./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 839c364b 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-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 16:19:59,616 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 16:19:59,621 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 16:19:59,655 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 16:19:59,655 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 16:19:59,656 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 16:19:59,657 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 16:19:59,658 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 16:19:59,659 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 16:19:59,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 16:19:59,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 16:19:59,661 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 16:19:59,662 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 16:19:59,662 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 16:19:59,663 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 16:19:59,664 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 16:19:59,665 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 16:19:59,666 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 16:19:59,667 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 16:19:59,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 16:19:59,669 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 16:19:59,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 16:19:59,670 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 16:19:59,671 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 16:19:59,673 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 16:19:59,673 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 16:19:59,673 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 16:19:59,674 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 16:19:59,674 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 16:19:59,675 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 16:19:59,675 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 16:19:59,676 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 16:19:59,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 16:19:59,677 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 16:19:59,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 16:19:59,678 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 16:19:59,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 16:19:59,678 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 16:19:59,678 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 16:19:59,679 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 16:19:59,679 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 16:19:59,680 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 16:19:59,693 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 16:19:59,694 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 16:19:59,694 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 16:19:59,694 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 16:19:59,695 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 16:19:59,695 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 16:19:59,695 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 16:19:59,695 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 16:19:59,696 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 16:19:59,696 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 16:19:59,696 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 16:19:59,696 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 16:19:59,696 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 16:19:59,697 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 16:19:59,697 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 16:19:59,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 16:19:59,697 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 16:19:59,698 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 16:19:59,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 16:19:59,698 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 16:19:59,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 16:19:59,699 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 16:19:59,699 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 16:19:59,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 16:19:59,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 16:19:59,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 16:19:59,699 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 16:19:59,700 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 16:19:59,700 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 16:19:59,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 16:19:59,700 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 16:19:59,700 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 16:19:59,700 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 16:19:59,700 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 16:19:59,701 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 [2021-12-14 16:19:59,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 16:19:59,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 16:19:59,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 16:19:59,910 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 16:19:59,910 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 16:19:59,911 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 [2021-12-14 16:19:59,951 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d33e6ba5a/1a93e2a686604c63a940e85f597a9f54/FLAG83d45f482 [2021-12-14 16:20:00,280 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 16:20:00,281 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c [2021-12-14 16:20:00,290 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d33e6ba5a/1a93e2a686604c63a940e85f597a9f54/FLAG83d45f482 [2021-12-14 16:20:00,715 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d33e6ba5a/1a93e2a686604c63a940e85f597a9f54 [2021-12-14 16:20:00,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 16:20:00,718 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 16:20:00,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 16:20:00,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 16:20:00,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 16:20:00,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:20:00" (1/1) ... [2021-12-14 16:20:00,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44e568ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:20:00, skipping insertion in model container [2021-12-14 16:20:00,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:20:00" (1/1) ... [2021-12-14 16:20:00,739 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 16:20:00,763 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 16:20:00,876 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] [2021-12-14 16:20:00,939 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] [2021-12-14 16:20:00,959 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 16:20:00,965 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 16:20:00,973 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] [2021-12-14 16:20:00,987 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] [2021-12-14 16:20:00,997 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 16:20:01,013 INFO L208 MainTranslator]: Completed translation [2021-12-14 16:20:01,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:20:01 WrapperNode [2021-12-14 16:20:01,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 16:20:01,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 16:20:01,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 16:20:01,015 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 16:20:01,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:20:01" (1/1) ... [2021-12-14 16:20:01,037 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:20:01" (1/1) ... [2021-12-14 16:20:01,060 INFO L137 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 440 [2021-12-14 16:20:01,060 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 16:20:01,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 16:20:01,061 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 16:20:01,061 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 16:20:01,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:20:01" (1/1) ... [2021-12-14 16:20:01,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:20:01" (1/1) ... [2021-12-14 16:20:01,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:20:01" (1/1) ... [2021-12-14 16:20:01,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:20:01" (1/1) ... [2021-12-14 16:20:01,081 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:20:01" (1/1) ... [2021-12-14 16:20:01,101 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:20:01" (1/1) ... [2021-12-14 16:20:01,104 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:20:01" (1/1) ... [2021-12-14 16:20:01,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 16:20:01,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 16:20:01,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 16:20:01,109 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 16:20:01,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:20:01" (1/1) ... [2021-12-14 16:20:01,119 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 16:20:01,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:20:01,193 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) [2021-12-14 16:20:01,202 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 [2021-12-14 16:20:01,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 16:20:01,238 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-14 16:20:01,238 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-14 16:20:01,238 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-14 16:20:01,238 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-14 16:20:01,238 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-12-14 16:20:01,239 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-12-14 16:20:01,239 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-12-14 16:20:01,239 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-12-14 16:20:01,239 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2021-12-14 16:20:01,239 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2021-12-14 16:20:01,239 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-12-14 16:20:01,239 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-12-14 16:20:01,239 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-12-14 16:20:01,240 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-12-14 16:20:01,240 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2021-12-14 16:20:01,240 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2021-12-14 16:20:01,240 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-14 16:20:01,240 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-14 16:20:01,240 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2021-12-14 16:20:01,240 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2021-12-14 16:20:01,240 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-12-14 16:20:01,241 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-12-14 16:20:01,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 16:20:01,241 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-12-14 16:20:01,241 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-12-14 16:20:01,241 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2021-12-14 16:20:01,241 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2021-12-14 16:20:01,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 16:20:01,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 16:20:01,241 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-12-14 16:20:01,242 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-12-14 16:20:01,317 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 16:20:01,318 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 16:20:01,677 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2021-12-14 16:20:01,677 INFO L768 $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; [2021-12-14 16:20:01,740 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 16:20:01,746 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 16:20:01,746 INFO L301 CfgBuilder]: Removed 8 assume(true) statements. [2021-12-14 16:20:01,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:20:01 BoogieIcfgContainer [2021-12-14 16:20:01,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 16:20:01,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 16:20:01,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 16:20:01,752 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 16:20:01,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 04:20:00" (1/3) ... [2021-12-14 16:20:01,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@868ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:20:01, skipping insertion in model container [2021-12-14 16:20:01,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:20:01" (2/3) ... [2021-12-14 16:20:01,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@868ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:20:01, skipping insertion in model container [2021-12-14 16:20:01,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:20:01" (3/3) ... [2021-12-14 16:20:01,755 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.01.cil-1.c [2021-12-14 16:20:01,758 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 16:20:01,758 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-14 16:20:01,792 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 16:20:01,796 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 16:20:01,797 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-14 16:20:01,812 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) [2021-12-14 16:20:01,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-14 16:20:01,819 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:01,819 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:20:01,820 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:01,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:01,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1818445817, now seen corresponding path program 1 times [2021-12-14 16:20:01,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:01,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410732954] [2021-12-14 16:20:01,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:01,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:01,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:01,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:20:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:01,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 16:20:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:02,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 16:20:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:02,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 16:20:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:02,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:20:02,027 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:02,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410732954] [2021-12-14 16:20:02,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410732954] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:02,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:02,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 16:20:02,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131025512] [2021-12-14 16:20:02,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:02,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 16:20:02,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:02,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 16:20:02,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:20:02,058 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) [2021-12-14 16:20:02,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:02,674 INFO L93 Difference]: Finished difference Result 562 states and 842 transitions. [2021-12-14 16:20:02,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 16:20:02,676 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 [2021-12-14 16:20:02,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:02,695 INFO L225 Difference]: With dead ends: 562 [2021-12-14 16:20:02,695 INFO L226 Difference]: Without dead ends: 345 [2021-12-14 16:20:02,699 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:02,701 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 556 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:02,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [576 Valid, 841 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 16:20:02,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-12-14 16:20:02,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 304. [2021-12-14 16:20:02,763 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) [2021-12-14 16:20:02,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 430 transitions. [2021-12-14 16:20:02,765 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 430 transitions. Word has length 57 [2021-12-14 16:20:02,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:02,766 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 430 transitions. [2021-12-14 16:20:02,766 INFO L471 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) [2021-12-14 16:20:02,766 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 430 transitions. [2021-12-14 16:20:02,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-14 16:20:02,768 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:02,768 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:20:02,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 16:20:02,768 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:02,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:02,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1564569483, now seen corresponding path program 1 times [2021-12-14 16:20:02,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:02,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872956947] [2021-12-14 16:20:02,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:02,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:02,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:02,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:20:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:02,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 16:20:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:02,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 16:20:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:02,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 16:20:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:02,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:20:02,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:02,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872956947] [2021-12-14 16:20:02,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872956947] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:02,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:02,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:20:02,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575601833] [2021-12-14 16:20:02,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:02,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:20:02,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:02,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:20:02,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:20:02,911 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) [2021-12-14 16:20:03,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:03,464 INFO L93 Difference]: Finished difference Result 636 states and 904 transitions. [2021-12-14 16:20:03,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 16:20:03,465 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 [2021-12-14 16:20:03,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:03,468 INFO L225 Difference]: With dead ends: 636 [2021-12-14 16:20:03,468 INFO L226 Difference]: Without dead ends: 453 [2021-12-14 16:20:03,469 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:03,470 INFO L933 BasicCegarLoop]: 362 mSDtfsCounter, 533 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:03,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [553 Valid, 1139 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 16:20:03,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2021-12-14 16:20:03,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 389. [2021-12-14 16:20:03,495 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) [2021-12-14 16:20:03,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 547 transitions. [2021-12-14 16:20:03,497 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 547 transitions. Word has length 57 [2021-12-14 16:20:03,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:03,497 INFO L470 AbstractCegarLoop]: Abstraction has 389 states and 547 transitions. [2021-12-14 16:20:03,497 INFO L471 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) [2021-12-14 16:20:03,498 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 547 transitions. [2021-12-14 16:20:03,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-14 16:20:03,499 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:03,499 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:20:03,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 16:20:03,500 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:03,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:03,500 INFO L85 PathProgramCache]: Analyzing trace with hash -484818359, now seen corresponding path program 1 times [2021-12-14 16:20:03,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:03,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072644822] [2021-12-14 16:20:03,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:03,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:03,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:03,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:20:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:03,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 16:20:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:03,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 16:20:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:03,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 16:20:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:03,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:20:03,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:03,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072644822] [2021-12-14 16:20:03,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072644822] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:03,588 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:03,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:20:03,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440237675] [2021-12-14 16:20:03,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:03,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:20:03,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:03,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:20:03,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:20:03,590 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) [2021-12-14 16:20:03,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:03,934 INFO L93 Difference]: Finished difference Result 719 states and 1023 transitions. [2021-12-14 16:20:03,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 16:20:03,935 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 [2021-12-14 16:20:03,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:03,937 INFO L225 Difference]: With dead ends: 719 [2021-12-14 16:20:03,937 INFO L226 Difference]: Without dead ends: 451 [2021-12-14 16:20:03,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-14 16:20:03,939 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 476 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:03,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [497 Valid, 769 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 16:20:03,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2021-12-14 16:20:03,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 389. [2021-12-14 16:20:03,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 309 states have (on average 1.4207119741100325) internal successors, (439), 315 states have internal predecessors, (439), 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) [2021-12-14 16:20:03,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 544 transitions. [2021-12-14 16:20:03,961 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 544 transitions. Word has length 57 [2021-12-14 16:20:03,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:03,961 INFO L470 AbstractCegarLoop]: Abstraction has 389 states and 544 transitions. [2021-12-14 16:20:03,962 INFO L471 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) [2021-12-14 16:20:03,962 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 544 transitions. [2021-12-14 16:20:03,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-14 16:20:03,963 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:03,964 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:20:03,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 16:20:03,964 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:03,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:03,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1382211637, now seen corresponding path program 1 times [2021-12-14 16:20:03,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:03,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594924476] [2021-12-14 16:20:03,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:03,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:03,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:04,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:20:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:04,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 16:20:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:04,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 16:20:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:04,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 16:20:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:04,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:20:04,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:04,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594924476] [2021-12-14 16:20:04,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594924476] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:04,046 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:04,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:20:04,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559808364] [2021-12-14 16:20:04,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:04,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:20:04,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:04,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:20:04,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:20:04,048 INFO L87 Difference]: Start difference. First operand 389 states and 544 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) [2021-12-14 16:20:04,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:04,460 INFO L93 Difference]: Finished difference Result 755 states and 1080 transitions. [2021-12-14 16:20:04,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 16:20:04,460 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 [2021-12-14 16:20:04,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:04,463 INFO L225 Difference]: With dead ends: 755 [2021-12-14 16:20:04,463 INFO L226 Difference]: Without dead ends: 488 [2021-12-14 16:20:04,464 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:04,464 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 283 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:04,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 1133 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 16:20:04,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2021-12-14 16:20:04,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 398. [2021-12-14 16:20:04,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 318 states have (on average 1.4088050314465408) internal successors, (448), 324 states have internal predecessors, (448), 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) [2021-12-14 16:20:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 553 transitions. [2021-12-14 16:20:04,486 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 553 transitions. Word has length 57 [2021-12-14 16:20:04,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:04,487 INFO L470 AbstractCegarLoop]: Abstraction has 398 states and 553 transitions. [2021-12-14 16:20:04,487 INFO L471 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) [2021-12-14 16:20:04,487 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 553 transitions. [2021-12-14 16:20:04,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-14 16:20:04,489 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:04,489 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:20:04,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 16:20:04,489 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:04,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:04,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1454598195, now seen corresponding path program 1 times [2021-12-14 16:20:04,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:04,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473616428] [2021-12-14 16:20:04,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:04,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:04,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:04,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:20:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:04,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 16:20:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:04,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 16:20:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:04,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 16:20:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:20:04,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:04,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473616428] [2021-12-14 16:20:04,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473616428] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:04,563 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:04,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:20:04,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598453104] [2021-12-14 16:20:04,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:04,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:20:04,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:04,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:20:04,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:20:04,579 INFO L87 Difference]: Start difference. First operand 398 states and 553 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) [2021-12-14 16:20:05,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:05,361 INFO L93 Difference]: Finished difference Result 1553 states and 2246 transitions. [2021-12-14 16:20:05,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 16:20:05,362 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 [2021-12-14 16:20:05,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:05,367 INFO L225 Difference]: With dead ends: 1553 [2021-12-14 16:20:05,367 INFO L226 Difference]: Without dead ends: 1277 [2021-12-14 16:20:05,369 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:05,369 INFO L933 BasicCegarLoop]: 418 mSDtfsCounter, 998 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1017 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:05,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1017 Valid, 1044 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-14 16:20:05,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2021-12-14 16:20:05,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1106. [2021-12-14 16:20:05,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 879 states have (on average 1.3765642775881684) internal successors, (1210), 900 states have internal predecessors, (1210), 138 states have call successors, (138), 80 states have call predecessors, (138), 87 states have return successors, (189), 128 states have call predecessors, (189), 136 states have call successors, (189) [2021-12-14 16:20:05,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1537 transitions. [2021-12-14 16:20:05,421 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1537 transitions. Word has length 57 [2021-12-14 16:20:05,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:05,421 INFO L470 AbstractCegarLoop]: Abstraction has 1106 states and 1537 transitions. [2021-12-14 16:20:05,421 INFO L471 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) [2021-12-14 16:20:05,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1537 transitions. [2021-12-14 16:20:05,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-14 16:20:05,423 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:05,423 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:20:05,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 16:20:05,424 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:05,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:05,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1901012817, now seen corresponding path program 1 times [2021-12-14 16:20:05,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:05,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983971993] [2021-12-14 16:20:05,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:05,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:05,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:05,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:05,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:20:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:05,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:20:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:05,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 16:20:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:05,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-14 16:20:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:05,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 16:20:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:05,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:20:05,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:05,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983971993] [2021-12-14 16:20:05,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983971993] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:05,490 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:05,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 16:20:05,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409970754] [2021-12-14 16:20:05,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:05,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 16:20:05,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:05,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 16:20:05,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:20:05,492 INFO L87 Difference]: Start difference. First operand 1106 states and 1537 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) [2021-12-14 16:20:06,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:06,007 INFO L93 Difference]: Finished difference Result 1361 states and 1907 transitions. [2021-12-14 16:20:06,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 16:20:06,007 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 [2021-12-14 16:20:06,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:06,012 INFO L225 Difference]: With dead ends: 1361 [2021-12-14 16:20:06,014 INFO L226 Difference]: Without dead ends: 1257 [2021-12-14 16:20:06,015 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:06,016 INFO L933 BasicCegarLoop]: 329 mSDtfsCounter, 619 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:06,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [626 Valid, 1137 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 16:20:06,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2021-12-14 16:20:06,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1218. [2021-12-14 16:20:06,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 969 states have (on average 1.3797729618163055) internal successors, (1337), 992 states have internal predecessors, (1337), 151 states have call successors, (151), 87 states have call predecessors, (151), 96 states have return successors, (207), 142 states have call predecessors, (207), 149 states have call successors, (207) [2021-12-14 16:20:06,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1695 transitions. [2021-12-14 16:20:06,067 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1695 transitions. Word has length 65 [2021-12-14 16:20:06,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:06,068 INFO L470 AbstractCegarLoop]: Abstraction has 1218 states and 1695 transitions. [2021-12-14 16:20:06,068 INFO L471 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) [2021-12-14 16:20:06,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1695 transitions. [2021-12-14 16:20:06,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-14 16:20:06,070 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:06,070 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:20:06,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 16:20:06,071 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:06,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:06,071 INFO L85 PathProgramCache]: Analyzing trace with hash -855614449, now seen corresponding path program 1 times [2021-12-14 16:20:06,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:06,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970339284] [2021-12-14 16:20:06,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:06,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:06,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:06,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:06,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:20:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:06,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:20:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:06,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 16:20:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:06,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-14 16:20:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:06,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 16:20:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:06,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:20:06,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:06,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970339284] [2021-12-14 16:20:06,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970339284] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:06,149 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:06,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 16:20:06,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956854568] [2021-12-14 16:20:06,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:06,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 16:20:06,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:06,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 16:20:06,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:20:06,152 INFO L87 Difference]: Start difference. First operand 1218 states and 1695 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) [2021-12-14 16:20:06,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:06,833 INFO L93 Difference]: Finished difference Result 1615 states and 2261 transitions. [2021-12-14 16:20:06,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 16:20:06,834 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 [2021-12-14 16:20:06,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:06,839 INFO L225 Difference]: With dead ends: 1615 [2021-12-14 16:20:06,839 INFO L226 Difference]: Without dead ends: 1406 [2021-12-14 16:20:06,840 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:06,841 INFO L933 BasicCegarLoop]: 395 mSDtfsCounter, 574 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 1481 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:06,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [596 Valid, 1481 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 16:20:06,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2021-12-14 16:20:06,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1330. [2021-12-14 16:20:06,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1059 states have (on average 1.3814919735599622) internal successors, (1463), 1084 states have internal predecessors, (1463), 164 states have call successors, (164), 94 states have call predecessors, (164), 105 states have return successors, (228), 156 states have call predecessors, (228), 162 states have call successors, (228) [2021-12-14 16:20:06,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1855 transitions. [2021-12-14 16:20:06,909 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1855 transitions. Word has length 65 [2021-12-14 16:20:06,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:06,910 INFO L470 AbstractCegarLoop]: Abstraction has 1330 states and 1855 transitions. [2021-12-14 16:20:06,910 INFO L471 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) [2021-12-14 16:20:06,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1855 transitions. [2021-12-14 16:20:06,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-14 16:20:06,911 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:06,911 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:20:06,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 16:20:06,912 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:06,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:06,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1410766737, now seen corresponding path program 1 times [2021-12-14 16:20:06,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:06,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423895107] [2021-12-14 16:20:06,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:06,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:06,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:06,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:06,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:20:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:06,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:20:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:06,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 16:20:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:06,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-14 16:20:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:06,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-14 16:20:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:06,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:20:06,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:06,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423895107] [2021-12-14 16:20:06,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423895107] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:06,969 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:06,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:20:06,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569568326] [2021-12-14 16:20:06,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:06,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:20:06,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:06,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:20:06,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:20:06,971 INFO L87 Difference]: Start difference. First operand 1330 states and 1855 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) [2021-12-14 16:20:07,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:07,458 INFO L93 Difference]: Finished difference Result 2002 states and 2797 transitions. [2021-12-14 16:20:07,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 16:20:07,459 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 [2021-12-14 16:20:07,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:07,465 INFO L225 Difference]: With dead ends: 2002 [2021-12-14 16:20:07,465 INFO L226 Difference]: Without dead ends: 1687 [2021-12-14 16:20:07,466 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:07,467 INFO L933 BasicCegarLoop]: 404 mSDtfsCounter, 825 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:07,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [860 Valid, 922 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 16:20:07,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2021-12-14 16:20:07,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1611. [2021-12-14 16:20:07,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1611 states, 1285 states have (on average 1.377431906614786) internal successors, (1770), 1314 states have internal predecessors, (1770), 194 states have call successors, (194), 115 states have call predecessors, (194), 130 states have return successors, (266), 186 states have call predecessors, (266), 192 states have call successors, (266) [2021-12-14 16:20:07,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2230 transitions. [2021-12-14 16:20:07,535 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2230 transitions. Word has length 65 [2021-12-14 16:20:07,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:07,535 INFO L470 AbstractCegarLoop]: Abstraction has 1611 states and 2230 transitions. [2021-12-14 16:20:07,535 INFO L471 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) [2021-12-14 16:20:07,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2230 transitions. [2021-12-14 16:20:07,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-14 16:20:07,536 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:07,536 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:20:07,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 16:20:07,537 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:07,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:07,537 INFO L85 PathProgramCache]: Analyzing trace with hash 679032074, now seen corresponding path program 1 times [2021-12-14 16:20:07,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:07,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594052915] [2021-12-14 16:20:07,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:07,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:07,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:07,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:07,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:07,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:20:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:07,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:20:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:07,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:20:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:07,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-14 16:20:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:07,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 16:20:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:07,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:20:07,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:07,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594052915] [2021-12-14 16:20:07,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594052915] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:07,617 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:07,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 16:20:07,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006835913] [2021-12-14 16:20:07,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:07,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 16:20:07,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:07,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 16:20:07,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-14 16:20:07,619 INFO L87 Difference]: Start difference. First operand 1611 states and 2230 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) [2021-12-14 16:20:08,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:08,041 INFO L93 Difference]: Finished difference Result 2285 states and 3166 transitions. [2021-12-14 16:20:08,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 16:20:08,042 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 [2021-12-14 16:20:08,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:08,049 INFO L225 Difference]: With dead ends: 2285 [2021-12-14 16:20:08,049 INFO L226 Difference]: Without dead ends: 1689 [2021-12-14 16:20:08,051 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:08,053 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 329 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:08,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [330 Valid, 1342 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 16:20:08,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1689 states. [2021-12-14 16:20:08,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1689 to 1626. [2021-12-14 16:20:08,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1626 states, 1297 states have (on average 1.371626831148805) internal successors, (1779), 1326 states have internal predecessors, (1779), 194 states have call successors, (194), 115 states have call predecessors, (194), 133 states have return successors, (269), 189 states have call predecessors, (269), 192 states have call successors, (269) [2021-12-14 16:20:08,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 2242 transitions. [2021-12-14 16:20:08,119 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 2242 transitions. Word has length 66 [2021-12-14 16:20:08,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:08,119 INFO L470 AbstractCegarLoop]: Abstraction has 1626 states and 2242 transitions. [2021-12-14 16:20:08,119 INFO L471 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) [2021-12-14 16:20:08,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 2242 transitions. [2021-12-14 16:20:08,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-14 16:20:08,121 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:08,121 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:20:08,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 16:20:08,121 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:08,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:08,122 INFO L85 PathProgramCache]: Analyzing trace with hash -350327224, now seen corresponding path program 1 times [2021-12-14 16:20:08,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:08,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514610987] [2021-12-14 16:20:08,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:08,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:08,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:08,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:08,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:20:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:08,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:20:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:08,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:20:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:08,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-14 16:20:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:08,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 16:20:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:08,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:20:08,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:08,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514610987] [2021-12-14 16:20:08,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514610987] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:08,217 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:08,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 16:20:08,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095428460] [2021-12-14 16:20:08,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:08,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 16:20:08,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:08,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 16:20:08,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-14 16:20:08,218 INFO L87 Difference]: Start difference. First operand 1626 states and 2242 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) [2021-12-14 16:20:09,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:09,465 INFO L93 Difference]: Finished difference Result 3831 states and 5363 transitions. [2021-12-14 16:20:09,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-14 16:20:09,465 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 [2021-12-14 16:20:09,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:09,473 INFO L225 Difference]: With dead ends: 3831 [2021-12-14 16:20:09,473 INFO L226 Difference]: Without dead ends: 1989 [2021-12-14 16:20:09,477 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:09,478 INFO L933 BasicCegarLoop]: 566 mSDtfsCounter, 1464 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 496 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:09,479 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1488 Valid, 1607 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [496 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-14 16:20:09,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2021-12-14 16:20:09,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1834. [2021-12-14 16:20:09,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1834 states, 1449 states have (on average 1.3547273982056591) internal successors, (1963), 1482 states have internal predecessors, (1963), 224 states have call successors, (224), 136 states have call predecessors, (224), 159 states have return successors, (318), 220 states have call predecessors, (318), 222 states have call successors, (318) [2021-12-14 16:20:09,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 2505 transitions. [2021-12-14 16:20:09,568 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 2505 transitions. Word has length 66 [2021-12-14 16:20:09,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:09,568 INFO L470 AbstractCegarLoop]: Abstraction has 1834 states and 2505 transitions. [2021-12-14 16:20:09,569 INFO L471 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) [2021-12-14 16:20:09,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 2505 transitions. [2021-12-14 16:20:09,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-14 16:20:09,573 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:09,573 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:20:09,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 16:20:09,574 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:09,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:09,574 INFO L85 PathProgramCache]: Analyzing trace with hash -801093477, now seen corresponding path program 1 times [2021-12-14 16:20:09,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:09,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072075795] [2021-12-14 16:20:09,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:09,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:09,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:09,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:09,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:20:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:09,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:20:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:09,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:20:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:09,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 16:20:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:09,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-14 16:20:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:09,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:20:09,662 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:09,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072075795] [2021-12-14 16:20:09,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072075795] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:09,662 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:09,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 16:20:09,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558079936] [2021-12-14 16:20:09,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:09,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 16:20:09,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:09,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 16:20:09,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-14 16:20:09,664 INFO L87 Difference]: Start difference. First operand 1834 states and 2505 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) [2021-12-14 16:20:10,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:10,119 INFO L93 Difference]: Finished difference Result 2798 states and 3825 transitions. [2021-12-14 16:20:10,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 16:20:10,119 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 [2021-12-14 16:20:10,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:10,126 INFO L225 Difference]: With dead ends: 2798 [2021-12-14 16:20:10,126 INFO L226 Difference]: Without dead ends: 1979 [2021-12-14 16:20:10,128 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:10,129 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 218 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:10,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 1407 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 16:20:10,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2021-12-14 16:20:10,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1879. [2021-12-14 16:20:10,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1485 states have (on average 1.346127946127946) internal successors, (1999), 1518 states have internal predecessors, (1999), 224 states have call successors, (224), 136 states have call predecessors, (224), 168 states have return successors, (327), 229 states have call predecessors, (327), 222 states have call successors, (327) [2021-12-14 16:20:10,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 2550 transitions. [2021-12-14 16:20:10,196 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 2550 transitions. Word has length 67 [2021-12-14 16:20:10,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:10,197 INFO L470 AbstractCegarLoop]: Abstraction has 1879 states and 2550 transitions. [2021-12-14 16:20:10,197 INFO L471 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) [2021-12-14 16:20:10,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2550 transitions. [2021-12-14 16:20:10,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-14 16:20:10,199 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:10,199 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:20:10,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 16:20:10,199 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:10,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:10,200 INFO L85 PathProgramCache]: Analyzing trace with hash 585109917, now seen corresponding path program 1 times [2021-12-14 16:20:10,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:10,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706565213] [2021-12-14 16:20:10,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:10,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:10,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:10,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:10,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:10,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:20:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:10,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:20:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:10,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:20:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:10,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 16:20:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:10,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-14 16:20:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:10,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:20:10,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:10,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706565213] [2021-12-14 16:20:10,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706565213] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:10,279 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:10,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 16:20:10,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083281477] [2021-12-14 16:20:10,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:10,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 16:20:10,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:10,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 16:20:10,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:20:10,280 INFO L87 Difference]: Start difference. First operand 1879 states and 2550 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) [2021-12-14 16:20:10,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:10,881 INFO L93 Difference]: Finished difference Result 2859 states and 3853 transitions. [2021-12-14 16:20:10,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 16:20:10,882 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 [2021-12-14 16:20:10,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:10,889 INFO L225 Difference]: With dead ends: 2859 [2021-12-14 16:20:10,889 INFO L226 Difference]: Without dead ends: 2082 [2021-12-14 16:20:10,891 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:10,891 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 741 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:10,891 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [762 Valid, 915 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 16:20:10,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2021-12-14 16:20:10,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 1888. [2021-12-14 16:20:10,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1888 states, 1494 states have (on average 1.3427041499330656) internal successors, (2006), 1525 states have internal predecessors, (2006), 225 states have call successors, (225), 137 states have call predecessors, (225), 167 states have return successors, (323), 230 states have call predecessors, (323), 223 states have call successors, (323) [2021-12-14 16:20:10,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 2554 transitions. [2021-12-14 16:20:10,960 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 2554 transitions. Word has length 67 [2021-12-14 16:20:10,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:10,961 INFO L470 AbstractCegarLoop]: Abstraction has 1888 states and 2554 transitions. [2021-12-14 16:20:10,961 INFO L471 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) [2021-12-14 16:20:10,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2554 transitions. [2021-12-14 16:20:10,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-14 16:20:10,962 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:10,962 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:20:10,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 16:20:10,963 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:10,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:10,963 INFO L85 PathProgramCache]: Analyzing trace with hash 451096411, now seen corresponding path program 1 times [2021-12-14 16:20:10,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:10,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398962438] [2021-12-14 16:20:10,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:10,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:10,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:10,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:11,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:20:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:11,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:20:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:11,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:20:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:11,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 16:20:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:11,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-14 16:20:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:11,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:20:11,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:11,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398962438] [2021-12-14 16:20:11,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398962438] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:11,024 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:11,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:20:11,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661894411] [2021-12-14 16:20:11,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:11,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:20:11,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:11,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:20:11,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:20:11,026 INFO L87 Difference]: Start difference. First operand 1888 states and 2554 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) [2021-12-14 16:20:11,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:11,445 INFO L93 Difference]: Finished difference Result 3773 states and 5076 transitions. [2021-12-14 16:20:11,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 16:20:11,446 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 [2021-12-14 16:20:11,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:11,457 INFO L225 Difference]: With dead ends: 3773 [2021-12-14 16:20:11,458 INFO L226 Difference]: Without dead ends: 2903 [2021-12-14 16:20:11,461 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:11,462 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 549 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:11,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [573 Valid, 819 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 16:20:11,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2021-12-14 16:20:11,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 2737. [2021-12-14 16:20:11,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2737 states, 2148 states have (on average 1.3198324022346368) internal successors, (2835), 2192 states have internal predecessors, (2835), 329 states have call successors, (329), 201 states have call predecessors, (329), 258 states have return successors, (513), 351 states have call predecessors, (513), 327 states have call successors, (513) [2021-12-14 16:20:11,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2737 states to 2737 states and 3677 transitions. [2021-12-14 16:20:11,584 INFO L78 Accepts]: Start accepts. Automaton has 2737 states and 3677 transitions. Word has length 67 [2021-12-14 16:20:11,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:11,585 INFO L470 AbstractCegarLoop]: Abstraction has 2737 states and 3677 transitions. [2021-12-14 16:20:11,585 INFO L471 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) [2021-12-14 16:20:11,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2737 states and 3677 transitions. [2021-12-14 16:20:11,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-14 16:20:11,587 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:11,587 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:20:11,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 16:20:11,587 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:11,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:11,588 INFO L85 PathProgramCache]: Analyzing trace with hash 678625623, now seen corresponding path program 1 times [2021-12-14 16:20:11,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:11,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831767051] [2021-12-14 16:20:11,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:11,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:11,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:11,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 16:20:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:11,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 16:20:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:11,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 16:20:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:11,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:20:11,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:11,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 16:20:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:11,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-14 16:20:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:11,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:20:11,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:11,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831767051] [2021-12-14 16:20:11,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831767051] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:11,640 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:11,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 16:20:11,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369287752] [2021-12-14 16:20:11,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:11,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 16:20:11,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:11,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 16:20:11,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:20:11,642 INFO L87 Difference]: Start difference. First operand 2737 states and 3677 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) [2021-12-14 16:20:11,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:11,873 INFO L93 Difference]: Finished difference Result 4460 states and 6033 transitions. [2021-12-14 16:20:11,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 16:20:11,873 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 [2021-12-14 16:20:11,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:11,877 INFO L225 Difference]: With dead ends: 4460 [2021-12-14 16:20:11,878 INFO L226 Difference]: Without dead ends: 995 [2021-12-14 16:20:11,884 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:11,885 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 525 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:11,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [549 Valid, 495 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 16:20:11,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2021-12-14 16:20:11,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 995. [2021-12-14 16:20:11,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 792 states have (on average 1.3674242424242424) internal successors, (1083), 810 states have internal predecessors, (1083), 122 states have call successors, (122), 72 states have call predecessors, (122), 80 states have return successors, (175), 114 states have call predecessors, (175), 122 states have call successors, (175) [2021-12-14 16:20:11,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1380 transitions. [2021-12-14 16:20:11,919 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1380 transitions. Word has length 68 [2021-12-14 16:20:11,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:11,920 INFO L470 AbstractCegarLoop]: Abstraction has 995 states and 1380 transitions. [2021-12-14 16:20:11,920 INFO L471 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) [2021-12-14 16:20:11,920 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1380 transitions. [2021-12-14 16:20:11,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-14 16:20:11,921 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:11,921 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:11,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 16:20:11,921 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:11,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:11,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1894779564, now seen corresponding path program 1 times [2021-12-14 16:20:11,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:11,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414613875] [2021-12-14 16:20:11,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:11,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:11,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:11,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:20:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:11,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 16:20:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:11,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 16:20:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:11,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 16:20:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:11,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-14 16:20:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:12,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:12,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 16:20:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:12,005 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-14 16:20:12,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:12,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414613875] [2021-12-14 16:20:12,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414613875] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:20:12,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588769449] [2021-12-14 16:20:12,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:12,005 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:12,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:20:12,007 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) [2021-12-14 16:20:12,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 16:20:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:12,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 16:20:12,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:20:12,244 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-14 16:20:12,244 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:20:12,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588769449] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:12,244 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:20:12,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 16:20:12,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507980195] [2021-12-14 16:20:12,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:12,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:20:12,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:12,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:20:12,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:20:12,260 INFO L87 Difference]: Start difference. First operand 995 states and 1380 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) [2021-12-14 16:20:12,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:12,320 INFO L93 Difference]: Finished difference Result 2871 states and 4007 transitions. [2021-12-14 16:20:12,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:20:12,321 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 [2021-12-14 16:20:12,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:12,325 INFO L225 Difference]: With dead ends: 2871 [2021-12-14 16:20:12,325 INFO L226 Difference]: Without dead ends: 1241 [2021-12-14 16:20:12,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:20:12,329 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 113 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 366 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 [2021-12-14 16:20:12,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 366 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 16:20:12,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2021-12-14 16:20:12,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1241. [2021-12-14 16:20:12,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 990 states have (on average 1.3606060606060606) internal successors, (1347), 1010 states have internal predecessors, (1347), 150 states have call successors, (150), 90 states have call predecessors, (150), 100 states have return successors, (217), 142 states have call predecessors, (217), 150 states have call successors, (217) [2021-12-14 16:20:12,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1714 transitions. [2021-12-14 16:20:12,374 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1714 transitions. Word has length 92 [2021-12-14 16:20:12,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:12,374 INFO L470 AbstractCegarLoop]: Abstraction has 1241 states and 1714 transitions. [2021-12-14 16:20:12,374 INFO L471 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) [2021-12-14 16:20:12,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1714 transitions. [2021-12-14 16:20:12,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-12-14 16:20:12,376 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:12,376 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:12,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 16:20:12,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-14 16:20:12,592 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:12,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:12,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1224402848, now seen corresponding path program 1 times [2021-12-14 16:20:12,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:12,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277630973] [2021-12-14 16:20:12,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:12,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:12,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:12,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:20:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:12,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 16:20:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:12,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 16:20:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:12,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 16:20:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:12,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-14 16:20:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:12,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:12,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-14 16:20:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:12,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:12,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-14 16:20:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:12,709 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-12-14 16:20:12,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:12,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277630973] [2021-12-14 16:20:12,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277630973] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:20:12,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540193777] [2021-12-14 16:20:12,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:12,710 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:12,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:20:12,711 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) [2021-12-14 16:20:12,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 16:20:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:12,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 16:20:12,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:20:12,962 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-14 16:20:12,962 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:20:12,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540193777] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:12,962 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:20:12,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-14 16:20:12,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431239529] [2021-12-14 16:20:12,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:12,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:20:12,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:12,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:20:12,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:20:12,964 INFO L87 Difference]: Start difference. First operand 1241 states and 1714 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) [2021-12-14 16:20:13,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:13,033 INFO L93 Difference]: Finished difference Result 2958 states and 4125 transitions. [2021-12-14 16:20:13,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:20:13,033 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 [2021-12-14 16:20:13,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:13,040 INFO L225 Difference]: With dead ends: 2958 [2021-12-14 16:20:13,040 INFO L226 Difference]: Without dead ends: 1960 [2021-12-14 16:20:13,044 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:13,044 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 67 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 277 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 [2021-12-14 16:20:13,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 277 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 16:20:13,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2021-12-14 16:20:13,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 1934. [2021-12-14 16:20:13,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1934 states, 1548 states have (on average 1.3585271317829457) internal successors, (2103), 1577 states have internal predecessors, (2103), 228 states have call successors, (228), 141 states have call predecessors, (228), 157 states have return successors, (321), 217 states have call predecessors, (321), 228 states have call successors, (321) [2021-12-14 16:20:13,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 2652 transitions. [2021-12-14 16:20:13,129 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 2652 transitions. Word has length 118 [2021-12-14 16:20:13,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:13,129 INFO L470 AbstractCegarLoop]: Abstraction has 1934 states and 2652 transitions. [2021-12-14 16:20:13,130 INFO L471 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) [2021-12-14 16:20:13,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 2652 transitions. [2021-12-14 16:20:13,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-12-14 16:20:13,132 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:13,133 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:13,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 16:20:13,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-14 16:20:13,347 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:13,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:13,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1746596599, now seen corresponding path program 1 times [2021-12-14 16:20:13,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:13,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438980965] [2021-12-14 16:20:13,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:13,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:13,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:13,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:20:13,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:13,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 16:20:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:13,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 16:20:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:13,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 16:20:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:13,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-14 16:20:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:13,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 16:20:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:13,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:13,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-14 16:20:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:13,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:13,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-14 16:20:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:13,429 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-14 16:20:13,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:13,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438980965] [2021-12-14 16:20:13,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438980965] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:20:13,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183310999] [2021-12-14 16:20:13,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:13,430 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:13,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:20:13,431 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) [2021-12-14 16:20:13,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 16:20:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:13,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 16:20:13,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:20:13,640 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-14 16:20:13,640 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:20:13,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183310999] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:13,640 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:20:13,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 16:20:13,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046772565] [2021-12-14 16:20:13,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:13,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:20:13,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:13,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:20:13,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:20:13,641 INFO L87 Difference]: Start difference. First operand 1934 states and 2652 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) [2021-12-14 16:20:13,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:13,724 INFO L93 Difference]: Finished difference Result 4164 states and 5762 transitions. [2021-12-14 16:20:13,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:20:13,724 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 [2021-12-14 16:20:13,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:13,732 INFO L225 Difference]: With dead ends: 4164 [2021-12-14 16:20:13,732 INFO L226 Difference]: Without dead ends: 2240 [2021-12-14 16:20:13,736 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:13,737 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 118 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 165 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 [2021-12-14 16:20:13,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 165 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 16:20:13,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2021-12-14 16:20:13,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 2174. [2021-12-14 16:20:13,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2174 states, 1767 states have (on average 1.2874929258630448) internal successors, (2275), 1793 states have internal predecessors, (2275), 228 states have call successors, (228), 159 states have call predecessors, (228), 178 states have return successors, (315), 223 states have call predecessors, (315), 228 states have call successors, (315) [2021-12-14 16:20:13,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 2818 transitions. [2021-12-14 16:20:13,815 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 2818 transitions. Word has length 134 [2021-12-14 16:20:13,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:13,815 INFO L470 AbstractCegarLoop]: Abstraction has 2174 states and 2818 transitions. [2021-12-14 16:20:13,815 INFO L471 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) [2021-12-14 16:20:13,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 2818 transitions. [2021-12-14 16:20:13,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-12-14 16:20:13,818 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:13,818 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:13,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 16:20:14,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:14,034 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:14,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:14,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1255738600, now seen corresponding path program 1 times [2021-12-14 16:20:14,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:14,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292628671] [2021-12-14 16:20:14,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:14,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:20:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 16:20:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 16:20:14,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 16:20:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-14 16:20:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 16:20:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-14 16:20:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-14 16:20:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,104 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-14 16:20:14,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:14,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292628671] [2021-12-14 16:20:14,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292628671] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:20:14,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011995286] [2021-12-14 16:20:14,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:14,104 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:14,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:20:14,105 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) [2021-12-14 16:20:14,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 16:20:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 16:20:14,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:20:14,339 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-14 16:20:14,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:20:14,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011995286] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:14,340 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:20:14,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 16:20:14,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808690064] [2021-12-14 16:20:14,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:14,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:20:14,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:14,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:20:14,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:20:14,341 INFO L87 Difference]: Start difference. First operand 2174 states and 2818 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) [2021-12-14 16:20:14,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:14,415 INFO L93 Difference]: Finished difference Result 4387 states and 5717 transitions. [2021-12-14 16:20:14,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:20:14,415 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 [2021-12-14 16:20:14,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:14,429 INFO L225 Difference]: With dead ends: 4387 [2021-12-14 16:20:14,429 INFO L226 Difference]: Without dead ends: 2225 [2021-12-14 16:20:14,433 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:14,434 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 118 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 276 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 [2021-12-14 16:20:14,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 276 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 16:20:14,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2225 states. [2021-12-14 16:20:14,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2225 to 2156. [2021-12-14 16:20:14,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 1749 states have (on average 1.2595769010863351) internal successors, (2203), 1775 states have internal predecessors, (2203), 228 states have call successors, (228), 159 states have call predecessors, (228), 178 states have return successors, (315), 223 states have call predecessors, (315), 228 states have call successors, (315) [2021-12-14 16:20:14,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 2746 transitions. [2021-12-14 16:20:14,516 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 2746 transitions. Word has length 134 [2021-12-14 16:20:14,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:14,517 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 2746 transitions. [2021-12-14 16:20:14,517 INFO L471 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) [2021-12-14 16:20:14,517 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2746 transitions. [2021-12-14 16:20:14,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-14 16:20:14,520 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:14,520 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:14,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 16:20:14,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-14 16:20:14,737 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:14,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:14,737 INFO L85 PathProgramCache]: Analyzing trace with hash 429240706, now seen corresponding path program 1 times [2021-12-14 16:20:14,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:14,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181584922] [2021-12-14 16:20:14,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:14,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:20:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 16:20:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 16:20:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 16:20:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 16:20:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 16:20:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 16:20:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:14,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-14 16:20:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,852 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-14 16:20:14,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:14,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181584922] [2021-12-14 16:20:14,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181584922] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:20:14,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184883451] [2021-12-14 16:20:14,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:14,852 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:14,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:20:14,853 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) [2021-12-14 16:20:14,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 16:20:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:14,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 16:20:14,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:20:15,115 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 16:20:15,115 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:20:15,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184883451] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:15,115 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:20:15,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 16:20:15,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433529618] [2021-12-14 16:20:15,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:15,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:20:15,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:15,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:20:15,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:20:15,119 INFO L87 Difference]: Start difference. First operand 2156 states and 2746 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) [2021-12-14 16:20:15,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:15,187 INFO L93 Difference]: Finished difference Result 3081 states and 4000 transitions. [2021-12-14 16:20:15,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:20:15,187 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 [2021-12-14 16:20:15,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:15,193 INFO L225 Difference]: With dead ends: 3081 [2021-12-14 16:20:15,193 INFO L226 Difference]: Without dead ends: 1990 [2021-12-14 16:20:15,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:20:15,196 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 75 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 365 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 [2021-12-14 16:20:15,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 365 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 16:20:15,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2021-12-14 16:20:15,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1952. [2021-12-14 16:20:15,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1587 states have (on average 1.238815374921235) internal successors, (1966), 1611 states have internal predecessors, (1966), 206 states have call successors, (206), 144 states have call predecessors, (206), 158 states have return successors, (275), 198 states have call predecessors, (275), 206 states have call successors, (275) [2021-12-14 16:20:15,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2447 transitions. [2021-12-14 16:20:15,281 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2447 transitions. Word has length 135 [2021-12-14 16:20:15,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:15,281 INFO L470 AbstractCegarLoop]: Abstraction has 1952 states and 2447 transitions. [2021-12-14 16:20:15,281 INFO L471 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) [2021-12-14 16:20:15,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2447 transitions. [2021-12-14 16:20:15,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-14 16:20:15,284 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:15,284 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:15,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 16:20:15,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:15,502 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:15,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:15,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1638887588, now seen corresponding path program 1 times [2021-12-14 16:20:15,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:15,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794624092] [2021-12-14 16:20:15,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:15,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:15,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:15,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:20:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:15,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 16:20:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:15,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 16:20:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:15,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 16:20:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:15,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 16:20:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:15,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 16:20:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:15,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:15,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 16:20:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:15,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:15,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 16:20:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:15,578 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-14 16:20:15,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:15,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794624092] [2021-12-14 16:20:15,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794624092] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:20:15,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686162335] [2021-12-14 16:20:15,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:15,579 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:15,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:20:15,580 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) [2021-12-14 16:20:15,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 16:20:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:15,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 16:20:15,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:20:15,909 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-14 16:20:15,909 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:20:15,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686162335] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:15,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:20:15,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-14 16:20:15,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930773162] [2021-12-14 16:20:15,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:15,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 16:20:15,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:15,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 16:20:15,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-14 16:20:15,911 INFO L87 Difference]: Start difference. First operand 1952 states and 2447 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) [2021-12-14 16:20:16,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:16,094 INFO L93 Difference]: Finished difference Result 3288 states and 4159 transitions. [2021-12-14 16:20:16,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 16:20:16,094 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 [2021-12-14 16:20:16,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:16,100 INFO L225 Difference]: With dead ends: 3288 [2021-12-14 16:20:16,100 INFO L226 Difference]: Without dead ends: 1945 [2021-12-14 16:20:16,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-14 16:20:16,104 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 134 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 255 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 [2021-12-14 16:20:16,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 255 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 16:20:16,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2021-12-14 16:20:16,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 1386. [2021-12-14 16:20:16,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 1129 states have (on average 1.2063773250664305) internal successors, (1362), 1143 states have internal predecessors, (1362), 148 states have call successors, (148), 101 states have call predecessors, (148), 108 states have return successors, (183), 142 states have call predecessors, (183), 148 states have call successors, (183) [2021-12-14 16:20:16,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1693 transitions. [2021-12-14 16:20:16,179 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1693 transitions. Word has length 136 [2021-12-14 16:20:16,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:16,179 INFO L470 AbstractCegarLoop]: Abstraction has 1386 states and 1693 transitions. [2021-12-14 16:20:16,180 INFO L471 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) [2021-12-14 16:20:16,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1693 transitions. [2021-12-14 16:20:16,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-14 16:20:16,181 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:16,181 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:16,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-14 16:20:16,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:16,395 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:16,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:16,396 INFO L85 PathProgramCache]: Analyzing trace with hash 331745190, now seen corresponding path program 1 times [2021-12-14 16:20:16,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:16,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744106177] [2021-12-14 16:20:16,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:16,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:16,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:16,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:20:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:16,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 16:20:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:16,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 16:20:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:16,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 16:20:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:16,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 16:20:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:16,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 16:20:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:16,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:16,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 16:20:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:16,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:16,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 16:20:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:16,472 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-14 16:20:16,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:16,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744106177] [2021-12-14 16:20:16,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744106177] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:20:16,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434088602] [2021-12-14 16:20:16,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:16,473 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:16,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:20:16,474 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) [2021-12-14 16:20:16,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 16:20:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:16,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 16:20:16,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:20:16,729 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-14 16:20:16,729 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:20:16,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434088602] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:16,729 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:20:16,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-14 16:20:16,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811410721] [2021-12-14 16:20:16,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:16,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 16:20:16,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:16,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 16:20:16,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-14 16:20:16,730 INFO L87 Difference]: Start difference. First operand 1386 states and 1693 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) [2021-12-14 16:20:16,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:16,893 INFO L93 Difference]: Finished difference Result 2506 states and 3064 transitions. [2021-12-14 16:20:16,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 16:20:16,894 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 [2021-12-14 16:20:16,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:16,897 INFO L225 Difference]: With dead ends: 2506 [2021-12-14 16:20:16,897 INFO L226 Difference]: Without dead ends: 1132 [2021-12-14 16:20:16,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-14 16:20:16,900 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 155 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:16,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 265 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 16:20:16,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2021-12-14 16:20:16,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1110. [2021-12-14 16:20:16,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 911 states have (on average 1.1525795828759604) internal successors, (1050), 921 states have internal predecessors, (1050), 110 states have call successors, (110), 79 states have call predecessors, (110), 88 states have return successors, (134), 110 states have call predecessors, (134), 110 states have call successors, (134) [2021-12-14 16:20:16,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1294 transitions. [2021-12-14 16:20:16,950 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1294 transitions. Word has length 136 [2021-12-14 16:20:16,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:16,950 INFO L470 AbstractCegarLoop]: Abstraction has 1110 states and 1294 transitions. [2021-12-14 16:20:16,950 INFO L471 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) [2021-12-14 16:20:16,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1294 transitions. [2021-12-14 16:20:16,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-14 16:20:16,951 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:16,952 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:16,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-14 16:20:17,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:17,168 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:17,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:17,168 INFO L85 PathProgramCache]: Analyzing trace with hash -2065725340, now seen corresponding path program 1 times [2021-12-14 16:20:17,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:17,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907604187] [2021-12-14 16:20:17,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:17,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:20:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 16:20:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 16:20:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 16:20:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 16:20:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 16:20:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 16:20:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 16:20:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,245 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-14 16:20:17,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:17,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907604187] [2021-12-14 16:20:17,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907604187] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:20:17,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918151193] [2021-12-14 16:20:17,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:17,245 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:20:17,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:20:17,246 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) [2021-12-14 16:20:17,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-14 16:20:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 16:20:17,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:20:17,466 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-14 16:20:17,467 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:20:17,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918151193] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:17,467 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:20:17,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-14 16:20:17,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598769503] [2021-12-14 16:20:17,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:17,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 16:20:17,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:17,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 16:20:17,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:20:17,468 INFO L87 Difference]: Start difference. First operand 1110 states and 1294 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) [2021-12-14 16:20:17,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:17,548 INFO L93 Difference]: Finished difference Result 2237 states and 2669 transitions. [2021-12-14 16:20:17,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 16:20:17,548 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 [2021-12-14 16:20:17,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:17,551 INFO L225 Difference]: With dead ends: 2237 [2021-12-14 16:20:17,551 INFO L226 Difference]: Without dead ends: 1138 [2021-12-14 16:20:17,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-14 16:20:17,553 INFO L933 BasicCegarLoop]: 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 [2021-12-14 16:20:17,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 527 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 16:20:17,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2021-12-14 16:20:17,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1122. [2021-12-14 16:20:17,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 923 states have (on average 1.1278439869989165) internal successors, (1041), 933 states have internal predecessors, (1041), 110 states have call successors, (110), 79 states have call predecessors, (110), 88 states have return successors, (134), 110 states have call predecessors, (134), 110 states have call successors, (134) [2021-12-14 16:20:17,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1285 transitions. [2021-12-14 16:20:17,608 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1285 transitions. Word has length 136 [2021-12-14 16:20:17,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:17,608 INFO L470 AbstractCegarLoop]: Abstraction has 1122 states and 1285 transitions. [2021-12-14 16:20:17,608 INFO L471 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) [2021-12-14 16:20:17,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1285 transitions. [2021-12-14 16:20:17,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-14 16:20:17,610 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:17,610 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:17,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-14 16:20:17,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-14 16:20:17,827 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:17,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:17,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1471946848, now seen corresponding path program 1 times [2021-12-14 16:20:17,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:17,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120569927] [2021-12-14 16:20:17,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:17,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:20:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 16:20:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 16:20:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 16:20:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 16:20:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 16:20:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 16:20:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 16:20:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:17,893 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-12-14 16:20:17,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:17,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120569927] [2021-12-14 16:20:17,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120569927] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:17,894 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:17,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 16:20:17,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615291909] [2021-12-14 16:20:17,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:17,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 16:20:17,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:17,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 16:20:17,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:20:17,895 INFO L87 Difference]: Start difference. First operand 1122 states and 1285 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) [2021-12-14 16:20:18,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:18,282 INFO L93 Difference]: Finished difference Result 2097 states and 2382 transitions. [2021-12-14 16:20:18,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 16:20:18,283 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 [2021-12-14 16:20:18,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:18,288 INFO L225 Difference]: With dead ends: 2097 [2021-12-14 16:20:18,288 INFO L226 Difference]: Without dead ends: 2095 [2021-12-14 16:20:18,289 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:18,289 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 473 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:18,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [496 Valid, 502 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 16:20:18,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2095 states. [2021-12-14 16:20:18,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2095 to 1826. [2021-12-14 16:20:18,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1826 states, 1503 states have (on average 1.1250831669993346) internal successors, (1691), 1519 states have internal predecessors, (1691), 178 states have call successors, (178), 127 states have call predecessors, (178), 144 states have return successors, (213), 180 states have call predecessors, (213), 178 states have call successors, (213) [2021-12-14 16:20:18,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 2082 transitions. [2021-12-14 16:20:18,378 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 2082 transitions. Word has length 136 [2021-12-14 16:20:18,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:18,379 INFO L470 AbstractCegarLoop]: Abstraction has 1826 states and 2082 transitions. [2021-12-14 16:20:18,379 INFO L471 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) [2021-12-14 16:20:18,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 2082 transitions. [2021-12-14 16:20:18,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-12-14 16:20:18,382 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 16:20:18,383 INFO L514 BasicCegarLoop]: 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] [2021-12-14 16:20:18,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-14 16:20:18,383 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 16:20:18,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:20:18,383 INFO L85 PathProgramCache]: Analyzing trace with hash -609020054, now seen corresponding path program 2 times [2021-12-14 16:20:18,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:20:18,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503125226] [2021-12-14 16:20:18,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:20:18,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:20:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:18,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 16:20:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:18,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 16:20:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:18,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 16:20:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:18,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 16:20:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:18,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 16:20:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:18,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 16:20:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:18,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 16:20:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:18,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:18,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 16:20:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:18,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:18,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 16:20:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:18,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-14 16:20:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:18,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 16:20:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:18,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-14 16:20:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:20:18,453 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2021-12-14 16:20:18,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:20:18,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503125226] [2021-12-14 16:20:18,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503125226] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:20:18,454 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:20:18,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 16:20:18,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831490213] [2021-12-14 16:20:18,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:20:18,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 16:20:18,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:20:18,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 16:20:18,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:20:18,455 INFO L87 Difference]: Start difference. First operand 1826 states and 2082 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) [2021-12-14 16:20:18,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 16:20:18,924 INFO L93 Difference]: Finished difference Result 3695 states and 4226 transitions. [2021-12-14 16:20:18,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 16:20:18,924 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 [2021-12-14 16:20:18,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 16:20:18,925 INFO L225 Difference]: With dead ends: 3695 [2021-12-14 16:20:18,925 INFO L226 Difference]: Without dead ends: 0 [2021-12-14 16:20:18,930 INFO L932 BasicCegarLoop]: 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 [2021-12-14 16:20:18,930 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 581 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 16:20:18,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [596 Valid, 435 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 16:20:18,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-14 16:20:18,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-14 16:20:18,931 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) [2021-12-14 16:20:18,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-14 16:20:18,931 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 175 [2021-12-14 16:20:18,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 16:20:18,932 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 16:20:18,932 INFO L471 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) [2021-12-14 16:20:18,932 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-14 16:20:18,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-14 16:20:18,934 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-14 16:20:18,934 INFO L764 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-14 16:20:18,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-14 16:20:18,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-14 16:20:55,816 INFO L858 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 915 925) no Hoare annotation was computed. [2021-12-14 16:20:55,816 INFO L854 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))) (.cse11 (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))) (.cse12 (= ~E_M~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) (or .cse0 (and (not (< 0 ~m_pc~0)) (not (<= 1 ~t1_pc~0))) .cse11 .cse3 .cse5 .cse7 .cse12 (and (or (not (< 1 ~m_pc~0)) (not (<= ~t1_pc~0 1))) (not (<= ~m_pc~0 0))) .cse10) (or .cse0 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse12 (not (< ~token~0 (+ 2 ~local~0))) (not (<= (+ ~local~0 1) ~token~0)) .cse10 (not (<= 2 ~E_1~0))))) [2021-12-14 16:20:55,816 INFO L858 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 915 925) no Hoare annotation was computed. [2021-12-14 16:20:55,816 INFO L858 garLoopResultBuilder]: For program point update_channels1EXIT(lines 262 276) no Hoare annotation was computed. [2021-12-14 16:20:55,816 INFO L861 garLoopResultBuilder]: At program point L57(lines 40 59) the Hoare annotation is: true [2021-12-14 16:20:55,817 INFO L854 garLoopResultBuilder]: At program point update_channels1ENTRY(lines 262 276) the Hoare annotation is: (let ((.cse7 (not (= ~p_dw_pc~0 0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (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)|))) (.cse3 (= ~E_M~0 0)) (.cse8 (not (<= ~c_dr_pc~0 1))) (.cse4 (not (= ~T1_E~0 ~M_E~0))) (.cse9 (not (<= 1 ~c_dr_pc~0))) (.cse5 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0)))) (.cse6 (not (<= 1 ~p_dw_pc~0)))) (and (or .cse0 .cse1 .cse2 (not (= ~c_dr_pc~0 0)) .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse7 .cse3 .cse8 .cse4 .cse9 .cse5) (or .cse0 .cse1 .cse2 .cse7 .cse3 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse9 .cse5 .cse6))) [2021-12-14 16:20:55,817 INFO L858 garLoopResultBuilder]: For program point L49-1(lines 49 53) no Hoare annotation was computed. [2021-12-14 16:20:55,817 INFO L858 garLoopResultBuilder]: For program point L44(lines 44 48) no Hoare annotation was computed. [2021-12-14 16:20:55,817 INFO L858 garLoopResultBuilder]: For program point L44-2(lines 43 58) no Hoare annotation was computed. [2021-12-14 16:20:55,817 INFO L858 garLoopResultBuilder]: For program point L266-1(lines 262 276) no Hoare annotation was computed. [2021-12-14 16:20:55,817 INFO L858 garLoopResultBuilder]: For program point L704(lines 704 709) no Hoare annotation was computed. [2021-12-14 16:20:55,817 INFO L858 garLoopResultBuilder]: For program point L898-2(lines 898 902) no Hoare annotation was computed. [2021-12-14 16:20:55,817 INFO L854 garLoopResultBuilder]: At program point activate_threads2ENTRY(lines 890 914) the Hoare annotation is: (let ((.cse1 (not (<= ~token~0 ~local~0))) (.cse16 (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))) (.cse15 (= ~E_M~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 .cse4 .cse6 .cse7 .cse15 .cse10 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0)))) (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 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11) (or (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse1 .cse3 .cse4 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse7 .cse15 .cse13 .cse14 .cse10 .cse11))) [2021-12-14 16:20:55,818 INFO L854 garLoopResultBuilder]: At program point L733(lines 721 735) the Hoare annotation is: (let ((.cse20 (= ~E_M~0 0)) (.cse29 (< 1 ~m_pc~0)) (.cse28 (<= ~m_pc~0 0))) (let ((.cse30 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse31 (<= 2 ~m_st~0)) (.cse32 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse34 (= ~p_dw_st~0 0)) (.cse26 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse27 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse36 (or .cse29 .cse28)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse11 (= ~m_st~0 |old(~m_st~0)|)) (.cse33 (not .cse20)) (.cse35 (= ~c_dr_pc~0 0))) (let ((.cse19 (and .cse36 .cse10 .cse11 .cse33 .cse35)) (.cse4 (not (<= ~t1_pc~0 0))) (.cse1 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse25 (not (= |old(~m_st~0)| 0))) (.cse21 (and (not .cse29) (not .cse28))) (.cse14 (not (= ~M_E~0 2))) (.cse6 (not (<= 2 ~E_M~0))) (.cse16 (and .cse26 .cse27)) (.cse17 (and (= ~T1_E~0 ~M_E~0) .cse36 .cse10 .cse30 .cse11 .cse31 .cse32 .cse33 .cse34 .cse35)) (.cse0 (not .cse34)) (.cse15 (not (<= 2 |old(~m_st~0)|))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse12 (not (= ~t1_pc~0 1))) (.cse3 (not .cse30)) (.cse13 (= |old(~t1_st~0)| 0)) (.cse5 (not (= ~p_dw_pc~0 0))) (.cse23 (not (< ~token~0 (+ 2 ~local~0)))) (.cse24 (not (<= (+ ~local~0 1) ~token~0))) (.cse8 (not .cse32)) (.cse9 (and .cse10 .cse11 .cse26 .cse27)) (.cse22 (and (or .cse28 (and (<= ~t1_pc~0 1) .cse29)) .cse10 .cse30 .cse11 .cse31 .cse32 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse33 .cse34 .cse35)) (.cse18 (not (<= 2 ~E_1~0)))) (and (or (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 (and .cse10 .cse11) .cse12 .cse3 .cse13 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse14 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse17 .cse18) (or .cse19 .cse0 .cse15 .cse3 .cse5 .cse20 .cse8 .cse21) (or .cse0 .cse1 .cse15 .cse2 .cse12 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse22 .cse18) (or .cse19 .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18) (or .cse0 .cse2 .cse12 .cse3 .cse13 .cse5 .cse23 .cse6 .cse24 .cse8 .cse9 .cse25 .cse18) (or .cse0 .cse14 .cse1 .cse15 .cse2 .cse12 .cse3 .cse5 .cse20 .cse6 .cse16 .cse7 .cse8 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse12 .cse3 .cse13 .cse5 .cse6 .cse16 .cse7 .cse8 .cse25 .cse21 .cse18) (or .cse0 .cse14 .cse15 .cse2 .cse12 .cse3 .cse13 .cse5 .cse20 .cse23 .cse16 .cse24 .cse8 .cse17 .cse18) (or .cse0 .cse15 .cse2 .cse12 .cse3 .cse13 .cse5 .cse6 .cse8 .cse9 .cse22 .cse18) (or .cse0 .cse14 .cse15 .cse2 .cse12 .cse3 .cse13 .cse5 .cse20 .cse6 .cse16 .cse8 .cse17 .cse18) (or .cse0 (and (= ~m_st~0 0) .cse26 .cse27 (not (= ~t1_st~0 0))) .cse15 .cse2 .cse12 .cse3 .cse13 .cse5 .cse20 .cse23 .cse24 .cse8 .cse9 .cse22 .cse18))))) [2021-12-14 16:20:55,818 INFO L858 garLoopResultBuilder]: For program point L723(lines 723 728) no Hoare annotation was computed. [2021-12-14 16:20:55,818 INFO L854 garLoopResultBuilder]: At program point L715(lines 699 717) the Hoare annotation is: (let ((.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse16 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse14 (= ~E_M~0 0)) (.cse12 (not (= ~t1_pc~0 1))) (.cse13 (= |old(~t1_st~0)| 0)) (.cse17 (not (< ~token~0 (+ 2 ~local~0)))) (.cse18 (not (<= (+ ~local~0 1) ~token~0))) (.cse11 (not (<= 2 ~E_1~0))) (.cse0 (and (<= |activate_threads2_is_master_triggered_#res#1| 0) .cse15 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse16 (<= |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 .cse3 .cse5 .cse7 .cse14 .cse10 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0)))) (or .cse1 .cse3 .cse4 (and .cse15 .cse16) .cse12 .cse5 .cse13 .cse7 .cse14 .cse17 .cse18 .cse10 .cse11) (or .cse0 .cse1 .cse4 .cse12 .cse5 .cse13 .cse7 .cse17 .cse8 .cse18 .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)))) [2021-12-14 16:20:55,818 INFO L858 garLoopResultBuilder]: For program point L703(lines 703 712) no Hoare annotation was computed. [2021-12-14 16:20:55,818 INFO L854 garLoopResultBuilder]: At program point L734(lines 718 736) the Hoare annotation is: (let ((.cse20 (= ~E_M~0 0)) (.cse38 (< 1 ~m_pc~0)) (.cse37 (<= ~m_pc~0 0))) (let ((.cse26 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse27 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse28 (<= |activate_threads2_is_transmit1_triggered_#res#1| 0)) (.cse29 (<= 0 |activate_threads2_is_transmit1_triggered_#res#1|)) (.cse31 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse32 (<= 2 ~m_st~0)) (.cse33 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse35 (= ~p_dw_st~0 0)) (.cse30 (or .cse38 .cse37)) (.cse3 (= |old(~t1_st~0)| ~t1_st~0)) (.cse4 (= ~m_st~0 |old(~m_st~0)|)) (.cse34 (not .cse20)) (.cse36 (= ~c_dr_pc~0 0))) (let ((.cse16 (and .cse30 .cse3 .cse4 .cse34 .cse36)) (.cse13 (and (not .cse38) (not .cse37))) (.cse25 (and (or .cse37 (and (<= ~t1_pc~0 1) .cse38)) .cse3 .cse31 .cse4 .cse32 .cse33 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse34 .cse35 .cse36)) (.cse5 (not (= ~t1_pc~0 1))) (.cse7 (= |old(~t1_st~0)| 0)) (.cse22 (not (< ~token~0 (+ 2 ~local~0)))) (.cse23 (not (<= (+ ~local~0 1) ~token~0))) (.cse12 (not (= |old(~m_st~0)| 0))) (.cse19 (and .cse3 .cse4 .cse26 .cse27 .cse28 .cse29)) (.cse0 (not .cse35)) (.cse21 (not (= ~M_E~0 2))) (.cse1 (not (<= ~token~0 ~local~0))) (.cse17 (not (<= 2 |old(~m_st~0)|))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse6 (not .cse31)) (.cse18 (not (<= ~t1_pc~0 0))) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse9 (not (<= 2 ~E_M~0))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse11 (not .cse33)) (.cse24 (and (= ~T1_E~0 ~M_E~0) .cse30 .cse3 .cse31 .cse4 .cse32 .cse33 .cse34 .cse35 .cse36)) (.cse14 (not (<= 2 ~E_1~0))) (.cse15 (and .cse26 .cse27 .cse28 .cse29))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse16 .cse0 .cse1 .cse17 .cse2 .cse6 .cse18 .cse8 .cse9 .cse10 .cse11 .cse19 .cse14) (or .cse16 .cse0 .cse17 .cse6 .cse8 .cse20 .cse11 .cse13) (or .cse0 .cse21 .cse17 .cse2 .cse5 .cse6 .cse7 .cse8 .cse20 .cse22 .cse23 .cse11 .cse24 .cse14 .cse15) (or .cse0 .cse17 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse19 .cse25 .cse14) (or .cse0 .cse1 .cse17 .cse2 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse19 .cse25 .cse14) (or .cse0 .cse21 .cse1 .cse17 .cse2 .cse5 .cse6 .cse8 .cse20 .cse9 .cse10 .cse11 .cse24 .cse14 .cse15) (or .cse0 .cse17 .cse2 .cse5 .cse6 .cse7 .cse8 .cse20 .cse22 .cse23 (and (= ~m_st~0 0) .cse26 .cse27 .cse28 (not (= ~t1_st~0 0)) .cse29) .cse11 .cse19 .cse25 .cse14) (or (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse1 .cse2 .cse6 .cse18 .cse8 .cse9 .cse10 .cse11 .cse19) (or .cse0 .cse21 .cse17 .cse2 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse11 .cse24 .cse14 .cse15) (or .cse0 .cse2 .cse5 .cse6 .cse7 .cse8 .cse22 .cse9 .cse23 .cse11 .cse12 .cse19 .cse14) (or .cse0 .cse21 .cse1 .cse17 .cse2 .cse6 .cse18 .cse8 .cse9 .cse10 .cse11 .cse24 .cse14 .cse15))))) [2021-12-14 16:20:55,818 INFO L858 garLoopResultBuilder]: For program point L703-2(lines 703 712) no Hoare annotation was computed. [2021-12-14 16:20:55,818 INFO L858 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 890 914) no Hoare annotation was computed. [2021-12-14 16:20:55,818 INFO L858 garLoopResultBuilder]: For program point L722(lines 722 731) no Hoare annotation was computed. [2021-12-14 16:20:55,818 INFO L858 garLoopResultBuilder]: For program point L722-2(lines 722 731) no Hoare annotation was computed. [2021-12-14 16:20:55,819 INFO L854 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 ((.cse2 (not (<= ~token~0 ~local~0))) (.cse6 (not (<= ~t1_pc~0 0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse12 (not (= ~t1_pc~0 1))) (.cse13 (= |old(~t1_st~0)| 0)) (.cse14 (not (< ~token~0 (+ 2 ~local~0)))) (.cse15 (not (<= (+ ~local~0 1) ~token~0))) (.cse11 (not (<= 2 ~E_1~0))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (and .cse16 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse17 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse5 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse18 (= ~E_M~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 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) (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 .cse18 .cse14 .cse15 .cse10 .cse11) (or .cse0 .cse1 .cse3 .cse5 .cse7 .cse18 .cse10 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))))))) [2021-12-14 16:20:55,819 INFO L858 garLoopResultBuilder]: For program point L906(lines 906 910) no Hoare annotation was computed. [2021-12-14 16:20:55,819 INFO L858 garLoopResultBuilder]: For program point L906-2(lines 890 914) no Hoare annotation was computed. [2021-12-14 16:20:55,819 INFO L858 garLoopResultBuilder]: For program point L898(lines 898 902) no Hoare annotation was computed. [2021-12-14 16:20:55,819 INFO L854 garLoopResultBuilder]: At program point activate_threads1ENTRY(lines 387 411) 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 (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse3 (= ~E_M~0 0)) (.cse8 (not (<= ~c_dr_pc~0 1))) (.cse4 (not (= ~T1_E~0 ~M_E~0))) (.cse9 (not (<= 1 ~c_dr_pc~0))) (.cse5 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))))) (and (or .cse0 .cse1 (not (= ~c_dr_pc~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse7 .cse3 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse9 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse7 .cse3 .cse8 .cse4 .cse9 .cse5))) [2021-12-14 16:20:55,819 INFO L858 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 387 411) no Hoare annotation was computed. [2021-12-14 16:20:55,819 INFO L858 garLoopResultBuilder]: For program point L403(lines 403 407) no Hoare annotation was computed. [2021-12-14 16:20:55,819 INFO L858 garLoopResultBuilder]: For program point L401(line 401) no Hoare annotation was computed. [2021-12-14 16:20:55,819 INFO L858 garLoopResultBuilder]: For program point L403-2(lines 387 411) no Hoare annotation was computed. [2021-12-14 16:20:55,819 INFO L858 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2021-12-14 16:20:55,819 INFO L854 garLoopResultBuilder]: At program point L393(line 393) 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 (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse3 (= ~E_M~0 0)) (.cse8 (not (<= ~c_dr_pc~0 1))) (.cse4 (not (= ~T1_E~0 ~M_E~0))) (.cse9 (not (<= 1 ~c_dr_pc~0))) (.cse5 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))))) (and (or .cse0 .cse1 (not (= ~c_dr_pc~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse7 .cse3 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse9 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse7 .cse3 .cse8 .cse4 .cse9 .cse5))) [2021-12-14 16:20:55,820 INFO L854 garLoopResultBuilder]: At program point L395-2(lines 395 399) the Hoare annotation is: (let ((.cse15 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse14 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse4 (not (<= ~c_dr_pc~0 1))) (.cse7 (not (<= 1 ~c_dr_pc~0))) (.cse11 (and .cse15 .cse14 (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))) (.cse12 (not (= ~p_dw_pc~0 0))) (.cse6 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse10 (not (= ~q_read_ev~0 2))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse13 (not (= ~c_dr_pc~0 0))) (.cse2 (and .cse15 .cse14)) (.cse3 (= ~E_M~0 0)) (.cse5 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0)))) (.cse9 (not (<= 1 ~p_dw_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse11 .cse12 .cse3 .cse4 .cse5 .cse7 .cse8) (or .cse0 .cse1 .cse11 .cse12 .cse3 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse5 .cse8) (or .cse0 .cse1 .cse13 .cse14 .cse3 .cse5 .cse8 (not (= |old(~p_dw_st~0)| 0)) .cse9) (or .cse15 .cse0 .cse1 .cse13 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse13 .cse2 .cse3 (= ~p_dw_st~0 0) .cse5 .cse8 .cse9)))) [2021-12-14 16:20:55,820 INFO L858 garLoopResultBuilder]: For program point L393-1(line 393) no Hoare annotation was computed. [2021-12-14 16:20:55,820 INFO L858 garLoopResultBuilder]: For program point update_channels2EXIT(lines 737 744) no Hoare annotation was computed. [2021-12-14 16:20:55,820 INFO L861 garLoopResultBuilder]: At program point update_channels2FINAL(lines 737 744) the Hoare annotation is: true [2021-12-14 16:20:55,820 INFO L858 garLoopResultBuilder]: For program point L853-1(lines 834 861) no Hoare annotation was computed. [2021-12-14 16:20:55,820 INFO L854 garLoopResultBuilder]: At program point fire_delta_events2ENTRY(lines 834 861) the Hoare annotation is: (let ((.cse14 (not (<= ~t1_pc~0 0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse1 (not (= ~p_dw_st~0 0))) (.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))) (.cse15 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~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 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse12 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10 .cse11) (or .cse0 .cse1 .cse12 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10) (or .cse0 .cse1 (= |old(~E_M~0)| 0) .cse3 .cse6 .cse8 .cse10 .cse15) (or .cse1 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10 .cse11 .cse15))) [2021-12-14 16:20:55,820 INFO L858 garLoopResultBuilder]: For program point L848-1(lines 837 860) no Hoare annotation was computed. [2021-12-14 16:20:55,820 INFO L858 garLoopResultBuilder]: For program point L843-1(lines 837 860) no Hoare annotation was computed. [2021-12-14 16:20:55,820 INFO L858 garLoopResultBuilder]: For program point L838-1(lines 837 860) no Hoare annotation was computed. [2021-12-14 16:20:55,821 INFO L858 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 834 861) no Hoare annotation was computed. [2021-12-14 16:20:55,821 INFO L854 garLoopResultBuilder]: At program point fire_delta_events1ENTRY(lines 315 332) the Hoare annotation is: (let ((.cse4 (not (<= ~c_dr_pc~0 1))) (.cse6 (not (<= 1 ~c_dr_pc~0))) (.cse8 (not (<= 1 ~p_dw_pc~0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse9 (not (= ~p_dw_pc~0 0))) (.cse2 (= ~E_M~0 0)) (.cse3 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse5 (not (= ~T1_E~0 ~M_E~0))) (.cse7 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 (not (= ~c_dr_pc~0 0)) .cse2 .cse3 .cse5 .cse7 .cse8) (or .cse0 .cse1 .cse9 .cse2 .cse3 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse5 .cse7))) [2021-12-14 16:20:55,821 INFO L858 garLoopResultBuilder]: For program point L319-1(lines 318 331) no Hoare annotation was computed. [2021-12-14 16:20:55,821 INFO L858 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 315 332) no Hoare annotation was computed. [2021-12-14 16:20:55,821 INFO L858 garLoopResultBuilder]: For program point L324-1(lines 315 332) no Hoare annotation was computed. [2021-12-14 16:20:55,821 INFO L861 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 99 127) the Hoare annotation is: true [2021-12-14 16:20:55,821 INFO L854 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 (= ~E_M~0 0)) (.cse3 (not (= ~T1_E~0 ~M_E~0))) (.cse4 (and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))) (.cse5 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))))) (and (or .cse0 .cse1 (not (= ~c_dr_pc~0 0)) .cse2 .cse3 .cse4 .cse5 (not (<= 1 ~p_dw_pc~0))) (or .cse0 .cse1 (not (= ~p_dw_pc~0 0)) .cse2 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse3 .cse4 .cse5))) [2021-12-14 16:20:55,821 INFO L858 garLoopResultBuilder]: For program point L114(lines 114 119) no Hoare annotation was computed. [2021-12-14 16:20:55,821 INFO L858 garLoopResultBuilder]: For program point L113-1(lines 113 122) no Hoare annotation was computed. [2021-12-14 16:20:55,822 INFO L858 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 99 127) no Hoare annotation was computed. [2021-12-14 16:20:55,822 INFO L858 garLoopResultBuilder]: For program point L104(lines 104 109) no Hoare annotation was computed. [2021-12-14 16:20:55,822 INFO L858 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 99 127) no Hoare annotation was computed. [2021-12-14 16:20:55,822 INFO L858 garLoopResultBuilder]: For program point L103(lines 103 112) no Hoare annotation was computed. [2021-12-14 16:20:55,822 INFO L858 garLoopResultBuilder]: For program point L103-2(lines 102 126) no Hoare annotation was computed. [2021-12-14 16:20:55,822 INFO L858 garLoopResultBuilder]: For program point L1026-2(lines 1026 1035) no Hoare annotation was computed. [2021-12-14 16:20:55,822 INFO L854 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))) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~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)) (.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 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse14 .cse2 .cse12 .cse4 (not (= ~E_M~0 0)) .cse7 .cse8))) [2021-12-14 16:20:55,822 INFO L858 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2021-12-14 16:20:55,822 INFO L858 garLoopResultBuilder]: For program point L432(lines 432 439) no Hoare annotation was computed. [2021-12-14 16:20:55,822 INFO L861 garLoopResultBuilder]: At program point L1060(lines 1051 1062) the Hoare annotation is: true [2021-12-14 16:20:55,823 INFO L854 garLoopResultBuilder]: At program point L499-1(lines 496 536) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse7 .cse8 .cse4 .cse6))) [2021-12-14 16:20:55,823 INFO L858 garLoopResultBuilder]: For program point L599(line 599) no Hoare annotation was computed. [2021-12-14 16:20:55,823 INFO L858 garLoopResultBuilder]: For program point L500(line 500) no Hoare annotation was computed. [2021-12-14 16:20:55,823 INFO L854 garLoopResultBuilder]: At program point L600(lines 595 602) the Hoare annotation is: false [2021-12-14 16:20:55,823 INFO L858 garLoopResultBuilder]: For program point L1063(lines 1063 1069) no Hoare annotation was computed. [2021-12-14 16:20:55,823 INFO L854 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))) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~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)) (.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 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse14 .cse2 .cse12 .cse4 (not (= ~E_M~0 0)) .cse7 .cse8))) [2021-12-14 16:20:55,823 INFO L858 garLoopResultBuilder]: For program point L1030-1(line 1030) no Hoare annotation was computed. [2021-12-14 16:20:55,823 INFO L858 garLoopResultBuilder]: For program point L799(lines 789 827) no Hoare annotation was computed. [2021-12-14 16:20:55,823 INFO L858 garLoopResultBuilder]: For program point L667(lines 667 675) no Hoare annotation was computed. [2021-12-14 16:20:55,824 INFO L854 garLoopResultBuilder]: At program point L172-1(lines 156 200) the Hoare annotation is: (let ((.cse5 (<= 1 ~p_dw_pc~0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse3 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (not (= ~E_M~0 0))) (.cse7 (= ~M_E~0 2))) (let ((.cse0 (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~p_dw_pc~0 0) .cse2 .cse3 .cse4 .cse6 .cse7))) (.cse1 (<= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 ~p_dw_pc~0)) (and .cse2 .cse3 .cse4 .cse5 .cse6 (= ~c_dr_pc~0 0) .cse7) (and .cse0 (<= 1 ~c_dr_pc~0) .cse1)))) [2021-12-14 16:20:55,824 INFO L854 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))) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~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)) (.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 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse14 .cse2 .cse12 .cse4 (not (= ~E_M~0 0)) .cse7 .cse8))) [2021-12-14 16:20:55,824 INFO L858 garLoopResultBuilder]: For program point L635(line 635) no Hoare annotation was computed. [2021-12-14 16:20:55,824 INFO L858 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2021-12-14 16:20:55,824 INFO L858 garLoopResultBuilder]: For program point L1065(lines 1065 1068) no Hoare annotation was computed. [2021-12-14 16:20:55,824 INFO L854 garLoopResultBuilder]: At program point L537(lines 484 542) the Hoare annotation is: (= ~M_E~0 2) [2021-12-14 16:20:55,824 INFO L854 garLoopResultBuilder]: At program point L471(line 471) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse7 .cse8 .cse4 .cse6))) [2021-12-14 16:20:55,824 INFO L858 garLoopResultBuilder]: For program point L471-1(line 471) no Hoare annotation was computed. [2021-12-14 16:20:55,824 INFO L858 garLoopResultBuilder]: For program point L207(lines 207 215) no Hoare annotation was computed. [2021-12-14 16:20:55,824 INFO L854 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) (<= 2 ~E_M~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) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~M_E~0 2)) [2021-12-14 16:20:55,825 INFO L858 garLoopResultBuilder]: For program point L1000-1(line 1000) no Hoare annotation was computed. [2021-12-14 16:20:55,825 INFO L858 garLoopResultBuilder]: For program point L802(lines 802 809) no Hoare annotation was computed. [2021-12-14 16:20:55,825 INFO L858 garLoopResultBuilder]: For program point L670(lines 670 674) no Hoare annotation was computed. [2021-12-14 16:20:55,825 INFO L854 garLoopResultBuilder]: At program point L571(lines 562 573) the Hoare annotation is: (= ~M_E~0 2) [2021-12-14 16:20:55,825 INFO L858 garLoopResultBuilder]: For program point L373(lines 373 377) no Hoare annotation was computed. [2021-12-14 16:20:55,825 INFO L858 garLoopResultBuilder]: For program point L373-2(lines 372 385) no Hoare annotation was computed. [2021-12-14 16:20:55,825 INFO L854 garLoopResultBuilder]: At program point L671(lines 666 697) the Hoare annotation is: (let ((.cse0 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse1 (<= 2 ~m_st~0)) (.cse2 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse3 (= ~p_dw_st~0 0)) (.cse4 (= ~c_dr_pc~0 0))) (or (and (or (<= ~m_pc~0 0) (and (<= ~t1_pc~0 1) (< 1 ~m_pc~0))) .cse0 .cse1 .cse2 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) (not (= ~E_M~0 0)) .cse3 .cse4) (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) (<= 2 ~E_M~0) .cse0 .cse1 .cse2 (<= 2 ~T1_E~0) .cse3 .cse4 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0)))) [2021-12-14 16:20:55,825 INFO L858 garLoopResultBuilder]: For program point L473(lines 473 478) no Hoare annotation was computed. [2021-12-14 16:20:55,825 INFO L858 garLoopResultBuilder]: For program point L242(lines 242 254) no Hoare annotation was computed. [2021-12-14 16:20:55,826 INFO L854 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 (= ~M_E~0 2))) (or (and .cse0 (<= 2 ~E_1~0) .cse1 (<= 2 ~E_M~0) .cse2 (= ~m_st~0 0) .cse3 (<= ~t1_pc~0 0) .cse4 .cse5 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse6) (and .cse0 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse1 .cse2 (<= 2 ~m_st~0) .cse3 (not (= ~E_M~0 0)) .cse4 .cse5 .cse6))) [2021-12-14 16:20:55,826 INFO L854 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 (= ~M_E~0 2))) (or (and .cse0 (<= 2 ~E_1~0) .cse1 (<= 2 ~E_M~0) .cse2 (= ~m_st~0 0) .cse3 (<= ~t1_pc~0 0) .cse4 .cse5 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse6) (and .cse0 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse1 .cse2 (<= 2 ~m_st~0) .cse3 (not (= ~E_M~0 0)) .cse4 .cse5 .cse6))) [2021-12-14 16:20:55,826 INFO L854 garLoopResultBuilder]: At program point L507(line 507) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse7 .cse8 .cse4 .cse6))) [2021-12-14 16:20:55,826 INFO L858 garLoopResultBuilder]: For program point L507-1(line 507) no Hoare annotation was computed. [2021-12-14 16:20:55,826 INFO L858 garLoopResultBuilder]: For program point L243(lines 243 249) no Hoare annotation was computed. [2021-12-14 16:20:55,826 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 214) no Hoare annotation was computed. [2021-12-14 16:20:55,826 INFO L854 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 (= ~M_E~0 2))) (or (and .cse0 (<= 2 ~E_1~0) .cse1 (<= 2 ~E_M~0) .cse2 (= ~m_st~0 0) .cse3 (<= ~t1_pc~0 0) .cse4 .cse5 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse6) (and .cse0 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse1 .cse2 (<= 2 ~m_st~0) .cse3 (not (= ~E_M~0 0)) .cse4 .cse5 .cse6))) [2021-12-14 16:20:55,826 INFO L854 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) (<= 2 ~E_M~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) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~M_E~0 2)) [2021-12-14 16:20:55,826 INFO L854 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))) [2021-12-14 16:20:55,827 INFO L858 garLoopResultBuilder]: For program point L640-1(line 640) no Hoare annotation was computed. [2021-12-14 16:20:55,827 INFO L854 garLoopResultBuilder]: At program point L211(lines 206 260) the Hoare annotation is: false [2021-12-14 16:20:55,827 INFO L854 garLoopResultBuilder]: At program point L443(lines 418 458) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse7 .cse8 .cse4 .cse6))) [2021-12-14 16:20:55,827 INFO L854 garLoopResultBuilder]: At program point L179(lines 156 200) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (<= ~c_dr_pc~0 1)) (.cse3 (<= 1 ~p_dw_pc~0)) (.cse4 (not (= ~E_M~0 0))) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~c_dr_pc~0 0) .cse5) (and .cse0 .cse1 .cse2 (<= 1 ~c_dr_pc~0) .cse6 (< 1 ~p_dw_pc~0) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse6 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse3 .cse4 .cse5))) [2021-12-14 16:20:55,827 INFO L858 garLoopResultBuilder]: For program point L939(lines 939 943) no Hoare annotation was computed. [2021-12-14 16:20:55,827 INFO L858 garLoopResultBuilder]: For program point L939-2(lines 938 961) no Hoare annotation was computed. [2021-12-14 16:20:55,827 INFO L854 garLoopResultBuilder]: At program point L378-1(lines 369 386) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse7 .cse8 .cse4 .cse6))) [2021-12-14 16:20:55,827 INFO L858 garLoopResultBuilder]: For program point L1039(lines 1039 1043) no Hoare annotation was computed. [2021-12-14 16:20:55,827 INFO L854 garLoopResultBuilder]: At program point L511(line 511) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse7 .cse8 .cse4 .cse6))) [2021-12-14 16:20:55,828 INFO L854 garLoopResultBuilder]: At program point L511-1(line 511) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse7 .cse8 .cse4 .cse6))) [2021-12-14 16:20:55,828 INFO L854 garLoopResultBuilder]: At program point L247(line 247) the Hoare annotation is: false [2021-12-14 16:20:55,828 INFO L854 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))) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~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)) (.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 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse14 .cse2 .cse12 .cse4 (not (= ~E_M~0 0)) .cse7 .cse8))) [2021-12-14 16:20:55,828 INFO L854 garLoopResultBuilder]: At program point L512(line 512) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse7 .cse8 .cse4 .cse6))) [2021-12-14 16:20:55,828 INFO L858 garLoopResultBuilder]: For program point L281(lines 281 285) no Hoare annotation was computed. [2021-12-14 16:20:55,828 INFO L858 garLoopResultBuilder]: For program point L281-2(lines 280 293) no Hoare annotation was computed. [2021-12-14 16:20:55,828 INFO L858 garLoopResultBuilder]: For program point L1008(line 1008) no Hoare annotation was computed. [2021-12-14 16:20:55,828 INFO L854 garLoopResultBuilder]: At program point L678-1(lines 666 697) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse10 (= ~m_st~0 0)) (.cse5 (<= 2 ~T1_E~0)) (.cse8 (not (= ~t1_st~0 0))) (.cse9 (or (< 1 ~m_pc~0) (<= ~m_pc~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)) (.cse11 (not (= ~E_M~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 .cse9 .cse1 .cse2 .cse10 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 (<= (+ ~local~0 1) ~token~0) .cse6 .cse7 (< ~token~0 (+ 2 ~local~0)) .cse8) (and .cse9 .cse2 .cse3 .cse4 .cse11 .cse6 .cse7))) [2021-12-14 16:20:55,829 INFO L854 garLoopResultBuilder]: At program point L513(line 513) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse7 .cse8 .cse4 .cse6))) [2021-12-14 16:20:55,829 INFO L854 garLoopResultBuilder]: At program point L480(lines 469 482) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse7 .cse8 .cse4 .cse6))) [2021-12-14 16:20:55,829 INFO L858 garLoopResultBuilder]: For program point L447(lines 447 454) no Hoare annotation was computed. [2021-12-14 16:20:55,829 INFO L858 garLoopResultBuilder]: For program point L679(line 679) no Hoare annotation was computed. [2021-12-14 16:20:55,829 INFO L854 garLoopResultBuilder]: At program point L481(lines 465 483) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse7 .cse8 .cse4 .cse6))) [2021-12-14 16:20:55,829 INFO L858 garLoopResultBuilder]: For program point L944-1(lines 938 961) no Hoare annotation was computed. [2021-12-14 16:20:55,829 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-14 16:20:55,829 INFO L854 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))) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~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)) (.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 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse14 .cse2 .cse12 .cse4 (not (= ~E_M~0 0)) .cse7 .cse8))) [2021-12-14 16:20:55,829 INFO L854 garLoopResultBuilder]: At program point L648-1(lines 622 661) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse8 (not (= ~t1_st~0 0))) (.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))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ ~local~0 1) ~token~0) .cse6 .cse7 (< ~token~0 (+ 2 ~local~0)) .cse8) (and .cse0 .cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .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)))) [2021-12-14 16:20:55,830 INFO L858 garLoopResultBuilder]: For program point L516(line 516) no Hoare annotation was computed. [2021-12-14 16:20:55,830 INFO L854 garLoopResultBuilder]: At program point L252(line 252) the Hoare annotation is: false [2021-12-14 16:20:55,830 INFO L858 garLoopResultBuilder]: For program point L219(line 219) no Hoare annotation was computed. [2021-12-14 16:20:55,830 INFO L854 garLoopResultBuilder]: At program point L252-1(lines 206 260) the Hoare annotation is: (let ((.cse5 (= ~p_dw_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (not (= ~E_M~0 0))) (.cse4 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 (<= 1 ~p_dw_pc~0) .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse2 (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1) .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse3 .cse4))) [2021-12-14 16:20:55,830 INFO L861 garLoopResultBuilder]: At program point L1045(lines 992 1050) the Hoare annotation is: true [2021-12-14 16:20:55,830 INFO L854 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))) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~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)) (.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 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse14 .cse2 .cse12 .cse4 (not (= ~E_M~0 0)) .cse7 .cse8))) [2021-12-14 16:20:55,830 INFO L858 garLoopResultBuilder]: For program point L979-1(line 979) no Hoare annotation was computed. [2021-12-14 16:20:55,830 INFO L854 garLoopResultBuilder]: At program point L286-1(lines 277 294) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) (= ~m_pc~0 ~t1_pc~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (not (= ~E_M~0 0)) (= ~c_dr_pc~0 0) (= ~M_E~0 2)) [2021-12-14 16:20:55,830 INFO L858 garLoopResultBuilder]: For program point L749(lines 749 753) no Hoare annotation was computed. [2021-12-14 16:20:55,831 INFO L858 garLoopResultBuilder]: For program point L749-2(lines 748 761) no Hoare annotation was computed. [2021-12-14 16:20:55,831 INFO L858 garLoopResultBuilder]: For program point L518(lines 518 527) no Hoare annotation was computed. [2021-12-14 16:20:55,831 INFO L858 garLoopResultBuilder]: For program point L518-2(lines 518 527) no Hoare annotation was computed. [2021-12-14 16:20:55,831 INFO L854 garLoopResultBuilder]: At program point L419(line 419) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse7 .cse8 .cse4 .cse6))) [2021-12-14 16:20:55,831 INFO L858 garLoopResultBuilder]: For program point L981(lines 981 986) no Hoare annotation was computed. [2021-12-14 16:20:55,831 INFO L858 garLoopResultBuilder]: For program point L816(lines 816 823) no Hoare annotation was computed. [2021-12-14 16:20:55,831 INFO L854 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))) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~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)) (.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 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse14 .cse2 .cse12 .cse4 (not (= ~E_M~0 0)) .cse7 .cse8))) [2021-12-14 16:20:55,831 INFO L858 garLoopResultBuilder]: For program point L1015-1(line 1015) no Hoare annotation was computed. [2021-12-14 16:20:55,831 INFO L858 garLoopResultBuilder]: For program point L949-1(lines 938 961) no Hoare annotation was computed. [2021-12-14 16:20:55,831 INFO L858 garLoopResultBuilder]: For program point L421(line 421) no Hoare annotation was computed. [2021-12-14 16:20:55,832 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-14 16:20:55,832 INFO L854 garLoopResultBuilder]: At program point L256(lines 203 261) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (<= 1 ~c_dr_pc~0)) (.cse4 (<= ~c_dr_pc~0 1)) (.cse5 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ~p_dw_pc~0) .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-12-14 16:20:55,832 INFO L858 garLoopResultBuilder]: For program point L157(lines 157 169) no Hoare annotation was computed. [2021-12-14 16:20:55,832 INFO L854 garLoopResultBuilder]: At program point L522(line 522) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse7 .cse8 .cse4 .cse6))) [2021-12-14 16:20:55,832 INFO L858 garLoopResultBuilder]: For program point L522-1(line 522) no Hoare annotation was computed. [2021-12-14 16:20:55,832 INFO L858 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2021-12-14 16:20:55,832 INFO L858 garLoopResultBuilder]: For program point L423-1(lines 418 458) no Hoare annotation was computed. [2021-12-14 16:20:55,832 INFO L858 garLoopResultBuilder]: For program point L357(lines 357 364) no Hoare annotation was computed. [2021-12-14 16:20:55,832 INFO L854 garLoopResultBuilder]: At program point L357-2(lines 353 368) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse7 .cse8 .cse4 .cse6))) [2021-12-14 16:20:55,833 INFO L854 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 (= ~M_E~0 2))) (or (and .cse0 (<= 2 ~E_1~0) .cse1 (<= 2 ~E_M~0) .cse2 (= ~m_st~0 0) .cse3 (<= ~t1_pc~0 0) .cse4 .cse5 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse6) (and .cse0 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse1 .cse2 (<= 2 ~m_st~0) .cse3 (not (= ~E_M~0 0)) .cse4 .cse5 .cse6))) [2021-12-14 16:20:55,833 INFO L854 garLoopResultBuilder]: At program point L688(line 688) the Hoare annotation is: (let ((.cse0 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse1 (<= 2 ~m_st~0)) (.cse2 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse3 (not (= ~E_M~0 0))) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (= ~c_dr_pc~0 0))) (or (and (or (<= ~m_pc~0 0) (and (<= ~t1_pc~0 1) (< 1 ~m_pc~0))) .cse0 .cse1 .cse2 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse3 .cse4 .cse5) (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) .cse0 .cse1 .cse2 (<= 2 ~T1_E~0) (<= (+ ~local~0 1) ~token~0) .cse3 .cse4 .cse5 (< ~token~0 (+ 2 ~local~0)) (not (= ~t1_st~0 0))))) [2021-12-14 16:20:55,833 INFO L858 garLoopResultBuilder]: For program point L688-1(line 688) no Hoare annotation was computed. [2021-12-14 16:20:55,833 INFO L858 garLoopResultBuilder]: For program point L226-1(lines 226 236) no Hoare annotation was computed. [2021-12-14 16:20:55,833 INFO L858 garLoopResultBuilder]: For program point L160(lines 160 168) no Hoare annotation was computed. [2021-12-14 16:20:55,833 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-14 16:20:55,833 INFO L854 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))) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~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)) (.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 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse14 .cse2 .cse12 .cse4 (not (= ~E_M~0 0)) .cse7 .cse8))) [2021-12-14 16:20:55,833 INFO L854 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))) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~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)) (.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 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse14 .cse2 .cse12 .cse4 (not (= ~E_M~0 0)) .cse7 .cse8))) [2021-12-14 16:20:55,834 INFO L854 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))) [2021-12-14 16:20:55,834 INFO L858 garLoopResultBuilder]: For program point L623(lines 623 631) no Hoare annotation was computed. [2021-12-14 16:20:55,834 INFO L854 garLoopResultBuilder]: At program point L161(lines 156 200) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (<= 1 ~p_dw_pc~0)) (.cse4 (not (= ~E_M~0 0))) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~c_dr_pc~0 0) .cse5) (and .cse0 .cse1 .cse2 (<= ~c_dr_pc~0 1) (= ~c_dr_pc~0 ~p_dw_pc~0) .cse3 .cse4 .cse5))) [2021-12-14 16:20:55,834 INFO L854 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))) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~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)) (.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 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse14 .cse2 .cse12 .cse4 (not (= ~E_M~0 0)) .cse7 .cse8))) [2021-12-14 16:20:55,834 INFO L854 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))) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~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)) (.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 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse14 .cse2 .cse12 .cse4 (not (= ~E_M~0 0)) .cse7 .cse8))) [2021-12-14 16:20:55,834 INFO L854 garLoopResultBuilder]: At program point L492(line 492) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) (= ~m_pc~0 ~t1_pc~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (not (= ~E_M~0 0)) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~M_E~0 2)) [2021-12-14 16:20:55,834 INFO L858 garLoopResultBuilder]: For program point L492-1(line 492) no Hoare annotation was computed. [2021-12-14 16:20:55,834 INFO L854 garLoopResultBuilder]: At program point L459(lines 412 464) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse7 .cse8 .cse4 .cse6))) [2021-12-14 16:20:55,835 INFO L854 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))) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~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)) (.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 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse14 .cse2 .cse12 .cse4 (not (= ~E_M~0 0)) .cse7 .cse8))) [2021-12-14 16:20:55,835 INFO L854 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))) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~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)) (.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 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse14 .cse2 .cse12 .cse4 (not (= ~E_M~0 0)) .cse7 .cse8))) [2021-12-14 16:20:55,835 INFO L854 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))) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~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)) (.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 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse14 .cse2 .cse12 .cse4 (not (= ~E_M~0 0)) .cse7 .cse8))) [2021-12-14 16:20:55,835 INFO L854 garLoopResultBuilder]: At program point L559(lines 543 561) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) (= ~m_pc~0 ~t1_pc~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (not (= ~E_M~0 0)) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~M_E~0 2)) [2021-12-14 16:20:55,835 INFO L854 garLoopResultBuilder]: At program point L196(lines 153 201) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (<= ~c_dr_pc~0 1)) (.cse3 (<= 1 ~p_dw_pc~0)) (.cse4 (not (= ~E_M~0 0))) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~c_dr_pc~0 0) .cse5) (and .cse0 .cse1 .cse2 (<= 1 ~c_dr_pc~0) .cse6 (< 1 ~p_dw_pc~0) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse6 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse3 .cse4 .cse5))) [2021-12-14 16:20:55,835 INFO L858 garLoopResultBuilder]: For program point L163(lines 163 167) no Hoare annotation was computed. [2021-12-14 16:20:55,835 INFO L854 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))) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~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)) (.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 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse14 .cse2 .cse12 .cse4 (not (= ~E_M~0 0)) .cse7 .cse8))) [2021-12-14 16:20:55,836 INFO L854 garLoopResultBuilder]: At program point L692(lines 663 698) the Hoare annotation is: (let ((.cse2 (<= 2 ~m_st~0)) (.cse6 (= ~t1_pc~0 1)) (.cse7 (<= 2 ~E_1~0)) (.cse0 (or (<= ~m_pc~0 0) (and (<= ~t1_pc~0 1) (< 1 ~m_pc~0)))) (.cse8 (<= 2 ~E_M~0)) (.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse11 (= ~m_st~0 0)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse9 (<= 2 ~T1_E~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) (not (= ~E_M~0 0)) .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse10) (and .cse6 .cse7 .cse8 .cse1 .cse11 .cse3 .cse9 (<= (+ ~local~0 1) ~token~0) .cse4 .cse5 (< ~token~0 (+ 2 ~local~0)) .cse10) (and .cse6 .cse7 .cse0 .cse8 .cse1 .cse11 .cse3 .cse9 .cse4 .cse5 .cse10 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0)))) [2021-12-14 16:20:55,836 INFO L858 garLoopResultBuilder]: For program point L626(lines 626 630) no Hoare annotation was computed. [2021-12-14 16:20:55,836 INFO L854 garLoopResultBuilder]: At program point L494(line 494) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) (= ~m_pc~0 ~t1_pc~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (not (= ~E_M~0 0)) (= ~c_dr_pc~0 0) (= ~M_E~0 2)) [2021-12-14 16:20:55,836 INFO L854 garLoopResultBuilder]: At program point L494-1(line 494) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) (= ~m_pc~0 ~t1_pc~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (not (= ~E_M~0 0)) (= ~c_dr_pc~0 0) (= ~M_E~0 2)) [2021-12-14 16:20:55,836 INFO L858 garLoopResultBuilder]: For program point L428(lines 418 458) no Hoare annotation was computed. [2021-12-14 16:20:55,836 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-14 16:20:55,836 INFO L858 garLoopResultBuilder]: For program point L792(line 792) no Hoare annotation was computed. [2021-12-14 16:20:55,836 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 599) no Hoare annotation was computed. [2021-12-14 16:20:55,836 INFO L854 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))) [2021-12-14 16:20:55,837 INFO L854 garLoopResultBuilder]: At program point L495(line 495) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) (= ~m_pc~0 ~t1_pc~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (not (= ~E_M~0 0)) (= ~c_dr_pc~0 0) (= ~M_E~0 2)) [2021-12-14 16:20:55,837 INFO L858 garLoopResultBuilder]: For program point L1024(line 1024) no Hoare annotation was computed. [2021-12-14 16:20:55,837 INFO L858 garLoopResultBuilder]: For program point L794(lines 794 798) no Hoare annotation was computed. [2021-12-14 16:20:55,837 INFO L858 garLoopResultBuilder]: For program point L794-1(lines 789 827) no Hoare annotation was computed. [2021-12-14 16:20:55,837 INFO L858 garLoopResultBuilder]: For program point L1026(lines 1026 1035) no Hoare annotation was computed. [2021-12-14 16:20:55,837 INFO L854 garLoopResultBuilder]: At program point L95(lines 73 97) the Hoare annotation is: (let ((.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (not (= ~q_read_ev~0 2))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))) (.cse3 (not (= ~p_dw_pc~0 0))) (.cse4 (= ~E_M~0 0)) (.cse9 (not (<= ~c_dr_pc~0 1))) (.cse6 (not (= ~T1_E~0 ~M_E~0))) (.cse10 (not (<= 1 ~c_dr_pc~0))) (.cse7 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse5) .cse6 .cse7) (or .cse0 .cse1 (not (= ~c_dr_pc~0 0)) .cse2 .cse4 (not (< 1 ~p_dw_pc~0)) .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse5 .cse2 .cse4 .cse9 .cse6 .cse10 .cse7 (not (<= 1 ~p_dw_pc~0)) .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse6 .cse10 .cse7))) [2021-12-14 16:20:55,837 INFO L858 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2021-12-14 16:20:55,837 INFO L858 garLoopResultBuilder]: For program point L84-1(lines 84 93) no Hoare annotation was computed. [2021-12-14 16:20:55,837 INFO L858 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 70 98) no Hoare annotation was computed. [2021-12-14 16:20:55,837 INFO L858 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 70 98) no Hoare annotation was computed. [2021-12-14 16:20:55,838 INFO L858 garLoopResultBuilder]: For program point L75(lines 75 80) no Hoare annotation was computed. [2021-12-14 16:20:55,838 INFO L858 garLoopResultBuilder]: For program point L74(lines 74 83) no Hoare annotation was computed. [2021-12-14 16:20:55,838 INFO L858 garLoopResultBuilder]: For program point L74-2(lines 73 97) no Hoare annotation was computed. [2021-12-14 16:20:55,838 INFO L861 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 70 98) the Hoare annotation is: true [2021-12-14 16:20:55,838 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread1FINAL(lines 295 314) no Hoare annotation was computed. [2021-12-14 16:20:55,838 INFO L861 garLoopResultBuilder]: At program point L311(lines 298 313) the Hoare annotation is: true [2021-12-14 16:20:55,838 INFO L861 garLoopResultBuilder]: At program point exists_runnable_thread1ENTRY(lines 295 314) the Hoare annotation is: true [2021-12-14 16:20:55,838 INFO L858 garLoopResultBuilder]: For program point L303(lines 303 308) no Hoare annotation was computed. [2021-12-14 16:20:55,838 INFO L858 garLoopResultBuilder]: For program point L299(lines 299 309) no Hoare annotation was computed. [2021-12-14 16:20:55,838 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 295 314) no Hoare annotation was computed. [2021-12-14 16:20:55,839 INFO L861 garLoopResultBuilder]: At program point error1ENTRY(lines 23 30) the Hoare annotation is: true [2021-12-14 16:20:55,839 INFO L858 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2021-12-14 16:20:55,839 INFO L858 garLoopResultBuilder]: For program point error1FINAL(lines 23 30) no Hoare annotation was computed. [2021-12-14 16:20:55,839 INFO L858 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2021-12-14 16:20:55,839 INFO L858 garLoopResultBuilder]: For program point L767(lines 767 777) no Hoare annotation was computed. [2021-12-14 16:20:55,839 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread2FINAL(lines 763 782) no Hoare annotation was computed. [2021-12-14 16:20:55,839 INFO L861 garLoopResultBuilder]: At program point exists_runnable_thread2ENTRY(lines 763 782) the Hoare annotation is: true [2021-12-14 16:20:55,839 INFO L861 garLoopResultBuilder]: At program point L779(lines 766 781) the Hoare annotation is: true [2021-12-14 16:20:55,839 INFO L858 garLoopResultBuilder]: For program point L771(lines 771 776) no Hoare annotation was computed. [2021-12-14 16:20:55,839 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 763 782) no Hoare annotation was computed. [2021-12-14 16:20:55,840 INFO L858 garLoopResultBuilder]: For program point L337-1(lines 336 349) no Hoare annotation was computed. [2021-12-14 16:20:55,840 INFO L854 garLoopResultBuilder]: At program point reset_delta_events1ENTRY(lines 333 350) the Hoare annotation is: (let ((.cse4 (not (<= ~c_dr_pc~0 1))) (.cse6 (not (<= 1 ~c_dr_pc~0))) (.cse8 (not (<= 1 ~p_dw_pc~0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse9 (not (= ~p_dw_pc~0 0))) (.cse2 (= ~E_M~0 0)) (.cse3 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse5 (not (= ~T1_E~0 ~M_E~0))) (.cse7 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 (not (= ~c_dr_pc~0 0)) .cse2 .cse3 .cse5 .cse7 .cse8) (or .cse0 .cse1 .cse9 .cse2 .cse3 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse5 .cse7))) [2021-12-14 16:20:55,840 INFO L858 garLoopResultBuilder]: For program point L342-1(lines 333 350) no Hoare annotation was computed. [2021-12-14 16:20:55,840 INFO L858 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 333 350) no Hoare annotation was computed. [2021-12-14 16:20:55,840 INFO L858 garLoopResultBuilder]: For program point L866-1(lines 865 888) no Hoare annotation was computed. [2021-12-14 16:20:55,840 INFO L858 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 862 889) no Hoare annotation was computed. [2021-12-14 16:20:55,840 INFO L854 garLoopResultBuilder]: At program point reset_delta_events2ENTRY(lines 862 889) the Hoare annotation is: (let ((.cse14 (not (<= ~t1_pc~0 0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse1 (not (= ~p_dw_st~0 0))) (.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))) (.cse15 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~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 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse12 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10 .cse11) (or .cse0 .cse1 .cse12 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10) (or .cse0 .cse1 (= |old(~E_M~0)| 0) .cse3 .cse6 .cse8 .cse10 .cse15) (or .cse1 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10 .cse11 .cse15))) [2021-12-14 16:20:55,840 INFO L858 garLoopResultBuilder]: For program point L881-1(lines 862 889) no Hoare annotation was computed. [2021-12-14 16:20:55,841 INFO L858 garLoopResultBuilder]: For program point L876-1(lines 865 888) no Hoare annotation was computed. [2021-12-14 16:20:55,841 INFO L858 garLoopResultBuilder]: For program point L871-1(lines 865 888) no Hoare annotation was computed. [2021-12-14 16:20:55,843 INFO L732 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] [2021-12-14 16:20:55,844 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 16:20:55,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 04:20:55 BoogieIcfgContainer [2021-12-14 16:20:55,891 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 16:20:55,892 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 16:20:55,892 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 16:20:55,892 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 16:20:55,892 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:20:01" (3/4) ... [2021-12-14 16:20:55,894 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-14 16:20:55,898 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2021-12-14 16:20:55,898 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2021-12-14 16:20:55,898 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2021-12-14 16:20:55,899 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2021-12-14 16:20:55,899 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2021-12-14 16:20:55,899 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2021-12-14 16:20:55,899 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2021-12-14 16:20:55,899 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2021-12-14 16:20:55,899 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2021-12-14 16:20:55,899 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2021-12-14 16:20:55,899 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2021-12-14 16:20:55,899 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2021-12-14 16:20:55,899 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2021-12-14 16:20:55,899 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2021-12-14 16:20:55,910 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2021-12-14 16:20:55,912 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-12-14 16:20:55,912 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-14 16:20:55,913 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-14 16:20:55,933 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)) || !(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)) || E_M == 0) || !(token < 2 + local)) || !(local + 1 <= 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)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || E_M == 0) || !(c_dr_pc == p_dw_pc)) || (!(1 < m_pc) && !(m_pc <= 0))) [2021-12-14 16:20:55,933 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)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || E_M == 0) || !(c_dr_pc == p_dw_pc)) || (!(1 < m_pc) && !(m_pc <= 0)))) && ((((((((((((!(p_dw_st == 0) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || E_M == 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)) [2021-12-14 16:20:55,939 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 <= 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_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 && (1 < m_pc || m_pc <= 0)) && \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) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1))) && ((((((((((((1 < m_pc || m_pc <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && !(E_M == 0)) && c_dr_pc == 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || E_M == 0) || !(c_dr_pc == p_dw_pc)) || (!(1 < m_pc) && !(m_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)) || ((((((((((m_pc <= 0 || (t1_pc <= 1 && 1 < m_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) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1))) && (((((((((((((((((1 < m_pc || m_pc <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && !(E_M == 0)) && c_dr_pc == 0) || !(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))) && ((((((((((((!(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) || !(M_E == 2)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || E_M == 0) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && \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) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1))) && (((((((((((((!(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)) || (__retres1 <= 0 && 0 <= __retres1)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(2 <= E_1))) && ((((((((((((((!(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)) || E_M == 0) || !(token < 2 + local)) || (__retres1 <= 0 && 0 <= __retres1)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && \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) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 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)) || ((((((((((m_pc <= 0 || (t1_pc <= 1 && 1 < m_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) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1))) && (((((((((((((!(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)) || E_M == 0) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && \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) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 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)) || E_M == 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)) || ((((((((((m_pc <= 0 || (t1_pc <= 1 && 1 < m_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) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1)) [2021-12-14 16:20:55,940 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(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) || !(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)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && (((((((((((((((((1 < m_pc || m_pc <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && !(E_M == 0)) && c_dr_pc == 0) || !(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))) && ((((((((((((1 < m_pc || m_pc <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && !(E_M == 0)) && c_dr_pc == 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || E_M == 0) || !(c_dr_pc == p_dw_pc)) || (!(1 < m_pc) && !(m_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)) || E_M == 0) || !(token < 2 + local)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && \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) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 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)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || ((((((((((m_pc <= 0 || (t1_pc <= 1 && 1 < m_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) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(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) && \result <= 0) && 0 <= \result)) || ((((((((((m_pc <= 0 || (t1_pc <= 1 && 1 < m_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) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1))) && ((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || E_M == 0) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && \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) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 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)) || E_M == 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)) || ((((((((((m_pc <= 0 || (t1_pc <= 1 && 1 < m_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) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1))) && ((((((((((!(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_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)) || E_M == 0) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && \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) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 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))) && (((((((((((((!(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 && (1 < m_pc || m_pc <= 0)) && \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) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result)) [2021-12-14 16:20:55,987 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 16:20:55,987 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 16:20:55,987 INFO L158 Benchmark]: Toolchain (without parser) took 55269.74ms. Allocated memory was 102.8MB in the beginning and 824.2MB in the end (delta: 721.4MB). Free memory was 74.2MB in the beginning and 590.4MB in the end (delta: -516.2MB). Peak memory consumption was 204.5MB. Max. memory is 16.1GB. [2021-12-14 16:20:55,987 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 102.8MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 16:20:55,988 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.58ms. Allocated memory is still 102.8MB. Free memory was 73.9MB in the beginning and 73.7MB in the end (delta: 284.7kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 16:20:55,988 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.57ms. Allocated memory is still 102.8MB. Free memory was 73.7MB in the beginning and 70.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 16:20:55,988 INFO L158 Benchmark]: Boogie Preprocessor took 46.56ms. Allocated memory is still 102.8MB. Free memory was 70.8MB in the beginning and 68.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 16:20:55,989 INFO L158 Benchmark]: RCFGBuilder took 640.12ms. Allocated memory was 102.8MB in the beginning and 130.0MB in the end (delta: 27.3MB). Free memory was 68.7MB in the beginning and 98.3MB in the end (delta: -29.6MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2021-12-14 16:20:55,990 INFO L158 Benchmark]: TraceAbstraction took 54141.64ms. Allocated memory was 130.0MB in the beginning and 824.2MB in the end (delta: 694.2MB). Free memory was 97.5MB in the beginning and 605.1MB in the end (delta: -507.6MB). Peak memory consumption was 501.7MB. Max. memory is 16.1GB. [2021-12-14 16:20:55,990 INFO L158 Benchmark]: Witness Printer took 95.36ms. Allocated memory is still 824.2MB. Free memory was 605.1MB in the beginning and 590.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-14 16:20:55,995 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.19ms. Allocated memory is still 102.8MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.58ms. Allocated memory is still 102.8MB. Free memory was 73.9MB in the beginning and 73.7MB in the end (delta: 284.7kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.57ms. Allocated memory is still 102.8MB. Free memory was 73.7MB in the beginning and 70.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.56ms. Allocated memory is still 102.8MB. Free memory was 70.8MB in the beginning and 68.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 640.12ms. Allocated memory was 102.8MB in the beginning and 130.0MB in the end (delta: 27.3MB). Free memory was 68.7MB in the beginning and 98.3MB in the end (delta: -29.6MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * TraceAbstraction took 54141.64ms. Allocated memory was 130.0MB in the beginning and 824.2MB in the end (delta: 694.2MB). Free memory was 97.5MB in the beginning and 605.1MB in the end (delta: -507.6MB). Peak memory consumption was 501.7MB. Max. memory is 16.1GB. * Witness Printer took 95.36ms. Allocated memory is still 824.2MB. Free memory was 605.1MB in the beginning and 590.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. 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: 54.1s, OverallIterations: 24, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 36.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10828 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10534 mSDsluCounter, 18484 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12070 mSDsCounter, 2583 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9761 IncrementalHoareTripleChecker+Invalid, 12344 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2583 mSolverCounterUnsat, 6414 mSDtfsCounter, 9761 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1773 GetRequests, 1483 SyntacticMatches, 3 SemanticMatches, 287 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2737occurred in iteration=13, InterpolantAutomatonStates: 252, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 2362 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 89 LocationsWithAnnotation, 6105 PreInvPairs, 8466 NumberOfFragments, 13340 HoareAnnotationTreeSize, 6105 FomulaSimplifications, 27809 FormulaSimplificationTreeSizeReduction, 13.9s HoareSimplificationTime, 89 FomulaSimplificationsInter, 1005469 FormulaSimplificationTreeSizeReductionInter, 22.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 3234 NumberOfCodeBlocks, 3234 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 3202 ConstructedInterpolants, 0 QuantifiedInterpolants, 5802 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: ((((((((((m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc)) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && c_dr_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))) || (((((((((((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))) || ((((((((((((t1_pc == 1 && 2 <= E_1) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && 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_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) && (1 < m_pc || m_pc <= 0)) && 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_st == 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) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && !(t1_st == 0))) || (((((((1 < m_pc || m_pc <= 0) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: ((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2) || (((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && 1 <= p_dw_pc) && !(E_M == 0)) && M_E == 2)) || ((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2)) || (((((((p_dw_pc == 0 && T1_E == M_E) && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && !(E_M == 0)) && M_E == 2) - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: ((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2) || (((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && 1 <= p_dw_pc) && !(E_M == 0)) && M_E == 2)) || ((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2)) || (((((((p_dw_pc == 0 && T1_E == M_E) && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && !(E_M == 0)) && M_E == 2) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: (((((((((!(m_pc == t1_pc) || !(M_E == 2)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_pc == 0)) || E_M == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || (!(1 < m_pc) && !(m_pc <= 0))) && ((((((((!(m_pc == t1_pc) || !(M_E == 2)) || !(c_dr_pc == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || E_M == 0) || !(1 < p_dw_pc)) || !(T1_E == M_E)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(q_read_ev == 2))) && ((((((((((!(m_pc == t1_pc) || !(M_E == 2)) || c_dr_pc == p_dw_pc) || (__retres1 <= 0 && 0 <= __retres1)) || E_M == 0) || !(c_dr_pc <= 1)) || !(T1_E == M_E)) || !(1 <= c_dr_pc)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(1 <= p_dw_pc)) || !(q_read_ev == 2))) && ((((((((!(m_pc == t1_pc) || !(M_E == 2)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_pc == 0)) || E_M == 0) || !(c_dr_pc <= 1)) || !(T1_E == M_E)) || !(1 <= c_dr_pc)) || (!(1 < m_pc) && !(m_pc <= 0))) - InvariantResult [Line: 496]: Loop Invariant Derived loop invariant: ((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2) || (((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && 1 <= p_dw_pc) && !(E_M == 0)) && M_E == 2)) || ((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2)) || (((((((p_dw_pc == 0 && T1_E == M_E) && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && !(E_M == 0)) && 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) && (1 < m_pc || m_pc <= 0)) && 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_st == 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) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && !(t1_st == 0))) || (((((((1 < m_pc || m_pc <= 0) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0) - InvariantResult [Line: 543]: Loop Invariant Derived loop invariant: ((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && q_write_ev == q_read_ev) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && 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)) || !(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)) || E_M == 0) || !(token < 2 + local)) || !(local + 1 <= 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)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || E_M == 0) || !(c_dr_pc == p_dw_pc)) || (!(1 < m_pc) && !(m_pc <= 0))) - 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)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || E_M == 0) || !(c_dr_pc == p_dw_pc)) || (!(1 < m_pc) && !(m_pc <= 0)))) && ((((((((((((!(p_dw_st == 0) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || E_M == 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 && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2) || (((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && c_dr_pc <= 1) && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && M_E == 2) - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: ((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2) || (((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && 1 <= p_dw_pc) && !(E_M == 0)) && M_E == 2)) || ((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2)) || (((((((p_dw_pc == 0 && T1_E == M_E) && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && !(E_M == 0)) && 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) && 2 <= E_M) && 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) && token <= local) && local <= token) && M_E == 2) || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0) && 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) && (1 < m_pc || m_pc <= 0)) && 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_st == 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) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && !(t1_st == 0))) || (((((((1 < m_pc || m_pc <= 0) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0) - InvariantResult [Line: 469]: Loop Invariant Derived loop invariant: ((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2) || (((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && 1 <= p_dw_pc) && !(E_M == 0)) && M_E == 2)) || ((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2)) || (((((((p_dw_pc == 0 && T1_E == M_E) && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && !(E_M == 0)) && 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 <= 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_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 && (1 < m_pc || m_pc <= 0)) && \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) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1))) && ((((((((((((1 < m_pc || m_pc <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && !(E_M == 0)) && c_dr_pc == 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || E_M == 0) || !(c_dr_pc == p_dw_pc)) || (!(1 < m_pc) && !(m_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)) || ((((((((((m_pc <= 0 || (t1_pc <= 1 && 1 < m_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) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1))) && (((((((((((((((((1 < m_pc || m_pc <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && !(E_M == 0)) && c_dr_pc == 0) || !(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))) && ((((((((((((!(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) || !(M_E == 2)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || E_M == 0) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && \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) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1))) && (((((((((((((!(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)) || (__retres1 <= 0 && 0 <= __retres1)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(2 <= E_1))) && ((((((((((((((!(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)) || E_M == 0) || !(token < 2 + local)) || (__retres1 <= 0 && 0 <= __retres1)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && \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) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 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)) || ((((((((((m_pc <= 0 || (t1_pc <= 1 && 1 < m_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) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1))) && (((((((((((((!(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)) || E_M == 0) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && \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) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 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)) || E_M == 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)) || ((((((((((m_pc <= 0 || (t1_pc <= 1 && 1 < m_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) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1)) - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 666]: Loop Invariant Derived loop invariant: ((((((((m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc)) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && c_dr_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 && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && 1 <= p_dw_pc) && !(E_M == 0)) && M_E == 2) || (((((((p_dw_pc == 0 && T1_E == M_E) && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && !(E_M == 0)) && M_E == 2) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && M_E == 2) || (((((p_dw_pc == 0 && T1_E == M_E) && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && !(E_M == 0)) && M_E == 2)) && c_dr_pc <= 1) && c_dr_pc == p_dw_pc) || ((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2)) || ((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && M_E == 2) || (((((p_dw_pc == 0 && T1_E == M_E) && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && !(E_M == 0)) && M_E == 2)) && 1 <= c_dr_pc) && c_dr_pc <= 1) - 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)) || (((((((((t1_pc == 1 && 2 <= E_1) && (1 < m_pc || m_pc <= 0)) && 2 <= E_M) && q_write_ev == q_read_ev) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && !(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) - InvariantResult [Line: 963]: Loop Invariant Derived loop invariant: (((((((((((T1_E == M_E && 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) && p_dw_st == 0) && c_dr_pc == 0) && 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) && (1 < m_pc || m_pc <= 0)) && 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_st == 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) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && !(t1_st == 0))) || (((((((1 < m_pc || m_pc <= 0) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 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) && (1 < m_pc || m_pc <= 0)) && 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_st == 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) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && !(t1_st == 0))) || (((((((1 < m_pc || m_pc <= 0) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2) || (((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && 1 < p_dw_pc) && !(E_M == 0)) && M_E == 2)) || (((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && c_dr_pc <= 1) && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && M_E == 2) - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: ((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2) || (((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && 1 <= p_dw_pc) && !(E_M == 0)) && M_E == 2)) || ((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2)) || (((((((p_dw_pc == 0 && T1_E == M_E) && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && !(E_M == 0)) && M_E == 2) - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: (((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2 - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: ((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2) || (((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && 1 <= p_dw_pc) && !(E_M == 0)) && M_E == 2)) || ((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2)) || (((((((p_dw_pc == 0 && T1_E == M_E) && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && !(E_M == 0)) && M_E == 2) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((((((!(m_pc == t1_pc) || !(M_E == 2)) || !(c_dr_pc == 0)) || E_M == 0) || !(T1_E == M_E)) || (__retres1 <= 0 && 0 <= __retres1)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(1 <= p_dw_pc)) && (((((((!(m_pc == t1_pc) || !(M_E == 2)) || !(p_dw_pc == 0)) || E_M == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || (__retres1 <= 0 && 0 <= __retres1)) || (!(1 < m_pc) && !(m_pc <= 0))) - InvariantResult [Line: 718]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(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) || !(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)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && (((((((((((((((((1 < m_pc || m_pc <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && !(E_M == 0)) && c_dr_pc == 0) || !(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))) && ((((((((((((1 < m_pc || m_pc <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && !(E_M == 0)) && c_dr_pc == 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || E_M == 0) || !(c_dr_pc == p_dw_pc)) || (!(1 < m_pc) && !(m_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)) || E_M == 0) || !(token < 2 + local)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && \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) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 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)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || ((((((((((m_pc <= 0 || (t1_pc <= 1 && 1 < m_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) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(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) && \result <= 0) && 0 <= \result)) || ((((((((((m_pc <= 0 || (t1_pc <= 1 && 1 < m_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) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1))) && ((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || E_M == 0) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && \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) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 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)) || E_M == 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)) || ((((((((((m_pc <= 0 || (t1_pc <= 1 && 1 < m_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) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1))) && ((((((((((!(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_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)) || E_M == 0) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && \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) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 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))) && (((((((((((((!(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 && (1 < m_pc || m_pc <= 0)) && \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) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result)) - 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) && (1 < m_pc || m_pc <= 0)) && 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_st == 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) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && !(t1_st == 0))) || (((((((1 < m_pc || m_pc <= 0) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2) || (((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && 1 < p_dw_pc) && !(E_M == 0)) && M_E == 2)) || (((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && c_dr_pc <= 1) && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && 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 && (1 < m_pc || m_pc <= 0)) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0)) && token <= local) && local <= token)) || ((((((((((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 < m_pc || m_pc <= 0) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 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) && (1 < m_pc || m_pc <= 0)) && 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_st == 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) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && !(t1_st == 0))) || (((((((1 < m_pc || m_pc <= 0) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: ((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && M_E == 2) || (((((((p_dw_pc == 0 && T1_E == M_E) && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && !(E_M == 0)) && M_E == 2)) || ((((((p_dw_pc == 0 && T1_E == M_E) && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && M_E == 2) RESULT: Ultimate proved your program to be correct! [2021-12-14 16:20:56,060 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