./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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_3.cil+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 8ff0a322ea14915785d13405f40f59a899d91f6127d01ad0d503cb7ec027b40c --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 08:09:25,853 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 08:09:25,855 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 08:09:25,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 08:09:25,883 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 08:09:25,885 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 08:09:25,889 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 08:09:25,891 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 08:09:25,893 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 08:09:25,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 08:09:25,904 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 08:09:25,905 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 08:09:25,906 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 08:09:25,907 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 08:09:25,909 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 08:09:25,910 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 08:09:25,912 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 08:09:25,913 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 08:09:25,916 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 08:09:25,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 08:09:25,920 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 08:09:25,921 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 08:09:25,923 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 08:09:25,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 08:09:25,925 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 08:09:25,929 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 08:09:25,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 08:09:25,932 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 08:09:25,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 08:09:25,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 08:09:25,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 08:09:25,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 08:09:25,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 08:09:25,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 08:09:25,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 08:09:25,938 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 08:09:25,938 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 08:09:25,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 08:09:25,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 08:09:25,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 08:09:25,939 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 08:09:25,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 08:09:25,955 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 08:09:25,973 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 08:09:25,974 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 08:09:25,974 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 08:09:25,974 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 08:09:25,975 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 08:09:25,975 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 08:09:25,976 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 08:09:25,976 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 08:09:25,976 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 08:09:25,977 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 08:09:25,977 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 08:09:25,977 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 08:09:25,977 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 08:09:25,977 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 08:09:25,977 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 08:09:25,978 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 08:09:25,978 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 08:09:25,978 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 08:09:25,978 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 08:09:25,978 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 08:09:25,979 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 08:09:25,979 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 08:09:25,979 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 08:09:25,979 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 08:09:25,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:09:25,979 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 08:09:25,979 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 08:09:25,980 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 08:09:25,980 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 08:09:25,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 08:09:25,980 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 08:09:25,980 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 08:09:25,980 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 08:09:25,981 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 -> 8ff0a322ea14915785d13405f40f59a899d91f6127d01ad0d503cb7ec027b40c [2022-07-21 08:09:26,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 08:09:26,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 08:09:26,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 08:09:26,250 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 08:09:26,251 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 08:09:26,251 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c [2022-07-21 08:09:26,309 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d57c8b3e7/cbe9378258904d2a871152e885ead488/FLAG24e9033d9 [2022-07-21 08:09:26,680 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 08:09:26,680 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c [2022-07-21 08:09:26,693 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d57c8b3e7/cbe9378258904d2a871152e885ead488/FLAG24e9033d9 [2022-07-21 08:09:26,706 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d57c8b3e7/cbe9378258904d2a871152e885ead488 [2022-07-21 08:09:26,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 08:09:26,709 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 08:09:26,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 08:09:26,710 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 08:09:26,713 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 08:09:26,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:09:26" (1/1) ... [2022-07-21 08:09:26,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d1e5d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:26, skipping insertion in model container [2022-07-21 08:09:26,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:09:26" (1/1) ... [2022-07-21 08:09:26,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 08:09:26,749 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 08:09:26,858 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_3.cil+token_ring.01.cil-1.c[911,924] [2022-07-21 08:09:26,916 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_3.cil+token_ring.01.cil-1.c[8416,8429] [2022-07-21 08:09:26,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:09:26,960 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 08:09:26,982 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_3.cil+token_ring.01.cil-1.c[911,924] [2022-07-21 08:09:27,005 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_3.cil+token_ring.01.cil-1.c[8416,8429] [2022-07-21 08:09:27,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:09:27,047 INFO L208 MainTranslator]: Completed translation [2022-07-21 08:09:27,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:27 WrapperNode [2022-07-21 08:09:27,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 08:09:27,049 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 08:09:27,049 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 08:09:27,049 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 08:09:27,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:27" (1/1) ... [2022-07-21 08:09:27,071 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:27" (1/1) ... [2022-07-21 08:09:27,111 INFO L137 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 440 [2022-07-21 08:09:27,111 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 08:09:27,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 08:09:27,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 08:09:27,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 08:09:27,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:27" (1/1) ... [2022-07-21 08:09:27,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:27" (1/1) ... [2022-07-21 08:09:27,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:27" (1/1) ... [2022-07-21 08:09:27,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:27" (1/1) ... [2022-07-21 08:09:27,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:27" (1/1) ... [2022-07-21 08:09:27,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:27" (1/1) ... [2022-07-21 08:09:27,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:27" (1/1) ... [2022-07-21 08:09:27,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 08:09:27,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 08:09:27,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 08:09:27,165 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 08:09:27,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:27" (1/1) ... [2022-07-21 08:09:27,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:09:27,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:09:27,204 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-21 08:09:27,211 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-21 08:09:27,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 08:09:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-07-21 08:09:27,234 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-07-21 08:09:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-07-21 08:09:27,234 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-07-21 08:09:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-07-21 08:09:27,234 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-07-21 08:09:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-07-21 08:09:27,234 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-07-21 08:09:27,235 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-07-21 08:09:27,235 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-07-21 08:09:27,235 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-07-21 08:09:27,235 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-07-21 08:09:27,235 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-07-21 08:09:27,235 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-07-21 08:09:27,235 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-07-21 08:09:27,235 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-07-21 08:09:27,235 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-07-21 08:09:27,236 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-07-21 08:09:27,236 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-07-21 08:09:27,236 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-07-21 08:09:27,244 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-07-21 08:09:27,244 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-07-21 08:09:27,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 08:09:27,244 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-07-21 08:09:27,244 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-07-21 08:09:27,245 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-07-21 08:09:27,245 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-07-21 08:09:27,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 08:09:27,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 08:09:27,245 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-07-21 08:09:27,245 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-07-21 08:09:27,306 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 08:09:27,307 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 08:09:27,612 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-07-21 08:09:27,612 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2022-07-21 08:09:27,659 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 08:09:27,665 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 08:09:27,673 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-07-21 08:09:27,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:09:27 BoogieIcfgContainer [2022-07-21 08:09:27,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 08:09:27,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 08:09:27,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 08:09:27,695 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 08:09:27,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 08:09:26" (1/3) ... [2022-07-21 08:09:27,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d785f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:09:27, skipping insertion in model container [2022-07-21 08:09:27,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:27" (2/3) ... [2022-07-21 08:09:27,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d785f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:09:27, skipping insertion in model container [2022-07-21 08:09:27,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:09:27" (3/3) ... [2022-07-21 08:09:27,697 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.01.cil-1.c [2022-07-21 08:09:27,706 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 08:09:27,706 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-21 08:09:27,761 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 08:09:27,779 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@329105fb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7d85333b [2022-07-21 08:09:27,779 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-21 08:09:27,784 INFO L276 IsEmpty]: Start isEmpty. Operand has 224 states, 176 states have (on average 1.5340909090909092) internal successors, (270), 182 states have internal predecessors, (270), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-07-21 08:09:27,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-21 08:09:27,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:27,800 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-21 08:09:27,800 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:27,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:27,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1818445817, now seen corresponding path program 1 times [2022-07-21 08:09:27,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:27,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607583274] [2022-07-21 08:09:27,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:27,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:28,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:28,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 08:09:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:28,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 08:09:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:28,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 08:09:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:28,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 08:09:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:28,123 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-21 08:09:28,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:28,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607583274] [2022-07-21 08:09:28,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607583274] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:28,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:28,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:09:28,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342345207] [2022-07-21 08:09:28,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:28,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:09:28,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:28,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:09:28,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:09:28,158 INFO L87 Difference]: Start difference. First operand has 224 states, 176 states have (on average 1.5340909090909092) internal successors, (270), 182 states have internal predecessors, (270), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) 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-21 08:09:28,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:28,776 INFO L93 Difference]: Finished difference Result 562 states and 842 transitions. [2022-07-21 08:09:28,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 08:09:28,779 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-21 08:09:28,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:28,787 INFO L225 Difference]: With dead ends: 562 [2022-07-21 08:09:28,787 INFO L226 Difference]: Without dead ends: 345 [2022-07-21 08:09:28,790 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-21 08:09:28,792 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 556 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:28,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 812 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 08:09:28,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-07-21 08:09:28,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 304. [2022-07-21 08:09:28,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 241 states have (on average 1.4398340248962656) internal successors, (347), 246 states have internal predecessors, (347), 41 states have call successors, (41), 20 states have call predecessors, (41), 20 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2022-07-21 08:09:28,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 430 transitions. [2022-07-21 08:09:28,853 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 430 transitions. Word has length 57 [2022-07-21 08:09:28,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:28,854 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 430 transitions. [2022-07-21 08:09:28,854 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-21 08:09:28,854 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 430 transitions. [2022-07-21 08:09:28,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-21 08:09:28,857 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:28,857 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-21 08:09:28,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 08:09:28,857 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:28,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:28,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1564569483, now seen corresponding path program 1 times [2022-07-21 08:09:28,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:28,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919629003] [2022-07-21 08:09:28,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:28,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:28,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:28,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 08:09:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:28,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 08:09:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:28,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 08:09:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:28,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 08:09:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:28,943 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-21 08:09:28,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:28,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919629003] [2022-07-21 08:09:28,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919629003] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:28,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:28,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:09:28,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970639873] [2022-07-21 08:09:28,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:28,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:09:28,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:28,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:09:28,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:09:28,946 INFO L87 Difference]: Start difference. First operand 304 states and 430 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-21 08:09:29,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:29,588 INFO L93 Difference]: Finished difference Result 636 states and 904 transitions. [2022-07-21 08:09:29,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 08:09:29,589 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-21 08:09:29,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:29,592 INFO L225 Difference]: With dead ends: 636 [2022-07-21 08:09:29,592 INFO L226 Difference]: Without dead ends: 453 [2022-07-21 08:09:29,593 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-21 08:09:29,594 INFO L413 NwaCegarLoop]: 362 mSDtfsCounter, 533 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:29,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1105 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 08:09:29,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-07-21 08:09:29,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 389. [2022-07-21 08:09:29,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 309 states have (on average 1.4304207119741101) internal successors, (442), 315 states have internal predecessors, (442), 51 states have call successors, (51), 26 states have call predecessors, (51), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-07-21 08:09:29,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 547 transitions. [2022-07-21 08:09:29,633 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 547 transitions. Word has length 57 [2022-07-21 08:09:29,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:29,633 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 547 transitions. [2022-07-21 08:09:29,633 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-21 08:09:29,634 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 547 transitions. [2022-07-21 08:09:29,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-21 08:09:29,635 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:29,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] [2022-07-21 08:09:29,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 08:09:29,636 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:29,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:29,637 INFO L85 PathProgramCache]: Analyzing trace with hash -484818359, now seen corresponding path program 1 times [2022-07-21 08:09:29,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:29,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519470160] [2022-07-21 08:09:29,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:29,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:29,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:29,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 08:09:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:29,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 08:09:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:29,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 08:09:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:29,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 08:09:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:29,708 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-21 08:09:29,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:29,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519470160] [2022-07-21 08:09:29,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519470160] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:29,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:29,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:09:29,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627005370] [2022-07-21 08:09:29,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:29,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:09:29,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:29,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:09:29,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:09:29,711 INFO L87 Difference]: Start difference. First operand 389 states and 547 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-21 08:09:30,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:30,361 INFO L93 Difference]: Finished difference Result 972 states and 1371 transitions. [2022-07-21 08:09:30,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 08:09:30,361 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-21 08:09:30,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:30,365 INFO L225 Difference]: With dead ends: 972 [2022-07-21 08:09:30,365 INFO L226 Difference]: Without dead ends: 704 [2022-07-21 08:09:30,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-07-21 08:09:30,367 INFO L413 NwaCegarLoop]: 375 mSDtfsCounter, 546 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:30,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 1110 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 08:09:30,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-07-21 08:09:30,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 554. [2022-07-21 08:09:30,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 442 states have (on average 1.4230769230769231) internal successors, (629), 450 states have internal predecessors, (629), 69 states have call successors, (69), 38 states have call predecessors, (69), 41 states have return successors, (80), 70 states have call predecessors, (80), 67 states have call successors, (80) [2022-07-21 08:09:30,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 778 transitions. [2022-07-21 08:09:30,400 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 778 transitions. Word has length 57 [2022-07-21 08:09:30,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:30,401 INFO L495 AbstractCegarLoop]: Abstraction has 554 states and 778 transitions. [2022-07-21 08:09:30,401 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-21 08:09:30,401 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 778 transitions. [2022-07-21 08:09:30,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-21 08:09:30,403 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:30,403 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-21 08:09:30,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 08:09:30,404 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:30,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:30,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1382211637, now seen corresponding path program 1 times [2022-07-21 08:09:30,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:30,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933435139] [2022-07-21 08:09:30,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:30,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:30,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:30,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 08:09:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:30,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 08:09:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:30,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 08:09:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:30,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 08:09:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:30,507 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-21 08:09:30,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:30,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933435139] [2022-07-21 08:09:30,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933435139] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:30,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:30,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:09:30,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716460688] [2022-07-21 08:09:30,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:30,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:09:30,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:30,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:09:30,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:09:30,510 INFO L87 Difference]: Start difference. First operand 554 states and 778 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-21 08:09:31,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:31,036 INFO L93 Difference]: Finished difference Result 1144 states and 1638 transitions. [2022-07-21 08:09:31,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 08:09:31,037 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-21 08:09:31,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:31,040 INFO L225 Difference]: With dead ends: 1144 [2022-07-21 08:09:31,040 INFO L226 Difference]: Without dead ends: 712 [2022-07-21 08:09:31,041 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-21 08:09:31,042 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 284 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:31,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 1019 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 08:09:31,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-07-21 08:09:31,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 569. [2022-07-21 08:09:31,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 457 states have (on average 1.4091903719912473) internal successors, (644), 465 states have internal predecessors, (644), 69 states have call successors, (69), 38 states have call predecessors, (69), 41 states have return successors, (80), 70 states have call predecessors, (80), 67 states have call successors, (80) [2022-07-21 08:09:31,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 793 transitions. [2022-07-21 08:09:31,065 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 793 transitions. Word has length 57 [2022-07-21 08:09:31,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:31,066 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 793 transitions. [2022-07-21 08:09:31,066 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-21 08:09:31,066 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 793 transitions. [2022-07-21 08:09:31,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-21 08:09:31,067 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:31,068 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-21 08:09:31,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 08:09:31,068 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:31,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:31,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1454598195, now seen corresponding path program 1 times [2022-07-21 08:09:31,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:31,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844423042] [2022-07-21 08:09:31,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:31,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:31,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:31,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 08:09:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:31,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 08:09:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:31,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 08:09:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:31,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 08:09:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:31,145 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-21 08:09:31,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:31,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844423042] [2022-07-21 08:09:31,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844423042] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:31,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:31,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:09:31,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233050007] [2022-07-21 08:09:31,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:31,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:09:31,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:31,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:09:31,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:09:31,148 INFO L87 Difference]: Start difference. First operand 569 states and 793 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-21 08:09:31,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:31,940 INFO L93 Difference]: Finished difference Result 2430 states and 3520 transitions. [2022-07-21 08:09:31,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 08:09:31,941 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-21 08:09:31,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:31,949 INFO L225 Difference]: With dead ends: 2430 [2022-07-21 08:09:31,949 INFO L226 Difference]: Without dead ends: 1983 [2022-07-21 08:09:31,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-07-21 08:09:31,952 INFO L413 NwaCegarLoop]: 422 mSDtfsCounter, 1086 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:31,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 978 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 08:09:31,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2022-07-21 08:09:32,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1728. [2022-07-21 08:09:32,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1728 states, 1373 states have (on average 1.3765477057538238) internal successors, (1890), 1408 states have internal predecessors, (1890), 210 states have call successors, (210), 128 states have call predecessors, (210), 143 states have return successors, (305), 196 states have call predecessors, (305), 208 states have call successors, (305) [2022-07-21 08:09:32,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1728 states and 2405 transitions. [2022-07-21 08:09:32,041 INFO L78 Accepts]: Start accepts. Automaton has 1728 states and 2405 transitions. Word has length 57 [2022-07-21 08:09:32,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:32,042 INFO L495 AbstractCegarLoop]: Abstraction has 1728 states and 2405 transitions. [2022-07-21 08:09:32,042 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-21 08:09:32,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2405 transitions. [2022-07-21 08:09:32,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-21 08:09:32,043 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:32,043 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-21 08:09:32,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 08:09:32,044 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:32,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:32,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1901012817, now seen corresponding path program 1 times [2022-07-21 08:09:32,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:32,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3194577] [2022-07-21 08:09:32,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:32,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:32,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:32,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:32,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:09:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:32,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:09:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:32,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:09:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:32,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 08:09:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:32,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 08:09:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:32,095 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-21 08:09:32,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:32,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3194577] [2022-07-21 08:09:32,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3194577] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:32,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:32,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 08:09:32,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933665802] [2022-07-21 08:09:32,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:32,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 08:09:32,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:32,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 08:09:32,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:09:32,098 INFO L87 Difference]: Start difference. First operand 1728 states and 2405 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-21 08:09:32,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:32,608 INFO L93 Difference]: Finished difference Result 1983 states and 2775 transitions. [2022-07-21 08:09:32,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 08:09:32,609 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-21 08:09:32,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:32,615 INFO L225 Difference]: With dead ends: 1983 [2022-07-21 08:09:32,615 INFO L226 Difference]: Without dead ends: 1879 [2022-07-21 08:09:32,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-07-21 08:09:32,617 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 461 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:32,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 1092 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 08:09:32,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2022-07-21 08:09:32,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1840. [2022-07-21 08:09:32,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1463 states have (on average 1.378673957621326) internal successors, (2017), 1500 states have internal predecessors, (2017), 223 states have call successors, (223), 135 states have call predecessors, (223), 152 states have return successors, (323), 210 states have call predecessors, (323), 221 states have call successors, (323) [2022-07-21 08:09:32,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2563 transitions. [2022-07-21 08:09:32,692 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2563 transitions. Word has length 65 [2022-07-21 08:09:32,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:32,693 INFO L495 AbstractCegarLoop]: Abstraction has 1840 states and 2563 transitions. [2022-07-21 08:09:32,693 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-21 08:09:32,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2563 transitions. [2022-07-21 08:09:32,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-21 08:09:32,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:32,694 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-21 08:09:32,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 08:09:32,695 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:32,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:32,695 INFO L85 PathProgramCache]: Analyzing trace with hash -855614449, now seen corresponding path program 1 times [2022-07-21 08:09:32,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:32,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422017129] [2022-07-21 08:09:32,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:32,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:32,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:32,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:32,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:09:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:32,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:09:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:32,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:09:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:32,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 08:09:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:32,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 08:09:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:32,752 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-21 08:09:32,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:32,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422017129] [2022-07-21 08:09:32,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422017129] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:32,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:32,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 08:09:32,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777291998] [2022-07-21 08:09:32,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:32,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 08:09:32,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:32,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 08:09:32,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:09:32,755 INFO L87 Difference]: Start difference. First operand 1840 states and 2563 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-21 08:09:33,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:33,419 INFO L93 Difference]: Finished difference Result 2237 states and 3129 transitions. [2022-07-21 08:09:33,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 08:09:33,419 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-21 08:09:33,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:33,427 INFO L225 Difference]: With dead ends: 2237 [2022-07-21 08:09:33,427 INFO L226 Difference]: Without dead ends: 2028 [2022-07-21 08:09:33,428 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-21 08:09:33,429 INFO L413 NwaCegarLoop]: 390 mSDtfsCounter, 589 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:33,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 1411 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 08:09:33,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2022-07-21 08:09:33,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 1952. [2022-07-21 08:09:33,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1553 states have (on average 1.3799098518995492) internal successors, (2143), 1592 states have internal predecessors, (2143), 236 states have call successors, (236), 142 states have call predecessors, (236), 161 states have return successors, (344), 224 states have call predecessors, (344), 234 states have call successors, (344) [2022-07-21 08:09:33,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2723 transitions. [2022-07-21 08:09:33,523 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2723 transitions. Word has length 65 [2022-07-21 08:09:33,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:33,523 INFO L495 AbstractCegarLoop]: Abstraction has 1952 states and 2723 transitions. [2022-07-21 08:09:33,523 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-21 08:09:33,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2723 transitions. [2022-07-21 08:09:33,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-21 08:09:33,525 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:33,525 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-21 08:09:33,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 08:09:33,525 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:33,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:33,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1410766737, now seen corresponding path program 1 times [2022-07-21 08:09:33,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:33,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967429954] [2022-07-21 08:09:33,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:33,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:33,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:33,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:33,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:09:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:33,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:09:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:33,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:09:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:33,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 08:09:33,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:33,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 08:09:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:33,576 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-21 08:09:33,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:33,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967429954] [2022-07-21 08:09:33,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967429954] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:33,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:33,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:09:33,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302243099] [2022-07-21 08:09:33,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:33,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:09:33,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:33,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:09:33,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:09:33,579 INFO L87 Difference]: Start difference. First operand 1952 states and 2723 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), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-21 08:09:34,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:34,055 INFO L93 Difference]: Finished difference Result 2624 states and 3665 transitions. [2022-07-21 08:09:34,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 08:09:34,055 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), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-07-21 08:09:34,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:34,064 INFO L225 Difference]: With dead ends: 2624 [2022-07-21 08:09:34,064 INFO L226 Difference]: Without dead ends: 2309 [2022-07-21 08:09:34,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-07-21 08:09:34,080 INFO L413 NwaCegarLoop]: 405 mSDtfsCounter, 829 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:34,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 913 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 08:09:34,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2022-07-21 08:09:34,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 2233. [2022-07-21 08:09:34,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2233 states, 1779 states have (on average 1.377178189994379) internal successors, (2450), 1822 states have internal predecessors, (2450), 266 states have call successors, (266), 163 states have call predecessors, (266), 186 states have return successors, (382), 254 states have call predecessors, (382), 264 states have call successors, (382) [2022-07-21 08:09:34,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 2233 states and 3098 transitions. [2022-07-21 08:09:34,254 INFO L78 Accepts]: Start accepts. Automaton has 2233 states and 3098 transitions. Word has length 65 [2022-07-21 08:09:34,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:34,254 INFO L495 AbstractCegarLoop]: Abstraction has 2233 states and 3098 transitions. [2022-07-21 08:09:34,255 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), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-21 08:09:34,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2233 states and 3098 transitions. [2022-07-21 08:09:34,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-21 08:09:34,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:34,257 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-21 08:09:34,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 08:09:34,257 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:34,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:34,258 INFO L85 PathProgramCache]: Analyzing trace with hash 679032074, now seen corresponding path program 1 times [2022-07-21 08:09:34,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:34,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830128325] [2022-07-21 08:09:34,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:34,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:34,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:34,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:34,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:09:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:34,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:09:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:34,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 08:09:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:34,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 08:09:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:34,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 08:09:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:34,326 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-21 08:09:34,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:34,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830128325] [2022-07-21 08:09:34,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830128325] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:34,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:34,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 08:09:34,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831334741] [2022-07-21 08:09:34,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:34,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 08:09:34,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:34,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 08:09:34,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-21 08:09:34,328 INFO L87 Difference]: Start difference. First operand 2233 states and 3098 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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-21 08:09:34,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:34,823 INFO L93 Difference]: Finished difference Result 2907 states and 4034 transitions. [2022-07-21 08:09:34,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 08:09:34,824 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 66 [2022-07-21 08:09:34,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:34,834 INFO L225 Difference]: With dead ends: 2907 [2022-07-21 08:09:34,835 INFO L226 Difference]: Without dead ends: 2311 [2022-07-21 08:09:34,837 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-21 08:09:34,839 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 332 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:34,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1197 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 08:09:34,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2022-07-21 08:09:34,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2248. [2022-07-21 08:09:34,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2248 states, 1791 states have (on average 1.3729759910664434) internal successors, (2459), 1834 states have internal predecessors, (2459), 266 states have call successors, (266), 163 states have call predecessors, (266), 189 states have return successors, (385), 257 states have call predecessors, (385), 264 states have call successors, (385) [2022-07-21 08:09:34,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 3110 transitions. [2022-07-21 08:09:34,936 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 3110 transitions. Word has length 66 [2022-07-21 08:09:34,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:34,936 INFO L495 AbstractCegarLoop]: Abstraction has 2248 states and 3110 transitions. [2022-07-21 08:09:34,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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-21 08:09:34,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 3110 transitions. [2022-07-21 08:09:34,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-21 08:09:34,942 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:34,942 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-21 08:09:34,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 08:09:34,942 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:34,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:34,943 INFO L85 PathProgramCache]: Analyzing trace with hash -350327224, now seen corresponding path program 1 times [2022-07-21 08:09:34,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:34,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167717913] [2022-07-21 08:09:34,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:34,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:34,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:34,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:34,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:09:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:35,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:09:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:35,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 08:09:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:35,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 08:09:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:35,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 08:09:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:35,035 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-21 08:09:35,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:35,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167717913] [2022-07-21 08:09:35,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167717913] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:35,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:35,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 08:09:35,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84056979] [2022-07-21 08:09:35,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:35,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 08:09:35,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:35,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 08:09:35,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-21 08:09:35,037 INFO L87 Difference]: Start difference. First operand 2248 states and 3110 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 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-21 08:09:36,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:36,499 INFO L93 Difference]: Finished difference Result 4453 states and 6231 transitions. [2022-07-21 08:09:36,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-21 08:09:36,500 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 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 66 [2022-07-21 08:09:36,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:36,508 INFO L225 Difference]: With dead ends: 4453 [2022-07-21 08:09:36,508 INFO L226 Difference]: Without dead ends: 2611 [2022-07-21 08:09:36,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2022-07-21 08:09:36,512 INFO L413 NwaCegarLoop]: 569 mSDtfsCounter, 1231 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 1735 mSolverCounterSat, 409 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1253 SdHoareTripleChecker+Valid, 1826 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 409 IncrementalHoareTripleChecker+Valid, 1735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:36,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1253 Valid, 1826 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [409 Valid, 1735 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-21 08:09:36,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2022-07-21 08:09:36,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 2456. [2022-07-21 08:09:36,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2456 states, 1943 states have (on average 1.3602676273803396) internal successors, (2643), 1990 states have internal predecessors, (2643), 296 states have call successors, (296), 184 states have call predecessors, (296), 215 states have return successors, (434), 288 states have call predecessors, (434), 294 states have call successors, (434) [2022-07-21 08:09:36,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2456 states to 2456 states and 3373 transitions. [2022-07-21 08:09:36,636 INFO L78 Accepts]: Start accepts. Automaton has 2456 states and 3373 transitions. Word has length 66 [2022-07-21 08:09:36,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:36,636 INFO L495 AbstractCegarLoop]: Abstraction has 2456 states and 3373 transitions. [2022-07-21 08:09:36,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 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-21 08:09:36,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2456 states and 3373 transitions. [2022-07-21 08:09:36,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-21 08:09:36,638 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:36,638 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, 1] [2022-07-21 08:09:36,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 08:09:36,639 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:36,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:36,639 INFO L85 PathProgramCache]: Analyzing trace with hash -801093477, now seen corresponding path program 1 times [2022-07-21 08:09:36,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:36,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783542073] [2022-07-21 08:09:36,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:36,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:36,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:36,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:36,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:09:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:36,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:09:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:36,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 08:09:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:36,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-21 08:09:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:36,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 08:09:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:36,724 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-21 08:09:36,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:36,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783542073] [2022-07-21 08:09:36,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783542073] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:36,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:36,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 08:09:36,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024371714] [2022-07-21 08:09:36,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:36,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 08:09:36,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:36,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 08:09:36,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-21 08:09:36,726 INFO L87 Difference]: Start difference. First operand 2456 states and 3373 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 5 states have internal predecessors, (52), 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-21 08:09:37,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:37,257 INFO L93 Difference]: Finished difference Result 3420 states and 4693 transitions. [2022-07-21 08:09:37,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 08:09:37,258 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 5 states have internal predecessors, (52), 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 67 [2022-07-21 08:09:37,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:37,267 INFO L225 Difference]: With dead ends: 3420 [2022-07-21 08:09:37,268 INFO L226 Difference]: Without dead ends: 2601 [2022-07-21 08:09:37,270 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-21 08:09:37,270 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 324 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:37,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1152 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 08:09:37,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2601 states. [2022-07-21 08:09:37,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2601 to 2501. [2022-07-21 08:09:37,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2501 states, 1979 states have (on average 1.3537139969681657) internal successors, (2679), 2026 states have internal predecessors, (2679), 296 states have call successors, (296), 184 states have call predecessors, (296), 224 states have return successors, (443), 297 states have call predecessors, (443), 294 states have call successors, (443) [2022-07-21 08:09:37,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 3418 transitions. [2022-07-21 08:09:37,389 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 3418 transitions. Word has length 67 [2022-07-21 08:09:37,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:37,390 INFO L495 AbstractCegarLoop]: Abstraction has 2501 states and 3418 transitions. [2022-07-21 08:09:37,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 5 states have internal predecessors, (52), 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-21 08:09:37,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 3418 transitions. [2022-07-21 08:09:37,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-21 08:09:37,392 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:37,392 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, 1] [2022-07-21 08:09:37,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 08:09:37,392 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:37,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:37,393 INFO L85 PathProgramCache]: Analyzing trace with hash 585109917, now seen corresponding path program 1 times [2022-07-21 08:09:37,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:37,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041895526] [2022-07-21 08:09:37,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:37,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:37,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:37,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:37,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:09:37,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:37,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:09:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:37,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 08:09:37,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:37,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-21 08:09:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:37,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 08:09:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:37,469 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-21 08:09:37,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:37,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041895526] [2022-07-21 08:09:37,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041895526] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:37,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:37,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 08:09:37,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891720015] [2022-07-21 08:09:37,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:37,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 08:09:37,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:37,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 08:09:37,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:09:37,471 INFO L87 Difference]: Start difference. First operand 2501 states and 3418 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 6 states have internal predecessors, (52), 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-21 08:09:38,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:38,160 INFO L93 Difference]: Finished difference Result 3481 states and 4721 transitions. [2022-07-21 08:09:38,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 08:09:38,160 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 6 states have internal predecessors, (52), 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 67 [2022-07-21 08:09:38,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:38,169 INFO L225 Difference]: With dead ends: 3481 [2022-07-21 08:09:38,169 INFO L226 Difference]: Without dead ends: 2704 [2022-07-21 08:09:38,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-07-21 08:09:38,172 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 604 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:38,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 1003 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 08:09:38,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2022-07-21 08:09:38,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2510. [2022-07-21 08:09:38,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2510 states, 1988 states have (on average 1.3511066398390341) internal successors, (2686), 2033 states have internal predecessors, (2686), 297 states have call successors, (297), 185 states have call predecessors, (297), 223 states have return successors, (439), 298 states have call predecessors, (439), 295 states have call successors, (439) [2022-07-21 08:09:38,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2510 states to 2510 states and 3422 transitions. [2022-07-21 08:09:38,268 INFO L78 Accepts]: Start accepts. Automaton has 2510 states and 3422 transitions. Word has length 67 [2022-07-21 08:09:38,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:38,269 INFO L495 AbstractCegarLoop]: Abstraction has 2510 states and 3422 transitions. [2022-07-21 08:09:38,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 6 states have internal predecessors, (52), 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-21 08:09:38,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2510 states and 3422 transitions. [2022-07-21 08:09:38,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-21 08:09:38,272 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:38,272 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, 1] [2022-07-21 08:09:38,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 08:09:38,272 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:38,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:38,273 INFO L85 PathProgramCache]: Analyzing trace with hash 451096411, now seen corresponding path program 1 times [2022-07-21 08:09:38,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:38,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122661615] [2022-07-21 08:09:38,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:38,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:38,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:38,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:38,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:09:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:38,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:09:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:38,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 08:09:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:38,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-21 08:09:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:38,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 08:09:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:38,326 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-21 08:09:38,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:38,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122661615] [2022-07-21 08:09:38,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122661615] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:38,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:38,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:09:38,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983393270] [2022-07-21 08:09:38,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:38,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:09:38,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:38,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:09:38,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:09:38,329 INFO L87 Difference]: Start difference. First operand 2510 states and 3422 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 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-21 08:09:38,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:38,770 INFO L93 Difference]: Finished difference Result 4395 states and 5944 transitions. [2022-07-21 08:09:38,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 08:09:38,771 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 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 67 [2022-07-21 08:09:38,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:38,782 INFO L225 Difference]: With dead ends: 4395 [2022-07-21 08:09:38,782 INFO L226 Difference]: Without dead ends: 3525 [2022-07-21 08:09:38,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-07-21 08:09:38,786 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 552 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:38,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 821 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 08:09:38,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3525 states. [2022-07-21 08:09:38,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3525 to 3359. [2022-07-21 08:09:38,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3359 states, 2642 states have (on average 1.330431491294474) internal successors, (3515), 2700 states have internal predecessors, (3515), 401 states have call successors, (401), 249 states have call predecessors, (401), 314 states have return successors, (629), 419 states have call predecessors, (629), 399 states have call successors, (629) [2022-07-21 08:09:38,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3359 states to 3359 states and 4545 transitions. [2022-07-21 08:09:38,957 INFO L78 Accepts]: Start accepts. Automaton has 3359 states and 4545 transitions. Word has length 67 [2022-07-21 08:09:38,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:38,958 INFO L495 AbstractCegarLoop]: Abstraction has 3359 states and 4545 transitions. [2022-07-21 08:09:38,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 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-21 08:09:38,958 INFO L276 IsEmpty]: Start isEmpty. Operand 3359 states and 4545 transitions. [2022-07-21 08:09:38,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-21 08:09:38,960 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:38,960 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, 1, 1] [2022-07-21 08:09:38,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 08:09:38,960 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:38,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:38,961 INFO L85 PathProgramCache]: Analyzing trace with hash 678625623, now seen corresponding path program 1 times [2022-07-21 08:09:38,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:38,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532701379] [2022-07-21 08:09:38,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:38,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:38,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:38,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:38,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:09:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:38,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:09:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:38,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 08:09:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:38,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-21 08:09:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:38,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 08:09:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:39,003 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-21 08:09:39,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:39,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532701379] [2022-07-21 08:09:39,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532701379] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:39,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:39,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:09:39,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726581211] [2022-07-21 08:09:39,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:39,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:09:39,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:39,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:09:39,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:09:39,005 INFO L87 Difference]: Start difference. First operand 3359 states and 4545 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 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-21 08:09:39,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:39,277 INFO L93 Difference]: Finished difference Result 5082 states and 6901 transitions. [2022-07-21 08:09:39,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 08:09:39,277 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 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 68 [2022-07-21 08:09:39,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:39,291 INFO L225 Difference]: With dead ends: 5082 [2022-07-21 08:09:39,292 INFO L226 Difference]: Without dead ends: 1617 [2022-07-21 08:09:39,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-21 08:09:39,300 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 435 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:39,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 612 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 08:09:39,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2022-07-21 08:09:39,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2022-07-21 08:09:39,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1286 states have (on average 1.3709175738724728) internal successors, (1763), 1318 states have internal predecessors, (1763), 194 states have call successors, (194), 120 states have call predecessors, (194), 136 states have return successors, (291), 182 states have call predecessors, (291), 194 states have call successors, (291) [2022-07-21 08:09:39,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2248 transitions. [2022-07-21 08:09:39,412 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2248 transitions. Word has length 68 [2022-07-21 08:09:39,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:39,412 INFO L495 AbstractCegarLoop]: Abstraction has 1617 states and 2248 transitions. [2022-07-21 08:09:39,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 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-21 08:09:39,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2248 transitions. [2022-07-21 08:09:39,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-21 08:09:39,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:39,414 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-21 08:09:39,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 08:09:39,414 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:39,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:39,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1894779564, now seen corresponding path program 1 times [2022-07-21 08:09:39,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:39,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333094030] [2022-07-21 08:09:39,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:39,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:39,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:39,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 08:09:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:39,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 08:09:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:39,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 08:09:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:39,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 08:09:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:39,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 08:09:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:39,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:09:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:39,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 08:09:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:39,477 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-21 08:09:39,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:39,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333094030] [2022-07-21 08:09:39,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333094030] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:09:39,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937998010] [2022-07-21 08:09:39,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:39,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:09:39,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:09:39,500 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-21 08:09:39,517 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-21 08:09:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:39,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 08:09:39,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:09:39,660 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-21 08:09:39,661 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:09:39,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937998010] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:39,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:09:39,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-21 08:09:39,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800330404] [2022-07-21 08:09:39,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:39,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:09:39,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:39,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:09:39,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:09:39,662 INFO L87 Difference]: Start difference. First operand 1617 states and 2248 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-21 08:09:39,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:39,804 INFO L93 Difference]: Finished difference Result 4659 states and 6517 transitions. [2022-07-21 08:09:39,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:09:39,804 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-21 08:09:39,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:39,812 INFO L225 Difference]: With dead ends: 4659 [2022-07-21 08:09:39,812 INFO L226 Difference]: Without dead ends: 2010 [2022-07-21 08:09:39,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:09:39,818 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 114 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 394 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-21 08:09:39,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 394 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:09:39,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2010 states. [2022-07-21 08:09:39,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2010 to 2010. [2022-07-21 08:09:39,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2010 states, 1605 states have (on average 1.3651090342679129) internal successors, (2191), 1641 states have internal predecessors, (2191), 236 states have call successors, (236), 148 states have call predecessors, (236), 168 states have return successors, (355), 224 states have call predecessors, (355), 236 states have call successors, (355) [2022-07-21 08:09:39,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 2782 transitions. [2022-07-21 08:09:39,894 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 2782 transitions. Word has length 92 [2022-07-21 08:09:39,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:39,894 INFO L495 AbstractCegarLoop]: Abstraction has 2010 states and 2782 transitions. [2022-07-21 08:09:39,894 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-21 08:09:39,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 2782 transitions. [2022-07-21 08:09:39,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-21 08:09:39,897 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:39,897 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-21 08:09:39,915 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-21 08:09:40,116 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-21 08:09:40,117 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:40,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:40,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1224402848, now seen corresponding path program 1 times [2022-07-21 08:09:40,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:40,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953063266] [2022-07-21 08:09:40,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:40,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:40,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:40,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 08:09:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:40,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 08:09:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:40,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 08:09:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:40,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 08:09:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:40,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 08:09:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:40,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:09:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:40,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 08:09:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:40,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:09:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:40,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-21 08:09:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:40,177 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-21 08:09:40,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:40,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953063266] [2022-07-21 08:09:40,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953063266] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:09:40,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48997836] [2022-07-21 08:09:40,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:40,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:09:40,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:09:40,179 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-21 08:09:40,204 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-21 08:09:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:40,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 08:09:40,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:09:40,344 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-21 08:09:40,344 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:09:40,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48997836] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:40,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:09:40,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-07-21 08:09:40,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747803538] [2022-07-21 08:09:40,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:40,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:09:40,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:40,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:09:40,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:09:40,346 INFO L87 Difference]: Start difference. First operand 2010 states and 2782 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-21 08:09:40,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:40,461 INFO L93 Difference]: Finished difference Result 4810 states and 6721 transitions. [2022-07-21 08:09:40,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:09:40,462 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-21 08:09:40,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:40,477 INFO L225 Difference]: With dead ends: 4810 [2022-07-21 08:09:40,477 INFO L226 Difference]: Without dead ends: 3192 [2022-07-21 08:09:40,481 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-21 08:09:40,481 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 68 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 279 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-21 08:09:40,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 279 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:09:40,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3192 states. [2022-07-21 08:09:40,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3192 to 3150. [2022-07-21 08:09:40,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3150 states, 2520 states have (on average 1.3615079365079366) internal successors, (3431), 2573 states have internal predecessors, (3431), 364 states have call successors, (364), 233 states have call predecessors, (364), 265 states have return successors, (535), 347 states have call predecessors, (535), 364 states have call successors, (535) [2022-07-21 08:09:40,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3150 states to 3150 states and 4330 transitions. [2022-07-21 08:09:40,604 INFO L78 Accepts]: Start accepts. Automaton has 3150 states and 4330 transitions. Word has length 118 [2022-07-21 08:09:40,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:40,604 INFO L495 AbstractCegarLoop]: Abstraction has 3150 states and 4330 transitions. [2022-07-21 08:09:40,605 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-21 08:09:40,605 INFO L276 IsEmpty]: Start isEmpty. Operand 3150 states and 4330 transitions. [2022-07-21 08:09:40,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-21 08:09:40,608 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:40,608 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-21 08:09:40,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 08:09:40,838 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,SelfDestructingSolverStorable15 [2022-07-21 08:09:40,838 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:40,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:40,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1746596599, now seen corresponding path program 1 times [2022-07-21 08:09:40,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:40,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119009663] [2022-07-21 08:09:40,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:40,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:40,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:40,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 08:09:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:40,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 08:09:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:40,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 08:09:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:40,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 08:09:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:40,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 08:09:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:40,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 08:09:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:40,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:09:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:40,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 08:09:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:40,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:09:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:40,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 08:09:40,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:40,903 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-21 08:09:40,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:40,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119009663] [2022-07-21 08:09:40,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119009663] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:09:40,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953938849] [2022-07-21 08:09:40,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:40,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:09:40,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:09:40,920 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-21 08:09:40,980 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-21 08:09:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:41,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 08:09:41,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:09:41,055 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-21 08:09:41,056 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:09:41,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953938849] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:41,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:09:41,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-21 08:09:41,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167677108] [2022-07-21 08:09:41,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:41,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:09:41,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:41,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:09:41,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:09:41,058 INFO L87 Difference]: Start difference. First operand 3150 states and 4330 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-21 08:09:41,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:41,206 INFO L93 Difference]: Finished difference Result 6784 states and 9406 transitions. [2022-07-21 08:09:41,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:09:41,207 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-21 08:09:41,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:41,214 INFO L225 Difference]: With dead ends: 6784 [2022-07-21 08:09:41,214 INFO L226 Difference]: Without dead ends: 3644 [2022-07-21 08:09:41,219 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-21 08:09:41,220 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 119 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 166 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-21 08:09:41,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 166 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:09:41,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3644 states. [2022-07-21 08:09:41,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3644 to 3534. [2022-07-21 08:09:41,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3534 states, 2879 states have (on average 1.2910732893365753) internal successors, (3717), 2927 states have internal predecessors, (3717), 360 states have call successors, (360), 259 states have call predecessors, (360), 294 states have return successors, (517), 351 states have call predecessors, (517), 360 states have call successors, (517) [2022-07-21 08:09:41,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3534 states to 3534 states and 4594 transitions. [2022-07-21 08:09:41,355 INFO L78 Accepts]: Start accepts. Automaton has 3534 states and 4594 transitions. Word has length 134 [2022-07-21 08:09:41,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:41,356 INFO L495 AbstractCegarLoop]: Abstraction has 3534 states and 4594 transitions. [2022-07-21 08:09:41,356 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-21 08:09:41,356 INFO L276 IsEmpty]: Start isEmpty. Operand 3534 states and 4594 transitions. [2022-07-21 08:09:41,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-21 08:09:41,361 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:41,361 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-21 08:09:41,386 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-21 08:09:41,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:09:41,586 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:41,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:41,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1255738600, now seen corresponding path program 1 times [2022-07-21 08:09:41,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:41,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51912410] [2022-07-21 08:09:41,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:41,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:41,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:41,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 08:09:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:41,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 08:09:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:41,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 08:09:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:41,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 08:09:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:41,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 08:09:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:41,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 08:09:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:41,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:09:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:41,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 08:09:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:41,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:09:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:41,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 08:09:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:41,666 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-21 08:09:41,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:41,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51912410] [2022-07-21 08:09:41,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51912410] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:09:41,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396563679] [2022-07-21 08:09:41,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:41,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:09:41,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:09:41,668 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-21 08:09:41,695 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-21 08:09:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:41,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 08:09:41,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:09:41,799 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-21 08:09:41,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:09:41,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396563679] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:41,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:09:41,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-21 08:09:41,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119004475] [2022-07-21 08:09:41,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:41,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:09:41,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:41,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:09:41,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:09:41,802 INFO L87 Difference]: Start difference. First operand 3534 states and 4594 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-21 08:09:41,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:41,983 INFO L93 Difference]: Finished difference Result 7141 states and 9333 transitions. [2022-07-21 08:09:41,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:09:41,984 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-21 08:09:41,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:41,991 INFO L225 Difference]: With dead ends: 7141 [2022-07-21 08:09:41,991 INFO L226 Difference]: Without dead ends: 3619 [2022-07-21 08:09:41,997 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-21 08:09:41,998 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 119 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 278 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-21 08:09:41,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 278 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:09:42,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3619 states. [2022-07-21 08:09:42,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3619 to 3504. [2022-07-21 08:09:42,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3504 states, 2849 states have (on average 1.2625482625482625) internal successors, (3597), 2897 states have internal predecessors, (3597), 360 states have call successors, (360), 259 states have call predecessors, (360), 294 states have return successors, (517), 351 states have call predecessors, (517), 360 states have call successors, (517) [2022-07-21 08:09:42,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3504 states to 3504 states and 4474 transitions. [2022-07-21 08:09:42,152 INFO L78 Accepts]: Start accepts. Automaton has 3504 states and 4474 transitions. Word has length 134 [2022-07-21 08:09:42,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:42,152 INFO L495 AbstractCegarLoop]: Abstraction has 3504 states and 4474 transitions. [2022-07-21 08:09:42,152 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-21 08:09:42,152 INFO L276 IsEmpty]: Start isEmpty. Operand 3504 states and 4474 transitions. [2022-07-21 08:09:42,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-21 08:09:42,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:42,156 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-21 08:09:42,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 08:09:42,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-21 08:09:42,372 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:42,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:42,372 INFO L85 PathProgramCache]: Analyzing trace with hash 429240706, now seen corresponding path program 1 times [2022-07-21 08:09:42,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:42,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540244267] [2022-07-21 08:09:42,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:42,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:42,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:42,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 08:09:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:42,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 08:09:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:42,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 08:09:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:42,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 08:09:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:42,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 08:09:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:42,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 08:09:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:42,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:09:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:42,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 08:09:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:42,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:09:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:42,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 08:09:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:42,439 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-21 08:09:42,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:42,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540244267] [2022-07-21 08:09:42,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540244267] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:09:42,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886324978] [2022-07-21 08:09:42,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:42,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:09:42,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:09:42,455 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-21 08:09:42,457 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-21 08:09:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:42,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 08:09:42,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:09:42,617 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-21 08:09:42,617 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:09:42,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886324978] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:42,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:09:42,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-21 08:09:42,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336631110] [2022-07-21 08:09:42,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:42,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:09:42,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:42,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:09:42,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:09:42,621 INFO L87 Difference]: Start difference. First operand 3504 states and 4474 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-21 08:09:42,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:42,834 INFO L93 Difference]: Finished difference Result 4980 states and 6464 transitions. [2022-07-21 08:09:42,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:09:42,835 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-21 08:09:42,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:42,846 INFO L225 Difference]: With dead ends: 4980 [2022-07-21 08:09:42,846 INFO L226 Difference]: Without dead ends: 3223 [2022-07-21 08:09:42,851 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-21 08:09:42,852 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 76 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 368 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-21 08:09:42,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 368 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:09:42,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3223 states. [2022-07-21 08:09:43,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3223 to 3161. [2022-07-21 08:09:43,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3161 states, 2574 states have (on average 1.2424242424242424) internal successors, (3198), 2618 states have internal predecessors, (3198), 324 states have call successors, (324), 234 states have call predecessors, (324), 262 states have return successors, (453), 312 states have call predecessors, (453), 324 states have call successors, (453) [2022-07-21 08:09:43,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3161 states to 3161 states and 3975 transitions. [2022-07-21 08:09:43,069 INFO L78 Accepts]: Start accepts. Automaton has 3161 states and 3975 transitions. Word has length 135 [2022-07-21 08:09:43,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:43,069 INFO L495 AbstractCegarLoop]: Abstraction has 3161 states and 3975 transitions. [2022-07-21 08:09:43,070 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-21 08:09:43,070 INFO L276 IsEmpty]: Start isEmpty. Operand 3161 states and 3975 transitions. [2022-07-21 08:09:43,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-21 08:09:43,083 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:43,083 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-21 08:09:43,126 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-21 08:09:43,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:09:43,300 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:43,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:43,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1638887588, now seen corresponding path program 1 times [2022-07-21 08:09:43,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:43,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502926811] [2022-07-21 08:09:43,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:43,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:43,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:43,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:43,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 08:09:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:43,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 08:09:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:43,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 08:09:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:43,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 08:09:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:43,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 08:09:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:43,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 08:09:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:43,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:09:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:43,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 08:09:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:43,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:09:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:43,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 08:09:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:43,380 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-21 08:09:43,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:43,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502926811] [2022-07-21 08:09:43,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502926811] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:09:43,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145465640] [2022-07-21 08:09:43,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:43,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:09:43,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:09:43,382 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-21 08:09:43,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-21 08:09:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:43,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 08:09:43,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:09:43,587 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-21 08:09:43,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:09:43,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145465640] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:43,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:09:43,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-21 08:09:43,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868161822] [2022-07-21 08:09:43,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:43,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 08:09:43,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:43,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 08:09:43,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-21 08:09:43,592 INFO L87 Difference]: Start difference. First operand 3161 states and 3975 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-21 08:09:43,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:43,928 INFO L93 Difference]: Finished difference Result 4497 states and 5708 transitions. [2022-07-21 08:09:43,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 08:09:43,928 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-21 08:09:43,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:43,934 INFO L225 Difference]: With dead ends: 4497 [2022-07-21 08:09:43,935 INFO L226 Difference]: Without dead ends: 2539 [2022-07-21 08:09:43,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-21 08:09:43,939 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 136 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:43,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 257 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 08:09:43,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2539 states. [2022-07-21 08:09:44,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2539 to 2518. [2022-07-21 08:09:44,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2518 states, 2049 states have (on average 1.208882381649585) internal successors, (2477), 2076 states have internal predecessors, (2477), 265 states have call successors, (265), 189 states have call predecessors, (265), 203 states have return successors, (335), 254 states have call predecessors, (335), 265 states have call successors, (335) [2022-07-21 08:09:44,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 3077 transitions. [2022-07-21 08:09:44,167 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 3077 transitions. Word has length 136 [2022-07-21 08:09:44,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:44,167 INFO L495 AbstractCegarLoop]: Abstraction has 2518 states and 3077 transitions. [2022-07-21 08:09:44,168 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-21 08:09:44,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 3077 transitions. [2022-07-21 08:09:44,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-21 08:09:44,170 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:44,171 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-21 08:09:44,196 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-21 08:09:44,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:09:44,396 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:44,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:44,396 INFO L85 PathProgramCache]: Analyzing trace with hash 331745190, now seen corresponding path program 1 times [2022-07-21 08:09:44,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:44,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324321507] [2022-07-21 08:09:44,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:44,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:44,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:44,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 08:09:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:44,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 08:09:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:44,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 08:09:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:44,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 08:09:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:44,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 08:09:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:44,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 08:09:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:44,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:09:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:44,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 08:09:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:44,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:09:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:44,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 08:09:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:44,475 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-21 08:09:44,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:44,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324321507] [2022-07-21 08:09:44,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324321507] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:09:44,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547217720] [2022-07-21 08:09:44,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:44,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:09:44,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:09:44,478 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-21 08:09:44,519 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-21 08:09:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:44,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 08:09:44,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:09:44,627 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-21 08:09:44,627 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:09:44,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547217720] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:44,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:09:44,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-21 08:09:44,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018659101] [2022-07-21 08:09:44,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:44,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 08:09:44,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:44,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 08:09:44,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-21 08:09:44,631 INFO L87 Difference]: Start difference. First operand 2518 states and 3077 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-21 08:09:44,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:44,843 INFO L93 Difference]: Finished difference Result 4137 states and 5073 transitions. [2022-07-21 08:09:44,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 08:09:44,843 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-21 08:09:44,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:44,847 INFO L225 Difference]: With dead ends: 4137 [2022-07-21 08:09:44,848 INFO L226 Difference]: Without dead ends: 1712 [2022-07-21 08:09:44,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-21 08:09:44,852 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 155 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:44,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 263 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 08:09:44,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-07-21 08:09:44,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1198. [2022-07-21 08:09:44,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 983 states have (on average 1.1525940996948119) internal successors, (1133), 994 states have internal predecessors, (1133), 119 states have call successors, (119), 86 states have call predecessors, (119), 95 states have return successors, (143), 118 states have call predecessors, (143), 119 states have call successors, (143) [2022-07-21 08:09:44,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1395 transitions. [2022-07-21 08:09:44,921 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1395 transitions. Word has length 136 [2022-07-21 08:09:44,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:44,921 INFO L495 AbstractCegarLoop]: Abstraction has 1198 states and 1395 transitions. [2022-07-21 08:09:44,921 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-21 08:09:44,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1395 transitions. [2022-07-21 08:09:44,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-21 08:09:44,923 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:44,923 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-21 08:09:44,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-21 08:09:45,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:09:45,141 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:45,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:45,141 INFO L85 PathProgramCache]: Analyzing trace with hash -2065725340, now seen corresponding path program 1 times [2022-07-21 08:09:45,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:45,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270203315] [2022-07-21 08:09:45,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:45,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:45,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:45,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 08:09:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:45,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 08:09:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:45,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 08:09:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:45,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 08:09:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:45,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 08:09:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:45,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 08:09:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:45,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:09:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:45,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 08:09:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:45,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:09:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:45,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 08:09:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:45,233 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-21 08:09:45,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:45,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270203315] [2022-07-21 08:09:45,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270203315] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:09:45,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526081550] [2022-07-21 08:09:45,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:45,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:09:45,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:09:45,235 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-21 08:09:45,237 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-21 08:09:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:45,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 08:09:45,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:09:45,362 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-21 08:09:45,362 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:09:45,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526081550] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:45,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:09:45,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-21 08:09:45,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862018185] [2022-07-21 08:09:45,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:45,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 08:09:45,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:45,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 08:09:45,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:09:45,365 INFO L87 Difference]: Start difference. First operand 1198 states and 1395 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-21 08:09:45,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:45,513 INFO L93 Difference]: Finished difference Result 2420 states and 2882 transitions. [2022-07-21 08:09:45,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 08:09:45,513 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-21 08:09:45,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:45,517 INFO L225 Difference]: With dead ends: 2420 [2022-07-21 08:09:45,518 INFO L226 Difference]: Without dead ends: 1233 [2022-07-21 08:09:45,520 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-21 08:09:45,522 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 10 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 527 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-21 08:09:45,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 527 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:09:45,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2022-07-21 08:09:45,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1213. [2022-07-21 08:09:45,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 998 states have (on average 1.128256513026052) internal successors, (1126), 1009 states have internal predecessors, (1126), 119 states have call successors, (119), 86 states have call predecessors, (119), 95 states have return successors, (143), 118 states have call predecessors, (143), 119 states have call successors, (143) [2022-07-21 08:09:45,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1388 transitions. [2022-07-21 08:09:45,628 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1388 transitions. Word has length 136 [2022-07-21 08:09:45,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:45,628 INFO L495 AbstractCegarLoop]: Abstraction has 1213 states and 1388 transitions. [2022-07-21 08:09:45,628 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-21 08:09:45,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1388 transitions. [2022-07-21 08:09:45,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-21 08:09:45,630 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:45,630 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-21 08:09:45,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-21 08:09:45,856 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,SelfDestructingSolverStorable21 [2022-07-21 08:09:45,856 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:45,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:45,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1471946848, now seen corresponding path program 1 times [2022-07-21 08:09:45,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:45,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509942733] [2022-07-21 08:09:45,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:45,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:45,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:45,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 08:09:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:45,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 08:09:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:45,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 08:09:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:45,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 08:09:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:45,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 08:09:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:45,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 08:09:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:45,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:09:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:45,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 08:09:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:45,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:09:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:45,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 08:09:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:45,931 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-21 08:09:45,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:45,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509942733] [2022-07-21 08:09:45,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509942733] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:45,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:45,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:09:45,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705452196] [2022-07-21 08:09:45,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:45,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:09:45,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:45,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:09:45,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:09:45,933 INFO L87 Difference]: Start difference. First operand 1213 states and 1388 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-21 08:09:46,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:46,469 INFO L93 Difference]: Finished difference Result 2192 states and 2489 transitions. [2022-07-21 08:09:46,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 08:09:46,470 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-21 08:09:46,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:46,474 INFO L225 Difference]: With dead ends: 2192 [2022-07-21 08:09:46,475 INFO L226 Difference]: Without dead ends: 2190 [2022-07-21 08:09:46,475 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-21 08:09:46,475 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 473 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:46,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 484 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 08:09:46,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2190 states. [2022-07-21 08:09:46,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 1917. [2022-07-21 08:09:46,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1917 states, 1578 states have (on average 1.1254752851711027) internal successors, (1776), 1595 states have internal predecessors, (1776), 187 states have call successors, (187), 134 states have call predecessors, (187), 151 states have return successors, (222), 188 states have call predecessors, (222), 187 states have call successors, (222) [2022-07-21 08:09:46,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1917 states and 2185 transitions. [2022-07-21 08:09:46,621 INFO L78 Accepts]: Start accepts. Automaton has 1917 states and 2185 transitions. Word has length 136 [2022-07-21 08:09:46,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:46,621 INFO L495 AbstractCegarLoop]: Abstraction has 1917 states and 2185 transitions. [2022-07-21 08:09:46,622 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-21 08:09:46,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 2185 transitions. [2022-07-21 08:09:46,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-21 08:09:46,624 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:46,624 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-21 08:09:46,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-21 08:09:46,625 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:46,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:46,625 INFO L85 PathProgramCache]: Analyzing trace with hash -609020054, now seen corresponding path program 2 times [2022-07-21 08:09:46,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:46,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771530624] [2022-07-21 08:09:46,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:46,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:46,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:46,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 08:09:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:46,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 08:09:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:46,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 08:09:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:46,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 08:09:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:46,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 08:09:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:46,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 08:09:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:46,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:09:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:46,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 08:09:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:46,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:09:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:46,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 08:09:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:46,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 08:09:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:46,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:09:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:46,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-21 08:09:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:46,687 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-21 08:09:46,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:46,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771530624] [2022-07-21 08:09:46,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771530624] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:46,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:46,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:09:46,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928783214] [2022-07-21 08:09:46,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:46,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:09:46,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:46,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:09:46,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:09:46,689 INFO L87 Difference]: Start difference. First operand 1917 states and 2185 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-21 08:09:47,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:47,171 INFO L93 Difference]: Finished difference Result 3880 states and 4434 transitions. [2022-07-21 08:09:47,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 08:09:47,172 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-21 08:09:47,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:47,173 INFO L225 Difference]: With dead ends: 3880 [2022-07-21 08:09:47,173 INFO L226 Difference]: Without dead ends: 0 [2022-07-21 08:09:47,177 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-21 08:09:47,177 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 581 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:47,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 431 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 08:09:47,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-21 08:09:47,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-21 08:09:47,178 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-21 08:09:47,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-21 08:09:47,179 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 175 [2022-07-21 08:09:47,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:47,179 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-21 08:09:47,179 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-21 08:09:47,179 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-21 08:09:47,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-21 08:09:47,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-07-21 08:09:47,182 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-07-21 08:09:47,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-21 08:09:47,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-21 08:10:25,295 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 915 925) no Hoare annotation was computed. [2022-07-21 08:10:25,296 INFO L895 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 915 925) the Hoare annotation is: (let ((.cse1 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse3 (and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse6 (= |old(~t1_st~0)| 0)) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse10 (not (= ~c_dr_pc~0 ~p_dw_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse1 .cse2 .cse3 .cse5 (not (<= ~t1_pc~0 0)) .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (<= ~m_pc~0 0))) (or .cse0 (and (or (not (<= ~t1_pc~0 1)) (<= ~m_pc~0 1)) (not .cse11)) .cse12 .cse3 .cse5 .cse7 .cse10 (and (not (<= 1 ~t1_pc~0)) .cse11))) (or .cse0 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (< ~token~0 (+ 2 ~local~0))) (not (<= (+ ~local~0 1) ~token~0)) .cse10 (not (<= 2 ~E_1~0))))) [2022-07-21 08:10:25,296 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 915 925) no Hoare annotation was computed. [2022-07-21 08:10:25,296 INFO L899 garLoopResultBuilder]: For program point update_channels1EXIT(lines 262 276) no Hoare annotation was computed. [2022-07-21 08:10:25,296 INFO L902 garLoopResultBuilder]: At program point L57(lines 40 59) the Hoare annotation is: true [2022-07-21 08:10:25,297 INFO L895 garLoopResultBuilder]: At program point update_channels1ENTRY(lines 262 276) the Hoare annotation is: (let ((.cse6 (not (<= 1 ~p_dw_pc~0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.cse3 (and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))) (.cse4 (not (= ~E_M~0 ~M_E~0))) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse8 (not (<= ~c_dr_pc~0 1))) (.cse5 (not (= ~T1_E~0 ~M_E~0))) (.cse9 (not (<= 1 ~c_dr_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~c_dr_pc~0 0)) .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse5 .cse9 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse5 .cse9))) [2022-07-21 08:10:25,297 INFO L899 garLoopResultBuilder]: For program point L49-1(lines 49 53) no Hoare annotation was computed. [2022-07-21 08:10:25,298 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 48) no Hoare annotation was computed. [2022-07-21 08:10:25,298 INFO L899 garLoopResultBuilder]: For program point L44-2(lines 43 58) no Hoare annotation was computed. [2022-07-21 08:10:25,298 INFO L899 garLoopResultBuilder]: For program point L266-1(lines 262 276) no Hoare annotation was computed. [2022-07-21 08:10:25,298 INFO L899 garLoopResultBuilder]: For program point L704(lines 704 709) no Hoare annotation was computed. [2022-07-21 08:10:25,298 INFO L899 garLoopResultBuilder]: For program point L898-2(lines 898 902) no Hoare annotation was computed. [2022-07-21 08:10:25,299 INFO L895 garLoopResultBuilder]: At program point activate_threads2ENTRY(lines 890 914) the Hoare annotation is: (let ((.cse1 (not (<= ~token~0 ~local~0))) (.cse15 (not (<= ~t1_pc~0 0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse4 (and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))) (.cse5 (not (= ~t1_pc~0 1))) (.cse6 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse12 (= |old(~t1_st~0)| 0)) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse13 (not (< ~token~0 (+ 2 ~local~0)))) (.cse14 (not (<= (+ ~local~0 1) ~token~0))) (.cse10 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse11 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse3 .cse4 .cse5 .cse6 .cse12 .cse7 .cse13 .cse8 .cse14 .cse10 (not (= |old(~m_st~0)| 0)) .cse11) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse7 .cse8 .cse10 .cse11) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse12 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse11) (or (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse1 .cse3 .cse4 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10) (or .cse0 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse2 .cse4 .cse6 .cse7 .cse10) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse7 .cse13 .cse14 .cse10 .cse11))) [2022-07-21 08:10:25,299 INFO L895 garLoopResultBuilder]: At program point L733(lines 721 735) the Hoare annotation is: (let ((.cse13 (= |old(~t1_st~0)| ~t1_st~0)) (.cse14 (= ~m_st~0 |old(~m_st~0)|)) (.cse28 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse27 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse31 (= ~p_dw_st~0 0)) (.cse25 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse26 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse30 (<= ~m_pc~0 0)) (.cse29 (<= ~m_pc~0 1)) (.cse23 (= ~M_E~0 2))) (let ((.cse18 (not .cse23)) (.cse4 (not (<= ~t1_pc~0 0))) (.cse22 (= ~T1_E~0 ~M_E~0)) (.cse17 (and (not .cse30) .cse29)) (.cse1 (not (<= ~token~0 ~local~0))) (.cse6 (not (<= 2 ~E_M~0))) (.cse20 (and .cse25 .cse26)) (.cse7 (not (<= ~local~0 ~token~0))) (.cse24 (not (= |old(~m_st~0)| 0))) (.cse0 (not .cse31)) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse15 (not (= ~t1_pc~0 1))) (.cse3 (not .cse27)) (.cse16 (= |old(~t1_st~0)| 0)) (.cse5 (not (= ~p_dw_pc~0 0))) (.cse19 (not (< ~token~0 (+ 2 ~local~0)))) (.cse21 (not (<= (+ ~local~0 1) ~token~0))) (.cse8 (not .cse28)) (.cse9 (and .cse13 .cse14 .cse25 .cse26)) (.cse11 (not (<= 2 ~E_1~0))) (.cse12 (and .cse13 .cse27 .cse14 (<= 2 ~m_st~0) .cse28 (or (not .cse29) .cse30) .cse31 (= ~c_dr_pc~0 0)))) (and (or (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12) (or .cse0 .cse1 .cse2 (and .cse13 .cse14) .cse15 .cse3 .cse16 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse17 .cse10 .cse3 .cse5 .cse8 .cse12) (or .cse0 .cse18 .cse10 .cse2 .cse15 .cse3 .cse16 .cse5 .cse19 .cse20 .cse21 .cse8 (and .cse22 .cse23) .cse11) (or .cse0 .cse1 .cse10 .cse2 .cse15 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12) (or .cse0 .cse18 .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 (and .cse22 (= ~E_M~0 ~M_E~0) .cse23) .cse11) (or .cse0 .cse2 .cse15 .cse3 .cse16 .cse5 .cse19 .cse6 .cse21 .cse8 .cse9 .cse24 .cse11) (or .cse0 .cse10 .cse2 .cse15 .cse3 .cse16 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12) (or .cse0 .cse17 .cse1 .cse2 .cse15 .cse3 .cse16 .cse5 .cse6 .cse20 .cse7 .cse8 .cse24 .cse11) (or .cse0 (and (= ~m_st~0 0) .cse25 .cse26 (not (= ~t1_st~0 0))) .cse10 .cse2 .cse15 .cse3 .cse16 .cse5 .cse19 .cse21 .cse8 .cse9 .cse11 .cse12)))) [2022-07-21 08:10:25,299 INFO L899 garLoopResultBuilder]: For program point L723(lines 723 728) no Hoare annotation was computed. [2022-07-21 08:10:25,299 INFO L895 garLoopResultBuilder]: At program point L715(lines 699 717) the Hoare annotation is: (let ((.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse15 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse12 (not (= ~t1_pc~0 1))) (.cse13 (= |old(~t1_st~0)| 0)) (.cse16 (not (< ~token~0 (+ 2 ~local~0)))) (.cse17 (not (<= (+ ~local~0 1) ~token~0))) (.cse11 (not (<= 2 ~E_1~0))) (.cse0 (and (<= |activate_threads2_is_master_triggered_#res#1| 0) .cse14 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse15 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse5 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse6 (not (<= ~t1_pc~0 0))) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse10 (not (= ~c_dr_pc~0 ~p_dw_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse4 .cse12 .cse5 .cse13 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse3 .cse4 .cse12 .cse5 .cse13 .cse7 .cse8 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse3 .cse5 .cse7 .cse10) (or .cse1 .cse3 .cse4 (and .cse14 .cse15) .cse12 .cse5 .cse13 .cse7 .cse16 .cse17 .cse10 .cse11) (or .cse0 .cse1 .cse4 .cse12 .cse5 .cse13 .cse7 .cse16 .cse8 .cse17 .cse10 (not (= |old(~m_st~0)| 0)) .cse11) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2022-07-21 08:10:25,300 INFO L899 garLoopResultBuilder]: For program point L703(lines 703 712) no Hoare annotation was computed. [2022-07-21 08:10:25,300 INFO L895 garLoopResultBuilder]: At program point L734(lines 718 736) the Hoare annotation is: (let ((.cse9 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse10 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse11 (<= |activate_threads2_is_transmit1_triggered_#res#1| 0)) (.cse12 (<= 0 |activate_threads2_is_transmit1_triggered_#res#1|)) (.cse19 (= ~M_E~0 2)) (.cse25 (= |old(~t1_st~0)| ~t1_st~0)) (.cse30 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse26 (= ~m_st~0 |old(~m_st~0)|)) (.cse29 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse33 (<= ~m_pc~0 1)) (.cse32 (<= ~m_pc~0 0)) (.cse31 (= ~p_dw_st~0 0))) (let ((.cse16 (and .cse25 .cse30 .cse26 (<= 2 ~m_st~0) .cse29 (or (not .cse33) .cse32) .cse31 (= ~c_dr_pc~0 0))) (.cse17 (not .cse19)) (.cse1 (not (<= 2 |old(~m_st~0)|))) (.cse18 (= ~T1_E~0 ~M_E~0)) (.cse22 (not (<= ~t1_pc~0 0))) (.cse27 (and (not .cse32) .cse33)) (.cse21 (not (<= ~token~0 ~local~0))) (.cse24 (not (<= ~local~0 ~token~0))) (.cse20 (and .cse9 .cse10 .cse11 .cse12)) (.cse0 (not .cse31)) (.cse2 (not (<= 2 ~T1_E~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not .cse30)) (.cse5 (= |old(~t1_st~0)| 0)) (.cse6 (not (= ~p_dw_pc~0 0))) (.cse7 (not (< ~token~0 (+ 2 ~local~0)))) (.cse23 (not (<= 2 ~E_M~0))) (.cse8 (not (<= (+ ~local~0 1) ~token~0))) (.cse13 (not .cse29)) (.cse28 (not (= |old(~m_st~0)| 0))) (.cse14 (and .cse25 .cse26 .cse9 .cse10 .cse11 .cse12)) (.cse15 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and (= ~m_st~0 0) .cse9 .cse10 .cse11 (not (= ~t1_st~0 0)) .cse12) .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 (and .cse18 .cse19) .cse15 .cse20) (or .cse0 .cse21 .cse1 .cse2 .cse4 .cse22 .cse6 .cse23 .cse24 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse21 .cse2 (and .cse25 .cse26) .cse3 .cse4 .cse5 .cse6 .cse23 .cse24 .cse13) (or .cse0 .cse27 .cse1 .cse4 .cse6 .cse13 .cse16) (or .cse0 .cse21 .cse1 .cse2 .cse3 .cse4 .cse6 .cse23 .cse24 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse23 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse17 .cse21 .cse1 .cse2 .cse4 .cse22 .cse6 .cse23 .cse24 .cse13 (and .cse18 (= ~E_M~0 ~M_E~0) .cse19) .cse15 .cse20) (or (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse21 .cse2 .cse4 .cse22 .cse6 .cse23 .cse24 .cse13 .cse14) (or .cse0 .cse27 .cse21 .cse2 .cse3 .cse4 .cse5 .cse6 .cse23 .cse24 .cse13 .cse28 .cse15 .cse20) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse13 .cse28 .cse14 .cse15)))) [2022-07-21 08:10:25,300 INFO L899 garLoopResultBuilder]: For program point L703-2(lines 703 712) no Hoare annotation was computed. [2022-07-21 08:10:25,300 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 890 914) no Hoare annotation was computed. [2022-07-21 08:10:25,300 INFO L899 garLoopResultBuilder]: For program point L722(lines 722 731) no Hoare annotation was computed. [2022-07-21 08:10:25,300 INFO L899 garLoopResultBuilder]: For program point L722-2(lines 722 731) no Hoare annotation was computed. [2022-07-21 08:10:25,300 INFO L895 garLoopResultBuilder]: At program point L714(lines 702 716) the Hoare annotation is: (let ((.cse16 (= |old(~t1_st~0)| ~t1_st~0)) (.cse17 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse1 (and .cse16 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse17 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse6 (not (<= ~t1_pc~0 0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse12 (not (= ~t1_pc~0 1))) (.cse5 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse13 (= |old(~t1_st~0)| 0)) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse14 (not (< ~token~0 (+ 2 ~local~0)))) (.cse15 (not (<= (+ ~local~0 1) ~token~0))) (.cse10 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse11 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse3 .cse5 .cse7 .cse10) (or .cse0 .cse1 .cse3 .cse4 .cse12 .cse5 .cse13 .cse7 .cse8 .cse10 .cse11) (or .cse0 .cse1 .cse4 .cse12 .cse5 .cse13 .cse7 .cse14 .cse8 .cse15 .cse10 (not (= |old(~m_st~0)| 0)) .cse11) (or .cse0 .cse1 .cse2 .cse4 .cse12 .cse5 .cse13 .cse7 .cse8 .cse9 .cse10) (or (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse3 .cse4 (and .cse16 .cse17) .cse12 .cse5 .cse13 .cse7 .cse14 .cse15 .cse10 .cse11)))) [2022-07-21 08:10:25,301 INFO L899 garLoopResultBuilder]: For program point L906(lines 906 910) no Hoare annotation was computed. [2022-07-21 08:10:25,301 INFO L899 garLoopResultBuilder]: For program point L906-2(lines 890 914) no Hoare annotation was computed. [2022-07-21 08:10:25,302 INFO L899 garLoopResultBuilder]: For program point L898(lines 898 902) no Hoare annotation was computed. [2022-07-21 08:10:25,302 INFO L895 garLoopResultBuilder]: At program point activate_threads1ENTRY(lines 387 411) the Hoare annotation is: (let ((.cse5 (not (<= ~c_dr_pc~0 1))) (.cse7 (not (<= 1 ~c_dr_pc~0))) (.cse9 (not (= ~p_dw_pc~0 0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.cse3 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse4 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (not (<= 1 ~p_dw_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse6) (or .cse0 .cse1 .cse2 (not (= ~c_dr_pc~0 0)) .cse3 .cse4 .cse6 .cse8))) [2022-07-21 08:10:25,302 INFO L899 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 387 411) no Hoare annotation was computed. [2022-07-21 08:10:25,302 INFO L899 garLoopResultBuilder]: For program point L403(lines 403 407) no Hoare annotation was computed. [2022-07-21 08:10:25,302 INFO L899 garLoopResultBuilder]: For program point L401(line 401) no Hoare annotation was computed. [2022-07-21 08:10:25,302 INFO L899 garLoopResultBuilder]: For program point L403-2(lines 387 411) no Hoare annotation was computed. [2022-07-21 08:10:25,302 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2022-07-21 08:10:25,303 INFO L895 garLoopResultBuilder]: At program point L393(line 393) the Hoare annotation is: (let ((.cse5 (not (<= ~c_dr_pc~0 1))) (.cse7 (not (<= 1 ~c_dr_pc~0))) (.cse9 (not (= ~p_dw_pc~0 0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.cse3 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse4 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (not (<= 1 ~p_dw_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse6) (or .cse0 .cse1 .cse2 (not (= ~c_dr_pc~0 0)) .cse3 .cse4 .cse6 .cse8))) [2022-07-21 08:10:25,303 INFO L895 garLoopResultBuilder]: At program point L395-2(lines 395 399) the Hoare annotation is: (let ((.cse12 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse4 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse3 (not (= ~c_dr_pc~0 0))) (.cse9 (and .cse12 .cse4 (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))) (.cse10 (not (= ~p_dw_pc~0 0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.cse8 (and .cse12 .cse4)) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse11 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (not (<= ~c_dr_pc~0 1))) (.cse6 (not (= ~T1_E~0 ~M_E~0))) (.cse15 (not (<= 1 ~c_dr_pc~0))) (.cse7 (not (<= 1 ~p_dw_pc~0))) (.cse13 (not (= ~q_read_ev~0 2)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~p_dw_st~0)| 0)) .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 (= ~p_dw_st~0 0) .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse9 .cse5 .cse10 (not .cse11) .cse6) (or .cse12 .cse0 .cse1 (<= ~p_dw_pc~0 1) .cse2 .cse3 .cse5 .cse6 .cse13) (or .cse0 .cse1 .cse2 .cse9 .cse5 .cse10 .cse14 .cse6 .cse15) (or .cse0 .cse1 .cse2 .cse8 .cse5 .cse11 .cse14 .cse6 .cse15 .cse7 .cse13)))) [2022-07-21 08:10:25,303 INFO L899 garLoopResultBuilder]: For program point L393-1(line 393) no Hoare annotation was computed. [2022-07-21 08:10:25,303 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 737 744) no Hoare annotation was computed. [2022-07-21 08:10:25,303 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 737 744) the Hoare annotation is: true [2022-07-21 08:10:25,303 INFO L899 garLoopResultBuilder]: For program point L853-1(lines 834 861) no Hoare annotation was computed. [2022-07-21 08:10:25,303 INFO L895 garLoopResultBuilder]: At program point fire_delta_events2ENTRY(lines 834 861) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse15 (not (<= ~t1_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse14 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.cse12 (not (<= ~token~0 ~local~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse4 (not (<= 2 |old(~T1_E~0)|))) (.cse5 (= ~t1_st~0 0)) (.cse6 (not (= ~p_dw_pc~0 0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (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)|))) (.cse9 (not (<= 2 |old(~E_M~0)|))) (.cse13 (not (<= ~local~0 ~token~0))) (.cse10 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse11 (not (= ~m_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (< ~token~0 (+ 2 ~local~0))) .cse8 .cse9 (not (<= (+ ~local~0 1) ~token~0)) .cse10 .cse11) (or .cse0 .cse1 .cse12 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10) (or .cse0 .cse1 .cse14 .cse3 .cse6 .cse8 .cse10) (or (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse12 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10 .cse11) (or .cse0 .cse1 .cse12 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10) (or .cse1 .cse14 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10 .cse11))) [2022-07-21 08:10:25,304 INFO L899 garLoopResultBuilder]: For program point L848-1(lines 837 860) no Hoare annotation was computed. [2022-07-21 08:10:25,304 INFO L899 garLoopResultBuilder]: For program point L843-1(lines 837 860) no Hoare annotation was computed. [2022-07-21 08:10:25,304 INFO L899 garLoopResultBuilder]: For program point L838-1(lines 837 860) no Hoare annotation was computed. [2022-07-21 08:10:25,304 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 834 861) no Hoare annotation was computed. [2022-07-21 08:10:25,304 INFO L895 garLoopResultBuilder]: At program point fire_delta_events1ENTRY(lines 315 332) the Hoare annotation is: (let ((.cse4 (not (= ~p_dw_pc~0 0))) (.cse7 (not (<= ~c_dr_pc~0 1))) (.cse8 (not (<= 1 ~c_dr_pc~0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.cse3 (not (= ~E_M~0 ~M_E~0))) (.cse5 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse6 (not (= ~T1_E~0 ~M_E~0))) (.cse9 (not (<= 1 ~p_dw_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse6 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse6 .cse8) (or .cse0 .cse1 .cse2 (not (= ~c_dr_pc~0 0)) .cse3 .cse5 .cse6 .cse9))) [2022-07-21 08:10:25,304 INFO L899 garLoopResultBuilder]: For program point L319-1(lines 318 331) no Hoare annotation was computed. [2022-07-21 08:10:25,304 INFO L899 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 315 332) no Hoare annotation was computed. [2022-07-21 08:10:25,304 INFO L899 garLoopResultBuilder]: For program point L324-1(lines 315 332) no Hoare annotation was computed. [2022-07-21 08:10:25,305 INFO L902 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 99 127) the Hoare annotation is: true [2022-07-21 08:10:25,305 INFO L895 garLoopResultBuilder]: At program point L124(lines 102 126) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.cse3 (not (= ~E_M~0 ~M_E~0))) (.cse4 (not (= ~T1_E~0 ~M_E~0))) (.cse5 (and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1)))) (and (or .cse0 .cse1 .cse2 (not (= ~c_dr_pc~0 0)) .cse3 .cse4 .cse5 (not (<= 1 ~p_dw_pc~0))) (or .cse0 .cse1 .cse2 .cse3 (not (= ~p_dw_pc~0 0)) (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse4 .cse5))) [2022-07-21 08:10:25,305 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 119) no Hoare annotation was computed. [2022-07-21 08:10:25,305 INFO L899 garLoopResultBuilder]: For program point L113-1(lines 113 122) no Hoare annotation was computed. [2022-07-21 08:10:25,305 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 99 127) no Hoare annotation was computed. [2022-07-21 08:10:25,306 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 109) no Hoare annotation was computed. [2022-07-21 08:10:25,306 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 99 127) no Hoare annotation was computed. [2022-07-21 08:10:25,306 INFO L899 garLoopResultBuilder]: For program point L103(lines 103 112) no Hoare annotation was computed. [2022-07-21 08:10:25,306 INFO L899 garLoopResultBuilder]: For program point L103-2(lines 102 126) no Hoare annotation was computed. [2022-07-21 08:10:25,306 INFO L899 garLoopResultBuilder]: For program point L1026-2(lines 1026 1035) no Hoare annotation was computed. [2022-07-21 08:10:25,306 INFO L895 garLoopResultBuilder]: At program point L828(lines 783 833) the Hoare annotation is: (let ((.cse5 (<= ~t1_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse2 .cse12 .cse4 .cse14 .cse7 .cse8))) [2022-07-21 08:10:25,306 INFO L899 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2022-07-21 08:10:25,306 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 439) no Hoare annotation was computed. [2022-07-21 08:10:25,307 INFO L902 garLoopResultBuilder]: At program point L1060(lines 1051 1062) the Hoare annotation is: true [2022-07-21 08:10:25,307 INFO L895 garLoopResultBuilder]: At program point L499-1(lines 496 536) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (<= 1 ~c_dr_pc~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse9 .cse7 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse7 .cse3 (< 1 ~p_dw_pc~0) .cse5 .cse6))) [2022-07-21 08:10:25,307 INFO L899 garLoopResultBuilder]: For program point L599(line 599) no Hoare annotation was computed. [2022-07-21 08:10:25,307 INFO L899 garLoopResultBuilder]: For program point L500(line 500) no Hoare annotation was computed. [2022-07-21 08:10:25,307 INFO L895 garLoopResultBuilder]: At program point L600(lines 595 602) the Hoare annotation is: false [2022-07-21 08:10:25,310 INFO L899 garLoopResultBuilder]: For program point L1063(lines 1063 1069) no Hoare annotation was computed. [2022-07-21 08:10:25,310 INFO L895 garLoopResultBuilder]: At program point L1030(line 1030) the Hoare annotation is: (let ((.cse5 (<= ~t1_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse2 .cse12 .cse4 .cse14 .cse7 .cse8))) [2022-07-21 08:10:25,310 INFO L899 garLoopResultBuilder]: For program point L1030-1(line 1030) no Hoare annotation was computed. [2022-07-21 08:10:25,310 INFO L899 garLoopResultBuilder]: For program point L799(lines 789 827) no Hoare annotation was computed. [2022-07-21 08:10:25,310 INFO L899 garLoopResultBuilder]: For program point L667(lines 667 675) no Hoare annotation was computed. [2022-07-21 08:10:25,310 INFO L895 garLoopResultBuilder]: At program point L172-1(lines 156 200) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (= ~T1_E~0 ~M_E~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~M_E~0 2))) (or (and (= ~p_dw_pc~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse2 (<= 1 ~p_dw_pc~0) .cse3 .cse4 .cse5))))) (or (and .cse0 (= ~c_dr_pc~0 0)) (and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1) .cse0))) [2022-07-21 08:10:25,311 INFO L895 garLoopResultBuilder]: At program point L932(lines 926 934) the Hoare annotation is: (let ((.cse5 (<= ~t1_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse2 .cse12 .cse4 .cse14 .cse7 .cse8))) [2022-07-21 08:10:25,311 INFO L899 garLoopResultBuilder]: For program point L635(line 635) no Hoare annotation was computed. [2022-07-21 08:10:25,311 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-07-21 08:10:25,311 INFO L899 garLoopResultBuilder]: For program point L1065(lines 1065 1068) no Hoare annotation was computed. [2022-07-21 08:10:25,311 INFO L895 garLoopResultBuilder]: At program point L537(lines 484 542) the Hoare annotation is: (= ~M_E~0 2) [2022-07-21 08:10:25,311 INFO L895 garLoopResultBuilder]: At program point L471(line 471) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (<= 1 ~c_dr_pc~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse9 .cse7 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse7 .cse3 (< 1 ~p_dw_pc~0) .cse5 .cse6))) [2022-07-21 08:10:25,311 INFO L899 garLoopResultBuilder]: For program point L471-1(line 471) no Hoare annotation was computed. [2022-07-21 08:10:25,311 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 215) no Hoare annotation was computed. [2022-07-21 08:10:25,312 INFO L895 garLoopResultBuilder]: At program point L1000(line 1000) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~M_E~0 2)) [2022-07-21 08:10:25,312 INFO L899 garLoopResultBuilder]: For program point L1000-1(line 1000) no Hoare annotation was computed. [2022-07-21 08:10:25,312 INFO L899 garLoopResultBuilder]: For program point L802(lines 802 809) no Hoare annotation was computed. [2022-07-21 08:10:25,312 INFO L899 garLoopResultBuilder]: For program point L670(lines 670 674) no Hoare annotation was computed. [2022-07-21 08:10:25,312 INFO L895 garLoopResultBuilder]: At program point L571(lines 562 573) the Hoare annotation is: (= ~M_E~0 2) [2022-07-21 08:10:25,312 INFO L899 garLoopResultBuilder]: For program point L373(lines 373 377) no Hoare annotation was computed. [2022-07-21 08:10:25,312 INFO L899 garLoopResultBuilder]: For program point L373-2(lines 372 385) no Hoare annotation was computed. [2022-07-21 08:10:25,312 INFO L895 garLoopResultBuilder]: At program point L671(lines 666 697) the Hoare annotation is: (let ((.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (<= 2 ~m_st~0)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (= ~c_dr_pc~0 0))) (or (let ((.cse0 (<= ~m_pc~0 0))) (and (or (<= 1 ~t1_pc~0) (not .cse0)) .cse1 .cse2 .cse3 .cse4 .cse5 (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) .cse0))) (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) (<= 2 ~E_M~0) .cse1 .cse2 .cse3 (<= 2 ~T1_E~0) .cse4 .cse5 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0)))) [2022-07-21 08:10:25,312 INFO L899 garLoopResultBuilder]: For program point L473(lines 473 478) no Hoare annotation was computed. [2022-07-21 08:10:25,313 INFO L899 garLoopResultBuilder]: For program point L242(lines 242 254) no Hoare annotation was computed. [2022-07-21 08:10:25,313 INFO L895 garLoopResultBuilder]: At program point L1002(line 1002) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~E_M~0 ~M_E~0)) (.cse7 (= ~M_E~0 2))) (or (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 (= ~m_st~0 0) .cse3 (<= ~t1_pc~0 0) .cse4 .cse5 .cse6 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse7) (and .cse0 .cse1 .cse2 (<= 2 ~m_st~0) .cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) .cse4 .cse5 .cse6 .cse7))) [2022-07-21 08:10:25,313 INFO L895 garLoopResultBuilder]: At program point L1002-1(line 1002) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~E_M~0 ~M_E~0)) (.cse7 (= ~M_E~0 2))) (or (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 (= ~m_st~0 0) .cse3 (<= ~t1_pc~0 0) .cse4 .cse5 .cse6 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse7) (and .cse0 .cse1 .cse2 (<= 2 ~m_st~0) .cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) .cse4 .cse5 .cse6 .cse7))) [2022-07-21 08:10:25,313 INFO L895 garLoopResultBuilder]: At program point L507(line 507) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (<= 1 ~c_dr_pc~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse9 .cse7 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse7 .cse3 (< 1 ~p_dw_pc~0) .cse5 .cse6))) [2022-07-21 08:10:25,314 INFO L899 garLoopResultBuilder]: For program point L507-1(line 507) no Hoare annotation was computed. [2022-07-21 08:10:25,314 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 249) no Hoare annotation was computed. [2022-07-21 08:10:25,314 INFO L899 garLoopResultBuilder]: For program point L210(lines 210 214) no Hoare annotation was computed. [2022-07-21 08:10:25,315 INFO L895 garLoopResultBuilder]: At program point L1003(line 1003) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~E_M~0 ~M_E~0)) (.cse7 (= ~M_E~0 2))) (or (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 (= ~m_st~0 0) .cse3 (<= ~t1_pc~0 0) .cse4 .cse5 .cse6 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse7) (and .cse0 .cse1 .cse2 (<= 2 ~m_st~0) .cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) .cse4 .cse5 .cse6 .cse7))) [2022-07-21 08:10:25,315 INFO L895 garLoopResultBuilder]: At program point L970(lines 963 972) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~M_E~0 2)) [2022-07-21 08:10:25,315 INFO L895 garLoopResultBuilder]: At program point L640(line 640) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_M~0)) (.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse3 (<= 2 ~T1_E~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (<= ~token~0 ~local~0)) (.cse7 (<= ~local~0 ~token~0))) (or (and (= ~m_pc~0 ~t1_pc~0) .cse0 .cse1 .cse2 (<= ~t1_pc~0 0) .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~t1_st~0 0)) .cse6 .cse7))) [2022-07-21 08:10:25,315 INFO L899 garLoopResultBuilder]: For program point L640-1(line 640) no Hoare annotation was computed. [2022-07-21 08:10:25,315 INFO L895 garLoopResultBuilder]: At program point L211(lines 206 260) the Hoare annotation is: false [2022-07-21 08:10:25,315 INFO L895 garLoopResultBuilder]: At program point L443(lines 418 458) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (<= 1 ~c_dr_pc~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse9 .cse7 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse7 .cse3 (< 1 ~p_dw_pc~0) .cse5 .cse6))) [2022-07-21 08:10:25,315 INFO L895 garLoopResultBuilder]: At program point L179(lines 156 200) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_dr_pc~0 0) .cse4 .cse5) (and .cse0 .cse1 .cse6 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (<= 1 ~c_dr_pc~0) .cse6 .cse3 (< 1 ~p_dw_pc~0) .cse4 .cse5))) [2022-07-21 08:10:25,316 INFO L899 garLoopResultBuilder]: For program point L939(lines 939 943) no Hoare annotation was computed. [2022-07-21 08:10:25,316 INFO L899 garLoopResultBuilder]: For program point L939-2(lines 938 961) no Hoare annotation was computed. [2022-07-21 08:10:25,316 INFO L895 garLoopResultBuilder]: At program point L378-1(lines 369 386) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (<= 1 ~c_dr_pc~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse9 .cse7 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse7 .cse3 (< 1 ~p_dw_pc~0) .cse5 .cse6))) [2022-07-21 08:10:25,316 INFO L899 garLoopResultBuilder]: For program point L1039(lines 1039 1043) no Hoare annotation was computed. [2022-07-21 08:10:25,316 INFO L895 garLoopResultBuilder]: At program point L511(line 511) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (<= 1 ~c_dr_pc~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse9 .cse7 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse7 .cse3 (< 1 ~p_dw_pc~0) .cse5 .cse6))) [2022-07-21 08:10:25,316 INFO L895 garLoopResultBuilder]: At program point L511-1(line 511) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (<= 1 ~c_dr_pc~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse9 .cse7 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse7 .cse3 (< 1 ~p_dw_pc~0) .cse5 .cse6))) [2022-07-21 08:10:25,316 INFO L895 garLoopResultBuilder]: At program point L247(line 247) the Hoare annotation is: false [2022-07-21 08:10:25,317 INFO L895 garLoopResultBuilder]: At program point L1007-1(lines 1004 1044) the Hoare annotation is: (let ((.cse5 (<= ~t1_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse2 .cse12 .cse4 .cse14 .cse7 .cse8))) [2022-07-21 08:10:25,317 INFO L895 garLoopResultBuilder]: At program point L512(line 512) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (<= 1 ~c_dr_pc~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse9 .cse7 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse7 .cse3 (< 1 ~p_dw_pc~0) .cse5 .cse6))) [2022-07-21 08:10:25,317 INFO L899 garLoopResultBuilder]: For program point L281(lines 281 285) no Hoare annotation was computed. [2022-07-21 08:10:25,317 INFO L899 garLoopResultBuilder]: For program point L281-2(lines 280 293) no Hoare annotation was computed. [2022-07-21 08:10:25,317 INFO L899 garLoopResultBuilder]: For program point L1008(line 1008) no Hoare annotation was computed. [2022-07-21 08:10:25,317 INFO L895 garLoopResultBuilder]: At program point L678-1(lines 666 697) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse9 (= ~m_st~0 0)) (.cse5 (<= 2 ~T1_E~0)) (.cse8 (not (= ~t1_st~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse10 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5 (<= (+ ~local~0 1) ~token~0) .cse6 .cse7 (< ~token~0 (+ 2 ~local~0)) .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5 .cse10 .cse6 .cse7 .cse8 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0)) (and .cse2 .cse3 .cse4 .cse10 .cse6 .cse7))) [2022-07-21 08:10:25,317 INFO L895 garLoopResultBuilder]: At program point L513(line 513) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (<= 1 ~c_dr_pc~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse9 .cse7 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse7 .cse3 (< 1 ~p_dw_pc~0) .cse5 .cse6))) [2022-07-21 08:10:25,317 INFO L895 garLoopResultBuilder]: At program point L480(lines 469 482) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (<= 1 ~c_dr_pc~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse9 .cse7 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse7 .cse3 (< 1 ~p_dw_pc~0) .cse5 .cse6))) [2022-07-21 08:10:25,318 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 454) no Hoare annotation was computed. [2022-07-21 08:10:25,326 INFO L899 garLoopResultBuilder]: For program point L679(line 679) no Hoare annotation was computed. [2022-07-21 08:10:25,326 INFO L895 garLoopResultBuilder]: At program point L481(lines 465 483) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (<= 1 ~c_dr_pc~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse9 .cse7 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse7 .cse3 (< 1 ~p_dw_pc~0) .cse5 .cse6))) [2022-07-21 08:10:25,327 INFO L899 garLoopResultBuilder]: For program point L944-1(lines 938 961) no Hoare annotation was computed. [2022-07-21 08:10:25,327 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-21 08:10:25,327 INFO L895 garLoopResultBuilder]: At program point L813(lines 789 827) the Hoare annotation is: (let ((.cse5 (<= ~t1_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse2 .cse12 .cse4 .cse14 .cse7 .cse8))) [2022-07-21 08:10:25,327 INFO L895 garLoopResultBuilder]: At program point L648-1(lines 622 661) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ ~local~0 1) ~token~0) .cse6 .cse7 (< ~token~0 (+ 2 ~local~0)) .cse8) (and .cse1 (= ~m_pc~0 ~t1_pc~0) .cse2 .cse3 .cse4 (<= ~t1_pc~0 0) .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) .cse6 .cse7 .cse8))) [2022-07-21 08:10:25,327 INFO L899 garLoopResultBuilder]: For program point L516(line 516) no Hoare annotation was computed. [2022-07-21 08:10:25,327 INFO L895 garLoopResultBuilder]: At program point L252(line 252) the Hoare annotation is: false [2022-07-21 08:10:25,327 INFO L899 garLoopResultBuilder]: For program point L219(line 219) no Hoare annotation was computed. [2022-07-21 08:10:25,327 INFO L895 garLoopResultBuilder]: At program point L252-1(lines 206 260) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~T1_E~0 ~M_E~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1) .cse3 .cse4 .cse5) (and .cse1 .cse2 (<= 1 ~p_dw_pc~0) .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse3 .cse4 .cse5))) [2022-07-21 08:10:25,328 INFO L902 garLoopResultBuilder]: At program point L1045(lines 992 1050) the Hoare annotation is: true [2022-07-21 08:10:25,328 INFO L895 garLoopResultBuilder]: At program point L979(line 979) the Hoare annotation is: (let ((.cse5 (<= ~t1_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse2 .cse12 .cse4 .cse14 .cse7 .cse8))) [2022-07-21 08:10:25,328 INFO L899 garLoopResultBuilder]: For program point L979-1(line 979) no Hoare annotation was computed. [2022-07-21 08:10:25,328 INFO L895 garLoopResultBuilder]: At program point L286-1(lines 277 294) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (= ~m_pc~0 ~t1_pc~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (= ~c_dr_pc~0 0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 2)) [2022-07-21 08:10:25,328 INFO L899 garLoopResultBuilder]: For program point L749(lines 749 753) no Hoare annotation was computed. [2022-07-21 08:10:25,328 INFO L899 garLoopResultBuilder]: For program point L749-2(lines 748 761) no Hoare annotation was computed. [2022-07-21 08:10:25,328 INFO L899 garLoopResultBuilder]: For program point L518(lines 518 527) no Hoare annotation was computed. [2022-07-21 08:10:25,329 INFO L899 garLoopResultBuilder]: For program point L518-2(lines 518 527) no Hoare annotation was computed. [2022-07-21 08:10:25,329 INFO L895 garLoopResultBuilder]: At program point L419(line 419) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (<= 1 ~c_dr_pc~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse9 .cse7 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse7 .cse3 (< 1 ~p_dw_pc~0) .cse5 .cse6))) [2022-07-21 08:10:25,329 INFO L899 garLoopResultBuilder]: For program point L981(lines 981 986) no Hoare annotation was computed. [2022-07-21 08:10:25,329 INFO L899 garLoopResultBuilder]: For program point L816(lines 816 823) no Hoare annotation was computed. [2022-07-21 08:10:25,329 INFO L895 garLoopResultBuilder]: At program point L1015(line 1015) the Hoare annotation is: (let ((.cse5 (<= ~t1_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse2 .cse12 .cse4 .cse14 .cse7 .cse8))) [2022-07-21 08:10:25,330 INFO L899 garLoopResultBuilder]: For program point L1015-1(line 1015) no Hoare annotation was computed. [2022-07-21 08:10:25,330 INFO L899 garLoopResultBuilder]: For program point L949-1(lines 938 961) no Hoare annotation was computed. [2022-07-21 08:10:25,330 INFO L899 garLoopResultBuilder]: For program point L421(line 421) no Hoare annotation was computed. [2022-07-21 08:10:25,330 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-21 08:10:25,332 INFO L895 garLoopResultBuilder]: At program point L256(lines 203 261) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (<= 1 ~c_dr_pc~0)) (.cse2 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) (<= 1 ~p_dw_pc~0) .cse3 .cse4 .cse5) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse3 (< 1 ~p_dw_pc~0) .cse4 .cse5))) [2022-07-21 08:10:25,332 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 169) no Hoare annotation was computed. [2022-07-21 08:10:25,346 INFO L895 garLoopResultBuilder]: At program point L522(line 522) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (<= 1 ~c_dr_pc~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse9 .cse7 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse7 .cse3 (< 1 ~p_dw_pc~0) .cse5 .cse6))) [2022-07-21 08:10:25,346 INFO L899 garLoopResultBuilder]: For program point L522-1(line 522) no Hoare annotation was computed. [2022-07-21 08:10:25,346 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2022-07-21 08:10:25,346 INFO L899 garLoopResultBuilder]: For program point L423-1(lines 418 458) no Hoare annotation was computed. [2022-07-21 08:10:25,346 INFO L899 garLoopResultBuilder]: For program point L357(lines 357 364) no Hoare annotation was computed. [2022-07-21 08:10:25,346 INFO L895 garLoopResultBuilder]: At program point L357-2(lines 353 368) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (<= 1 ~c_dr_pc~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse9 .cse7 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse7 .cse3 (< 1 ~p_dw_pc~0) .cse5 .cse6))) [2022-07-21 08:10:25,346 INFO L895 garLoopResultBuilder]: At program point L754-1(lines 745 762) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~E_M~0 ~M_E~0)) (.cse7 (= ~M_E~0 2))) (or (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 (= ~m_st~0 0) .cse3 (<= ~t1_pc~0 0) .cse4 .cse5 .cse6 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse7) (and .cse0 .cse1 .cse2 (<= 2 ~m_st~0) .cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) .cse4 .cse5 .cse6 .cse7))) [2022-07-21 08:10:25,347 INFO L895 garLoopResultBuilder]: At program point L688(line 688) the Hoare annotation is: (let ((.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (<= 2 ~m_st~0)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (= ~c_dr_pc~0 0))) (or (let ((.cse0 (<= ~m_pc~0 0))) (and (or (<= 1 ~t1_pc~0) (not .cse0)) .cse1 .cse2 .cse3 .cse4 .cse5 (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) .cse0))) (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) .cse1 .cse2 .cse3 (<= 2 ~T1_E~0) (<= (+ ~local~0 1) ~token~0) .cse4 .cse5 (< ~token~0 (+ 2 ~local~0)) (not (= ~t1_st~0 0))))) [2022-07-21 08:10:25,347 INFO L899 garLoopResultBuilder]: For program point L688-1(line 688) no Hoare annotation was computed. [2022-07-21 08:10:25,347 INFO L899 garLoopResultBuilder]: For program point L226-1(lines 226 236) no Hoare annotation was computed. [2022-07-21 08:10:25,347 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 168) no Hoare annotation was computed. [2022-07-21 08:10:25,347 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-21 08:10:25,347 INFO L895 garLoopResultBuilder]: At program point L1019(line 1019) the Hoare annotation is: (let ((.cse5 (<= ~t1_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse2 .cse12 .cse4 .cse14 .cse7 .cse8))) [2022-07-21 08:10:25,347 INFO L895 garLoopResultBuilder]: At program point L1019-1(line 1019) the Hoare annotation is: (let ((.cse5 (<= ~t1_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse2 .cse12 .cse4 .cse14 .cse7 .cse8))) [2022-07-21 08:10:25,348 INFO L895 garLoopResultBuilder]: At program point L656(lines 619 662) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (<= ~token~0 ~local~0)) (.cse9 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~t1_pc~0 0) .cse5 .cse6 .cse7 .cse8 .cse9) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2022-07-21 08:10:25,348 INFO L899 garLoopResultBuilder]: For program point L623(lines 623 631) no Hoare annotation was computed. [2022-07-21 08:10:25,348 INFO L895 garLoopResultBuilder]: At program point L161(lines 156 200) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (<= 1 ~p_dw_pc~0)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_dr_pc~0 0) .cse4 .cse5) (and .cse0 .cse1 (<= ~c_dr_pc~0 1) (= ~c_dr_pc~0 ~p_dw_pc~0) .cse2 .cse3 .cse4 .cse5))) [2022-07-21 08:10:25,348 INFO L895 garLoopResultBuilder]: At program point L1020(line 1020) the Hoare annotation is: (let ((.cse5 (<= ~t1_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse2 .cse12 .cse4 .cse14 .cse7 .cse8))) [2022-07-21 08:10:25,348 INFO L895 garLoopResultBuilder]: At program point L954-1(lines 935 962) the Hoare annotation is: (let ((.cse5 (<= ~t1_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse2 .cse12 .cse4 .cse14 .cse7 .cse8))) [2022-07-21 08:10:25,348 INFO L895 garLoopResultBuilder]: At program point L492(line 492) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 2)) [2022-07-21 08:10:25,348 INFO L899 garLoopResultBuilder]: For program point L492-1(line 492) no Hoare annotation was computed. [2022-07-21 08:10:25,349 INFO L895 garLoopResultBuilder]: At program point L459(lines 412 464) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (<= 1 ~c_dr_pc~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse9 .cse7 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse7 .cse3 (< 1 ~p_dw_pc~0) .cse5 .cse6))) [2022-07-21 08:10:25,349 INFO L895 garLoopResultBuilder]: At program point L1021(line 1021) the Hoare annotation is: (let ((.cse5 (<= ~t1_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse2 .cse12 .cse4 .cse14 .cse7 .cse8))) [2022-07-21 08:10:25,349 INFO L895 garLoopResultBuilder]: At program point L988(lines 977 990) the Hoare annotation is: (let ((.cse5 (<= ~t1_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse2 .cse12 .cse4 .cse14 .cse7 .cse8))) [2022-07-21 08:10:25,349 INFO L895 garLoopResultBuilder]: At program point L790(line 790) the Hoare annotation is: (let ((.cse5 (<= ~t1_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse2 .cse12 .cse4 .cse14 .cse7 .cse8))) [2022-07-21 08:10:25,349 INFO L895 garLoopResultBuilder]: At program point L559(lines 543 561) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 2)) [2022-07-21 08:10:25,349 INFO L895 garLoopResultBuilder]: At program point L196(lines 153 201) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_dr_pc~0 0) .cse4 .cse5) (and .cse0 .cse1 .cse6 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (<= 1 ~c_dr_pc~0) .cse6 .cse3 (< 1 ~p_dw_pc~0) .cse4 .cse5))) [2022-07-21 08:10:25,350 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 167) no Hoare annotation was computed. [2022-07-21 08:10:25,350 INFO L895 garLoopResultBuilder]: At program point L989(lines 973 991) the Hoare annotation is: (let ((.cse5 (<= ~t1_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse2 .cse12 .cse4 .cse14 .cse7 .cse8))) [2022-07-21 08:10:25,350 INFO L895 garLoopResultBuilder]: At program point L692(lines 663 698) the Hoare annotation is: (let ((.cse11 (<= ~m_pc~0 0))) (let ((.cse4 (<= 2 ~m_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse10 (= ~m_st~0 0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~T1_E~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0)) (.cse12 (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) .cse11)) (.cse9 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse9) (and (or (<= 1 ~t1_pc~0) (not .cse11)) .cse3 .cse4 .cse5 .cse7 .cse8 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse7 .cse8 .cse12 .cse9 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0))))) [2022-07-21 08:10:25,350 INFO L899 garLoopResultBuilder]: For program point L626(lines 626 630) no Hoare annotation was computed. [2022-07-21 08:10:25,350 INFO L895 garLoopResultBuilder]: At program point L494(line 494) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (= ~m_pc~0 ~t1_pc~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (= ~c_dr_pc~0 0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 2)) [2022-07-21 08:10:25,350 INFO L895 garLoopResultBuilder]: At program point L494-1(line 494) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (= ~m_pc~0 ~t1_pc~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (= ~c_dr_pc~0 0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 2)) [2022-07-21 08:10:25,350 INFO L899 garLoopResultBuilder]: For program point L428(lines 418 458) no Hoare annotation was computed. [2022-07-21 08:10:25,351 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-21 08:10:25,351 INFO L899 garLoopResultBuilder]: For program point L792(line 792) no Hoare annotation was computed. [2022-07-21 08:10:25,351 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 599) no Hoare annotation was computed. [2022-07-21 08:10:25,351 INFO L895 garLoopResultBuilder]: At program point L627(lines 622 661) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) (<= 2 ~E_M~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= 2 ~T1_E~0) (<= (+ ~local~0 1) ~token~0) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (< ~token~0 (+ 2 ~local~0)) (not (= ~t1_st~0 0))) [2022-07-21 08:10:25,351 INFO L895 garLoopResultBuilder]: At program point L495(line 495) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (= ~m_pc~0 ~t1_pc~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (= ~c_dr_pc~0 0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 2)) [2022-07-21 08:10:25,351 INFO L899 garLoopResultBuilder]: For program point L1024(line 1024) no Hoare annotation was computed. [2022-07-21 08:10:25,351 INFO L899 garLoopResultBuilder]: For program point L794(lines 794 798) no Hoare annotation was computed. [2022-07-21 08:10:25,351 INFO L899 garLoopResultBuilder]: For program point L794-1(lines 789 827) no Hoare annotation was computed. [2022-07-21 08:10:25,352 INFO L899 garLoopResultBuilder]: For program point L1026(lines 1026 1035) no Hoare annotation was computed. [2022-07-21 08:10:25,352 INFO L895 garLoopResultBuilder]: At program point L95(lines 73 97) the Hoare annotation is: (let ((.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse9 (not (= ~q_read_ev~0 2))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.cse3 (not (= ~E_M~0 ~M_E~0))) (.cse5 (and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))) (.cse10 (not (= ~p_dw_pc~0 0))) (.cse6 (not (<= ~c_dr_pc~0 1))) (.cse7 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (not (<= 1 ~c_dr_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= 1 ~p_dw_pc~0)) .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse10 (not .cse4) .cse7) (or .cse0 .cse1 (<= ~p_dw_pc~0 1) .cse2 (not (= ~c_dr_pc~0 0)) .cse3 .cse5 .cse7 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse10 .cse6 .cse7 .cse8))) [2022-07-21 08:10:25,352 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2022-07-21 08:10:25,352 INFO L899 garLoopResultBuilder]: For program point L84-1(lines 84 93) no Hoare annotation was computed. [2022-07-21 08:10:25,352 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 70 98) no Hoare annotation was computed. [2022-07-21 08:10:25,352 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 70 98) no Hoare annotation was computed. [2022-07-21 08:10:25,352 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 80) no Hoare annotation was computed. [2022-07-21 08:10:25,352 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 83) no Hoare annotation was computed. [2022-07-21 08:10:25,353 INFO L899 garLoopResultBuilder]: For program point L74-2(lines 73 97) no Hoare annotation was computed. [2022-07-21 08:10:25,353 INFO L902 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 70 98) the Hoare annotation is: true [2022-07-21 08:10:25,353 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1FINAL(lines 295 314) no Hoare annotation was computed. [2022-07-21 08:10:25,353 INFO L902 garLoopResultBuilder]: At program point L311(lines 298 313) the Hoare annotation is: true [2022-07-21 08:10:25,353 INFO L902 garLoopResultBuilder]: At program point exists_runnable_thread1ENTRY(lines 295 314) the Hoare annotation is: true [2022-07-21 08:10:25,353 INFO L899 garLoopResultBuilder]: For program point L303(lines 303 308) no Hoare annotation was computed. [2022-07-21 08:10:25,353 INFO L899 garLoopResultBuilder]: For program point L299(lines 299 309) no Hoare annotation was computed. [2022-07-21 08:10:25,353 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 295 314) no Hoare annotation was computed. [2022-07-21 08:10:25,353 INFO L902 garLoopResultBuilder]: At program point error1ENTRY(lines 23 30) the Hoare annotation is: true [2022-07-21 08:10:25,354 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2022-07-21 08:10:25,354 INFO L899 garLoopResultBuilder]: For program point error1FINAL(lines 23 30) no Hoare annotation was computed. [2022-07-21 08:10:25,354 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2022-07-21 08:10:25,354 INFO L899 garLoopResultBuilder]: For program point L767(lines 767 777) no Hoare annotation was computed. [2022-07-21 08:10:25,354 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2FINAL(lines 763 782) no Hoare annotation was computed. [2022-07-21 08:10:25,354 INFO L902 garLoopResultBuilder]: At program point exists_runnable_thread2ENTRY(lines 763 782) the Hoare annotation is: true [2022-07-21 08:10:25,354 INFO L902 garLoopResultBuilder]: At program point L779(lines 766 781) the Hoare annotation is: true [2022-07-21 08:10:25,354 INFO L899 garLoopResultBuilder]: For program point L771(lines 771 776) no Hoare annotation was computed. [2022-07-21 08:10:25,354 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 763 782) no Hoare annotation was computed. [2022-07-21 08:10:25,355 INFO L899 garLoopResultBuilder]: For program point L337-1(lines 336 349) no Hoare annotation was computed. [2022-07-21 08:10:25,355 INFO L895 garLoopResultBuilder]: At program point reset_delta_events1ENTRY(lines 333 350) the Hoare annotation is: (let ((.cse4 (not (= ~p_dw_pc~0 0))) (.cse7 (not (<= ~c_dr_pc~0 1))) (.cse8 (not (<= 1 ~c_dr_pc~0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.cse3 (not (= ~E_M~0 ~M_E~0))) (.cse5 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse6 (not (= ~T1_E~0 ~M_E~0))) (.cse9 (not (<= 1 ~p_dw_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse6 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse6 .cse8) (or .cse0 .cse1 .cse2 (not (= ~c_dr_pc~0 0)) .cse3 .cse5 .cse6 .cse9))) [2022-07-21 08:10:25,355 INFO L899 garLoopResultBuilder]: For program point L342-1(lines 333 350) no Hoare annotation was computed. [2022-07-21 08:10:25,355 INFO L899 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 333 350) no Hoare annotation was computed. [2022-07-21 08:10:25,355 INFO L899 garLoopResultBuilder]: For program point L866-1(lines 865 888) no Hoare annotation was computed. [2022-07-21 08:10:25,355 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 862 889) no Hoare annotation was computed. [2022-07-21 08:10:25,355 INFO L895 garLoopResultBuilder]: At program point reset_delta_events2ENTRY(lines 862 889) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse15 (not (<= ~t1_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse14 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.cse12 (not (<= ~token~0 ~local~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse4 (not (<= 2 |old(~T1_E~0)|))) (.cse5 (= ~t1_st~0 0)) (.cse6 (not (= ~p_dw_pc~0 0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (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)|))) (.cse9 (not (<= 2 |old(~E_M~0)|))) (.cse13 (not (<= ~local~0 ~token~0))) (.cse10 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse11 (not (= ~m_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (< ~token~0 (+ 2 ~local~0))) .cse8 .cse9 (not (<= (+ ~local~0 1) ~token~0)) .cse10 .cse11) (or .cse0 .cse1 .cse12 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10) (or .cse0 .cse1 .cse14 .cse3 .cse6 .cse8 .cse10) (or (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse12 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10 .cse11) (or .cse0 .cse1 .cse12 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10) (or .cse1 .cse14 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10 .cse11))) [2022-07-21 08:10:25,356 INFO L899 garLoopResultBuilder]: For program point L881-1(lines 862 889) no Hoare annotation was computed. [2022-07-21 08:10:25,356 INFO L899 garLoopResultBuilder]: For program point L876-1(lines 865 888) no Hoare annotation was computed. [2022-07-21 08:10:25,356 INFO L899 garLoopResultBuilder]: For program point L871-1(lines 865 888) no Hoare annotation was computed. [2022-07-21 08:10:25,358 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:10:25,360 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 08:10:25,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 08:10:25 BoogieIcfgContainer [2022-07-21 08:10:25,426 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 08:10:25,427 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 08:10:25,427 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 08:10:25,427 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 08:10:25,428 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:09:27" (3/4) ... [2022-07-21 08:10:25,430 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-21 08:10:25,434 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2022-07-21 08:10:25,434 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2022-07-21 08:10:25,434 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2022-07-21 08:10:25,434 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2022-07-21 08:10:25,434 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2022-07-21 08:10:25,434 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2022-07-21 08:10:25,434 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2022-07-21 08:10:25,435 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2022-07-21 08:10:25,435 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2022-07-21 08:10:25,435 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2022-07-21 08:10:25,435 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2022-07-21 08:10:25,435 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2022-07-21 08:10:25,435 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2022-07-21 08:10:25,435 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2022-07-21 08:10:25,442 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2022-07-21 08:10:25,442 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-21 08:10:25,443 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-21 08:10:25,444 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-21 08:10:25,466 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1)) && (((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(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_dw_pc == 0)) || !(c_dr_pc == p_dw_pc))) && ((((((((((!(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)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1))) && ((((((((((((!(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)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(token < 2 + local)) || !(2 <= E_M)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1))) && ((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(token <= local)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc))) && ((((((((((!(m_pc == t1_pc) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(token <= local)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc))) && (((((((((((!(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)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(token < 2 + local)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1)) [2022-07-21 08:10:25,466 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1)) && (((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(token <= local)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc))) && (((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1))) && ((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1))) && (((((((((((\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_dw_pc == 0)) || !(c_dr_pc == p_dw_pc))) && (((((((((((!(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)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(token < 2 + local)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1))) && (((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(token < 2 + local)) || !(2 <= E_M)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1))) && (((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(token <= local)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) [2022-07-21 08:10:25,480 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(m_pc == t1_pc) || !(p_dw_st == 0)) || !(token <= local)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 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)) && ((((((((((((!(p_dw_st == 0) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 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)) || !(2 <= E_1)) || (((((((\old(t1_st) == t1_st && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0))) && ((((((((((!(p_dw_st == 0) || !(token <= local)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc))) && ((((((!(p_dw_st == 0) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || (((((((\old(t1_st) == t1_st && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0))) && (((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(token < 2 + local)) || (__retres1 <= 0 && 0 <= __retres1)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || (T1_E == M_E && M_E == 2)) || !(2 <= E_1))) && ((((((((((((!(p_dw_st == 0) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 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)) || !(2 <= E_1)) || (((((((\old(t1_st) == t1_st && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0))) && (((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || ((T1_E == M_E && E_M == M_E) && M_E == 2)) || !(2 <= E_1))) && ((((((((((((!(p_dw_st == 0) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(token < 2 + local)) || !(2 <= E_M)) || !(local + 1 <= 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)) || !(2 <= E_1))) && (((((((((((!(p_dw_st == 0) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= E_1)) || (((((((\old(t1_st) == t1_st && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0))) && (((((((((((((!(p_dw_st == 0) || (!(m_pc <= 0) && m_pc <= 1)) || !(token <= local)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1))) && (((((((((((((!(p_dw_st == 0) || (((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)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(token < 2 + local)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= E_1)) || (((((((\old(t1_st) == t1_st && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0)) [2022-07-21 08:10:25,480 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((!(p_dw_st == 0) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(token < 2 + local)) || !(local + 1 <= 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)) || !(2 <= E_1)) || (((((((\old(t1_st) == t1_st && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0)) && (((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(token < 2 + local)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || (T1_E == M_E && M_E == 2)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && ((((((((((((!(p_dw_st == 0) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 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) && \result <= 0) && 0 <= \result)) || !(2 <= E_1)) || (((((((\old(t1_st) == t1_st && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0))) && ((((((((((!(p_dw_st == 0) || !(token <= local)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc))) && ((((((!(p_dw_st == 0) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || (((((((\old(t1_st) == t1_st && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0))) && ((((((((((((!(p_dw_st == 0) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 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) && \result <= 0) && 0 <= \result)) || !(2 <= E_1)) || (((((((\old(t1_st) == t1_st && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0))) && (((((((((((!(p_dw_st == 0) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 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)) || !(2 <= E_1)) || (((((((\old(t1_st) == t1_st && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0))) && (((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || ((T1_E == M_E && E_M == M_E) && M_E == 2)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && ((((((((((!(m_pc == t1_pc) || !(p_dw_st == 0)) || !(token <= local)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 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) && \result <= 0) && 0 <= \result))) && (((((((((((((!(p_dw_st == 0) || (!(m_pc <= 0) && m_pc <= 1)) || !(token <= local)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && ((((((((((((!(p_dw_st == 0) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(token < 2 + local)) || !(2 <= E_M)) || !(local + 1 <= 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)) || !(2 <= E_1)) [2022-07-21 08:10:25,534 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 08:10:25,536 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 08:10:25,537 INFO L158 Benchmark]: Toolchain (without parser) took 58827.74ms. Allocated memory was 48.2MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 25.1MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 114.6MB. Max. memory is 16.1GB. [2022-07-21 08:10:25,537 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 48.2MB. Free memory was 30.8MB in the beginning and 30.7MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 08:10:25,537 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.79ms. Allocated memory was 48.2MB in the beginning and 60.8MB in the end (delta: 12.6MB). Free memory was 24.9MB in the beginning and 39.8MB in the end (delta: -14.9MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2022-07-21 08:10:25,537 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.66ms. Allocated memory is still 60.8MB. Free memory was 39.8MB in the beginning and 37.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 08:10:25,537 INFO L158 Benchmark]: Boogie Preprocessor took 52.18ms. Allocated memory is still 60.8MB. Free memory was 37.0MB in the beginning and 34.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 08:10:25,538 INFO L158 Benchmark]: RCFGBuilder took 527.02ms. Allocated memory is still 60.8MB. Free memory was 34.8MB in the beginning and 38.8MB in the end (delta: -4.0MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2022-07-21 08:10:25,538 INFO L158 Benchmark]: TraceAbstraction took 57733.91ms. Allocated memory was 60.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 38.3MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 917.6MB. Max. memory is 16.1GB. [2022-07-21 08:10:25,538 INFO L158 Benchmark]: Witness Printer took 109.45ms. Allocated memory is still 1.5GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 08:10:25,539 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.15ms. Allocated memory is still 48.2MB. Free memory was 30.8MB in the beginning and 30.7MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.79ms. Allocated memory was 48.2MB in the beginning and 60.8MB in the end (delta: 12.6MB). Free memory was 24.9MB in the beginning and 39.8MB in the end (delta: -14.9MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.66ms. Allocated memory is still 60.8MB. Free memory was 39.8MB in the beginning and 37.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.18ms. Allocated memory is still 60.8MB. Free memory was 37.0MB in the beginning and 34.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 527.02ms. Allocated memory is still 60.8MB. Free memory was 34.8MB in the beginning and 38.8MB in the end (delta: -4.0MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * TraceAbstraction took 57733.91ms. Allocated memory was 60.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 38.3MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 917.6MB. Max. memory is 16.1GB. * Witness Printer took 109.45ms. Allocated memory is still 1.5GB. Free memory was 1.4GB in the beginning and 1.4GB 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: 599]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 27]: 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, 224 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 57.6s, OverallIterations: 24, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 38.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10506 SdHoareTripleChecker+Valid, 7.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10213 mSDsluCounter, 18498 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11923 mSDsCounter, 2427 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11543 IncrementalHoareTripleChecker+Invalid, 13970 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2427 mSolverCounterUnsat, 6575 mSDtfsCounter, 11543 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1782 GetRequests, 1486 SyntacticMatches, 3 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3534occurred in iteration=17, InterpolantAutomatonStates: 260, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 2679 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 89 LocationsWithAnnotation, 7721 PreInvPairs, 10347 NumberOfFragments, 13128 HoareAnnotationTreeSize, 7721 FomulaSimplifications, 33622 FormulaSimplificationTreeSizeReduction, 20.0s HoareSimplificationTime, 89 FomulaSimplificationsInter, 509881 FormulaSimplificationTreeSizeReductionInter, 17.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 3234 NumberOfCodeBlocks, 3234 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 3202 ConstructedInterpolants, 0 QuantifiedInterpolants, 5840 SizeOfPredicates, 3 NumberOfNonLiveVariables, 3454 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 32 InterpolantComputations, 24 PerfectInterpolantSequences, 1313/1388 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: 206]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 595]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 663]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0)) || (((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && !(t1_st == 0))) || (((((((1 <= t1_pc || !(m_pc <= 0)) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && ((t1_pc <= 1 && !(m_pc <= 1)) || m_pc <= 0))) || ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && ((t1_pc <= 1 && !(m_pc <= 1)) || m_pc <= 0)) && !(t1_st == 0)) && token <= local) && local <= token) - InvariantResult [Line: 766]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 977]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= E_1 && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token) || (((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0))) || ((((((((((2 <= E_1 && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token)) || ((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token)) || ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0)) && token <= local) && local <= token)) || (((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && !(t1_st == 0))) || (((((q_write_ev == q_read_ev && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (((((((((T1_E == M_E && m_pc == t1_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2) || (((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc <= 1) && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || ((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2)) || (((((((p_dw_pc == 0 && T1_E == M_E) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || (((((((T1_E == M_E && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && 1 < p_dw_pc) && E_M == M_E) && M_E == 2) - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: (((((((((T1_E == M_E && m_pc == t1_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2) || (((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc <= 1) && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || ((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2)) || (((((((p_dw_pc == 0 && T1_E == M_E) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || (((((((T1_E == M_E && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && 1 < p_dw_pc) && E_M == M_E) && M_E == 2) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: ((((((((((((!(m_pc == t1_pc) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(E_M == M_E)) || c_dr_pc == p_dw_pc) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc <= 1)) || !(T1_E == M_E)) || !(1 <= c_dr_pc)) || !(1 <= p_dw_pc)) || !(q_read_ev == 2)) && (((((((!(m_pc == t1_pc) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(E_M == M_E)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E))) && ((((((((!(m_pc == t1_pc) || !(M_E == 2)) || p_dw_pc <= 1) || (!(m_pc <= 0) && m_pc <= 1)) || !(c_dr_pc == 0)) || !(E_M == M_E)) || (__retres1 <= 0 && 0 <= __retres1)) || !(T1_E == M_E)) || !(q_read_ev == 2))) && ((((((((!(m_pc == t1_pc) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(E_M == M_E)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_pc == 0)) || !(c_dr_pc <= 1)) || !(T1_E == M_E)) || !(1 <= c_dr_pc)) - InvariantResult [Line: 496]: Loop Invariant Derived loop invariant: (((((((((T1_E == M_E && m_pc == t1_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2) || (((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc <= 1) && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || ((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2)) || (((((((p_dw_pc == 0 && T1_E == M_E) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || (((((((T1_E == M_E && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && 1 < p_dw_pc) && E_M == M_E) && M_E == 2) - InvariantResult [Line: 789]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= E_1 && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token) || (((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0))) || ((((((((((2 <= E_1 && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token)) || ((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token)) || ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0)) && token <= local) && local <= token)) || (((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && !(t1_st == 0))) || (((((q_write_ev == q_read_ev && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0) - InvariantResult [Line: 543]: Loop Invariant Derived loop invariant: ((((((((T1_E == M_E && m_pc == t1_pc) && q_write_ev == q_read_ev) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && E_M == M_E) && M_E == 2 - InvariantResult [Line: 702]: Loop Invariant Derived loop invariant: (((((((((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1)) && (((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(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_dw_pc == 0)) || !(c_dr_pc == p_dw_pc))) && ((((((((((!(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)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1))) && ((((((((((((!(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)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(token < 2 + local)) || !(2 <= E_M)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1))) && ((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(token <= local)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc))) && ((((((((((!(m_pc == t1_pc) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(token <= local)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc))) && (((((((((((!(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)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(token < 2 + local)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1)) - InvariantResult [Line: 699]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1)) && (((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(token <= local)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc))) && (((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1))) && ((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1))) && (((((((((((\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_dw_pc == 0)) || !(c_dr_pc == p_dw_pc))) && (((((((((((!(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)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(token < 2 + local)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1))) && (((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(token < 2 + local)) || !(2 <= E_M)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1))) && (((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(token <= local)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: ((((((T1_E == M_E && m_pc == t1_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2) || (((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc <= 1) && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2) - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: (((((((((T1_E == M_E && m_pc == t1_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2) || (((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc <= 1) && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || ((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2)) || (((((((p_dw_pc == 0 && T1_E == M_E) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || (((((((T1_E == M_E && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && 1 < p_dw_pc) && E_M == M_E) && M_E == 2) - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 745]: Loop Invariant Derived loop invariant: ((((((((((((T1_E == M_E && 2 <= E_1) && m_pc == t1_pc) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_st == 0) && c_dr_pc == 0) && E_M == M_E) && token <= local) && local <= token) && M_E == 2) || (((((((((T1_E == M_E && m_pc == t1_pc) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0) && E_M == M_E) && M_E == 2) - InvariantResult [Line: 926]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= E_1 && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token) || (((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0))) || ((((((((((2 <= E_1 && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token)) || ((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token)) || ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0)) && token <= local) && local <= token)) || (((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && !(t1_st == 0))) || (((((q_write_ev == q_read_ev && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0) - InvariantResult [Line: 469]: Loop Invariant Derived loop invariant: (((((((((T1_E == M_E && m_pc == t1_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2) || (((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc <= 1) && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || ((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2)) || (((((((p_dw_pc == 0 && T1_E == M_E) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || (((((((T1_E == M_E && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && 1 < p_dw_pc) && E_M == M_E) && M_E == 2) - InvariantResult [Line: 721]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(m_pc == t1_pc) || !(p_dw_st == 0)) || !(token <= local)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 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)) && ((((((((((((!(p_dw_st == 0) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 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)) || !(2 <= E_1)) || (((((((\old(t1_st) == t1_st && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0))) && ((((((((((!(p_dw_st == 0) || !(token <= local)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc))) && ((((((!(p_dw_st == 0) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || (((((((\old(t1_st) == t1_st && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0))) && (((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(token < 2 + local)) || (__retres1 <= 0 && 0 <= __retres1)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || (T1_E == M_E && M_E == 2)) || !(2 <= E_1))) && ((((((((((((!(p_dw_st == 0) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 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)) || !(2 <= E_1)) || (((((((\old(t1_st) == t1_st && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0))) && (((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || ((T1_E == M_E && E_M == M_E) && M_E == 2)) || !(2 <= E_1))) && ((((((((((((!(p_dw_st == 0) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(token < 2 + local)) || !(2 <= E_M)) || !(local + 1 <= 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)) || !(2 <= E_1))) && (((((((((((!(p_dw_st == 0) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= E_1)) || (((((((\old(t1_st) == t1_st && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0))) && (((((((((((((!(p_dw_st == 0) || (!(m_pc <= 0) && m_pc <= 1)) || !(token <= local)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1))) && (((((((((((((!(p_dw_st == 0) || (((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)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(token < 2 + local)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= E_1)) || (((((((\old(t1_st) == t1_st && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0)) - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 666]: Loop Invariant Derived loop invariant: (((((((1 <= t1_pc || !(m_pc <= 0)) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && ((t1_pc <= 1 && !(m_pc <= 1)) || m_pc <= 0)) || (((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0)) && token <= local) && local <= token) - InvariantResult [Line: 484]: Loop Invariant Derived loop invariant: M_E == 2 - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc <= 1) && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2) || (((((((p_dw_pc == 0 && T1_E == M_E) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || (((((((T1_E == M_E && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && 1 < p_dw_pc) && E_M == M_E) && M_E == 2) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (((((((p_dw_pc == 0 && T1_E == M_E) && m_pc == t1_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2) || (((((T1_E == M_E && m_pc == t1_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) && c_dr_pc == 0) || ((1 <= c_dr_pc && c_dr_pc <= 1) && ((((((p_dw_pc == 0 && T1_E == M_E) && m_pc == t1_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2) || (((((T1_E == M_E && m_pc == t1_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2))) - InvariantResult [Line: 562]: Loop Invariant Derived loop invariant: M_E == 2 - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && !(t1_st == 0) - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && !(t1_st == 0)) || ((((((((((2 <= E_1 && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token)) || (((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0)) - InvariantResult [Line: 963]: Loop Invariant Derived loop invariant: (((((((((((T1_E == M_E && 2 <= E_1) && m_pc == t1_pc) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_st == 0) && c_dr_pc == 0) && E_M == M_E) && token <= local) && local <= token) && M_E == 2 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1004]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= E_1 && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token) || (((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0))) || ((((((((((2 <= E_1 && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token)) || ((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token)) || ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0)) && token <= local) && local <= token)) || (((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && !(t1_st == 0))) || (((((q_write_ev == q_read_ev && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0) - InvariantResult [Line: 783]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= E_1 && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token) || (((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0))) || ((((((((((2 <= E_1 && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token)) || ((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token)) || ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0)) && token <= local) && local <= token)) || (((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && !(t1_st == 0))) || (((((q_write_ev == q_read_ev && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (((((((T1_E == M_E && m_pc == t1_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2) || (((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc <= 1) && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || (((((((T1_E == M_E && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && 1 < p_dw_pc) && E_M == M_E) && M_E == 2) - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: (((((((((T1_E == M_E && m_pc == t1_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2) || (((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc <= 1) && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || ((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2)) || (((((((p_dw_pc == 0 && T1_E == M_E) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || (((((((T1_E == M_E && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && 1 < p_dw_pc) && E_M == M_E) && M_E == 2) - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: (((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2 - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: (((((((((T1_E == M_E && m_pc == t1_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2) || (((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc <= 1) && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || ((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2)) || (((((((p_dw_pc == 0 && T1_E == M_E) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || (((((((T1_E == M_E && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && 1 < p_dw_pc) && E_M == M_E) && M_E == 2) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((((((!(m_pc == t1_pc) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(c_dr_pc == 0)) || !(E_M == M_E)) || !(T1_E == M_E)) || (__retres1 <= 0 && 0 <= __retres1)) || !(1 <= p_dw_pc)) && (((((((!(m_pc == t1_pc) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(E_M == M_E)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || (__retres1 <= 0 && 0 <= __retres1)) - InvariantResult [Line: 718]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(p_dw_st == 0) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(token < 2 + local)) || !(local + 1 <= 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)) || !(2 <= E_1)) || (((((((\old(t1_st) == t1_st && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0)) && (((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(token < 2 + local)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || (T1_E == M_E && M_E == 2)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && ((((((((((((!(p_dw_st == 0) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 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) && \result <= 0) && 0 <= \result)) || !(2 <= E_1)) || (((((((\old(t1_st) == t1_st && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0))) && ((((((((((!(p_dw_st == 0) || !(token <= local)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc))) && ((((((!(p_dw_st == 0) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || (((((((\old(t1_st) == t1_st && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0))) && ((((((((((((!(p_dw_st == 0) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 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) && \result <= 0) && 0 <= \result)) || !(2 <= E_1)) || (((((((\old(t1_st) == t1_st && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0))) && (((((((((((!(p_dw_st == 0) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 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)) || !(2 <= E_1)) || (((((((\old(t1_st) == t1_st && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0))) && (((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || ((T1_E == M_E && E_M == M_E) && M_E == 2)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && ((((((((((!(m_pc == t1_pc) || !(p_dw_st == 0)) || !(token <= local)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 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) && \result <= 0) && 0 <= \result))) && (((((((((((((!(p_dw_st == 0) || (!(m_pc <= 0) && m_pc <= 1)) || !(token <= local)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && ((((((((((((!(p_dw_st == 0) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(token < 2 + local)) || !(2 <= E_M)) || !(local + 1 <= 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)) || !(2 <= E_1)) - InvariantResult [Line: 619]: Loop Invariant Derived loop invariant: ((((((((((2 <= E_1 && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token) || ((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token) - InvariantResult [Line: 935]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= E_1 && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token) || (((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0))) || ((((((((((2 <= E_1 && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token)) || ((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token)) || ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0)) && token <= local) && local <= token)) || (((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && !(t1_st == 0))) || (((((q_write_ev == q_read_ev && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (((((((T1_E == M_E && m_pc == t1_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2) || (((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc <= 1) && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || (((((((T1_E == M_E && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && 1 < p_dw_pc) && E_M == M_E) && M_E == 2) - InvariantResult [Line: 666]: Loop Invariant Derived loop invariant: ((((((((((2 <= E_1 && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0)) || ((((((((((2 <= E_1 && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && !(t1_st == 0))) || (((((((((((2 <= E_1 && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0)) && token <= local) && local <= token)) || (((((q_write_ev == q_read_ev && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0) - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= E_1 && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token) || (((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0))) || ((((((((((2 <= E_1 && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token)) || ((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token)) || ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0)) && token <= local) && local <= token)) || (((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && !(t1_st == 0))) || (((((q_write_ev == q_read_ev && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: ((((((((p_dw_pc == 0 && T1_E == M_E) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2) || (((((T1_E == M_E && m_pc == t1_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || ((((((p_dw_pc == 0 && T1_E == M_E) && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2) RESULT: Ultimate proved your program to be correct! [2022-07-21 08:10:25,620 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