./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f24e14c02d3357f8669328b41c4b37af446f7269afa24af78cb772dc24fa0c01 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 12:46:57,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:46:57,005 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:46:57,044 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:46:57,045 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:46:57,048 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:46:57,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:46:57,054 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:46:57,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:46:57,060 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:46:57,061 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:46:57,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:46:57,063 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:46:57,068 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:46:57,069 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:46:57,071 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:46:57,072 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:46:57,074 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:46:57,076 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:46:57,080 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:46:57,082 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:46:57,083 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:46:57,086 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:46:57,087 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:46:57,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:46:57,097 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:46:57,098 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:46:57,098 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:46:57,100 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:46:57,101 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:46:57,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:46:57,102 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:46:57,104 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:46:57,105 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:46:57,107 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:46:57,107 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:46:57,108 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:46:57,108 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:46:57,108 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:46:57,109 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:46:57,110 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:46:57,111 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 12:46:57,150 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:46:57,150 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:46:57,151 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:46:57,151 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:46:57,152 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:46:57,152 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:46:57,153 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:46:57,153 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:46:57,153 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:46:57,153 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:46:57,154 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:46:57,155 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:46:57,155 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:46:57,155 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:46:57,155 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:46:57,155 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:46:57,156 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:46:57,156 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:46:57,156 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:46:57,156 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:46:57,156 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:46:57,157 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:46:57,157 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:46:57,157 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:46:57,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:46:57,158 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:46:57,159 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:46:57,159 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:46:57,160 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:46:57,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:46:57,160 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:46:57,160 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:46:57,161 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:46:57,161 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f24e14c02d3357f8669328b41c4b37af446f7269afa24af78cb772dc24fa0c01 [2022-11-16 12:46:57,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:46:57,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:46:57,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:46:57,450 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:46:57,451 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:46:57,452 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2022-11-16 12:46:57,521 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/data/b167bffbe/f99fdbbf2d2d403c832faa5e68e782b4/FLAGcdfcfdc53 [2022-11-16 12:46:58,026 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:46:58,027 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2022-11-16 12:46:58,038 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/data/b167bffbe/f99fdbbf2d2d403c832faa5e68e782b4/FLAGcdfcfdc53 [2022-11-16 12:46:58,392 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/data/b167bffbe/f99fdbbf2d2d403c832faa5e68e782b4 [2022-11-16 12:46:58,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:46:58,398 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:46:58,402 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:46:58,402 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:46:58,406 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:46:58,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:46:58" (1/1) ... [2022-11-16 12:46:58,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bebd0f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:58, skipping insertion in model container [2022-11-16 12:46:58,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:46:58" (1/1) ... [2022-11-16 12:46:58,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:46:58,473 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:46:58,645 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2022-11-16 12:46:58,690 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2022-11-16 12:46:58,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:46:58,729 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:46:58,741 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2022-11-16 12:46:58,770 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2022-11-16 12:46:58,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:46:58,825 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:46:58,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:58 WrapperNode [2022-11-16 12:46:58,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:46:58,827 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:46:58,827 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:46:58,827 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:46:58,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:58" (1/1) ... [2022-11-16 12:46:58,844 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:58" (1/1) ... [2022-11-16 12:46:58,875 INFO L138 Inliner]: procedures = 55, calls = 60, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 402 [2022-11-16 12:46:58,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:46:58,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:46:58,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:46:58,877 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:46:58,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:58" (1/1) ... [2022-11-16 12:46:58,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:58" (1/1) ... [2022-11-16 12:46:58,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:58" (1/1) ... [2022-11-16 12:46:58,890 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:58" (1/1) ... [2022-11-16 12:46:58,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:58" (1/1) ... [2022-11-16 12:46:58,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:58" (1/1) ... [2022-11-16 12:46:58,925 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:58" (1/1) ... [2022-11-16 12:46:58,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:58" (1/1) ... [2022-11-16 12:46:58,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:46:58,931 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:46:58,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:46:58,932 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:46:58,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:58" (1/1) ... [2022-11-16 12:46:58,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:46:58,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:58,963 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:46:58,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:46:58,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:46:58,999 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-16 12:46:58,999 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-16 12:46:58,999 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-11-16 12:46:58,999 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-11-16 12:46:58,999 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-11-16 12:46:59,000 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-11-16 12:46:59,000 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-11-16 12:46:59,000 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-11-16 12:46:59,000 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-11-16 12:46:59,000 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-11-16 12:46:59,001 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-11-16 12:46:59,001 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-11-16 12:46:59,001 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-11-16 12:46:59,001 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-11-16 12:46:59,001 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-11-16 12:46:59,001 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-11-16 12:46:59,002 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-11-16 12:46:59,002 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-11-16 12:46:59,002 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-11-16 12:46:59,002 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-11-16 12:46:59,002 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-11-16 12:46:59,002 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-11-16 12:46:59,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:46:59,003 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-11-16 12:46:59,003 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-11-16 12:46:59,003 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-11-16 12:46:59,003 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-11-16 12:46:59,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:46:59,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:46:59,004 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-11-16 12:46:59,004 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-11-16 12:46:59,140 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:46:59,142 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:46:59,715 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:46:59,724 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:46:59,724 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2022-11-16 12:46:59,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:46:59 BoogieIcfgContainer [2022-11-16 12:46:59,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:46:59,734 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:46:59,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:46:59,738 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:46:59,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:46:58" (1/3) ... [2022-11-16 12:46:59,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb7c303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:46:59, skipping insertion in model container [2022-11-16 12:46:59,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:58" (2/3) ... [2022-11-16 12:46:59,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb7c303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:46:59, skipping insertion in model container [2022-11-16 12:46:59,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:46:59" (3/3) ... [2022-11-16 12:46:59,744 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2022-11-16 12:46:59,764 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:46:59,764 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 12:46:59,852 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:46:59,870 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6f402369, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:46:59,870 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-16 12:46:59,875 INFO L276 IsEmpty]: Start isEmpty. Operand has 208 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 168 states have internal predecessors, (248), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-11-16 12:46:59,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-16 12:46:59,886 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:59,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:59,887 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:59,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:59,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1497674214, now seen corresponding path program 1 times [2022-11-16 12:46:59,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:59,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188838180] [2022-11-16 12:46:59,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:59,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:00,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:47:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:00,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:47:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:00,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:47:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:00,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:47:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:00,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:47:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:00,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:00,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188838180] [2022-11-16 12:47:00,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188838180] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:00,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:00,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:47:00,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526699793] [2022-11-16 12:47:00,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:00,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:47:00,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:00,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:47:00,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:47:00,411 INFO L87 Difference]: Start difference. First operand has 208 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 168 states have internal predecessors, (248), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 12:47:01,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:01,396 INFO L93 Difference]: Finished difference Result 530 states and 790 transitions. [2022-11-16 12:47:01,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:47:01,398 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-11-16 12:47:01,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:01,412 INFO L225 Difference]: With dead ends: 530 [2022-11-16 12:47:01,412 INFO L226 Difference]: Without dead ends: 329 [2022-11-16 12:47:01,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:47:01,420 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 524 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:01,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 641 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-16 12:47:01,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-11-16 12:47:01,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 288. [2022-11-16 12:47:01,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 227 states have (on average 1.4317180616740088) internal successors, (325), 232 states have internal predecessors, (325), 39 states have call successors, (39), 20 states have call predecessors, (39), 20 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2022-11-16 12:47:01,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 404 transitions. [2022-11-16 12:47:01,513 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 404 transitions. Word has length 57 [2022-11-16 12:47:01,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:01,514 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 404 transitions. [2022-11-16 12:47:01,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 12:47:01,514 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 404 transitions. [2022-11-16 12:47:01,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-16 12:47:01,519 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:01,520 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:01,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:47:01,521 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:47:01,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:01,524 INFO L85 PathProgramCache]: Analyzing trace with hash -604187876, now seen corresponding path program 1 times [2022-11-16 12:47:01,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:01,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193422341] [2022-11-16 12:47:01,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:01,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:01,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:47:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:01,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:47:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:01,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:47:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:01,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:47:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:01,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:47:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:01,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:01,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:01,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193422341] [2022-11-16 12:47:01,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193422341] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:01,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:01,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:47:01,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337608076] [2022-11-16 12:47:01,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:01,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:47:01,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:01,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:47:01,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:47:01,794 INFO L87 Difference]: Start difference. First operand 288 states and 404 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 12:47:02,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:02,739 INFO L93 Difference]: Finished difference Result 620 states and 878 transitions. [2022-11-16 12:47:02,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:47:02,739 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-11-16 12:47:02,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:02,752 INFO L225 Difference]: With dead ends: 620 [2022-11-16 12:47:02,753 INFO L226 Difference]: Without dead ends: 437 [2022-11-16 12:47:02,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-16 12:47:02,762 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 505 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:02,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 910 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 12:47:02,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-11-16 12:47:02,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 373. [2022-11-16 12:47:02,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 295 states have (on average 1.423728813559322) internal successors, (420), 301 states have internal predecessors, (420), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-11-16 12:47:02,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 521 transitions. [2022-11-16 12:47:02,842 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 521 transitions. Word has length 57 [2022-11-16 12:47:02,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:02,842 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 521 transitions. [2022-11-16 12:47:02,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 12:47:02,843 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 521 transitions. [2022-11-16 12:47:02,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-16 12:47:02,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:02,853 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:02,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:47:02,853 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:47:02,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:02,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1641391578, now seen corresponding path program 1 times [2022-11-16 12:47:02,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:02,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634346761] [2022-11-16 12:47:02,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:02,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:02,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:47:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:02,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:47:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:03,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:47:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:03,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:47:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:03,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:47:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:03,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:03,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:03,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634346761] [2022-11-16 12:47:03,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634346761] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:03,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:03,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:47:03,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659744448] [2022-11-16 12:47:03,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:03,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:47:03,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:03,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:47:03,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:47:03,024 INFO L87 Difference]: Start difference. First operand 373 states and 521 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 12:47:03,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:03,568 INFO L93 Difference]: Finished difference Result 703 states and 997 transitions. [2022-11-16 12:47:03,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:47:03,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-11-16 12:47:03,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:03,575 INFO L225 Difference]: With dead ends: 703 [2022-11-16 12:47:03,575 INFO L226 Difference]: Without dead ends: 435 [2022-11-16 12:47:03,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:47:03,583 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 452 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:03,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 594 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:47:03,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-11-16 12:47:03,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 373. [2022-11-16 12:47:03,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 295 states have (on average 1.4135593220338982) internal successors, (417), 301 states have internal predecessors, (417), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-11-16 12:47:03,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 518 transitions. [2022-11-16 12:47:03,639 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 518 transitions. Word has length 57 [2022-11-16 12:47:03,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:03,640 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 518 transitions. [2022-11-16 12:47:03,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 12:47:03,640 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 518 transitions. [2022-11-16 12:47:03,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-16 12:47:03,641 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:03,642 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:03,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:47:03,642 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:47:03,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:03,643 INFO L85 PathProgramCache]: Analyzing trace with hash 743998300, now seen corresponding path program 1 times [2022-11-16 12:47:03,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:03,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870399114] [2022-11-16 12:47:03,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:03,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:03,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:47:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:03,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:47:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:03,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:47:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:03,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:47:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:03,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:47:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:03,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:03,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:03,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870399114] [2022-11-16 12:47:03,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870399114] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:03,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:03,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:47:03,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342916388] [2022-11-16 12:47:03,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:03,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:47:03,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:03,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:47:03,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:47:03,820 INFO L87 Difference]: Start difference. First operand 373 states and 518 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 12:47:04,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:04,595 INFO L93 Difference]: Finished difference Result 739 states and 1054 transitions. [2022-11-16 12:47:04,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:47:04,599 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-11-16 12:47:04,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:04,603 INFO L225 Difference]: With dead ends: 739 [2022-11-16 12:47:04,603 INFO L226 Difference]: Without dead ends: 472 [2022-11-16 12:47:04,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:47:04,605 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 272 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:04,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 834 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 12:47:04,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-11-16 12:47:04,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 382. [2022-11-16 12:47:04,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 304 states have (on average 1.4013157894736843) internal successors, (426), 310 states have internal predecessors, (426), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-11-16 12:47:04,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 527 transitions. [2022-11-16 12:47:04,649 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 527 transitions. Word has length 57 [2022-11-16 12:47:04,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:04,649 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 527 transitions. [2022-11-16 12:47:04,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 12:47:04,650 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 527 transitions. [2022-11-16 12:47:04,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-16 12:47:04,651 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:04,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:04,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:47:04,652 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:47:04,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:04,652 INFO L85 PathProgramCache]: Analyzing trace with hash 671611742, now seen corresponding path program 1 times [2022-11-16 12:47:04,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:04,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582654164] [2022-11-16 12:47:04,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:04,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:04,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:47:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:04,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:47:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:04,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:47:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:04,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:47:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:04,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:47:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:04,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:04,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:04,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582654164] [2022-11-16 12:47:04,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582654164] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:04,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:04,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:47:04,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751226950] [2022-11-16 12:47:04,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:04,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:47:04,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:04,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:47:04,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:47:04,785 INFO L87 Difference]: Start difference. First operand 382 states and 527 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 12:47:06,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:06,295 INFO L93 Difference]: Finished difference Result 1537 states and 2220 transitions. [2022-11-16 12:47:06,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 12:47:06,296 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-11-16 12:47:06,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:06,303 INFO L225 Difference]: With dead ends: 1537 [2022-11-16 12:47:06,303 INFO L226 Difference]: Without dead ends: 1261 [2022-11-16 12:47:06,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-11-16 12:47:06,306 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 967 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:06,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 800 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-16 12:47:06,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2022-11-16 12:47:06,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1090. [2022-11-16 12:47:06,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 865 states have (on average 1.3734104046242774) internal successors, (1188), 886 states have internal predecessors, (1188), 136 states have call successors, (136), 80 states have call predecessors, (136), 87 states have return successors, (187), 126 states have call predecessors, (187), 134 states have call successors, (187) [2022-11-16 12:47:06,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1511 transitions. [2022-11-16 12:47:06,410 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1511 transitions. Word has length 57 [2022-11-16 12:47:06,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:06,410 INFO L495 AbstractCegarLoop]: Abstraction has 1090 states and 1511 transitions. [2022-11-16 12:47:06,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 12:47:06,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1511 transitions. [2022-11-16 12:47:06,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-16 12:47:06,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:06,412 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:06,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:47:06,413 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:47:06,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:06,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1385451018, now seen corresponding path program 1 times [2022-11-16 12:47:06,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:06,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120113452] [2022-11-16 12:47:06,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:06,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:06,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:47:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:06,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:47:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:06,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:47:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:06,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:47:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:06,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:47:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:06,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:47:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:06,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:47:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:06,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:06,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:06,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120113452] [2022-11-16 12:47:06,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120113452] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:06,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:06,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:47:06,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964893531] [2022-11-16 12:47:06,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:06,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:47:06,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:06,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:47:06,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:47:06,535 INFO L87 Difference]: Start difference. First operand 1090 states and 1511 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-16 12:47:07,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:07,434 INFO L93 Difference]: Finished difference Result 1313 states and 1826 transitions. [2022-11-16 12:47:07,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:47:07,435 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-11-16 12:47:07,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:07,441 INFO L225 Difference]: With dead ends: 1313 [2022-11-16 12:47:07,442 INFO L226 Difference]: Without dead ends: 1225 [2022-11-16 12:47:07,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-11-16 12:47:07,445 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 545 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:07,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 798 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 12:47:07,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2022-11-16 12:47:07,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1186. [2022-11-16 12:47:07,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 941 states have (on average 1.3740701381509033) internal successors, (1293), 964 states have internal predecessors, (1293), 147 states have call successors, (147), 87 states have call predecessors, (147), 96 states have return successors, (203), 138 states have call predecessors, (203), 145 states have call successors, (203) [2022-11-16 12:47:07,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1643 transitions. [2022-11-16 12:47:07,576 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1643 transitions. Word has length 65 [2022-11-16 12:47:07,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:07,576 INFO L495 AbstractCegarLoop]: Abstraction has 1186 states and 1643 transitions. [2022-11-16 12:47:07,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-16 12:47:07,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1643 transitions. [2022-11-16 12:47:07,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-16 12:47:07,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:07,579 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:07,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:47:07,579 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:47:07,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:07,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1789236969, now seen corresponding path program 1 times [2022-11-16 12:47:07,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:07,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815635276] [2022-11-16 12:47:07,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:07,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:07,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:47:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:07,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:47:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:07,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:47:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:07,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:47:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:07,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:47:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:07,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:47:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:07,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:47:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:07,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:07,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:07,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815635276] [2022-11-16 12:47:07,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815635276] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:07,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:07,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:47:07,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892653928] [2022-11-16 12:47:07,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:07,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:47:07,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:07,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:47:07,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:47:07,760 INFO L87 Difference]: Start difference. First operand 1186 states and 1643 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-16 12:47:08,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:08,766 INFO L93 Difference]: Finished difference Result 1533 states and 2120 transitions. [2022-11-16 12:47:08,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 12:47:08,766 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-11-16 12:47:08,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:08,773 INFO L225 Difference]: With dead ends: 1533 [2022-11-16 12:47:08,773 INFO L226 Difference]: Without dead ends: 1356 [2022-11-16 12:47:08,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-11-16 12:47:08,775 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 712 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:08,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 929 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 12:47:08,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2022-11-16 12:47:08,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1282. [2022-11-16 12:47:08,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1017 states have (on average 1.3736479842674534) internal successors, (1397), 1042 states have internal predecessors, (1397), 158 states have call successors, (158), 94 states have call predecessors, (158), 105 states have return successors, (222), 150 states have call predecessors, (222), 156 states have call successors, (222) [2022-11-16 12:47:08,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1777 transitions. [2022-11-16 12:47:08,901 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1777 transitions. Word has length 65 [2022-11-16 12:47:08,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:08,901 INFO L495 AbstractCegarLoop]: Abstraction has 1282 states and 1777 transitions. [2022-11-16 12:47:08,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-16 12:47:08,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1777 transitions. [2022-11-16 12:47:08,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-16 12:47:08,903 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:08,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:08,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:47:08,904 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:47:08,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:08,905 INFO L85 PathProgramCache]: Analyzing trace with hash -239349141, now seen corresponding path program 1 times [2022-11-16 12:47:08,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:08,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856221416] [2022-11-16 12:47:08,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:08,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:08,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:47:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:08,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:47:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:08,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:47:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:09,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:47:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:09,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:47:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:09,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:47:09,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:09,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:47:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:09,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:09,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:09,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856221416] [2022-11-16 12:47:09,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856221416] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:09,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:09,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:47:09,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430470297] [2022-11-16 12:47:09,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:09,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:47:09,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:09,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:47:09,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:47:09,081 INFO L87 Difference]: Start difference. First operand 1282 states and 1777 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-16 12:47:09,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:09,959 INFO L93 Difference]: Finished difference Result 1583 states and 2191 transitions. [2022-11-16 12:47:09,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:47:09,960 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-11-16 12:47:09,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:09,967 INFO L225 Difference]: With dead ends: 1583 [2022-11-16 12:47:09,968 INFO L226 Difference]: Without dead ends: 1316 [2022-11-16 12:47:09,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-16 12:47:09,970 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 312 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:09,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 991 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 12:47:09,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2022-11-16 12:47:10,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1287. [2022-11-16 12:47:10,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1021 states have (on average 1.3702252693437806) internal successors, (1399), 1046 states have internal predecessors, (1399), 158 states have call successors, (158), 94 states have call predecessors, (158), 106 states have return successors, (223), 151 states have call predecessors, (223), 156 states have call successors, (223) [2022-11-16 12:47:10,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1780 transitions. [2022-11-16 12:47:10,111 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1780 transitions. Word has length 65 [2022-11-16 12:47:10,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:10,112 INFO L495 AbstractCegarLoop]: Abstraction has 1287 states and 1780 transitions. [2022-11-16 12:47:10,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-16 12:47:10,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1780 transitions. [2022-11-16 12:47:10,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-16 12:47:10,115 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:10,115 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:10,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:47:10,115 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:47:10,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:10,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1268708439, now seen corresponding path program 1 times [2022-11-16 12:47:10,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:10,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254326521] [2022-11-16 12:47:10,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:10,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:10,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:47:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:10,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:47:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:10,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:47:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:10,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:47:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:10,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:47:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:10,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:47:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:10,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:47:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:10,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:10,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:10,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254326521] [2022-11-16 12:47:10,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254326521] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:10,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:10,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:47:10,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168232905] [2022-11-16 12:47:10,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:10,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:47:10,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:10,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:47:10,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:47:10,310 INFO L87 Difference]: Start difference. First operand 1287 states and 1780 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-16 12:47:12,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:12,450 INFO L93 Difference]: Finished difference Result 2949 states and 4052 transitions. [2022-11-16 12:47:12,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-16 12:47:12,451 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-11-16 12:47:12,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:12,464 INFO L225 Difference]: With dead ends: 2949 [2022-11-16 12:47:12,465 INFO L226 Difference]: Without dead ends: 2677 [2022-11-16 12:47:12,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2022-11-16 12:47:12,470 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 1369 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 392 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1387 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 392 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:12,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1387 Valid, 1303 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [392 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-16 12:47:12,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2677 states. [2022-11-16 12:47:12,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2677 to 2427. [2022-11-16 12:47:12,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2427 states, 1921 states have (on average 1.3430504945340969) internal successors, (2580), 1966 states have internal predecessors, (2580), 275 states have call successors, (275), 196 states have call predecessors, (275), 229 states have return successors, (409), 269 states have call predecessors, (409), 273 states have call successors, (409) [2022-11-16 12:47:12,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 3264 transitions. [2022-11-16 12:47:12,809 INFO L78 Accepts]: Start accepts. Automaton has 2427 states and 3264 transitions. Word has length 65 [2022-11-16 12:47:12,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:12,809 INFO L495 AbstractCegarLoop]: Abstraction has 2427 states and 3264 transitions. [2022-11-16 12:47:12,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-16 12:47:12,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 3264 transitions. [2022-11-16 12:47:12,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-16 12:47:12,812 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:12,812 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:12,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:47:12,812 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:47:12,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:12,813 INFO L85 PathProgramCache]: Analyzing trace with hash -217259350, now seen corresponding path program 1 times [2022-11-16 12:47:12,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:12,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694987628] [2022-11-16 12:47:12,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:12,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:12,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:47:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:12,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:47:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:12,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:47:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:12,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:47:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:12,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:47:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:12,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:47:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:12,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:47:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:12,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:12,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:12,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694987628] [2022-11-16 12:47:12,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694987628] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:12,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:12,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:47:12,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051437204] [2022-11-16 12:47:12,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:12,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:47:12,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:12,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:47:12,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:47:12,957 INFO L87 Difference]: Start difference. First operand 2427 states and 3264 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-16 12:47:13,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:13,914 INFO L93 Difference]: Finished difference Result 4028 states and 5388 transitions. [2022-11-16 12:47:13,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:47:13,914 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-11-16 12:47:13,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:13,927 INFO L225 Difference]: With dead ends: 4028 [2022-11-16 12:47:13,927 INFO L226 Difference]: Without dead ends: 2616 [2022-11-16 12:47:13,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-11-16 12:47:13,932 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 212 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:13,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1107 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 12:47:13,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2616 states. [2022-11-16 12:47:14,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2616 to 2472. [2022-11-16 12:47:14,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2472 states, 1957 states have (on average 1.3321410321921308) internal successors, (2607), 2002 states have internal predecessors, (2607), 275 states have call successors, (275), 196 states have call predecessors, (275), 238 states have return successors, (421), 278 states have call predecessors, (421), 273 states have call successors, (421) [2022-11-16 12:47:14,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3303 transitions. [2022-11-16 12:47:14,234 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3303 transitions. Word has length 65 [2022-11-16 12:47:14,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:14,235 INFO L495 AbstractCegarLoop]: Abstraction has 2472 states and 3303 transitions. [2022-11-16 12:47:14,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-16 12:47:14,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3303 transitions. [2022-11-16 12:47:14,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-16 12:47:14,237 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:14,237 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:14,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:47:14,238 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:47:14,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:14,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1168944044, now seen corresponding path program 1 times [2022-11-16 12:47:14,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:14,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872407323] [2022-11-16 12:47:14,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:14,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:14,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:47:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:14,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:47:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:14,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:47:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:14,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:47:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:14,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:47:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:14,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:47:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:14,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:47:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:14,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:14,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:14,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872407323] [2022-11-16 12:47:14,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872407323] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:14,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:14,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:47:14,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654734971] [2022-11-16 12:47:14,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:14,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:47:14,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:14,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:47:14,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:47:14,397 INFO L87 Difference]: Start difference. First operand 2472 states and 3303 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-16 12:47:15,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:15,507 INFO L93 Difference]: Finished difference Result 3907 states and 5142 transitions. [2022-11-16 12:47:15,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 12:47:15,507 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-11-16 12:47:15,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:15,518 INFO L225 Difference]: With dead ends: 3907 [2022-11-16 12:47:15,519 INFO L226 Difference]: Without dead ends: 2670 [2022-11-16 12:47:15,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-11-16 12:47:15,522 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 685 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:15,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 702 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 12:47:15,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2022-11-16 12:47:15,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2450. [2022-11-16 12:47:15,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2450 states, 1943 states have (on average 1.3293875450334534) internal successors, (2583), 1982 states have internal predecessors, (2583), 275 states have call successors, (275), 196 states have call predecessors, (275), 230 states have return successors, (405), 276 states have call predecessors, (405), 273 states have call successors, (405) [2022-11-16 12:47:15,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 3263 transitions. [2022-11-16 12:47:15,788 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 3263 transitions. Word has length 65 [2022-11-16 12:47:15,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:15,788 INFO L495 AbstractCegarLoop]: Abstraction has 2450 states and 3263 transitions. [2022-11-16 12:47:15,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-16 12:47:15,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 3263 transitions. [2022-11-16 12:47:15,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-16 12:47:15,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:15,790 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:15,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 12:47:15,791 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:47:15,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:15,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1034930538, now seen corresponding path program 1 times [2022-11-16 12:47:15,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:15,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248981633] [2022-11-16 12:47:15,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:15,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:15,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:47:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:15,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:47:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:15,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:47:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:15,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:47:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:15,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:47:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:15,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:47:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:15,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:47:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:15,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:15,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:15,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248981633] [2022-11-16 12:47:15,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248981633] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:15,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:15,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:47:15,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926824245] [2022-11-16 12:47:15,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:15,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:47:15,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:15,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:47:15,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:47:15,879 INFO L87 Difference]: Start difference. First operand 2450 states and 3263 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-16 12:47:16,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:16,804 INFO L93 Difference]: Finished difference Result 5525 states and 7242 transitions. [2022-11-16 12:47:16,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:47:16,805 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-11-16 12:47:16,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:16,823 INFO L225 Difference]: With dead ends: 5525 [2022-11-16 12:47:16,823 INFO L226 Difference]: Without dead ends: 4093 [2022-11-16 12:47:16,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:47:16,829 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 659 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:16,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 566 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:47:16,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4093 states. [2022-11-16 12:47:17,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4093 to 3821. [2022-11-16 12:47:17,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3821 states, 3009 states have (on average 1.296111665004985) internal successors, (3900), 3069 states have internal predecessors, (3900), 427 states have call successors, (427), 319 states have call predecessors, (427), 383 states have return successors, (677), 440 states have call predecessors, (677), 425 states have call successors, (677) [2022-11-16 12:47:17,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3821 states to 3821 states and 5004 transitions. [2022-11-16 12:47:17,327 INFO L78 Accepts]: Start accepts. Automaton has 3821 states and 5004 transitions. Word has length 65 [2022-11-16 12:47:17,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:17,327 INFO L495 AbstractCegarLoop]: Abstraction has 3821 states and 5004 transitions. [2022-11-16 12:47:17,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-16 12:47:17,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3821 states and 5004 transitions. [2022-11-16 12:47:17,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-16 12:47:17,329 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:17,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:17,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 12:47:17,330 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:47:17,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:17,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1593552473, now seen corresponding path program 1 times [2022-11-16 12:47:17,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:17,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773874240] [2022-11-16 12:47:17,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:17,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:17,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:47:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:17,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:47:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:17,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:47:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:17,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:47:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:17,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:47:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:17,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:47:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:17,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:47:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:17,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:17,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:17,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773874240] [2022-11-16 12:47:17,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773874240] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:17,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:17,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:47:17,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473199284] [2022-11-16 12:47:17,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:17,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:47:17,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:17,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:47:17,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:47:17,398 INFO L87 Difference]: Start difference. First operand 3821 states and 5004 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-16 12:47:18,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:18,518 INFO L93 Difference]: Finished difference Result 8839 states and 11518 transitions. [2022-11-16 12:47:18,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:47:18,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-11-16 12:47:18,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:18,543 INFO L225 Difference]: With dead ends: 8839 [2022-11-16 12:47:18,543 INFO L226 Difference]: Without dead ends: 6015 [2022-11-16 12:47:18,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:47:18,552 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 388 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:18,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 678 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:47:18,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6015 states. [2022-11-16 12:47:19,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6015 to 5499. [2022-11-16 12:47:19,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5499 states, 4294 states have (on average 1.2808570097810899) internal successors, (5500), 4361 states have internal predecessors, (5500), 621 states have call successors, (621), 493 states have call predecessors, (621), 582 states have return successors, (998), 652 states have call predecessors, (998), 619 states have call successors, (998) [2022-11-16 12:47:19,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5499 states to 5499 states and 7119 transitions. [2022-11-16 12:47:19,293 INFO L78 Accepts]: Start accepts. Automaton has 5499 states and 7119 transitions. Word has length 66 [2022-11-16 12:47:19,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:19,294 INFO L495 AbstractCegarLoop]: Abstraction has 5499 states and 7119 transitions. [2022-11-16 12:47:19,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-16 12:47:19,296 INFO L276 IsEmpty]: Start isEmpty. Operand 5499 states and 7119 transitions. [2022-11-16 12:47:19,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-16 12:47:19,298 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:19,299 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:19,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 12:47:19,299 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:47:19,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:19,300 INFO L85 PathProgramCache]: Analyzing trace with hash -455119352, now seen corresponding path program 1 times [2022-11-16 12:47:19,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:19,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340740690] [2022-11-16 12:47:19,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:19,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:19,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:19,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:47:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:19,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:47:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:19,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:47:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:19,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:47:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:19,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:47:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:19,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:47:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:19,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:47:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:19,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:19,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:19,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340740690] [2022-11-16 12:47:19,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340740690] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:19,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:19,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:47:19,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425168356] [2022-11-16 12:47:19,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:19,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:47:19,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:19,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:47:19,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:47:19,409 INFO L87 Difference]: Start difference. First operand 5499 states and 7119 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-16 12:47:20,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:20,813 INFO L93 Difference]: Finished difference Result 7129 states and 9121 transitions. [2022-11-16 12:47:20,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:47:20,813 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-11-16 12:47:20,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:20,844 INFO L225 Difference]: With dead ends: 7129 [2022-11-16 12:47:20,845 INFO L226 Difference]: Without dead ends: 7126 [2022-11-16 12:47:20,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:47:20,848 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 932 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:20,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 464 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:47:20,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7126 states. [2022-11-16 12:47:21,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7126 to 6553. [2022-11-16 12:47:21,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6553 states, 5097 states have (on average 1.2693741416519522) internal successors, (6470), 5173 states have internal predecessors, (6470), 747 states have call successors, (747), 607 states have call predecessors, (747), 707 states have return successors, (1191), 780 states have call predecessors, (1191), 746 states have call successors, (1191) [2022-11-16 12:47:21,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6553 states to 6553 states and 8408 transitions. [2022-11-16 12:47:21,564 INFO L78 Accepts]: Start accepts. Automaton has 6553 states and 8408 transitions. Word has length 73 [2022-11-16 12:47:21,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:21,564 INFO L495 AbstractCegarLoop]: Abstraction has 6553 states and 8408 transitions. [2022-11-16 12:47:21,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-16 12:47:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 6553 states and 8408 transitions. [2022-11-16 12:47:21,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-16 12:47:21,567 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:21,567 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:21,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 12:47:21,567 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:47:21,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:21,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1224424688, now seen corresponding path program 1 times [2022-11-16 12:47:21,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:21,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5715682] [2022-11-16 12:47:21,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:21,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:21,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:47:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:21,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:47:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:21,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:47:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:21,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:47:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:21,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:47:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:21,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:47:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:21,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:47:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:21,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:21,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:21,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5715682] [2022-11-16 12:47:21,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5715682] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:47:21,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390403822] [2022-11-16 12:47:21,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:21,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:47:21,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:47:21,718 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:47:21,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:47:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:21,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 12:47:21,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:47:22,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:22,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:47:22,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:22,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390403822] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:47:22,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:47:22,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-11-16 12:47:22,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394846643] [2022-11-16 12:47:22,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:47:22,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:47:22,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:22,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:47:22,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:47:22,523 INFO L87 Difference]: Start difference. First operand 6553 states and 8408 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-11-16 12:47:26,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:26,180 INFO L93 Difference]: Finished difference Result 14199 states and 17936 transitions. [2022-11-16 12:47:26,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-16 12:47:26,180 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2022-11-16 12:47:26,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:26,234 INFO L225 Difference]: With dead ends: 14199 [2022-11-16 12:47:26,234 INFO L226 Difference]: Without dead ends: 14196 [2022-11-16 12:47:26,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2022-11-16 12:47:26,240 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 1243 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1301 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:26,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1301 Valid, 1094 Invalid, 1561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-16 12:47:26,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14196 states. [2022-11-16 12:47:27,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14196 to 11811. [2022-11-16 12:47:27,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11811 states, 9189 states have (on average 1.2600935901621504) internal successors, (11579), 9317 states have internal predecessors, (11579), 1313 states have call successors, (1313), 1097 states have call predecessors, (1313), 1307 states have return successors, (2130), 1404 states have call predecessors, (2130), 1312 states have call successors, (2130) [2022-11-16 12:47:27,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11811 states to 11811 states and 15022 transitions. [2022-11-16 12:47:27,713 INFO L78 Accepts]: Start accepts. Automaton has 11811 states and 15022 transitions. Word has length 74 [2022-11-16 12:47:27,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:27,714 INFO L495 AbstractCegarLoop]: Abstraction has 11811 states and 15022 transitions. [2022-11-16 12:47:27,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-11-16 12:47:27,714 INFO L276 IsEmpty]: Start isEmpty. Operand 11811 states and 15022 transitions. [2022-11-16 12:47:27,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-16 12:47:27,717 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:27,717 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:27,728 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:47:27,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-16 12:47:27,923 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:47:27,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:27,923 INFO L85 PathProgramCache]: Analyzing trace with hash -499209592, now seen corresponding path program 2 times [2022-11-16 12:47:27,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:27,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377602901] [2022-11-16 12:47:27,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:27,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:27,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:47:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:27,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:47:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:27,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:47:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:27,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:47:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:27,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:47:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:27,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:47:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:27,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:47:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:27,991 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:27,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:27,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377602901] [2022-11-16 12:47:27,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377602901] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:27,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:27,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:47:27,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099908470] [2022-11-16 12:47:27,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:27,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:47:27,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:27,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:47:27,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:47:27,994 INFO L87 Difference]: Start difference. First operand 11811 states and 15022 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-16 12:47:29,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:29,558 INFO L93 Difference]: Finished difference Result 18354 states and 23364 transitions. [2022-11-16 12:47:29,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:47:29,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2022-11-16 12:47:29,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:29,590 INFO L225 Difference]: With dead ends: 18354 [2022-11-16 12:47:29,590 INFO L226 Difference]: Without dead ends: 8416 [2022-11-16 12:47:29,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:47:29,613 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 432 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:29,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 671 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:47:29,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8416 states. [2022-11-16 12:47:30,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8416 to 7864. [2022-11-16 12:47:30,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7864 states, 6136 states have (on average 1.2416883963494132) internal successors, (7619), 6220 states have internal predecessors, (7619), 880 states have call successors, (880), 721 states have call predecessors, (880), 846 states have return successors, (1349), 930 states have call predecessors, (1349), 879 states have call successors, (1349) [2022-11-16 12:47:30,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7864 states to 7864 states and 9848 transitions. [2022-11-16 12:47:30,890 INFO L78 Accepts]: Start accepts. Automaton has 7864 states and 9848 transitions. Word has length 77 [2022-11-16 12:47:30,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:30,891 INFO L495 AbstractCegarLoop]: Abstraction has 7864 states and 9848 transitions. [2022-11-16 12:47:30,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-16 12:47:30,892 INFO L276 IsEmpty]: Start isEmpty. Operand 7864 states and 9848 transitions. [2022-11-16 12:47:30,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-16 12:47:30,896 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:30,896 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:30,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 12:47:30,897 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:47:30,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:30,897 INFO L85 PathProgramCache]: Analyzing trace with hash 867535010, now seen corresponding path program 1 times [2022-11-16 12:47:30,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:30,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277916379] [2022-11-16 12:47:30,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:30,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:30,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:47:30,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:31,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:47:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:31,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:47:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:31,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:47:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:31,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:47:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:31,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:47:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:31,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:47:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:31,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-16 12:47:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:31,049 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 12:47:31,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:31,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277916379] [2022-11-16 12:47:31,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277916379] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:31,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:31,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:47:31,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354653622] [2022-11-16 12:47:31,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:31,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:47:31,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:31,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:47:31,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:47:31,052 INFO L87 Difference]: Start difference. First operand 7864 states and 9848 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-16 12:47:33,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:33,771 INFO L93 Difference]: Finished difference Result 21738 states and 27065 transitions. [2022-11-16 12:47:33,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 12:47:33,772 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2022-11-16 12:47:33,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:33,826 INFO L225 Difference]: With dead ends: 21738 [2022-11-16 12:47:33,826 INFO L226 Difference]: Without dead ends: 14895 [2022-11-16 12:47:33,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2022-11-16 12:47:33,848 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 775 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:33,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 937 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-16 12:47:33,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14895 states. [2022-11-16 12:47:35,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14895 to 14036. [2022-11-16 12:47:35,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14036 states, 10812 states have (on average 1.212171661117277) internal successors, (13106), 11002 states have internal predecessors, (13106), 1596 states have call successors, (1596), 1325 states have call predecessors, (1596), 1626 states have return successors, (2752), 1722 states have call predecessors, (2752), 1595 states have call successors, (2752) [2022-11-16 12:47:35,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14036 states to 14036 states and 17454 transitions. [2022-11-16 12:47:35,315 INFO L78 Accepts]: Start accepts. Automaton has 14036 states and 17454 transitions. Word has length 84 [2022-11-16 12:47:35,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:35,316 INFO L495 AbstractCegarLoop]: Abstraction has 14036 states and 17454 transitions. [2022-11-16 12:47:35,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-16 12:47:35,316 INFO L276 IsEmpty]: Start isEmpty. Operand 14036 states and 17454 transitions. [2022-11-16 12:47:35,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-16 12:47:35,323 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:35,323 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:35,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 12:47:35,323 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:47:35,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:35,324 INFO L85 PathProgramCache]: Analyzing trace with hash 260386383, now seen corresponding path program 1 times [2022-11-16 12:47:35,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:35,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275415250] [2022-11-16 12:47:35,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:35,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:35,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:47:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:35,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:47:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:35,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:47:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:35,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:47:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:35,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:47:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:35,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:47:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:35,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:47:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:35,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-16 12:47:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:35,445 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-16 12:47:35,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:35,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275415250] [2022-11-16 12:47:35,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275415250] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:47:35,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576049611] [2022-11-16 12:47:35,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:35,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:47:35,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:47:35,447 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:47:35,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:47:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:35,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 12:47:35,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:47:35,603 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 12:47:35,604 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:47:35,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576049611] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:35,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:47:35,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-16 12:47:35,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488208433] [2022-11-16 12:47:35,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:35,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:47:35,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:35,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:47:35,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:47:35,607 INFO L87 Difference]: Start difference. First operand 14036 states and 17454 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-16 12:47:36,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:36,975 INFO L93 Difference]: Finished difference Result 15912 states and 20081 transitions. [2022-11-16 12:47:36,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:47:36,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 92 [2022-11-16 12:47:36,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:37,028 INFO L225 Difference]: With dead ends: 15912 [2022-11-16 12:47:37,029 INFO L226 Difference]: Without dead ends: 14282 [2022-11-16 12:47:37,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:47:37,041 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 113 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:37,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 624 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:47:37,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14282 states. [2022-11-16 12:47:39,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14282 to 14282. [2022-11-16 12:47:39,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14282 states, 11010 states have (on average 1.2143505903723888) internal successors, (13370), 11202 states have internal predecessors, (13370), 1624 states have call successors, (1624), 1343 states have call predecessors, (1624), 1646 states have return successors, (2794), 1750 states have call predecessors, (2794), 1623 states have call successors, (2794) [2022-11-16 12:47:39,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14282 states to 14282 states and 17788 transitions. [2022-11-16 12:47:39,077 INFO L78 Accepts]: Start accepts. Automaton has 14282 states and 17788 transitions. Word has length 92 [2022-11-16 12:47:39,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:39,077 INFO L495 AbstractCegarLoop]: Abstraction has 14282 states and 17788 transitions. [2022-11-16 12:47:39,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-16 12:47:39,078 INFO L276 IsEmpty]: Start isEmpty. Operand 14282 states and 17788 transitions. [2022-11-16 12:47:39,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-16 12:47:39,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:39,085 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:39,098 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-16 12:47:39,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 12:47:39,298 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:47:39,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:39,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1083636890, now seen corresponding path program 1 times [2022-11-16 12:47:39,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:39,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7227124] [2022-11-16 12:47:39,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:39,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:39,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:47:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:39,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:47:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:39,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:47:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:39,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:47:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:39,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:47:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:39,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:47:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:39,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:47:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:39,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-16 12:47:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:39,430 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 12:47:39,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:39,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7227124] [2022-11-16 12:47:39,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7227124] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:39,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:39,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:47:39,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146207458] [2022-11-16 12:47:39,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:39,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:47:39,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:39,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:47:39,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:47:39,433 INFO L87 Difference]: Start difference. First operand 14282 states and 17788 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-16 12:47:42,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:42,142 INFO L93 Difference]: Finished difference Result 25156 states and 31107 transitions. [2022-11-16 12:47:42,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 12:47:42,142 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2022-11-16 12:47:42,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:42,183 INFO L225 Difference]: With dead ends: 25156 [2022-11-16 12:47:42,183 INFO L226 Difference]: Without dead ends: 12757 [2022-11-16 12:47:42,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2022-11-16 12:47:42,209 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 1538 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1573 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:42,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1573 Valid, 805 Invalid, 1413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-16 12:47:42,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12757 states. [2022-11-16 12:47:43,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12757 to 11857. [2022-11-16 12:47:43,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11857 states, 9176 states have (on average 1.207606800348736) internal successors, (11081), 9335 states have internal predecessors, (11081), 1325 states have call successors, (1325), 1092 states have call predecessors, (1325), 1354 states have return successors, (2126), 1440 states have call predecessors, (2126), 1324 states have call successors, (2126) [2022-11-16 12:47:43,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11857 states to 11857 states and 14532 transitions. [2022-11-16 12:47:43,424 INFO L78 Accepts]: Start accepts. Automaton has 11857 states and 14532 transitions. Word has length 93 [2022-11-16 12:47:43,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:43,424 INFO L495 AbstractCegarLoop]: Abstraction has 11857 states and 14532 transitions. [2022-11-16 12:47:43,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-16 12:47:43,425 INFO L276 IsEmpty]: Start isEmpty. Operand 11857 states and 14532 transitions. [2022-11-16 12:47:43,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-16 12:47:43,436 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:43,436 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:43,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 12:47:43,437 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:47:43,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:43,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1789084765, now seen corresponding path program 1 times [2022-11-16 12:47:43,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:43,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974453236] [2022-11-16 12:47:43,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:43,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:43,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:47:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:43,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:47:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:43,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:47:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:43,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:47:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:43,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:47:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:43,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:47:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:43,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:47:43,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:43,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-16 12:47:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:43,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:47:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:43,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-16 12:47:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:43,563 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-16 12:47:43,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:43,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974453236] [2022-11-16 12:47:43,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974453236] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:47:43,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611443635] [2022-11-16 12:47:43,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:43,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:47:43,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:47:43,566 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:47:43,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:47:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:43,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 12:47:43,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:47:43,822 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 12:47:43,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:47:43,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611443635] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:43,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:47:43,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-11-16 12:47:43,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708446613] [2022-11-16 12:47:43,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:43,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:47:43,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:43,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:47:43,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:47:43,826 INFO L87 Difference]: Start difference. First operand 11857 states and 14532 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-16 12:47:45,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:45,245 INFO L93 Difference]: Finished difference Result 13574 states and 16943 transitions. [2022-11-16 12:47:45,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:47:45,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 118 [2022-11-16 12:47:45,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:45,286 INFO L225 Difference]: With dead ends: 13574 [2022-11-16 12:47:45,286 INFO L226 Difference]: Without dead ends: 12576 [2022-11-16 12:47:45,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:47:45,295 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 196 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:45,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 406 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:47:45,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12576 states. [2022-11-16 12:47:46,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12576 to 12550. [2022-11-16 12:47:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12550 states, 9734 states have (on average 1.216046846106431) internal successors, (11837), 9902 states have internal predecessors, (11837), 1403 states have call successors, (1403), 1143 states have call predecessors, (1403), 1411 states have return successors, (2230), 1515 states have call predecessors, (2230), 1402 states have call successors, (2230) [2022-11-16 12:47:46,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12550 states to 12550 states and 15470 transitions. [2022-11-16 12:47:46,709 INFO L78 Accepts]: Start accepts. Automaton has 12550 states and 15470 transitions. Word has length 118 [2022-11-16 12:47:46,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:46,709 INFO L495 AbstractCegarLoop]: Abstraction has 12550 states and 15470 transitions. [2022-11-16 12:47:46,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-16 12:47:46,709 INFO L276 IsEmpty]: Start isEmpty. Operand 12550 states and 15470 transitions. [2022-11-16 12:47:46,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-16 12:47:46,722 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:46,722 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:46,728 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:47:46,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:47:46,927 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:47:46,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:46,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2070810004, now seen corresponding path program 1 times [2022-11-16 12:47:46,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:46,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546836775] [2022-11-16 12:47:46,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:46,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:46,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:47:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:47,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:47:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:47,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:47:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:47,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:47:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:47,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:47:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:47,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-16 12:47:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:47,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-16 12:47:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:47,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:47:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:47,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-16 12:47:47,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:47,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:47:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:47,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-16 12:47:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:47,083 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-11-16 12:47:47,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:47,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546836775] [2022-11-16 12:47:47,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546836775] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:47:47,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762131166] [2022-11-16 12:47:47,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:47,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:47:47,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:47:47,086 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:47:47,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:47:47,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:47,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 12:47:47,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:47:47,246 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-16 12:47:47,247 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:47:47,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762131166] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:47,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:47:47,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-16 12:47:47,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854313587] [2022-11-16 12:47:47,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:47,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:47:47,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:47,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:47:47,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:47:47,249 INFO L87 Difference]: Start difference. First operand 12550 states and 15470 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-16 12:47:48,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:48,420 INFO L93 Difference]: Finished difference Result 14780 states and 18580 transitions. [2022-11-16 12:47:48,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:47:48,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 134 [2022-11-16 12:47:48,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:48,455 INFO L225 Difference]: With dead ends: 14780 [2022-11-16 12:47:48,455 INFO L226 Difference]: Without dead ends: 12856 [2022-11-16 12:47:48,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:47:48,467 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 247 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:48,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 294 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:47:48,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12856 states. [2022-11-16 12:47:50,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12856 to 12790. [2022-11-16 12:47:50,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12790 states, 9953 states have (on average 1.2065708831508088) internal successors, (12009), 10118 states have internal predecessors, (12009), 1403 states have call successors, (1403), 1161 states have call predecessors, (1403), 1432 states have return successors, (2224), 1521 states have call predecessors, (2224), 1402 states have call successors, (2224) [2022-11-16 12:47:50,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12790 states to 12790 states and 15636 transitions. [2022-11-16 12:47:50,332 INFO L78 Accepts]: Start accepts. Automaton has 12790 states and 15636 transitions. Word has length 134 [2022-11-16 12:47:50,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:50,333 INFO L495 AbstractCegarLoop]: Abstraction has 12790 states and 15636 transitions. [2022-11-16 12:47:50,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-16 12:47:50,333 INFO L276 IsEmpty]: Start isEmpty. Operand 12790 states and 15636 transitions. [2022-11-16 12:47:50,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-16 12:47:50,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:50,345 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:50,354 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 12:47:50,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:47:50,550 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:47:50,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:50,551 INFO L85 PathProgramCache]: Analyzing trace with hash -931525195, now seen corresponding path program 1 times [2022-11-16 12:47:50,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:50,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468889544] [2022-11-16 12:47:50,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:50,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:50,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:47:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:50,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:47:50,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:50,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:47:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:50,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:47:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:50,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:47:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:50,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-16 12:47:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:50,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-16 12:47:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:50,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:47:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:50,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-16 12:47:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:50,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:47:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:50,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-16 12:47:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-11-16 12:47:50,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:50,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468889544] [2022-11-16 12:47:50,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468889544] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:47:50,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538555583] [2022-11-16 12:47:50,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:50,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:47:50,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:47:50,712 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:47:50,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 12:47:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:50,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 12:47:50,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:47:50,863 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-16 12:47:50,863 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:47:50,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538555583] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:50,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:47:50,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-16 12:47:50,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755972491] [2022-11-16 12:47:50,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:50,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:47:50,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:50,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:47:50,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:47:50,865 INFO L87 Difference]: Start difference. First operand 12790 states and 15636 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-16 12:47:52,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:52,122 INFO L93 Difference]: Finished difference Result 15003 states and 18535 transitions. [2022-11-16 12:47:52,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:47:52,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 134 [2022-11-16 12:47:52,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:52,145 INFO L225 Difference]: With dead ends: 15003 [2022-11-16 12:47:52,146 INFO L226 Difference]: Without dead ends: 12841 [2022-11-16 12:47:52,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:47:52,151 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 247 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:52,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 405 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:47:52,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12841 states. [2022-11-16 12:47:53,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12841 to 12772. [2022-11-16 12:47:53,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12772 states, 9935 states have (on average 1.2015098137896325) internal successors, (11937), 10100 states have internal predecessors, (11937), 1403 states have call successors, (1403), 1161 states have call predecessors, (1403), 1432 states have return successors, (2224), 1521 states have call predecessors, (2224), 1402 states have call successors, (2224) [2022-11-16 12:47:53,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12772 states to 12772 states and 15564 transitions. [2022-11-16 12:47:53,458 INFO L78 Accepts]: Start accepts. Automaton has 12772 states and 15564 transitions. Word has length 134 [2022-11-16 12:47:53,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:53,458 INFO L495 AbstractCegarLoop]: Abstraction has 12772 states and 15564 transitions. [2022-11-16 12:47:53,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-16 12:47:53,459 INFO L276 IsEmpty]: Start isEmpty. Operand 12772 states and 15564 transitions. [2022-11-16 12:47:53,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-16 12:47:53,470 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:53,471 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:53,478 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 12:47:53,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:47:53,678 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:47:53,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:53,679 INFO L85 PathProgramCache]: Analyzing trace with hash -564892461, now seen corresponding path program 1 times [2022-11-16 12:47:53,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:53,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001023431] [2022-11-16 12:47:53,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:53,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:53,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:53,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:47:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:53,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:47:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:53,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:47:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:53,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:47:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:53,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:47:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:53,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 12:47:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:53,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-16 12:47:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:53,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:47:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:53,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-16 12:47:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:53,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:47:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:53,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-16 12:47:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:53,828 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-11-16 12:47:53,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:53,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001023431] [2022-11-16 12:47:53,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001023431] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:47:53,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319756699] [2022-11-16 12:47:53,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:53,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:47:53,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:47:53,830 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:47:53,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 12:47:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:53,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 12:47:53,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:47:54,025 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 12:47:54,026 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:47:54,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319756699] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:54,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:47:54,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-16 12:47:54,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167036292] [2022-11-16 12:47:54,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:54,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:47:54,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:54,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:47:54,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:47:54,028 INFO L87 Difference]: Start difference. First operand 12772 states and 15564 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-16 12:47:55,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:55,267 INFO L93 Difference]: Finished difference Result 13697 states and 16818 transitions. [2022-11-16 12:47:55,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:47:55,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 135 [2022-11-16 12:47:55,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:55,299 INFO L225 Difference]: With dead ends: 13697 [2022-11-16 12:47:55,300 INFO L226 Difference]: Without dead ends: 12606 [2022-11-16 12:47:55,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:47:55,306 INFO L413 NwaCegarLoop]: 369 mSDtfsCounter, 75 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:55,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 623 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:47:55,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12606 states. [2022-11-16 12:47:56,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12606 to 12568. [2022-11-16 12:47:56,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12568 states, 9773 states have (on average 1.1971758927657832) internal successors, (11700), 9936 states have internal predecessors, (11700), 1381 states have call successors, (1381), 1146 states have call predecessors, (1381), 1412 states have return successors, (2184), 1496 states have call predecessors, (2184), 1380 states have call successors, (2184) [2022-11-16 12:47:56,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12568 states to 12568 states and 15265 transitions. [2022-11-16 12:47:56,493 INFO L78 Accepts]: Start accepts. Automaton has 12568 states and 15265 transitions. Word has length 135 [2022-11-16 12:47:56,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:56,493 INFO L495 AbstractCegarLoop]: Abstraction has 12568 states and 15265 transitions. [2022-11-16 12:47:56,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-16 12:47:56,494 INFO L276 IsEmpty]: Start isEmpty. Operand 12568 states and 15265 transitions. [2022-11-16 12:47:56,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-16 12:47:56,505 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:56,506 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:56,515 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-16 12:47:56,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-16 12:47:56,714 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:47:56,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:56,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1386105035, now seen corresponding path program 1 times [2022-11-16 12:47:56,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:56,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311371122] [2022-11-16 12:47:56,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:56,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:56,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:47:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:56,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:47:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:56,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:47:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:56,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:47:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:56,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:47:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:56,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 12:47:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:56,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-16 12:47:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:56,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:47:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:56,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-16 12:47:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:56,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:47:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:56,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-16 12:47:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:56,850 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-16 12:47:56,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:56,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311371122] [2022-11-16 12:47:56,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311371122] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:47:56,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971686277] [2022-11-16 12:47:56,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:56,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:47:56,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:47:56,852 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:47:56,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 12:47:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:56,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 12:47:56,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:47:57,067 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-16 12:47:57,067 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:47:57,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971686277] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:57,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:47:57,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-11-16 12:47:57,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668791259] [2022-11-16 12:47:57,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:57,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:47:57,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:57,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:47:57,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:47:57,069 INFO L87 Difference]: Start difference. First operand 12568 states and 15265 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-16 12:47:58,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:58,684 INFO L93 Difference]: Finished difference Result 13904 states and 16977 transitions. [2022-11-16 12:47:58,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:47:58,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2022-11-16 12:47:58,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:58,717 INFO L225 Difference]: With dead ends: 13904 [2022-11-16 12:47:58,718 INFO L226 Difference]: Without dead ends: 12561 [2022-11-16 12:47:58,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:47:58,725 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 300 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:58,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 394 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:47:58,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12561 states. [2022-11-16 12:47:59,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12561 to 12002. [2022-11-16 12:47:59,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12002 states, 9315 states have (on average 1.191196994095545) internal successors, (11096), 9468 states have internal predecessors, (11096), 1323 states have call successors, (1323), 1103 states have call predecessors, (1323), 1362 states have return successors, (2092), 1440 states have call predecessors, (2092), 1322 states have call successors, (2092) [2022-11-16 12:47:59,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12002 states to 12002 states and 14511 transitions. [2022-11-16 12:47:59,947 INFO L78 Accepts]: Start accepts. Automaton has 12002 states and 14511 transitions. Word has length 136 [2022-11-16 12:47:59,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:59,948 INFO L495 AbstractCegarLoop]: Abstraction has 12002 states and 14511 transitions. [2022-11-16 12:47:59,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-16 12:47:59,948 INFO L276 IsEmpty]: Start isEmpty. Operand 12002 states and 14511 transitions. [2022-11-16 12:47:59,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-16 12:47:59,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:59,954 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:59,959 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 12:48:00,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-16 12:48:00,157 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:48:00,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:00,157 INFO L85 PathProgramCache]: Analyzing trace with hash 78962637, now seen corresponding path program 1 times [2022-11-16 12:48:00,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:00,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407288498] [2022-11-16 12:48:00,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:00,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:00,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:48:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:00,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:48:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:00,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:48:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:00,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:48:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:00,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:48:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:00,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 12:48:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:00,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-16 12:48:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:00,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:48:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:00,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-16 12:48:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:00,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:48:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:00,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-16 12:48:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:00,309 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-16 12:48:00,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:00,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407288498] [2022-11-16 12:48:00,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407288498] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:48:00,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947219210] [2022-11-16 12:48:00,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:00,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:00,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:48:00,311 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:48:00,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 12:48:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:00,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 12:48:00,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:00,516 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-16 12:48:00,516 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:48:00,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947219210] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:00,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:48:00,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-11-16 12:48:00,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941610689] [2022-11-16 12:48:00,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:00,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:48:00,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:00,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:48:00,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:48:00,518 INFO L87 Difference]: Start difference. First operand 12002 states and 14511 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-16 12:48:02,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:48:02,123 INFO L93 Difference]: Finished difference Result 13122 states and 15882 transitions. [2022-11-16 12:48:02,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:48:02,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2022-11-16 12:48:02,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:48:02,148 INFO L225 Difference]: With dead ends: 13122 [2022-11-16 12:48:02,148 INFO L226 Difference]: Without dead ends: 11748 [2022-11-16 12:48:02,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:48:02,154 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 322 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:48:02,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 390 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:48:02,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11748 states. [2022-11-16 12:48:03,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11748 to 11726. [2022-11-16 12:48:03,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11726 states, 9097 states have (on average 1.1854457513465977) internal successors, (10784), 9246 states have internal predecessors, (10784), 1285 states have call successors, (1285), 1081 states have call predecessors, (1285), 1342 states have return successors, (2043), 1408 states have call predecessors, (2043), 1284 states have call successors, (2043) [2022-11-16 12:48:03,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11726 states to 11726 states and 14112 transitions. [2022-11-16 12:48:03,283 INFO L78 Accepts]: Start accepts. Automaton has 11726 states and 14112 transitions. Word has length 136 [2022-11-16 12:48:03,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:48:03,283 INFO L495 AbstractCegarLoop]: Abstraction has 11726 states and 14112 transitions. [2022-11-16 12:48:03,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-16 12:48:03,283 INFO L276 IsEmpty]: Start isEmpty. Operand 11726 states and 14112 transitions. [2022-11-16 12:48:03,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-16 12:48:03,289 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:48:03,289 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:03,294 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 12:48:03,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-16 12:48:03,490 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:48:03,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:03,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1976459403, now seen corresponding path program 1 times [2022-11-16 12:48:03,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:03,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309343065] [2022-11-16 12:48:03,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:03,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:03,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:48:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:03,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:48:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:03,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:48:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:03,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:48:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:03,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:48:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:03,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 12:48:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:03,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-16 12:48:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:03,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:48:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:03,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-16 12:48:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:03,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:48:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:03,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-16 12:48:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:03,618 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-16 12:48:03,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:03,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309343065] [2022-11-16 12:48:03,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309343065] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:48:03,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716123439] [2022-11-16 12:48:03,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:03,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:03,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:48:03,620 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:48:03,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 12:48:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:03,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 12:48:03,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:03,765 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-16 12:48:03,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:48:03,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716123439] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:03,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:48:03,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-11-16 12:48:03,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719770849] [2022-11-16 12:48:03,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:03,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:48:03,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:03,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:48:03,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:48:03,768 INFO L87 Difference]: Start difference. First operand 11726 states and 14112 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-16 12:48:05,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:48:05,162 INFO L93 Difference]: Finished difference Result 12853 states and 15487 transitions. [2022-11-16 12:48:05,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:48:05,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2022-11-16 12:48:05,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:48:05,186 INFO L225 Difference]: With dead ends: 12853 [2022-11-16 12:48:05,186 INFO L226 Difference]: Without dead ends: 11754 [2022-11-16 12:48:05,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:48:05,192 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 10 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:48:05,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1043 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:48:05,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11754 states. [2022-11-16 12:48:06,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11754 to 11738. [2022-11-16 12:48:06,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11738 states, 9109 states have (on average 1.1828960368865957) internal successors, (10775), 9258 states have internal predecessors, (10775), 1285 states have call successors, (1285), 1081 states have call predecessors, (1285), 1342 states have return successors, (2043), 1408 states have call predecessors, (2043), 1284 states have call successors, (2043) [2022-11-16 12:48:06,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11738 states to 11738 states and 14103 transitions. [2022-11-16 12:48:06,377 INFO L78 Accepts]: Start accepts. Automaton has 11738 states and 14103 transitions. Word has length 136 [2022-11-16 12:48:06,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:48:06,377 INFO L495 AbstractCegarLoop]: Abstraction has 11738 states and 14103 transitions. [2022-11-16 12:48:06,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-16 12:48:06,378 INFO L276 IsEmpty]: Start isEmpty. Operand 11738 states and 14103 transitions. [2022-11-16 12:48:06,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-16 12:48:06,383 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:48:06,383 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:06,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 12:48:06,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-16 12:48:06,584 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:48:06,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:06,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1219164295, now seen corresponding path program 1 times [2022-11-16 12:48:06,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:06,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590256454] [2022-11-16 12:48:06,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:06,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:06,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:48:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:06,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:48:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:06,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:48:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:06,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:48:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:06,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:48:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:06,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 12:48:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:06,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-16 12:48:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:06,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:48:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:06,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-16 12:48:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:06,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:48:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:06,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-16 12:48:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:06,757 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-11-16 12:48:06,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:06,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590256454] [2022-11-16 12:48:06,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590256454] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:06,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:06,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:48:06,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874731788] [2022-11-16 12:48:06,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:06,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:48:06,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:06,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:48:06,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:48:06,760 INFO L87 Difference]: Start difference. First operand 11738 states and 14103 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-16 12:48:08,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:48:08,776 INFO L93 Difference]: Finished difference Result 12713 states and 15200 transitions. [2022-11-16 12:48:08,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:48:08,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 136 [2022-11-16 12:48:08,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:48:08,807 INFO L225 Difference]: With dead ends: 12713 [2022-11-16 12:48:08,808 INFO L226 Difference]: Without dead ends: 12711 [2022-11-16 12:48:08,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-11-16 12:48:08,813 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 700 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:48:08,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 670 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:48:08,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12711 states. [2022-11-16 12:48:10,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12711 to 12442. [2022-11-16 12:48:10,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12442 states, 9689 states have (on average 1.1791722571988854) internal successors, (11425), 9844 states have internal predecessors, (11425), 1353 states have call successors, (1353), 1129 states have call predecessors, (1353), 1398 states have return successors, (2122), 1478 states have call predecessors, (2122), 1352 states have call successors, (2122) [2022-11-16 12:48:10,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12442 states to 12442 states and 14900 transitions. [2022-11-16 12:48:10,144 INFO L78 Accepts]: Start accepts. Automaton has 12442 states and 14900 transitions. Word has length 136 [2022-11-16 12:48:10,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:48:10,145 INFO L495 AbstractCegarLoop]: Abstraction has 12442 states and 14900 transitions. [2022-11-16 12:48:10,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-16 12:48:10,145 INFO L276 IsEmpty]: Start isEmpty. Operand 12442 states and 14900 transitions. [2022-11-16 12:48:10,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-16 12:48:10,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:48:10,152 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:10,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-16 12:48:10,152 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:48:10,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:10,152 INFO L85 PathProgramCache]: Analyzing trace with hash 114815496, now seen corresponding path program 1 times [2022-11-16 12:48:10,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:10,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698847079] [2022-11-16 12:48:10,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:10,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:10,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:48:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:10,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:48:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:10,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:48:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:10,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:48:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:10,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:48:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:10,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:48:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:10,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:48:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:10,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-16 12:48:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:10,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-16 12:48:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:10,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-16 12:48:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:10,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 12:48:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:10,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:48:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:10,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:48:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:10,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-16 12:48:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:10,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-16 12:48:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:10,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-16 12:48:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:10,318 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-11-16 12:48:10,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:10,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698847079] [2022-11-16 12:48:10,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698847079] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:48:10,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796559631] [2022-11-16 12:48:10,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:10,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:10,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:48:10,320 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:48:10,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 12:48:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:10,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:48:10,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:10,481 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 12:48:10,481 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:48:10,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796559631] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:10,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:48:10,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2022-11-16 12:48:10,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876216798] [2022-11-16 12:48:10,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:10,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:48:10,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:10,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:48:10,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:48:10,483 INFO L87 Difference]: Start difference. First operand 12442 states and 14900 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-16 12:48:11,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:48:11,420 INFO L93 Difference]: Finished difference Result 17590 states and 21120 transitions. [2022-11-16 12:48:11,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:48:11,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2022-11-16 12:48:11,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:48:11,435 INFO L225 Difference]: With dead ends: 17590 [2022-11-16 12:48:11,435 INFO L226 Difference]: Without dead ends: 7008 [2022-11-16 12:48:11,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:48:11,447 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 34 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:48:11,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1280 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:48:11,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7008 states. [2022-11-16 12:48:12,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7008 to 6566. [2022-11-16 12:48:12,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6566 states, 5254 states have (on average 1.159307194518462) internal successors, (6091), 5307 states have internal predecessors, (6091), 655 states have call successors, (655), 523 states have call predecessors, (655), 655 states have return successors, (962), 736 states have call predecessors, (962), 654 states have call successors, (962) [2022-11-16 12:48:12,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6566 states to 6566 states and 7708 transitions. [2022-11-16 12:48:12,362 INFO L78 Accepts]: Start accepts. Automaton has 6566 states and 7708 transitions. Word has length 145 [2022-11-16 12:48:12,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:48:12,363 INFO L495 AbstractCegarLoop]: Abstraction has 6566 states and 7708 transitions. [2022-11-16 12:48:12,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-16 12:48:12,363 INFO L276 IsEmpty]: Start isEmpty. Operand 6566 states and 7708 transitions. [2022-11-16 12:48:12,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-16 12:48:12,370 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:48:12,370 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:12,374 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 12:48:12,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-16 12:48:12,570 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:48:12,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:12,571 INFO L85 PathProgramCache]: Analyzing trace with hash 62040612, now seen corresponding path program 1 times [2022-11-16 12:48:12,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:12,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684219900] [2022-11-16 12:48:12,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:12,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:12,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:48:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:12,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:48:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:12,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:48:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:12,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:48:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:12,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:48:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:12,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:48:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:12,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:48:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:12,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-16 12:48:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:12,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-16 12:48:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:12,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-16 12:48:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:12,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-16 12:48:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:12,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:48:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:12,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:48:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:12,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-16 12:48:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:12,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-16 12:48:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:12,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-16 12:48:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:12,659 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-11-16 12:48:12,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:12,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684219900] [2022-11-16 12:48:12,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684219900] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:12,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:12,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:48:12,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21025918] [2022-11-16 12:48:12,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:12,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:48:12,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:12,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:48:12,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:48:12,663 INFO L87 Difference]: Start difference. First operand 6566 states and 7708 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-16 12:48:13,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:48:13,770 INFO L93 Difference]: Finished difference Result 7114 states and 8326 transitions. [2022-11-16 12:48:13,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:48:13,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 147 [2022-11-16 12:48:13,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:48:13,782 INFO L225 Difference]: With dead ends: 7114 [2022-11-16 12:48:13,782 INFO L226 Difference]: Without dead ends: 6365 [2022-11-16 12:48:13,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:48:13,786 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 392 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:48:13,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 455 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:48:13,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6365 states. [2022-11-16 12:48:14,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6365 to 6141. [2022-11-16 12:48:14,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6141 states, 4925 states have (on average 1.1595939086294416) internal successors, (5711), 4975 states have internal predecessors, (5711), 609 states have call successors, (609), 483 states have call predecessors, (609), 605 states have return successors, (898), 683 states have call predecessors, (898), 608 states have call successors, (898) [2022-11-16 12:48:14,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6141 states to 6141 states and 7218 transitions. [2022-11-16 12:48:14,542 INFO L78 Accepts]: Start accepts. Automaton has 6141 states and 7218 transitions. Word has length 147 [2022-11-16 12:48:14,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:48:14,542 INFO L495 AbstractCegarLoop]: Abstraction has 6141 states and 7218 transitions. [2022-11-16 12:48:14,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-16 12:48:14,542 INFO L276 IsEmpty]: Start isEmpty. Operand 6141 states and 7218 transitions. [2022-11-16 12:48:14,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-11-16 12:48:14,547 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:48:14,548 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:14,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-16 12:48:14,548 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:48:14,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:14,549 INFO L85 PathProgramCache]: Analyzing trace with hash -818503781, now seen corresponding path program 1 times [2022-11-16 12:48:14,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:14,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704363110] [2022-11-16 12:48:14,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:14,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:14,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:48:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:14,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:48:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:14,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 12:48:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:14,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:48:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:14,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:48:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:14,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:48:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:14,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:48:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:14,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-16 12:48:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:14,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-16 12:48:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:14,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:48:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:14,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 12:48:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:14,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:48:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:14,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:48:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:14,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-16 12:48:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:14,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-16 12:48:14,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:14,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-16 12:48:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:14,686 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-16 12:48:14,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:14,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704363110] [2022-11-16 12:48:14,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704363110] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:48:14,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689928962] [2022-11-16 12:48:14,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:14,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:14,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:48:14,689 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:48:14,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 12:48:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:14,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 12:48:14,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:14,959 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-16 12:48:14,959 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:48:14,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689928962] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:14,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:48:14,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-16 12:48:14,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618122818] [2022-11-16 12:48:14,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:14,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:48:14,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:14,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:48:14,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:48:14,962 INFO L87 Difference]: Start difference. First operand 6141 states and 7218 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-16 12:48:15,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:48:15,592 INFO L93 Difference]: Finished difference Result 7977 states and 9378 transitions. [2022-11-16 12:48:15,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:48:15,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 158 [2022-11-16 12:48:15,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:48:15,601 INFO L225 Difference]: With dead ends: 7977 [2022-11-16 12:48:15,602 INFO L226 Difference]: Without dead ends: 3937 [2022-11-16 12:48:15,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:48:15,607 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 171 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:48:15,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 372 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:48:15,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3937 states. [2022-11-16 12:48:16,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3937 to 3937. [2022-11-16 12:48:16,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3937 states, 3191 states have (on average 1.144468818552178) internal successors, (3652), 3225 states have internal predecessors, (3652), 380 states have call successors, (380), 295 states have call predecessors, (380), 364 states have return successors, (516), 417 states have call predecessors, (516), 379 states have call successors, (516) [2022-11-16 12:48:16,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3937 states to 3937 states and 4548 transitions. [2022-11-16 12:48:16,079 INFO L78 Accepts]: Start accepts. Automaton has 3937 states and 4548 transitions. Word has length 158 [2022-11-16 12:48:16,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:48:16,082 INFO L495 AbstractCegarLoop]: Abstraction has 3937 states and 4548 transitions. [2022-11-16 12:48:16,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-16 12:48:16,082 INFO L276 IsEmpty]: Start isEmpty. Operand 3937 states and 4548 transitions. [2022-11-16 12:48:16,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-11-16 12:48:16,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:48:16,087 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:16,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 12:48:16,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:16,287 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:48:16,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:16,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1011844634, now seen corresponding path program 1 times [2022-11-16 12:48:16,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:16,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523019883] [2022-11-16 12:48:16,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:16,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:16,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:48:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:16,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:48:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:16,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:48:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:16,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:48:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:16,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:48:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:16,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:48:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:16,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:48:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:16,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-16 12:48:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:16,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-16 12:48:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:16,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-16 12:48:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:16,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 12:48:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:16,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:48:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:16,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:48:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:16,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-16 12:48:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:16,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-16 12:48:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:16,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-16 12:48:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:16,403 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-11-16 12:48:16,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:16,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523019883] [2022-11-16 12:48:16,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523019883] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:16,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:16,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:48:16,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825330267] [2022-11-16 12:48:16,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:16,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:48:16,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:16,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:48:16,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:48:16,406 INFO L87 Difference]: Start difference. First operand 3937 states and 4548 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-16 12:48:17,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:48:17,367 INFO L93 Difference]: Finished difference Result 5801 states and 6758 transitions. [2022-11-16 12:48:17,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:48:17,368 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 159 [2022-11-16 12:48:17,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:48:17,375 INFO L225 Difference]: With dead ends: 5801 [2022-11-16 12:48:17,375 INFO L226 Difference]: Without dead ends: 4040 [2022-11-16 12:48:17,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:48:17,379 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 316 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:48:17,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 708 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:48:17,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4040 states. [2022-11-16 12:48:17,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4040 to 3496. [2022-11-16 12:48:17,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3496 states, 2842 states have (on average 1.145320197044335) internal successors, (3255), 2875 states have internal predecessors, (3255), 336 states have call successors, (336), 259 states have call predecessors, (336), 316 states have return successors, (448), 362 states have call predecessors, (448), 335 states have call successors, (448) [2022-11-16 12:48:17,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3496 states to 3496 states and 4039 transitions. [2022-11-16 12:48:17,787 INFO L78 Accepts]: Start accepts. Automaton has 3496 states and 4039 transitions. Word has length 159 [2022-11-16 12:48:17,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:48:17,788 INFO L495 AbstractCegarLoop]: Abstraction has 3496 states and 4039 transitions. [2022-11-16 12:48:17,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-16 12:48:17,788 INFO L276 IsEmpty]: Start isEmpty. Operand 3496 states and 4039 transitions. [2022-11-16 12:48:17,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-11-16 12:48:17,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:48:17,790 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:17,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-16 12:48:17,791 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:48:17,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:17,791 INFO L85 PathProgramCache]: Analyzing trace with hash 978764957, now seen corresponding path program 1 times [2022-11-16 12:48:17,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:17,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062543687] [2022-11-16 12:48:17,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:17,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:17,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:48:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:17,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:48:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:17,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:48:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:17,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:48:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:17,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:48:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:17,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:48:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:17,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:48:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:17,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-16 12:48:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:17,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-16 12:48:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:18,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-16 12:48:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:18,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-16 12:48:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:18,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:48:18,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:18,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:48:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:18,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-16 12:48:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:18,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-16 12:48:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:18,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-16 12:48:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:18,027 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-16 12:48:18,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:18,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062543687] [2022-11-16 12:48:18,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062543687] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:48:18,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188016219] [2022-11-16 12:48:18,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:18,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:18,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:48:18,030 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:48:18,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 12:48:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:18,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 12:48:18,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:18,317 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-16 12:48:18,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:48:18,643 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-11-16 12:48:18,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188016219] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:48:18,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:48:18,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2022-11-16 12:48:18,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540790166] [2022-11-16 12:48:18,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:48:18,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 12:48:18,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:18,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 12:48:18,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:48:18,646 INFO L87 Difference]: Start difference. First operand 3496 states and 4039 transitions. Second operand has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2022-11-16 12:48:20,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:48:20,332 INFO L93 Difference]: Finished difference Result 5531 states and 6517 transitions. [2022-11-16 12:48:20,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-16 12:48:20,332 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 162 [2022-11-16 12:48:20,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:48:20,339 INFO L225 Difference]: With dead ends: 5531 [2022-11-16 12:48:20,339 INFO L226 Difference]: Without dead ends: 3783 [2022-11-16 12:48:20,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 353 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2022-11-16 12:48:20,343 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 1208 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:48:20,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1229 Valid, 925 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-16 12:48:20,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3783 states. [2022-11-16 12:48:20,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3783 to 3583. [2022-11-16 12:48:20,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3583 states, 2887 states have (on average 1.1323172843782474) internal successors, (3269), 2925 states have internal predecessors, (3269), 358 states have call successors, (358), 283 states have call predecessors, (358), 336 states have return successors, (499), 375 states have call predecessors, (499), 357 states have call successors, (499) [2022-11-16 12:48:20,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 3583 states and 4126 transitions. [2022-11-16 12:48:20,785 INFO L78 Accepts]: Start accepts. Automaton has 3583 states and 4126 transitions. Word has length 162 [2022-11-16 12:48:20,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:48:20,785 INFO L495 AbstractCegarLoop]: Abstraction has 3583 states and 4126 transitions. [2022-11-16 12:48:20,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2022-11-16 12:48:20,786 INFO L276 IsEmpty]: Start isEmpty. Operand 3583 states and 4126 transitions. [2022-11-16 12:48:20,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-11-16 12:48:20,789 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:48:20,789 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:20,794 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-16 12:48:20,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:20,990 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:48:20,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:20,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1575925759, now seen corresponding path program 2 times [2022-11-16 12:48:20,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:20,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677811233] [2022-11-16 12:48:20,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:20,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:21,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:48:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:21,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:48:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:21,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:48:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:21,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:48:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:21,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:48:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:21,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 12:48:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:21,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-16 12:48:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:21,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:48:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:21,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-16 12:48:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:21,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:48:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:21,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-16 12:48:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:21,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-16 12:48:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:21,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:48:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:21,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-16 12:48:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:21,119 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-11-16 12:48:21,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:21,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677811233] [2022-11-16 12:48:21,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677811233] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:21,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:21,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:48:21,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581218554] [2022-11-16 12:48:21,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:21,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:48:21,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:21,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:48:21,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:48:21,122 INFO L87 Difference]: Start difference. First operand 3583 states and 4126 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-11-16 12:48:22,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:48:22,411 INFO L93 Difference]: Finished difference Result 5452 states and 6270 transitions. [2022-11-16 12:48:22,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 12:48:22,411 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 175 [2022-11-16 12:48:22,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:48:22,415 INFO L225 Difference]: With dead ends: 5452 [2022-11-16 12:48:22,415 INFO L226 Difference]: Without dead ends: 1760 [2022-11-16 12:48:22,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-11-16 12:48:22,421 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 802 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:48:22,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 611 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 12:48:22,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2022-11-16 12:48:22,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1760. [2022-11-16 12:48:22,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1387 states have (on average 1.1391492429704397) internal successors, (1580), 1408 states have internal predecessors, (1580), 180 states have call successors, (180), 156 states have call predecessors, (180), 192 states have return successors, (286), 195 states have call predecessors, (286), 179 states have call successors, (286) [2022-11-16 12:48:22,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2046 transitions. [2022-11-16 12:48:22,634 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2046 transitions. Word has length 175 [2022-11-16 12:48:22,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:48:22,634 INFO L495 AbstractCegarLoop]: Abstraction has 1760 states and 2046 transitions. [2022-11-16 12:48:22,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-11-16 12:48:22,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2046 transitions. [2022-11-16 12:48:22,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-11-16 12:48:22,635 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:48:22,636 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:22,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-16 12:48:22,636 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:48:22,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:22,636 INFO L85 PathProgramCache]: Analyzing trace with hash -61354190, now seen corresponding path program 1 times [2022-11-16 12:48:22,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:22,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92734751] [2022-11-16 12:48:22,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:22,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:22,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:48:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:22,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:48:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:22,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 12:48:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:22,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:48:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:22,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:48:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:22,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:48:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:22,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:48:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:22,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-16 12:48:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:22,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-16 12:48:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:22,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-16 12:48:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:22,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-16 12:48:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:22,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-16 12:48:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:22,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:48:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:22,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:48:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:22,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-16 12:48:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:22,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-16 12:48:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:22,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-16 12:48:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:22,778 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-16 12:48:22,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:22,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92734751] [2022-11-16 12:48:22,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92734751] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:48:22,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256753076] [2022-11-16 12:48:22,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:22,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:22,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:48:22,780 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:48:22,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 12:48:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:22,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:48:22,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:22,971 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-11-16 12:48:22,971 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:48:22,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256753076] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:22,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:48:22,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-11-16 12:48:22,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241899247] [2022-11-16 12:48:22,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:22,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:48:22,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:22,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:48:22,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:48:22,974 INFO L87 Difference]: Start difference. First operand 1760 states and 2046 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-16 12:48:23,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:48:23,423 INFO L93 Difference]: Finished difference Result 3405 states and 3969 transitions. [2022-11-16 12:48:23,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:48:23,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 179 [2022-11-16 12:48:23,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:48:23,427 INFO L225 Difference]: With dead ends: 3405 [2022-11-16 12:48:23,427 INFO L226 Difference]: Without dead ends: 1477 [2022-11-16 12:48:23,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-11-16 12:48:23,430 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 151 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:48:23,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 228 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:48:23,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2022-11-16 12:48:23,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1440. [2022-11-16 12:48:23,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 1143 states have (on average 1.1286089238845145) internal successors, (1290), 1155 states have internal predecessors, (1290), 145 states have call successors, (145), 124 states have call predecessors, (145), 151 states have return successors, (214), 160 states have call predecessors, (214), 144 states have call successors, (214) [2022-11-16 12:48:23,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 1649 transitions. [2022-11-16 12:48:23,605 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 1649 transitions. Word has length 179 [2022-11-16 12:48:23,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:48:23,606 INFO L495 AbstractCegarLoop]: Abstraction has 1440 states and 1649 transitions. [2022-11-16 12:48:23,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-16 12:48:23,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 1649 transitions. [2022-11-16 12:48:23,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-11-16 12:48:23,607 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:48:23,608 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:23,614 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-16 12:48:23,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-16 12:48:23,808 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:48:23,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:23,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1658574142, now seen corresponding path program 1 times [2022-11-16 12:48:23,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:23,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219711868] [2022-11-16 12:48:23,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:23,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:23,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:48:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:23,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:48:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:23,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:48:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:23,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:48:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:23,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:48:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:23,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:48:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:23,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:48:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:23,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-16 12:48:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:23,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-16 12:48:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:23,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-16 12:48:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:23,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-16 12:48:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:23,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:48:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:23,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:48:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:23,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-16 12:48:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:23,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-16 12:48:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:23,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 12:48:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:23,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-16 12:48:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:23,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-16 12:48:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:23,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-11-16 12:48:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:23,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-11-16 12:48:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:23,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:48:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:23,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:48:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:23,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-16 12:48:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:23,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-11-16 12:48:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:23,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-11-16 12:48:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:23,985 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 75 proven. 16 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2022-11-16 12:48:23,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:23,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219711868] [2022-11-16 12:48:23,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219711868] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:48:23,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135538065] [2022-11-16 12:48:23,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:23,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:23,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:48:23,988 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:48:24,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 12:48:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:24,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 12:48:24,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:24,340 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 256 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-16 12:48:24,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:48:24,627 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 107 proven. 7 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-11-16 12:48:24,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135538065] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:48:24,627 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:48:24,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2022-11-16 12:48:24,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751683595] [2022-11-16 12:48:24,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:48:24,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:48:24,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:24,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:48:24,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:48:24,630 INFO L87 Difference]: Start difference. First operand 1440 states and 1649 transitions. Second operand has 11 states, 11 states have (on average 20.727272727272727) internal successors, (228), 8 states have internal predecessors, (228), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2022-11-16 12:48:25,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:48:25,316 INFO L93 Difference]: Finished difference Result 1743 states and 1984 transitions. [2022-11-16 12:48:25,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 12:48:25,317 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 20.727272727272727) internal successors, (228), 8 states have internal predecessors, (228), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) Word has length 253 [2022-11-16 12:48:25,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:48:25,318 INFO L225 Difference]: With dead ends: 1743 [2022-11-16 12:48:25,318 INFO L226 Difference]: Without dead ends: 0 [2022-11-16 12:48:25,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 549 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2022-11-16 12:48:25,320 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 355 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:48:25,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 362 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:48:25,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-16 12:48:25,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-16 12:48:25,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:48:25,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-16 12:48:25,321 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 253 [2022-11-16 12:48:25,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:48:25,321 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-16 12:48:25,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.727272727272727) internal successors, (228), 8 states have internal predecessors, (228), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2022-11-16 12:48:25,322 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-16 12:48:25,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-16 12:48:25,324 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-16 12:48:25,324 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-16 12:48:25,338 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-16 12:48:25,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-16 12:48:25,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-16 12:49:57,004 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 812 822) no Hoare annotation was computed. [2022-11-16 12:49:57,005 INFO L895 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 812 822) the Hoare annotation is: (let ((.cse13 (not (<= 2 |old(~m_st~0)|))) (.cse16 (= ~E_M~0 0)) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse3 (and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))) (.cse14 (not (= ~t1_pc~0 1))) (.cse4 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse5 (not (= ~p_num_write~0 0))) (.cse15 (= |old(~t1_st~0)| 0)) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (not (= ~c_num_read~0 0))) (.cse8 (not (= ~q_free~0 0))) (.cse9 (not (<= 2 ~E_M~0))) (.cse10 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse11 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse12 (not (= ~token~0 ~local~0)))) (and (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse2 .cse3 .cse4 (not (<= ~t1_pc~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse13 .cse2 .cse3 .cse14 .cse4 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 (not (< ~local~0 ~token~0)) .cse10 .cse11 (not (<= 2 ~E_1~0)) (not (<= ~token~0 (+ ~local~0 1)))) (let ((.cse17 (<= ~m_pc~0 0))) (or .cse1 (and (or (not (<= ~t1_pc~0 1)) (<= ~m_pc~0 1)) (not .cse17)) .cse13 .cse3 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse10 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1)) (and (not (<= 1 ~t1_pc~0)) .cse17) .cse11)) (or .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2022-11-16 12:49:57,005 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 812 822) no Hoare annotation was computed. [2022-11-16 12:49:57,005 INFO L899 garLoopResultBuilder]: For program point update_channels1EXIT(lines 226 240) no Hoare annotation was computed. [2022-11-16 12:49:57,006 INFO L895 garLoopResultBuilder]: At program point update_channels1ENTRY(lines 226 240) the Hoare annotation is: (let ((.cse38 (= ~q_read_ev~0 2)) (.cse39 (= ~T1_E~0 ~M_E~0)) (.cse36 (= ~q_ev~0 |old(~q_ev~0)|)) (.cse40 (= ~p_last_write~0 ~q_buf_0~0)) (.cse44 (= ~m_pc~0 ~t1_pc~0)) (.cse49 (<= 1 ~c_dr_pc~0)) (.cse48 (= ~q_free~0 1)) (.cse46 (<= ~c_dr_pc~0 1)) (.cse45 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse50 (<= ~p_num_write~0 ~c_num_read~0)) (.cse32 (<= ~m_pc~0 1)) (.cse31 (<= ~m_pc~0 0)) (.cse34 (= ~E_M~0 0)) (.cse37 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse41 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse42 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse47 (= ~c_last_read~0 ~p_last_write~0)) (.cse43 (= ~M_E~0 2)) (.cse51 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (let ((.cse23 (and .cse39 .cse36 .cse40 .cse44 .cse49 .cse48 .cse46 .cse45 .cse50 (or (not .cse32) .cse31) (not .cse34) .cse37 .cse41 .cse42 .cse47 .cse43 .cse51)) (.cse29 (not (= ~p_num_write~0 0))) (.cse30 (not (= ~c_num_read~0 0))) (.cse4 (and .cse36 .cse37 .cse42 .cse38)) (.cse11 (not (<= |old(~q_req_up~0)| 0))) (.cse20 (not .cse51)) (.cse21 (not .cse50)) (.cse35 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse24 (not .cse49)) (.cse25 (not .cse48)) (.cse26 (not .cse47)) (.cse27 (not (= |old(~q_req_up~0)| 1))) (.cse3 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse6 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse10 (not .cse46)) (.cse13 (not .cse45)) (.cse22 (not (<= 2 |old(~q_write_ev~0)|))) (.cse16 (not (= |old(~q_read_ev~0)| 2))) (.cse0 (= ~c_dr_st~0 0)) (.cse28 (not (<= ~c_dr_pc~0 0))) (.cse1 (not .cse44)) (.cse2 (not .cse43)) (.cse33 (and .cse36 .cse37 .cse41 .cse42)) (.cse5 (not (<= ~t1_pc~0 0))) (.cse7 (not .cse40)) (.cse8 (not (= ~q_free~0 0))) (.cse9 (not (<= 2 ~E_M~0))) (.cse12 (= ~p_dw_st~0 0)) (.cse14 (not .cse39)) (.cse15 (not (= ~m_st~0 0))) (.cse17 (not (= ~p_dw_i~0 1))) (.cse18 (not (<= 2 ~E_1~0))) (.cse19 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= |old(~q_write_ev~0)| 0) .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse20 .cse5 .cse7 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22 .cse23 .cse24 .cse17 .cse25 .cse26 .cse18 .cse19) (or .cse0 .cse1 .cse2 (not (<= 1 |old(~q_read_ev~0)|)) .cse27 .cse20 .cse5 .cse7 .cse21 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse22 .cse23 .cse24 .cse17 .cse25 .cse26 .cse18 .cse19) (or .cse28 .cse1 (not .cse12) .cse2 .cse4 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse5 .cse29 .cse7 .cse30 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse25 .cse26 .cse18 .cse19) (or .cse0 .cse1 .cse2 (and (not .cse31) .cse32) .cse33 .cse29 .cse7 .cse34 .cse30 .cse12 .cse13 .cse35 .cse14 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse33 .cse20 .cse5 .cse7 .cse21 .cse9 .cse10 .cse12 .cse35 .cse14 .cse15 .cse22 .cse24 .cse17 .cse25 .cse26 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse27 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 (and (= ~q_req_up~0 1) .cse36 .cse37 .cse38) .cse13 .cse14 .cse15 .cse22 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse28 .cse1 .cse2 .cse33 .cse5 .cse7 .cse8 .cse9 .cse12 .cse14 .cse15 .cse17 .cse18 .cse19)))) [2022-11-16 12:49:57,007 INFO L895 garLoopResultBuilder]: At program point L56(lines 39 58) the Hoare annotation is: (let ((.cse1 (not (<= ~c_dr_pc~0 0))) (.cse27 (<= ~q_req_up~0 0)) (.cse24 (not (= |old(~q_req_up~0)| 1))) (.cse14 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse15 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse6 (not (= ~q_free~0 0))) (.cse19 (not (= |old(~q_read_ev~0)| 2))) (.cse28 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse0 (= ~c_dr_st~0 0)) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse3 (not (= ~M_E~0 2))) (.cse25 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse4 (not (<= ~t1_pc~0 0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse26 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse7 (not (<= 2 ~E_M~0))) (.cse16 (not (<= ~c_dr_pc~0 1))) (.cse17 (not (<= |old(~q_req_up~0)| 0))) (.cse8 (= ~p_dw_st~0 0)) (.cse18 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse10 (not (= ~m_st~0 0))) (.cse23 (not (<= 2 |old(~q_write_ev~0)|))) (.cse20 (not (<= 1 ~c_dr_pc~0))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse21 (not (= ~q_free~0 1))) (.cse22 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse12 (not (<= 2 ~E_1~0))) (.cse13 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse14 .cse4 .cse15 .cse5 .cse6 .cse7 .cse16 .cse17 .cse8 .cse18 .cse9 .cse10 .cse19 .cse20 .cse11 (= |old(~q_write_ev~0)| 0) .cse12 .cse13) (or .cse1 .cse2 (not .cse8) .cse3 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse4 (not (= ~p_num_write~0 0)) .cse5 (not (= ~c_num_read~0 0)) .cse7 .cse17 .cse18 .cse9 .cse10 .cse19 .cse11 .cse21 .cse22 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse17 .cse8 .cse18 .cse9 .cse10 .cse23 .cse19 .cse20 .cse11 .cse12 .cse13) (or .cse0 .cse2 .cse3 (not (<= 1 |old(~q_read_ev~0)|)) .cse24 .cse25 .cse4 .cse5 .cse26 .cse7 .cse16 .cse8 .cse9 .cse10 .cse23 (and .cse27 .cse28) .cse20 .cse11 .cse21 .cse22 .cse12 .cse13) (or .cse0 (and .cse27 (= ~q_read_ev~0 2)) .cse2 .cse3 .cse24 .cse14 .cse4 .cse15 .cse5 .cse6 .cse7 .cse16 .cse8 .cse18 .cse9 .cse10 .cse23 .cse19 .cse20 .cse11 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse25 .cse4 .cse5 .cse26 .cse7 .cse16 .cse28 .cse8 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1)) .cse9 .cse10 .cse23 .cse20 .cse11 .cse21 .cse22 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse25 .cse4 .cse5 .cse26 .cse7 .cse16 .cse17 .cse8 .cse18 .cse9 .cse10 .cse23 .cse20 .cse11 .cse21 .cse22 .cse12 .cse13))) [2022-11-16 12:49:57,007 INFO L899 garLoopResultBuilder]: For program point L48-1(lines 48 52) no Hoare annotation was computed. [2022-11-16 12:49:57,008 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 47) no Hoare annotation was computed. [2022-11-16 12:49:57,008 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 42 57) no Hoare annotation was computed. [2022-11-16 12:49:57,008 INFO L899 garLoopResultBuilder]: For program point L230-1(lines 226 240) no Hoare annotation was computed. [2022-11-16 12:49:57,008 INFO L899 garLoopResultBuilder]: For program point L803-2(lines 787 811) no Hoare annotation was computed. [2022-11-16 12:49:57,009 INFO L895 garLoopResultBuilder]: At program point activate_threads2ENTRY(lines 787 811) the Hoare annotation is: (let ((.cse18 (not (< ~local~0 ~token~0))) (.cse20 (not (<= ~token~0 (+ ~local~0 1)))) (.cse17 (= ~E_M~0 0)) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse19 (not (<= 2 ~E_1~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse3 (and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))) (.cse15 (not (= ~t1_pc~0 1))) (.cse4 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse6 (not (= ~p_num_write~0 0))) (.cse16 (= |old(~t1_st~0)| 0)) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (= ~c_num_read~0 0))) (.cse9 (not (= ~q_free~0 0))) (.cse10 (not (<= 2 ~E_M~0))) (.cse11 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse13 (not (= ~token~0 ~local~0)))) (and (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse14 .cse2 .cse3 .cse15 .cse4 .cse6 .cse16 .cse7 .cse17 .cse8 .cse9 .cse18 .cse11 .cse12 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 (not (= |old(~m_st~0)| 0)) .cse12 .cse19 .cse20) (or .cse0 .cse1 .cse14 .cse2 .cse3 .cse15 .cse4 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19) (or .cse1 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse14 .cse3 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse11 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1)) .cse12) (or .cse0 .cse1 .cse14 .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13) (or .cse0 .cse1 .cse14 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-11-16 12:49:57,009 INFO L899 garLoopResultBuilder]: For program point L795(lines 795 799) no Hoare annotation was computed. [2022-11-16 12:49:57,009 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 606) no Hoare annotation was computed. [2022-11-16 12:49:57,009 INFO L899 garLoopResultBuilder]: For program point L795-2(lines 795 799) no Hoare annotation was computed. [2022-11-16 12:49:57,010 INFO L895 garLoopResultBuilder]: At program point L630(lines 618 632) the Hoare annotation is: (let ((.cse44 (<= ~p_dw_pc~0 0)) (.cse45 (<= ~p_dw_pc~0 1)) (.cse21 (= ~E_M~0 0)) (.cse47 (<= ~m_pc~0 1)) (.cse46 (<= ~m_pc~0 0))) (let ((.cse30 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse31 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse37 (= ~p_num_write~0 0)) (.cse35 (= ~c_num_read~0 0)) (.cse36 (= ~p_last_write~0 ~q_buf_0~0)) (.cse28 (= |old(~t1_st~0)| ~t1_st~0)) (.cse38 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse34 (= ~q_free~0 0)) (.cse39 (<= 2 ~m_st~0)) (.cse33 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse40 (or (not .cse47) .cse46)) (.cse41 (not .cse21)) (.cse42 (= ~p_dw_st~0 0)) (.cse32 (= ~c_last_read~0 ~p_last_write~0)) (.cse43 (or .cse44 (not .cse45))) (.cse48 (= ~M_E~0 2))) (let ((.cse6 (not (<= ~t1_pc~0 0))) (.cse17 (not .cse48)) (.cse18 (and (= ~T1_E~0 ~M_E~0) .cse37 .cse35 .cse36 .cse28 .cse38 .cse29 .cse34 .cse39 .cse33 .cse40 .cse41 .cse42 .cse32 .cse43 .cse48)) (.cse22 (and .cse30 .cse31)) (.cse27 (not (= |old(~m_st~0)| 0))) (.cse26 (and (not .cse46) .cse47)) (.cse23 (and (not .cse44) .cse45)) (.cse11 (not (<= 2 ~E_M~0))) (.cse16 (not (= ~token~0 ~local~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not .cse42)) (.cse2 (and .cse37 .cse35 .cse36 .cse28 .cse38 .cse29 .cse34 .cse39 .cse33 .cse40 .cse41 .cse42 .cse32 .cse43)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse19 (not (= ~t1_pc~0 1))) (.cse5 (not .cse38)) (.cse7 (not .cse37)) (.cse20 (= |old(~t1_st~0)| 0)) (.cse8 (not .cse36)) (.cse9 (not .cse35)) (.cse10 (not .cse34)) (.cse24 (not (< ~local~0 ~token~0))) (.cse12 (not .cse33)) (.cse13 (and .cse28 .cse29 .cse30 .cse31)) (.cse14 (not .cse32)) (.cse15 (not (<= 2 ~E_1~0))) (.cse25 (not (<= ~token~0 (+ ~local~0 1))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse17 .cse18 .cse3 .cse4 .cse19 .cse5 .cse7 .cse20 .cse8 .cse21 .cse9 .cse10 .cse11 .cse22 .cse12 .cse23 .cse14 .cse15) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (or .cse0 .cse1 .cse17 .cse18 .cse3 .cse4 .cse19 .cse5 .cse7 .cse20 .cse8 .cse21 .cse9 .cse10 .cse24 .cse22 .cse12 .cse23 .cse14 .cse15 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse26 .cse4 .cse19 .cse5 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse22 .cse12 .cse27 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse17 .cse18 .cse3 .cse4 .cse19 .cse5 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 .cse22 .cse12 .cse23 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse4 .cse19 .cse5 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse27 .cse14 .cse15 .cse25) (or .cse1 .cse2 .cse26 .cse3 .cse5 .cse7 .cse8 .cse21 .cse9 .cse10 .cse12 .cse23 .cse14) (or .cse0 .cse1 .cse4 (and .cse28 .cse29) .cse19 .cse5 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse16) (or .cse0 .cse1 .cse2 (and (= ~m_st~0 0) .cse30 .cse31 (not (= ~t1_st~0 0))) .cse3 .cse4 .cse19 .cse5 .cse7 .cse20 .cse8 .cse21 .cse9 .cse10 .cse24 .cse12 .cse13 .cse14 .cse15 .cse25))))) [2022-11-16 12:49:57,011 INFO L899 garLoopResultBuilder]: For program point L620(lines 620 625) no Hoare annotation was computed. [2022-11-16 12:49:57,011 INFO L895 garLoopResultBuilder]: At program point L612(lines 596 614) the Hoare annotation is: (let ((.cse4 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse11 (= ~E_M~0 0)) (.cse14 (not (< ~local~0 ~token~0))) (.cse18 (not (<= ~token~0 (+ ~local~0 1)))) (.cse20 (not (<= ~t1_pc~0 0))) (.cse22 (not (= ~token~0 ~local~0))) (.cse19 (and (<= |activate_threads2_is_master_triggered_#res#1| 0) .cse4 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse5 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse8 (not (= ~p_num_write~0 0))) (.cse9 (= |old(~t1_st~0)| 0)) (.cse10 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse12 (not (= ~c_num_read~0 0))) (.cse13 (not (= ~q_free~0 0))) (.cse21 (not (<= 2 ~E_M~0))) (.cse15 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse17 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse19 .cse0 .cse1 .cse2 .cse3 .cse7 .cse20 .cse8 .cse10 .cse12 .cse13 .cse21 .cse15 .cse16 .cse17 .cse22) (or .cse19 .cse1 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse2 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse15 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1)) .cse16) (or .cse19 .cse0 .cse1 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse21 .cse14 .cse15 (not (= |old(~m_st~0)| 0)) .cse16 .cse17 .cse18) (or .cse19 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse10 .cse12 .cse13 .cse21 .cse15 .cse16 .cse17 .cse22) (or .cse19 .cse0 .cse1 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse21 .cse15 .cse16 .cse22) (or .cse19 .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse3 .cse7 .cse20 .cse8 .cse10 .cse12 .cse13 .cse21 .cse15 .cse16 .cse22) (or .cse19 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse21 .cse15 .cse16 .cse17)))) [2022-11-16 12:49:57,012 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 787 811) no Hoare annotation was computed. [2022-11-16 12:49:57,012 INFO L899 garLoopResultBuilder]: For program point L600(lines 600 609) no Hoare annotation was computed. [2022-11-16 12:49:57,013 INFO L895 garLoopResultBuilder]: At program point L631(lines 615 633) the Hoare annotation is: (let ((.cse46 (<= ~p_dw_pc~0 0)) (.cse47 (<= ~p_dw_pc~0 1)) (.cse10 (= ~E_M~0 0)) (.cse49 (<= ~m_pc~0 1)) (.cse48 (<= ~m_pc~0 0))) (let ((.cse23 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse24 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse25 (<= |activate_threads2_is_transmit1_triggered_#res#1| 0)) (.cse26 (<= 0 |activate_threads2_is_transmit1_triggered_#res#1|)) (.cse39 (= ~p_num_write~0 0)) (.cse37 (= ~c_num_read~0 0)) (.cse38 (= ~p_last_write~0 ~q_buf_0~0)) (.cse32 (= |old(~t1_st~0)| ~t1_st~0)) (.cse40 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse33 (= ~m_st~0 |old(~m_st~0)|)) (.cse36 (= ~q_free~0 0)) (.cse41 (<= 2 ~m_st~0)) (.cse35 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse42 (or (not .cse49) .cse48)) (.cse43 (not .cse10)) (.cse44 (= ~p_dw_st~0 0)) (.cse34 (= ~c_last_read~0 ~p_last_write~0)) (.cse45 (or .cse46 (not .cse47))) (.cse50 (= ~M_E~0 2))) (let ((.cse2 (not .cse50)) (.cse3 (and (= ~T1_E~0 ~M_E~0) .cse39 .cse37 .cse38 .cse32 .cse40 .cse33 .cse36 .cse41 .cse35 .cse42 .cse43 .cse44 .cse34 .cse45 .cse50)) (.cse18 (and .cse23 .cse24 .cse25 .cse26)) (.cse30 (and (not .cse48) .cse49)) (.cse15 (and (not .cse46) .cse47)) (.cse22 (not (< ~local~0 ~token~0))) (.cse31 (not (= |old(~m_st~0)| 0))) (.cse28 (not (<= ~token~0 (+ ~local~0 1)))) (.cse21 (= |old(~t1_st~0)| 0)) (.cse29 (not (<= ~t1_pc~0 0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not .cse44)) (.cse20 (and .cse39 .cse37 .cse38 .cse32 .cse40 .cse33 .cse36 .cse41 .cse35 .cse42 .cse43 .cse44 .cse34 .cse45)) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse5 (not (<= 2 ~T1_E~0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not .cse40)) (.cse8 (not .cse39)) (.cse9 (not .cse38)) (.cse11 (not .cse37)) (.cse12 (not .cse36)) (.cse13 (not (<= 2 ~E_M~0))) (.cse14 (not .cse35)) (.cse27 (and .cse32 .cse33 .cse23 .cse24 .cse25 .cse26)) (.cse16 (not .cse34)) (.cse17 (not (<= 2 ~E_1~0))) (.cse19 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12 .cse22 (and (= ~m_st~0 0) .cse23 .cse24 .cse25 (not (= ~t1_st~0 0)) .cse26) .cse14 .cse27 .cse16 .cse17 .cse28) (or .cse0 .cse1 .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17) (or .cse0 .cse1 .cse20 .cse4 .cse5 .cse7 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12 .cse22 .cse14 .cse15 .cse16 .cse17 .cse28 .cse18) (or .cse0 .cse1 .cse30 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse11 .cse12 .cse13 .cse14 .cse31 .cse16 .cse17 .cse18 .cse19) (or .cse1 .cse20 .cse30 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse11 .cse12 .cse13 .cse22 .cse14 .cse31 .cse27 .cse16 .cse17 .cse28) (or .cse0 .cse1 .cse5 (and .cse32 .cse33) .cse6 .cse7 .cse8 .cse21 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse19) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse5 .cse7 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse19) (or .cse0 .cse1 .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17 .cse19))))) [2022-11-16 12:49:57,014 INFO L899 garLoopResultBuilder]: For program point L600-2(lines 600 609) no Hoare annotation was computed. [2022-11-16 12:49:57,014 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 628) no Hoare annotation was computed. [2022-11-16 12:49:57,014 INFO L899 garLoopResultBuilder]: For program point L619-2(lines 619 628) no Hoare annotation was computed. [2022-11-16 12:49:57,014 INFO L895 garLoopResultBuilder]: At program point L611(lines 599 613) the Hoare annotation is: (let ((.cse17 (= |old(~t1_st~0)| ~t1_st~0)) (.cse18 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse16 (= ~E_M~0 0)) (.cse21 (not (<= ~t1_pc~0 0))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse19 (not (< ~local~0 ~token~0))) (.cse15 (not (<= 2 ~E_1~0))) (.cse20 (not (<= ~token~0 (+ ~local~0 1)))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (and .cse17 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse18 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse5 (not (= ~t1_pc~0 1))) (.cse6 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse7 (not (= ~p_num_write~0 0))) (.cse8 (= |old(~t1_st~0)| 0)) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (not (= ~c_num_read~0 0))) (.cse11 (not (= ~q_free~0 0))) (.cse12 (not (<= 2 ~E_M~0))) (.cse13 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse22 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse1 .cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse3 .cse6 .cse7 .cse9 .cse16 .cse10 .cse11 .cse13 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1)) .cse14) (or .cse0 .cse1 .cse3 .cse4 (and .cse17 .cse18) .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse19 .cse13 .cse14 .cse15 .cse20) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse2 .cse4 .cse6 .cse21 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse21 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13 (not (= |old(~m_st~0)| 0)) .cse14 .cse15 .cse20) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22)))) [2022-11-16 12:49:57,015 INFO L899 garLoopResultBuilder]: For program point L803(lines 803 807) no Hoare annotation was computed. [2022-11-16 12:49:57,015 INFO L895 garLoopResultBuilder]: At program point L321(line 321) the Hoare annotation is: (let ((.cse2 (= |old(~p_dw_st~0)| 0)) (.cse30 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse27 (not (<= ~c_dr_pc~0 0))) (.cse4 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~c_num_read~0 0))) (.cse28 (and .cse30 (= ~p_dw_st~0 0))) (.cse29 (not .cse2)) (.cse13 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse15 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse8 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse20 (not (<= 1 ~c_dr_pc~0))) (.cse10 (not (= ~q_free~0 1))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse3 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse30)) (.cse14 (not (<= ~t1_pc~0 0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse25 (not (= ~q_free~0 0))) (.cse16 (not (<= 2 ~E_M~0))) (.cse17 (not (<= ~c_dr_pc~0 1))) (.cse7 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse18 (not (= ~m_st~0 0))) (.cse19 (not (<= 2 ~q_write_ev~0))) (.cse21 (not (= ~p_dw_i~0 1))) (.cse11 (= |old(~c_dr_st~0)| 0)) (.cse22 (not (<= ~q_req_up~0 0))) (.cse26 (not (= ~q_read_ev~0 2))) (.cse23 (not (<= 2 ~E_1~0))) (.cse24 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse2 .cse3 .cse4 .cse5 (= ~E_M~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse3 .cse13 .cse14 .cse5 .cse15 .cse16 .cse17 .cse9 .cse18 .cse19 .cse20 .cse21 .cse10 .cse11 .cse22 .cse12 .cse23 .cse24) (or .cse0 .cse1 .cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse3 .cse14 (not (< ~c_num_read~0 ~p_num_write~0)) .cse5 .cse25 .cse16 .cse17 .cse7 .cse9 .cse18 (= ~q_write_ev~0 0) .cse21 .cse11 .cse22 .cse26 .cse23 .cse24) (or .cse27 .cse0 .cse1 .cse2 .cse3 .cse14 .cse5 .cse25 .cse16 .cse9 .cse18 .cse21 .cse11 .cse23 .cse24) (or .cse27 .cse0 .cse1 .cse14 .cse4 .cse5 .cse6 .cse16 .cse7 .cse9 .cse18 .cse28 .cse21 .cse10 .cse11 .cse29 .cse12 .cse23 .cse24) (or .cse27 .cse0 .cse1 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse14 .cse4 .cse5 .cse6 .cse16 .cse7 .cse9 .cse18 .cse28 .cse21 .cse10 .cse29 .cse22 .cse26 .cse12 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse13 .cse14 .cse5 .cse15 .cse16 .cse17 .cse8 .cse9 .cse18 .cse19 .cse20 .cse21 .cse10 .cse11 .cse12 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse14 .cse5 .cse25 .cse16 .cse17 .cse7 .cse9 .cse18 .cse19 .cse21 .cse11 .cse22 .cse26 .cse23 .cse24)))) [2022-11-16 12:49:57,016 INFO L895 garLoopResultBuilder]: At program point L323-2(lines 323 327) the Hoare annotation is: (let ((.cse3 (= |old(~p_dw_st~0)| 0)) (.cse40 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse39 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse32 (<= activate_threads1_~tmp~1 0)) (.cse33 (< 0 (+ activate_threads1_~tmp~1 1))) (.cse16 (= ~p_dw_st~0 0))) (let ((.cse31 (not .cse16)) (.cse35 (and .cse40 .cse39 .cse32 .cse33)) (.cse26 (not (<= ~q_req_up~0 0))) (.cse38 (not .cse3)) (.cse15 (not (= ~c_dr_st~0 0))) (.cse30 (not (= ~q_free~0 0))) (.cse4 (and .cse40 .cse39)) (.cse17 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse19 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse21 (not (<= ~c_dr_pc~0 1))) (.cse23 (not (<= 2 ~q_write_ev~0))) (.cse24 (not (<= 1 ~c_dr_pc~0))) (.cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.cse7 (= ~E_M~0 0)) (.cse10 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse29 (not (<= ~c_dr_pc~0 0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse37 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse18 (not (<= ~t1_pc~0 0))) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (= ~c_num_read~0 0))) (.cse20 (not (<= 2 ~E_M~0))) (.cse9 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse11 (not (= ~T1_E~0 ~M_E~0))) (.cse22 (not (= ~m_st~0 0))) (.cse36 (and .cse32 .cse33)) (.cse25 (not (= ~p_dw_i~0 1))) (.cse12 (not (= ~q_free~0 1))) (.cse13 (= |old(~c_dr_st~0)| 0)) (.cse34 (not (= ~q_read_ev~0 2))) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse27 (not (<= 2 ~E_1~0))) (.cse28 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 (and (= ~q_read_ev~0 1) .cse15 .cse16) .cse1 .cse3 .cse4 .cse17 .cse18 .cse6 .cse19 .cse20 .cse21 .cse11 .cse22 .cse23 .cse24 .cse25 .cse12 .cse13 .cse26 .cse14 .cse27 .cse28) (or .cse29 .cse0 .cse1 .cse3 .cse18 .cse6 .cse30 .cse20 .cse11 .cse22 (and .cse31 .cse32 .cse33) .cse25 .cse13 .cse34 .cse27 .cse28) (or .cse0 .cse1 .cse3 .cse35 .cse18 .cse6 .cse30 .cse20 .cse21 .cse9 .cse11 .cse22 .cse23 .cse25 .cse13 .cse26 .cse34 .cse27 .cse28) (or .cse29 .cse0 .cse31 .cse1 .cse3 .cse18 .cse6 .cse30 .cse20 .cse10 .cse11 .cse22 .cse25 .cse13 .cse27 .cse28) (or .cse0 .cse1 .cse3 .cse17 .cse18 .cse6 .cse19 .cse20 .cse21 .cse11 .cse22 .cse23 .cse24 .cse36 .cse25 .cse12 .cse13 .cse26 .cse34 .cse14 .cse27 .cse28) (or .cse29 .cse0 .cse1 .cse37 .cse18 .cse5 .cse6 .cse8 .cse20 .cse9 .cse11 .cse22 .cse25 .cse12 .cse38 .cse26 .cse34 .cse14 .cse27 (and .cse39 .cse32 .cse16 .cse33) .cse28) (or .cse0 .cse1 .cse3 .cse17 .cse18 .cse6 .cse19 .cse20 .cse21 .cse10 .cse11 .cse22 .cse23 .cse24 .cse36 .cse25 .cse12 .cse13 .cse34 .cse14 .cse27 .cse28) (or .cse0 .cse1 .cse3 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse35 .cse18 (not (< ~c_num_read~0 ~p_num_write~0)) .cse6 .cse30 .cse20 .cse21 .cse9 .cse11 .cse22 (= ~q_write_ev~0 0) .cse25 .cse13 .cse26 .cse34 .cse27 .cse28) (or .cse29 .cse0 .cse1 .cse18 .cse5 .cse6 .cse8 .cse20 .cse9 .cse11 .cse22 (and .cse39 .cse16) .cse25 .cse12 .cse13 .cse38 .cse14 .cse27 .cse28) (or .cse29 .cse0 .cse1 (and .cse15 .cse16) .cse3 .cse4 .cse18 .cse6 .cse30 .cse20 .cse11 .cse22 .cse25 .cse13 .cse27 .cse28) (or .cse0 .cse1 .cse3 .cse4 .cse17 .cse18 .cse6 .cse19 .cse20 .cse21 .cse10 .cse11 .cse22 .cse23 .cse24 .cse25 .cse12 .cse13 .cse14 .cse27 .cse28) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse36 .cse12 .cse13 .cse34 .cse14) (or .cse29 .cse0 .cse1 .cse37 .cse18 .cse5 .cse6 .cse8 .cse20 .cse9 .cse11 .cse22 .cse36 .cse25 .cse12 .cse13 .cse34 .cse14 .cse27 .cse28)))) [2022-11-16 12:49:57,016 INFO L899 garLoopResultBuilder]: For program point L321-1(line 321) no Hoare annotation was computed. [2022-11-16 12:49:57,017 INFO L895 garLoopResultBuilder]: At program point activate_threads1ENTRY(lines 315 339) the Hoare annotation is: (let ((.cse2 (= |old(~p_dw_st~0)| 0)) (.cse30 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse27 (not (<= ~c_dr_pc~0 0))) (.cse4 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~c_num_read~0 0))) (.cse28 (and .cse30 (= ~p_dw_st~0 0))) (.cse29 (not .cse2)) (.cse13 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse15 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse8 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse20 (not (<= 1 ~c_dr_pc~0))) (.cse10 (not (= ~q_free~0 1))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse3 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse30)) (.cse14 (not (<= ~t1_pc~0 0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse25 (not (= ~q_free~0 0))) (.cse16 (not (<= 2 ~E_M~0))) (.cse17 (not (<= ~c_dr_pc~0 1))) (.cse7 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse18 (not (= ~m_st~0 0))) (.cse19 (not (<= 2 ~q_write_ev~0))) (.cse21 (not (= ~p_dw_i~0 1))) (.cse11 (= |old(~c_dr_st~0)| 0)) (.cse22 (not (<= ~q_req_up~0 0))) (.cse26 (not (= ~q_read_ev~0 2))) (.cse23 (not (<= 2 ~E_1~0))) (.cse24 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse2 .cse3 .cse4 .cse5 (= ~E_M~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse3 .cse13 .cse14 .cse5 .cse15 .cse16 .cse17 .cse9 .cse18 .cse19 .cse20 .cse21 .cse10 .cse11 .cse22 .cse12 .cse23 .cse24) (or .cse0 .cse1 .cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse3 .cse14 (not (< ~c_num_read~0 ~p_num_write~0)) .cse5 .cse25 .cse16 .cse17 .cse7 .cse9 .cse18 (= ~q_write_ev~0 0) .cse21 .cse11 .cse22 .cse26 .cse23 .cse24) (or .cse27 .cse0 .cse1 .cse2 .cse3 .cse14 .cse5 .cse25 .cse16 .cse9 .cse18 .cse21 .cse11 .cse23 .cse24) (or .cse27 .cse0 .cse1 .cse14 .cse4 .cse5 .cse6 .cse16 .cse7 .cse9 .cse18 .cse28 .cse21 .cse10 .cse11 .cse29 .cse12 .cse23 .cse24) (or .cse27 .cse0 .cse1 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse14 .cse4 .cse5 .cse6 .cse16 .cse7 .cse9 .cse18 .cse28 .cse21 .cse10 .cse29 .cse22 .cse26 .cse12 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse13 .cse14 .cse5 .cse15 .cse16 .cse17 .cse8 .cse9 .cse18 .cse19 .cse20 .cse21 .cse10 .cse11 .cse12 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse14 .cse5 .cse25 .cse16 .cse17 .cse7 .cse9 .cse18 .cse19 .cse21 .cse11 .cse22 .cse26 .cse23 .cse24)))) [2022-11-16 12:49:57,017 INFO L899 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 315 339) no Hoare annotation was computed. [2022-11-16 12:49:57,017 INFO L899 garLoopResultBuilder]: For program point L331(lines 331 335) no Hoare annotation was computed. [2022-11-16 12:49:57,018 INFO L899 garLoopResultBuilder]: For program point L329(line 329) no Hoare annotation was computed. [2022-11-16 12:49:57,018 INFO L899 garLoopResultBuilder]: For program point L331-2(lines 315 339) no Hoare annotation was computed. [2022-11-16 12:49:57,018 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2022-11-16 12:49:57,018 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 634 641) no Hoare annotation was computed. [2022-11-16 12:49:57,018 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 634 641) the Hoare annotation is: true [2022-11-16 12:49:57,018 INFO L899 garLoopResultBuilder]: For program point L735-1(lines 734 757) no Hoare annotation was computed. [2022-11-16 12:49:57,020 INFO L895 garLoopResultBuilder]: At program point fire_delta_events2ENTRY(lines 731 758) the Hoare annotation is: (let ((.cse15 (not (= ~m_st~0 0))) (.cse7 (= ~t1_st~0 0)) (.cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.cse18 (not (<= ~t1_pc~0 0))) (.cse19 (not (<= 2 ~m_st~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (<= 2 |old(~T1_E~0)|))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not (= ~c_num_read~0 0))) (.cse11 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse12 (not (= ~q_free~0 0))) (.cse13 (not (<= 2 |old(~E_M~0)|))) (.cse14 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse17 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (< ~local~0 ~token~0)) .cse13 .cse14 .cse15 .cse16 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse19 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (or .cse19 .cse1 (= |old(~E_M~0)| 0) .cse2 .cse4 .cse5 .cse8 .cse10 .cse11 .cse12 .cse14 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1)) .cse16) (or .cse19 .cse0 .cse1 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17) (or .cse19 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17))) [2022-11-16 12:49:57,021 INFO L899 garLoopResultBuilder]: For program point L750-1(lines 731 758) no Hoare annotation was computed. [2022-11-16 12:49:57,021 INFO L899 garLoopResultBuilder]: For program point L745-1(lines 734 757) no Hoare annotation was computed. [2022-11-16 12:49:57,021 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 731 758) no Hoare annotation was computed. [2022-11-16 12:49:57,021 INFO L899 garLoopResultBuilder]: For program point L740-1(lines 734 757) no Hoare annotation was computed. [2022-11-16 12:49:57,022 INFO L895 garLoopResultBuilder]: At program point fire_delta_events1ENTRY(lines 279 296) the Hoare annotation is: (let ((.cse29 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse18 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse19 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse8 (not (<= ~c_dr_pc~0 1))) (.cse21 (not (<= 2 |old(~q_write_ev~0)|))) (.cse22 (not (<= 1 ~c_dr_pc~0))) (.cse20 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse0 (= ~c_dr_st~0 0)) (.cse5 (and .cse29 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse6 (not (= ~q_free~0 0))) (.cse26 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse9 (= ~p_dw_st~0 0)) (.cse2 (not (= ~M_E~0 2))) (.cse3 (not (<= ~t1_pc~0 0))) (.cse27 (not (= ~p_num_write~0 0))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse28 (not (= ~c_num_read~0 0))) (.cse7 (not (<= 2 ~E_M~0))) (.cse10 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse11 (not (= ~T1_E~0 ~M_E~0))) (.cse12 (not (= ~m_st~0 0))) (.cse13 (not (= |old(~q_read_ev~0)| 2))) (.cse14 (not (= ~p_dw_i~0 1))) (.cse23 (not (= ~q_free~0 1))) (.cse15 (not (<= ~q_req_up~0 0))) (.cse24 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse16 (not (<= 2 ~E_1~0))) (.cse25 (and .cse29 (= ~q_read_ev~0 2))) (.cse17 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse3 (not (< ~c_num_read~0 ~p_num_write~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse18 .cse3 .cse4 .cse19 .cse5 .cse7 .cse8 .cse9 .cse20 .cse11 .cse12 .cse21 .cse22 .cse14 .cse23 .cse24 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse25 .cse17) (or .cse0 .cse26 .cse1 .cse2 .cse3 .cse27 .cse4 .cse5 .cse28 .cse7 .cse10 .cse11 .cse12 .cse14 .cse23 .cse24 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse18 .cse3 .cse4 .cse19 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse21 .cse22 .cse14 .cse23 .cse15 .cse24 .cse16 .cse17) (or .cse0 .cse1 .cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse27 .cse4 (= ~E_M~0 0) .cse5 .cse28 .cse9 .cse10 .cse20 .cse11 .cse23 .cse24) (or .cse0 .cse26 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse14 .cse16 .cse17) (or .cse26 .cse1 (not .cse9) .cse2 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse3 .cse27 .cse4 .cse28 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse23 .cse15 .cse24 .cse16 .cse25 .cse17)))) [2022-11-16 12:49:57,022 INFO L899 garLoopResultBuilder]: For program point L288-1(lines 279 296) no Hoare annotation was computed. [2022-11-16 12:49:57,022 INFO L899 garLoopResultBuilder]: For program point L283-1(lines 282 295) no Hoare annotation was computed. [2022-11-16 12:49:57,022 INFO L899 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 279 296) no Hoare annotation was computed. [2022-11-16 12:49:57,023 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 98) no Hoare annotation was computed. [2022-11-16 12:49:57,023 INFO L902 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 88 106) the Hoare annotation is: true [2022-11-16 12:49:57,023 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 101) no Hoare annotation was computed. [2022-11-16 12:49:57,023 INFO L899 garLoopResultBuilder]: For program point L92-2(lines 92 101) no Hoare annotation was computed. [2022-11-16 12:49:57,023 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 88 106) no Hoare annotation was computed. [2022-11-16 12:49:57,023 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 88 106) no Hoare annotation was computed. [2022-11-16 12:49:57,024 INFO L895 garLoopResultBuilder]: At program point L103(lines 91 105) the Hoare annotation is: (let ((.cse33 (= ~T1_E~0 ~M_E~0)) (.cse37 (= ~m_pc~0 ~t1_pc~0)) (.cse39 (<= ~c_dr_pc~0 1)) (.cse31 (<= is_do_read_c_triggered_~__retres1~1 0)) (.cse38 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse35 (<= ~m_pc~0 1)) (.cse34 (<= ~m_pc~0 0)) (.cse7 (= ~E_M~0 0)) (.cse32 (<= 0 is_do_read_c_triggered_~__retres1~1)) (.cse36 (= ~M_E~0 2)) (.cse40 (<= 1 ~c_dr_pc~0))) (let ((.cse24 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse4 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse8 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse15 (not (<= 2 ~q_write_ev~0))) (.cse16 (not .cse40)) (.cse22 (and .cse33 .cse37 .cse40 .cse39 .cse31 .cse38 (or (not .cse35) .cse34) (not .cse7) .cse32 .cse36)) (.cse10 (not .cse39)) (.cse11 (= ~p_dw_st~0 0)) (.cse26 (not (= ~p_num_write~0 0))) (.cse27 (not (= ~c_num_read~0 0))) (.cse12 (not .cse38)) (.cse18 (not (= ~q_free~0 1))) (.cse19 (not (<= ~q_req_up~0 0))) (.cse30 (not (= ~q_read_ev~0 2))) (.cse20 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse28 (not (<= ~c_dr_pc~0 0))) (.cse1 (not .cse37)) (.cse2 (not .cse36)) (.cse3 (and (not .cse34) .cse35)) (.cse5 (not (<= ~t1_pc~0 0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse29 (not (= ~q_free~0 0))) (.cse9 (not (<= 2 ~E_M~0))) (.cse13 (not .cse33)) (.cse14 (not (= ~m_st~0 0))) (.cse25 (and .cse31 .cse32)) (.cse17 (not (= ~p_dw_i~0 1))) (.cse21 (not (<= 2 ~E_1~0))) (.cse23 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse14 .cse25 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse26 .cse6 .cse7 .cse27 .cse11 .cse12 .cse24 .cse13 .cse25 .cse18 .cse20) (or .cse0 .cse28 .cse1 .cse2 .cse3 .cse5 .cse26 .cse6 .cse7 .cse27 .cse9 .cse12 .cse13 .cse14 .cse25 .cse17 .cse18 .cse20 .cse21 .cse23) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse17 .cse19 .cse30 .cse21 .cse23) (or .cse0 .cse1 (not (= ~q_read_ev~0 1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse5 (< 0 ~q_write_ev~0) (not (< ~c_num_read~0 ~p_num_write~0)) .cse6 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~q_write_ev~0 0) .cse25 .cse17 .cse19 .cse30 .cse21 .cse23) (or .cse28 .cse1 (not .cse11) .cse2 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse5 .cse26 .cse6 .cse27 .cse9 .cse12 .cse13 .cse14 .cse25 .cse17 .cse18 .cse19 .cse30 .cse20 .cse21 .cse23) (or .cse0 .cse28 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse29 .cse9 .cse13 .cse14 .cse25 .cse17 .cse21 .cse23)))) [2022-11-16 12:49:57,024 INFO L899 garLoopResultBuilder]: For program point L960(lines 960 966) no Hoare annotation was computed. [2022-11-16 12:49:57,025 INFO L895 garLoopResultBuilder]: At program point L927(line 927) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-11-16 12:49:57,025 INFO L899 garLoopResultBuilder]: For program point L927-1(line 927) no Hoare annotation was computed. [2022-11-16 12:49:57,025 INFO L895 garLoopResultBuilder]: At program point L250-1(lines 241 258) the Hoare annotation is: (let ((.cse7 (not (= ~c_dr_st~0 0))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse11 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (= ~q_free~0 1)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (<= ~t1_pc~0 0)) (.cse2 (= ~p_dw_st~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 .cse13 .cse6 .cse7 .cse8 .cse14 .cse15 .cse9 .cse16 .cse17 .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 (= ~q_write_ev~0 ~q_read_ev~0) .cse13 .cse6 .cse8 .cse14 (<= ~q_req_up~0 0) .cse2 (= ~q_read_ev~0 2) .cse15 .cse9 .cse16 .cse17 .cse10))) [2022-11-16 12:49:57,025 INFO L899 garLoopResultBuilder]: For program point L696(lines 686 724) no Hoare annotation was computed. [2022-11-16 12:49:57,026 INFO L899 garLoopResultBuilder]: For program point L564(lines 564 572) no Hoare annotation was computed. [2022-11-16 12:49:57,026 INFO L899 garLoopResultBuilder]: For program point L878(lines 878 883) no Hoare annotation was computed. [2022-11-16 12:49:57,026 INFO L899 garLoopResultBuilder]: For program point L713(lines 713 720) no Hoare annotation was computed. [2022-11-16 12:49:57,026 INFO L895 garLoopResultBuilder]: At program point L482(lines 473 484) the Hoare annotation is: (= ~M_E~0 2) [2022-11-16 12:49:57,026 INFO L899 garLoopResultBuilder]: For program point L350(line 350) no Hoare annotation was computed. [2022-11-16 12:49:57,026 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-16 12:49:57,027 INFO L895 garLoopResultBuilder]: At program point L829(lines 823 831) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-11-16 12:49:57,027 INFO L899 garLoopResultBuilder]: For program point L532(line 532) no Hoare annotation was computed. [2022-11-16 12:49:57,027 INFO L895 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (let ((.cse11 (< ~c_num_read~0 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (= ~q_read_ev~0 2)) (.cse8 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse23 (<= 1 ~c_dr_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse22 (<= 2 ~q_write_ev~0)) (.cse14 (<= ~c_dr_pc~0 1)) (.cse24 (<= ~p_num_write~0 ~c_num_read~0)) (.cse17 (<= ~q_req_up~0 0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse10 (<= 2 ~E_1~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse15 (= ~q_free~0 0)) (.cse16 (<= ~t1_pc~0 0)) (.cse19 (= ~p_dw_i~0 1)) (.cse20 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse11 .cse12 .cse13 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9 .cse21) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse13 .cse22 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse12 .cse23 .cse13 .cse22 .cse14 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9 .cse21) (and .cse0 .cse10 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse6 .cse16 .cse24 .cse17 .cse18 .cse19 .cse7 .cse20 .cse9 .cse25) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse16 .cse24 .cse19 .cse7 .cse20 .cse8 .cse9 .cse25) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse16 .cse24 .cse17 .cse19 .cse7 .cse20 .cse9 .cse25) (and .cse0 .cse10 .cse2 .cse3 .cse12 .cse13 .cse5 .cse15 .cse16 .cse19 (<= ~c_dr_pc~0 0) .cse20 .cse9))) [2022-11-16 12:49:57,028 INFO L895 garLoopResultBuilder]: At program point L912(line 912) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-11-16 12:49:57,028 INFO L899 garLoopResultBuilder]: For program point L400-1(line 400) no Hoare annotation was computed. [2022-11-16 12:49:57,028 INFO L899 garLoopResultBuilder]: For program point L912-1(line 912) no Hoare annotation was computed. [2022-11-16 12:49:57,028 INFO L899 garLoopResultBuilder]: For program point L846-1(lines 835 858) no Hoare annotation was computed. [2022-11-16 12:49:57,029 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 144) no Hoare annotation was computed. [2022-11-16 12:49:57,029 INFO L899 garLoopResultBuilder]: For program point L962(lines 962 965) no Hoare annotation was computed. [2022-11-16 12:49:57,029 INFO L895 garLoopResultBuilder]: At program point L450(lines 413 455) the Hoare annotation is: (= ~M_E~0 2) [2022-11-16 12:49:57,030 INFO L895 garLoopResultBuilder]: At program point L897(line 897) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (<= 2 ~E_M~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (= ~p_dw_st~0 0) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-11-16 12:49:57,030 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 356) no Hoare annotation was computed. [2022-11-16 12:49:57,030 INFO L899 garLoopResultBuilder]: For program point L897-1(line 897) no Hoare annotation was computed. [2022-11-16 12:49:57,031 INFO L899 garLoopResultBuilder]: For program point L352-1(lines 347 387) no Hoare annotation was computed. [2022-11-16 12:49:57,031 INFO L895 garLoopResultBuilder]: At program point L220(lines 173 225) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse13 (= ~p_dw_st~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (<= 1 ~c_dr_pc~0)) (.cse6 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse7 (= ~m_st~0 0)) (.cse8 (= ~q_free~0 1)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse10 (<= ~c_dr_pc~0 1)) (.cse11 (not (= ~c_dr_st~0 0))) (.cse12 (<= ~t1_pc~0 0)) (.cse14 (= ~p_dw_i~0 1)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2))) (or (and .cse0 .cse1 (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ~q_req_up~0 0) .cse13 (= ~q_read_ev~0 2) .cse14 .cse15 .cse16 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse17) (and .cse0 (= ~q_req_up~0 1) .cse1 (not .cse13) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ~p_num_write~0 ~c_num_read~0) (<= 1 ~q_read_ev~0) .cse14 .cse15 .cse16 .cse17 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2022-11-16 12:49:57,031 INFO L899 garLoopResultBuilder]: For program point L699(lines 699 706) no Hoare annotation was computed. [2022-11-16 12:49:57,031 INFO L899 garLoopResultBuilder]: For program point L567(lines 567 571) no Hoare annotation was computed. [2022-11-16 12:49:57,032 INFO L895 garLoopResultBuilder]: At program point L435(line 435) the Hoare annotation is: (let ((.cse13 (< ~c_num_read~0 ~p_num_write~0)) (.cse20 (= ~q_read_ev~0 2)) (.cse23 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse19 (<= ~q_req_up~0 0)) (.cse10 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse25 (= ~q_req_up~0 1)) (.cse26 (<= 1 ~c_dr_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse24 (<= 2 ~q_write_ev~0)) (.cse16 (<= ~c_dr_pc~0 1)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse27 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse8 (not (= ~E_M~0 0))) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse28 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse12 (<= 2 ~E_1~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse14 (<= 2 ~E_M~0)) (.cse15 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse17 (= ~q_free~0 0)) (.cse18 (<= ~t1_pc~0 0)) (.cse21 (= ~p_dw_i~0 1)) (.cse22 (= ~token~0 ~local~0)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse13 .cse14 .cse15 .cse16 .cse5 .cse17 .cse6 .cse18 .cse19 .cse20 .cse21 .cse22 .cse11 .cse23) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse15 .cse24 .cse16 .cse5 .cse17 .cse6 .cse18 .cse19 .cse20 .cse21 .cse22 .cse11) (and .cse0 .cse25 .cse12 .cse1 .cse2 .cse3 .cse13 .cse14 .cse15 .cse24 .cse16 .cse5 .cse17 .cse6 .cse18 .cse20 .cse21 .cse22 .cse11 .cse23) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse26 .cse15 .cse4 .cse24 .cse16 .cse5 .cse6 .cse18 .cse27 .cse19 .cse7 .cse8 .cse21 .cse9 .cse22 .cse11 .cse28) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse26 .cse15 .cse4 .cse24 .cse16 .cse5 .cse18 .cse27 .cse21 .cse9 .cse22 .cse10 .cse11 .cse28) (and .cse0 .cse25 .cse12 .cse1 .cse2 .cse3 .cse14 .cse26 .cse15 .cse4 .cse24 .cse16 .cse5 .cse6 .cse18 .cse27 .cse7 .cse8 (<= 1 ~q_read_ev~0) .cse21 .cse9 .cse22 .cse11 .cse28) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse15 .cse5 .cse17 .cse18 .cse21 (<= ~c_dr_pc~0 0) .cse22 .cse11))) [2022-11-16 12:49:57,032 INFO L899 garLoopResultBuilder]: For program point L435-1(line 435) no Hoare annotation was computed. [2022-11-16 12:49:57,033 INFO L899 garLoopResultBuilder]: For program point L402(lines 402 407) no Hoare annotation was computed. [2022-11-16 12:49:57,033 INFO L895 garLoopResultBuilder]: At program point L568(lines 563 594) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse5 (= ~q_free~0 0)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0))) (or (let ((.cse3 (<= ~m_pc~0 0))) (and .cse0 .cse1 .cse2 (or (<= 1 ~t1_pc~0) (not .cse3)) .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) .cse3) (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))))) (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) .cse0 .cse1 .cse2 (<= 2 ~E_M~0) .cse4 .cse5 .cse6 .cse7 (<= 2 ~T1_E~0) .cse8 .cse9 (<= ~c_dr_pc~0 0) (not (= ~t1_st~0 0)) (= ~token~0 ~local~0)))) [2022-11-16 12:49:57,034 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 143) no Hoare annotation was computed. [2022-11-16 12:49:57,034 INFO L895 garLoopResultBuilder]: At program point L651-1(lines 642 659) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~0) .cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 (<= 2 ~E_M~0) .cse5 (= ~m_st~0 0) .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) .cse10))) [2022-11-16 12:49:57,034 INFO L895 garLoopResultBuilder]: At program point L585(line 585) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse5 (= ~q_free~0 0)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (not (= ~E_M~0 0))) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0))) (or (let ((.cse3 (<= ~m_pc~0 0))) (and .cse0 .cse1 .cse2 (or (<= 1 ~t1_pc~0) (not .cse3)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) .cse3) (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))))) (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) .cse0 .cse1 .cse2 .cse4 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse7 (<= 2 ~T1_E~0) .cse8 .cse9 .cse10 (<= ~c_dr_pc~0 0) (not (= ~t1_st~0 0)) (< ~local~0 ~token~0)))) [2022-11-16 12:49:57,034 INFO L899 garLoopResultBuilder]: For program point L585-1(line 585) no Hoare annotation was computed. [2022-11-16 12:49:57,035 INFO L895 garLoopResultBuilder]: At program point L420(line 420) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (<= 2 ~E_M~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (= ~q_free~0 1) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-11-16 12:49:57,035 INFO L899 garLoopResultBuilder]: For program point L420-1(line 420) no Hoare annotation was computed. [2022-11-16 12:49:57,035 INFO L895 garLoopResultBuilder]: At program point L899(line 899) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~0) .cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 (<= 2 ~E_M~0) .cse5 (= ~m_st~0 0) .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) .cse10))) [2022-11-16 12:49:57,036 INFO L895 garLoopResultBuilder]: At program point L899-1(line 899) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~0) .cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 (<= 2 ~E_M~0) .cse5 (= ~m_st~0 0) .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) .cse10))) [2022-11-16 12:49:57,036 INFO L899 garLoopResultBuilder]: For program point L189(lines 188 219) no Hoare annotation was computed. [2022-11-16 12:49:57,036 INFO L895 garLoopResultBuilder]: At program point L470(lines 456 472) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (<= 2 ~E_M~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (= ~q_free~0 1) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-11-16 12:49:57,037 INFO L895 garLoopResultBuilder]: At program point L916(line 916) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-11-16 12:49:57,037 INFO L895 garLoopResultBuilder]: At program point L916-1(line 916) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-11-16 12:49:57,037 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 218) no Hoare annotation was computed. [2022-11-16 12:49:57,037 INFO L895 garLoopResultBuilder]: At program point L553(lines 516 559) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse9 (<= 2 ~T1_E~0)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (<= ~c_dr_pc~0 0)) (.cse13 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~t1_pc~0 0) .cse9 .cse10 .cse11 .cse12 .cse13) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-11-16 12:49:57,038 INFO L899 garLoopResultBuilder]: For program point L520(lines 520 528) no Hoare annotation was computed. [2022-11-16 12:49:57,038 INFO L895 garLoopResultBuilder]: At program point L388(lines 340 393) the Hoare annotation is: (let ((.cse13 (< ~c_num_read~0 ~p_num_write~0)) (.cse20 (= ~q_read_ev~0 2)) (.cse23 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse19 (<= ~q_req_up~0 0)) (.cse10 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse25 (= ~q_req_up~0 1)) (.cse26 (<= 1 ~c_dr_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse24 (<= 2 ~q_write_ev~0)) (.cse16 (<= ~c_dr_pc~0 1)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse27 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse8 (not (= ~E_M~0 0))) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse28 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse12 (<= 2 ~E_1~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse14 (<= 2 ~E_M~0)) (.cse15 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse17 (= ~q_free~0 0)) (.cse18 (<= ~t1_pc~0 0)) (.cse21 (= ~p_dw_i~0 1)) (.cse22 (= ~token~0 ~local~0)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse13 .cse14 .cse15 .cse16 .cse5 .cse17 .cse6 .cse18 .cse19 .cse20 .cse21 .cse22 .cse11 .cse23) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse15 .cse24 .cse16 .cse5 .cse17 .cse6 .cse18 .cse19 .cse20 .cse21 .cse22 .cse11) (and .cse0 .cse25 .cse12 .cse1 .cse2 .cse3 .cse13 .cse14 .cse15 .cse24 .cse16 .cse5 .cse17 .cse6 .cse18 .cse20 .cse21 .cse22 .cse11 .cse23) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse26 .cse15 .cse4 .cse24 .cse16 .cse5 .cse6 .cse18 .cse27 .cse19 .cse7 .cse8 .cse21 .cse9 .cse22 .cse11 .cse28) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse26 .cse15 .cse4 .cse24 .cse16 .cse5 .cse18 .cse27 .cse21 .cse9 .cse22 .cse10 .cse11 .cse28) (and .cse0 .cse25 .cse12 .cse1 .cse2 .cse3 .cse14 .cse26 .cse15 .cse4 .cse24 .cse16 .cse5 .cse6 .cse18 .cse27 .cse7 .cse8 (<= 1 ~q_read_ev~0) .cse21 .cse9 .cse22 .cse11 .cse28) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse15 .cse5 .cse17 .cse18 .cse21 (<= ~c_dr_pc~0 0) .cse22 .cse11))) [2022-11-16 12:49:57,039 INFO L895 garLoopResultBuilder]: At program point L900(line 900) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~0) .cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 (<= 2 ~E_M~0) .cse5 (= ~m_st~0 0) .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) .cse10))) [2022-11-16 12:49:57,040 INFO L895 garLoopResultBuilder]: At program point L867(lines 860 869) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (<= 2 ~E_M~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (= ~p_dw_st~0 0) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-11-16 12:49:57,040 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-16 12:49:57,040 INFO L899 garLoopResultBuilder]: For program point L190-1(lines 190 200) no Hoare annotation was computed. [2022-11-16 12:49:57,040 INFO L895 garLoopResultBuilder]: At program point L537(line 537) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse5 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (<= ~c_dr_pc~0 0)) (.cse11 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse3 .cse4 .cse5 .cse6 (<= ~t1_pc~0 0) .cse7 .cse8 .cse9 .cse10 .cse11) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ~t1_st~0 0)) .cse11))) [2022-11-16 12:49:57,040 INFO L899 garLoopResultBuilder]: For program point L537-1(line 537) no Hoare annotation was computed. [2022-11-16 12:49:57,041 INFO L895 garLoopResultBuilder]: At program point L917(line 917) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-11-16 12:49:57,041 INFO L895 garLoopResultBuilder]: At program point L372(lines 347 387) the Hoare annotation is: (let ((.cse32 (= ~p_dw_st~0 0))) (let ((.cse15 (<= 1 ~q_read_ev~0)) (.cse30 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse1 (= ~q_req_up~0 1)) (.cse21 (< ~c_num_read~0 ~p_num_write~0)) (.cse26 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse29 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse27 (= ~p_num_write~0 0)) (.cse28 (= ~c_num_read~0 0)) (.cse23 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse25 (= ~q_read_ev~0 2)) (.cse3 (not .cse32)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse9 (= ~q_free~0 1)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse11 (<= ~c_dr_pc~0 1)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse24 (<= ~q_req_up~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse20 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse2 (<= 2 ~E_1~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse12 (not (= ~c_dr_st~0 0))) (.cse22 (= ~q_free~0 0)) (.cse13 (<= ~t1_pc~0 0)) (.cse16 (= ~p_dw_i~0 1)) (.cse31 (<= ~c_dr_pc~0 0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 (not (= ~q_write_ev~0 0)) .cse21 .cse6 .cse7 .cse8 .cse11 .cse12 .cse22 .cse23 .cse13 .cse24 .cse25 .cse16 .cse18 .cse19 .cse26) (and .cse0 .cse27 .cse3 .cse28 .cse4 .cse5 .cse9 .cse12 .cse23 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse17 .cse29 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse22 .cse23 .cse13 .cse24 .cse25 .cse16 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse30 .cse8 .cse10 .cse22 .cse13 (<= ~p_num_write~0 1) .cse15 .cse16 .cse31 (<= 1 ~p_num_write~0) .cse18 .cse19) (and .cse0 .cse2 .cse27 .cse28 .cse4 .cse5 .cse6 .cse8 .cse9 .cse12 .cse23 .cse13 .cse16 .cse17 .cse31 .cse18 .cse19) (and .cse0 .cse2 .cse27 .cse28 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse25 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse22 .cse23 .cse13 .cse25 .cse16 .cse18 .cse19 .cse26) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse10 .cse11 .cse22 .cse23 .cse13 .cse24 .cse25 .cse16 .cse18 .cse19 .cse26) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse23 .cse13 .cse14 .cse24 .cse25 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse29 .cse19 .cse20) (and .cse0 .cse2 .cse27 .cse28 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse23 .cse13 .cse24 .cse32 .cse25 .cse16 .cse17 .cse31 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse24 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse8 .cse12 .cse22 .cse13 .cse16 .cse31 .cse18 .cse19)))) [2022-11-16 12:49:57,042 INFO L895 garLoopResultBuilder]: At program point L851-1(lines 832 859) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-11-16 12:49:57,042 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 213) no Hoare annotation was computed. [2022-11-16 12:49:57,043 INFO L895 garLoopResultBuilder]: At program point L422(line 422) the Hoare annotation is: (let ((.cse7 (not (= ~c_dr_st~0 0))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse11 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (= ~q_free~0 1)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (<= ~t1_pc~0 0)) (.cse2 (= ~p_dw_st~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 .cse13 .cse6 .cse7 .cse8 .cse14 .cse15 .cse9 .cse16 .cse17 .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 (= ~q_write_ev~0 ~q_read_ev~0) .cse13 .cse6 .cse8 .cse14 (<= ~q_req_up~0 0) .cse2 (= ~q_read_ev~0 2) .cse15 .cse9 .cse16 .cse17 .cse10))) [2022-11-16 12:49:57,043 INFO L895 garLoopResultBuilder]: At program point L422-1(line 422) the Hoare annotation is: (let ((.cse7 (not (= ~c_dr_st~0 0))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse11 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (= ~q_free~0 1)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (<= ~t1_pc~0 0)) (.cse2 (= ~p_dw_st~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 .cse13 .cse6 .cse7 .cse8 .cse14 .cse15 .cse9 .cse16 .cse17 .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 (= ~q_write_ev~0 ~q_read_ev~0) .cse13 .cse6 .cse8 .cse14 (<= ~q_req_up~0 0) .cse2 (= ~q_read_ev~0 2) .cse15 .cse9 .cse16 .cse17 .cse10))) [2022-11-16 12:49:57,043 INFO L895 garLoopResultBuilder]: At program point L439(line 439) the Hoare annotation is: (let ((.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (= ~q_read_ev~0 2)) (.cse8 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse21 (<= 1 ~c_dr_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse13 (<= 2 ~q_write_ev~0)) (.cse14 (<= ~c_dr_pc~0 1)) (.cse22 (<= ~p_num_write~0 ~c_num_read~0)) (.cse17 (<= ~q_req_up~0 0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse23 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse10 (<= 2 ~E_1~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse11 (<= 2 ~E_M~0)) (.cse12 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse15 (= ~q_free~0 0)) (.cse16 (<= ~t1_pc~0 0)) (.cse19 (= ~p_dw_i~0 1)) (.cse20 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse12 .cse13 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 (< ~c_num_read~0 ~p_num_write~0) .cse11 .cse12 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse21 .cse12 .cse4 .cse13 .cse14 .cse5 .cse16 .cse22 .cse19 .cse7 .cse20 .cse8 .cse9 .cse23) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse21 .cse12 .cse4 .cse13 .cse14 .cse5 .cse16 .cse22 .cse17 .cse19 .cse7 .cse20 .cse9 .cse23) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse12 .cse5 .cse15 .cse16 .cse19 (<= ~c_dr_pc~0 0) .cse20 .cse9))) [2022-11-16 12:49:57,044 INFO L895 garLoopResultBuilder]: At program point L439-1(line 439) the Hoare annotation is: (let ((.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse17 (= ~q_read_ev~0 2)) (.cse8 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse21 (<= 1 ~c_dr_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse20 (<= 2 ~q_write_ev~0)) (.cse13 (<= ~c_dr_pc~0 1)) (.cse22 (<= ~p_num_write~0 ~c_num_read~0)) (.cse16 (<= ~q_req_up~0 0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse23 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse10 (<= 2 ~E_1~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse11 (<= 2 ~E_M~0)) (.cse12 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse14 (= ~q_free~0 0)) (.cse15 (<= ~t1_pc~0 0)) (.cse18 (= ~p_dw_i~0 1)) (.cse19 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) (< ~c_num_read~0 ~p_num_write~0) .cse11 .cse12 .cse13 .cse5 .cse14 .cse6 .cse15 .cse16 .cse17 .cse18 .cse19 .cse9 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse12 .cse20 .cse13 .cse5 .cse14 .cse6 .cse15 .cse16 .cse17 .cse18 .cse19 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse21 .cse12 .cse4 .cse20 .cse13 .cse5 .cse15 .cse22 .cse18 .cse7 .cse19 .cse8 .cse9 .cse23) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse21 .cse12 .cse4 .cse20 .cse13 .cse5 .cse15 .cse22 .cse16 .cse18 .cse7 .cse19 .cse9 .cse23) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse12 .cse5 .cse14 .cse15 .cse18 (<= ~c_dr_pc~0 0) .cse19 .cse9))) [2022-11-16 12:49:57,044 INFO L895 garLoopResultBuilder]: At program point L918(line 918) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-11-16 12:49:57,045 INFO L895 garLoopResultBuilder]: At program point L885(lines 874 887) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-11-16 12:49:57,045 INFO L895 garLoopResultBuilder]: At program point L687(line 687) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-11-16 12:49:57,046 INFO L895 garLoopResultBuilder]: At program point L423(line 423) the Hoare annotation is: (let ((.cse7 (not (= ~c_dr_st~0 0))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse11 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (= ~q_free~0 1)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (<= ~t1_pc~0 0)) (.cse2 (= ~p_dw_st~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 .cse13 .cse6 .cse7 .cse8 .cse14 .cse15 .cse9 .cse16 .cse17 .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 (= ~q_write_ev~0 ~q_read_ev~0) .cse13 .cse6 .cse8 .cse14 (<= ~q_req_up~0 0) .cse2 (= ~q_read_ev~0 2) .cse15 .cse9 .cse16 .cse17 .cse10))) [2022-11-16 12:49:57,046 INFO L899 garLoopResultBuilder]: For program point L357(lines 347 387) no Hoare annotation was computed. [2022-11-16 12:49:57,046 INFO L899 garLoopResultBuilder]: For program point L836(lines 836 840) no Hoare annotation was computed. [2022-11-16 12:49:57,046 INFO L899 garLoopResultBuilder]: For program point L836-2(lines 835 858) no Hoare annotation was computed. [2022-11-16 12:49:57,047 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse24 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse25 (< ~c_num_read~0 ~p_num_write~0)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse12 (< 0 ~q_write_ev~0)) (.cse14 (= ~q_read_ev~0 2)) (.cse26 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse2 (not (= ~p_dw_st~0 0))) (.cse18 (<= 1 ~c_dr_pc~0)) (.cse19 (= ~q_free~0 1)) (.cse20 (<= 2 ~q_write_ev~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse21 (<= ~p_num_write~0 ~c_num_read~0)) (.cse13 (<= ~q_req_up~0 0)) (.cse22 (= ~c_last_read~0 ~p_last_write~0)) (.cse23 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (not (= ~c_dr_st~0 0))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= ~t1_pc~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse18 .cse6 .cse19 (= ~q_read_ev~0 1) .cse20 .cse7 .cse8 .cse10 .cse11 .cse21 .cse13 .cse15 .cse22 .cse16 .cse17 .cse23) (and .cse0 (= ~p_num_write~0 0) .cse2 (= ~c_num_read~0 0) .cse3 .cse4 .cse19 .cse8 .cse10 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse22 .cse24 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~q_write_ev~0 0)) .cse25 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse19 .cse20 .cse7 .cse8 .cse11 .cse21 .cse15 .cse22 .cse16 .cse24 .cse17 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse25 .cse5 .cse18 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse19 .cse20 .cse7 .cse8 .cse11 .cse21 .cse13 .cse15 .cse22 .cse16 .cse17 .cse23) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse15 (<= ~c_dr_pc~0 0) .cse16 .cse17))) [2022-11-16 12:49:57,047 INFO L895 garLoopResultBuilder]: At program point L886(lines 870 888) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-11-16 12:49:57,048 INFO L895 garLoopResultBuilder]: At program point L589(lines 560 595) the Hoare annotation is: (let ((.cse3 (<= ~m_pc~0 0))) (let ((.cse6 (<= 2 ~m_st~0)) (.cse10 (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) .cse3)) (.cse11 (= ~t1_pc~0 1)) (.cse12 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse13 (<= 2 ~E_M~0)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse17 (= ~m_st~0 0)) (.cse5 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (<= ~c_dr_pc~0 0)) (.cse16 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 (or (<= 1 ~t1_pc~0) (not .cse3)) .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 .cse10 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse13 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse9 .cse15 .cse16) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse13 .cse4 .cse17 .cse5 .cse7 .cse14 .cse8 .cse9 .cse10 .cse15 .cse16 (= ~token~0 ~local~0)) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse13 .cse4 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse7 .cse14 .cse8 .cse9 .cse15 .cse16 (< ~local~0 ~token~0))))) [2022-11-16 12:49:57,048 INFO L899 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2022-11-16 12:49:57,048 INFO L899 garLoopResultBuilder]: For program point L936(lines 936 940) no Hoare annotation was computed. [2022-11-16 12:49:57,048 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-16 12:49:57,048 INFO L899 garLoopResultBuilder]: For program point L441(line 441) no Hoare annotation was computed. [2022-11-16 12:49:57,048 INFO L899 garLoopResultBuilder]: For program point L177(lines 177 185) no Hoare annotation was computed. [2022-11-16 12:49:57,048 INFO L899 garLoopResultBuilder]: For program point L689(line 689) no Hoare annotation was computed. [2022-11-16 12:49:57,049 INFO L895 garLoopResultBuilder]: At program point L524(lines 519 558) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_write_ev~0 ~q_read_ev~0) (<= ~token~0 (+ ~local~0 1)) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= 2 ~T1_E~0) (= ~p_dw_st~0 0) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0) (not (= ~t1_st~0 0)) (< ~local~0 ~token~0)) [2022-11-16 12:49:57,049 INFO L895 garLoopResultBuilder]: At program point L904-1(lines 901 941) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-11-16 12:49:57,050 INFO L895 garLoopResultBuilder]: At program point L409(lines 398 411) the Hoare annotation is: (let ((.cse11 (< ~c_num_read~0 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (= ~q_read_ev~0 2)) (.cse8 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse23 (<= 1 ~c_dr_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse22 (<= 2 ~q_write_ev~0)) (.cse14 (<= ~c_dr_pc~0 1)) (.cse24 (<= ~p_num_write~0 ~c_num_read~0)) (.cse17 (<= ~q_req_up~0 0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse10 (<= 2 ~E_1~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse15 (= ~q_free~0 0)) (.cse16 (<= ~t1_pc~0 0)) (.cse19 (= ~p_dw_i~0 1)) (.cse20 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse11 .cse12 .cse13 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9 .cse21) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse13 .cse22 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse12 .cse23 .cse13 .cse22 .cse14 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9 .cse21) (and .cse0 .cse10 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse6 .cse16 .cse24 .cse17 .cse18 .cse19 .cse7 .cse20 .cse9 .cse25) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse16 .cse24 .cse19 .cse7 .cse20 .cse8 .cse9 .cse25) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse16 .cse24 .cse17 .cse19 .cse7 .cse20 .cse9 .cse25) (and .cse0 .cse10 .cse2 .cse3 .cse12 .cse13 .cse5 .cse15 .cse16 .cse19 (<= ~c_dr_pc~0 0) .cse20 .cse9))) [2022-11-16 12:49:57,050 INFO L899 garLoopResultBuilder]: For program point L921(line 921) no Hoare annotation was computed. [2022-11-16 12:49:57,050 INFO L899 garLoopResultBuilder]: For program point L376(lines 376 383) no Hoare annotation was computed. [2022-11-16 12:49:57,050 INFO L895 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: false [2022-11-16 12:49:57,050 INFO L899 garLoopResultBuilder]: For program point L905(line 905) no Hoare annotation was computed. [2022-11-16 12:49:57,051 INFO L895 garLoopResultBuilder]: At program point L575-1(lines 563 594) the Hoare annotation is: (let ((.cse5 (<= 2 ~m_st~0)) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse13 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (<= 2 ~T1_E~0)) (.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse8 (not (= ~E_M~0 0))) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (<= ~c_dr_pc~0 0)) (.cse16 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse13 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse14 .cse9 .cse10 .cse15 .cse16 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse14 .cse9 .cse10 .cse15 .cse16) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse13 .cse4 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 (= ~token~0 ~local~0)))) [2022-11-16 12:49:57,051 INFO L895 garLoopResultBuilder]: At program point L410(lines 394 412) the Hoare annotation is: (let ((.cse11 (< ~c_num_read~0 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (= ~q_read_ev~0 2)) (.cse8 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse23 (<= 1 ~c_dr_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse22 (<= 2 ~q_write_ev~0)) (.cse14 (<= ~c_dr_pc~0 1)) (.cse24 (<= ~p_num_write~0 ~c_num_read~0)) (.cse17 (<= ~q_req_up~0 0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse10 (<= 2 ~E_1~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse15 (= ~q_free~0 0)) (.cse16 (<= ~t1_pc~0 0)) (.cse19 (= ~p_dw_i~0 1)) (.cse20 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse11 .cse12 .cse13 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9 .cse21) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse13 .cse22 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse12 .cse23 .cse13 .cse22 .cse14 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9 .cse21) (and .cse0 .cse10 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse6 .cse16 .cse24 .cse17 .cse18 .cse19 .cse7 .cse20 .cse9 .cse25) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse16 .cse24 .cse19 .cse7 .cse20 .cse8 .cse9 .cse25) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse16 .cse24 .cse17 .cse19 .cse7 .cse20 .cse9 .cse25) (and .cse0 .cse10 .cse2 .cse3 .cse12 .cse13 .cse5 .cse15 .cse16 .cse19 (<= ~c_dr_pc~0 0) .cse20 .cse9))) [2022-11-16 12:49:57,051 INFO L899 garLoopResultBuilder]: For program point L245(lines 245 249) no Hoare annotation was computed. [2022-11-16 12:49:57,052 INFO L899 garLoopResultBuilder]: For program point L245-2(lines 244 257) no Hoare annotation was computed. [2022-11-16 12:49:57,052 INFO L899 garLoopResultBuilder]: For program point L691(lines 691 695) no Hoare annotation was computed. [2022-11-16 12:49:57,052 INFO L899 garLoopResultBuilder]: For program point L691-1(lines 686 724) no Hoare annotation was computed. [2022-11-16 12:49:57,052 INFO L895 garLoopResultBuilder]: At program point L427-1(lines 424 449) the Hoare annotation is: (let ((.cse29 (= ~p_dw_st~0 0))) (let ((.cse13 (< ~c_num_read~0 ~p_num_write~0)) (.cse23 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse10 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse1 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse20 (= ~q_read_ev~0 2)) (.cse2 (not .cse29)) (.cse26 (<= 1 ~c_dr_pc~0)) (.cse6 (= ~q_free~0 1)) (.cse24 (<= 2 ~q_write_ev~0)) (.cse16 (<= ~c_dr_pc~0 1)) (.cse27 (<= ~p_num_write~0 ~c_num_read~0)) (.cse19 (<= ~q_req_up~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse28 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse12 (<= 2 ~E_1~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse14 (<= 2 ~E_M~0)) (.cse15 (= ~m_st~0 0)) (.cse7 (not (= ~c_dr_st~0 0))) (.cse17 (= ~q_free~0 0)) (.cse18 (<= ~t1_pc~0 0)) (.cse21 (= ~p_dw_i~0 1)) (.cse25 (<= ~c_dr_pc~0 0)) (.cse22 (= ~token~0 ~local~0)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse4 .cse5 (not (= ~q_write_ev~0 0)) .cse13 .cse14 .cse15 .cse16 .cse7 .cse17 .cse8 .cse18 .cse19 .cse20 .cse21 .cse22 .cse11 .cse23) (and .cse0 .cse12 .cse2 .cse4 .cse5 .cse14 .cse15 .cse24 .cse16 .cse7 .cse17 .cse8 .cse18 .cse19 .cse20 .cse21 .cse22 .cse11) (and .cse0 .cse12 .cse1 .cse3 .cse4 .cse5 .cse14 .cse15 .cse6 .cse7 .cse8 .cse18 .cse21 .cse9 .cse25 .cse22 .cse11) (and .cse0 .cse12 .cse2 .cse4 .cse5 .cse13 .cse14 .cse26 .cse15 .cse24 .cse16 .cse17 .cse8 .cse18 .cse19 .cse20 .cse21 .cse22 .cse11 .cse23) (and .cse0 .cse12 .cse4 .cse5 .cse14 .cse26 .cse15 .cse6 .cse24 .cse16 .cse7 .cse8 .cse18 .cse27 .cse19 .cse20 .cse21 .cse9 .cse22 .cse11 .cse28) (and .cse0 .cse12 .cse2 .cse4 .cse5 .cse14 .cse26 .cse15 .cse6 .cse24 .cse16 .cse7 .cse18 .cse27 .cse21 .cse9 .cse22 .cse10 .cse11 .cse28) (and .cse0 .cse12 .cse1 .cse3 .cse4 .cse5 .cse14 .cse15 .cse6 .cse24 .cse8 .cse18 .cse19 .cse29 .cse20 .cse21 .cse9 .cse25 .cse22 .cse11) (and .cse0 .cse12 .cse2 .cse4 .cse5 .cse14 .cse26 .cse15 .cse6 .cse24 .cse16 .cse7 .cse18 .cse27 .cse19 .cse21 .cse9 .cse22 .cse11 .cse28) (and .cse0 .cse12 .cse4 .cse5 .cse14 .cse15 .cse7 .cse17 .cse18 .cse21 .cse25 .cse22 .cse11)))) [2022-11-16 12:49:57,053 INFO L899 garLoopResultBuilder]: For program point L361(lines 361 368) no Hoare annotation was computed. [2022-11-16 12:49:57,053 INFO L899 garLoopResultBuilder]: For program point L576(line 576) no Hoare annotation was computed. [2022-11-16 12:49:57,053 INFO L899 garLoopResultBuilder]: For program point L444(lines 444 448) no Hoare annotation was computed. [2022-11-16 12:49:57,053 INFO L899 garLoopResultBuilder]: For program point L923(lines 923 932) no Hoare annotation was computed. [2022-11-16 12:49:57,053 INFO L899 garLoopResultBuilder]: For program point L923-2(lines 923 932) no Hoare annotation was computed. [2022-11-16 12:49:57,054 INFO L895 garLoopResultBuilder]: At program point L725(lines 680 730) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-11-16 12:49:57,054 INFO L899 garLoopResultBuilder]: For program point L180(lines 180 184) no Hoare annotation was computed. [2022-11-16 12:49:57,054 INFO L895 garLoopResultBuilder]: At program point L147-1(lines 135 170) the Hoare annotation is: (let ((.cse15 (<= 1 ~q_read_ev~0)) (.cse20 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse21 (= ~q_free~0 1)) (.cse22 (<= ~q_req_up~0 0)) (.cse1 (= ~q_req_up~0 1)) (.cse24 (<= 1 ~c_dr_pc~0)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse25 (<= ~c_dr_pc~0 1)) (.cse26 (= ~q_read_ev~0 2)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (not (= ~p_dw_st~0 0))) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse9 (= ~m_st~0 0)) (.cse23 (not (= ~c_dr_st~0 0))) (.cse11 (= ~q_free~0 0)) (.cse12 (<= ~t1_pc~0 0)) (.cse13 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse14 (not (= ~E_M~0 0))) (.cse16 (= ~p_dw_i~0 1)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ~p_num_write~0 1) .cse13 .cse14 .cse15 .cse16 .cse17 (<= 1 ~p_num_write~0) .cse18 .cse19) (and .cse0 .cse2 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 .cse10 .cse12 .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 .cse23 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse24 .cse8 .cse9 .cse21 .cse10 .cse25 .cse23 .cse12 .cse22 .cse13 .cse14 .cse26 .cse16 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 (< ~c_num_read~0 ~p_num_write~0) .cse7 .cse24 .cse8 .cse9 .cse10 .cse25 .cse23 .cse11 .cse12 .cse13 .cse14 .cse26 .cse16 .cse18 .cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19))) [2022-11-16 12:49:57,054 INFO L899 garLoopResultBuilder]: For program point L428(line 428) no Hoare annotation was computed. [2022-11-16 12:49:57,054 INFO L899 garLoopResultBuilder]: For program point L841-1(lines 835 858) no Hoare annotation was computed. [2022-11-16 12:49:57,055 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-16 12:49:57,055 INFO L902 garLoopResultBuilder]: At program point L957(lines 948 959) the Hoare annotation is: true [2022-11-16 12:49:57,055 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 496) no Hoare annotation was computed. [2022-11-16 12:49:57,055 INFO L895 garLoopResultBuilder]: At program point L181(lines 176 224) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (not (= ~p_dw_st~0 0)) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (< ~c_num_read~0 ~p_num_write~0) (<= 2 ~E_M~0) (<= 1 ~c_dr_pc~0) (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|) (= ~m_st~0 0) (<= 2 ~q_write_ev~0) (<= ~c_dr_pc~0 1) (not (= ~c_dr_st~0 0)) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (<= ~q_req_up~0 0) (<= 1 ~q_read_ev~0) (= ~p_dw_i~0 1) (= ~token~0 ~local~0) (= ~M_E~0 2) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) [2022-11-16 12:49:57,055 INFO L899 garLoopResultBuilder]: For program point L148(lines 147 165) no Hoare annotation was computed. [2022-11-16 12:49:57,056 INFO L895 garLoopResultBuilder]: At program point L710(lines 686 724) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-11-16 12:49:57,056 INFO L895 garLoopResultBuilder]: At program point L545-1(lines 519 558) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (<= ~c_dr_pc~0 0)) (.cse13 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 ~t1_pc~0) .cse4 .cse5 .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 .cse10 .cse11 (= ~token~0 ~local~0)) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 (< ~local~0 ~token~0)) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) .cse9 .cse10 .cse11 .cse13))) [2022-11-16 12:49:57,057 INFO L895 garLoopResultBuilder]: At program point L149(lines 135 170) the Hoare annotation is: (let ((.cse2 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse12 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse13 (not (= ~E_M~0 0))) (.cse15 (<= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (not (= ~p_dw_st~0 0))) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse9 (= ~m_st~0 0)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse18 (not (= ~c_dr_st~0 0))) (.cse11 (<= ~t1_pc~0 0)) (.cse14 (= ~p_dw_i~0 1)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~q_req_up~0 0) .cse12 .cse13 (<= 1 ~q_read_ev~0) .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 (= ~q_free~0 0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 (<= 1 ~c_dr_pc~0) .cse8 .cse9 .cse10 (<= ~c_dr_pc~0 1) .cse18 .cse11 (<= ~p_num_write~0 ~c_num_read~0) (= ~q_read_ev~0 2) .cse14 .cse16 .cse17 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2022-11-16 12:49:57,057 INFO L899 garLoopResultBuilder]: For program point L496(line 496) no Hoare annotation was computed. [2022-11-16 12:49:57,057 INFO L902 garLoopResultBuilder]: At program point L942(lines 889 947) the Hoare annotation is: true [2022-11-16 12:49:57,057 INFO L895 garLoopResultBuilder]: At program point L876(line 876) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-11-16 12:49:57,058 INFO L899 garLoopResultBuilder]: For program point L876-1(line 876) no Hoare annotation was computed. [2022-11-16 12:49:57,058 INFO L895 garLoopResultBuilder]: At program point L166(lines 132 171) the Hoare annotation is: (let ((.cse13 (<= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~q_req_up~0 1)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (not (= ~p_dw_st~0 0))) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (<= 2 ~E_M~0)) (.cse7 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse8 (= ~m_st~0 0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse16 (not (= ~c_dr_st~0 0))) (.cse10 (= ~q_free~0 0)) (.cse11 (<= ~t1_pc~0 0)) (.cse12 (= ~p_dw_i~0 1)) (.cse14 (= ~token~0 ~local~0)) (.cse15 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_num_read~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~p_num_write~0 1) (<= 1 ~q_read_ev~0) .cse12 .cse13 (<= 1 ~p_num_write~0) .cse14 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< ~c_num_read~0 ~p_num_write~0) .cse6 .cse7 .cse8 .cse9 (<= ~c_dr_pc~0 1) .cse16 .cse10 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse11 (= ~q_read_ev~0 2) .cse12 .cse14 .cse15 (<= ~p_num_write~0 (+ ~c_num_read~0 1))))) [2022-11-16 12:49:57,059 INFO L895 garLoopResultBuilder]: At program point L348(line 348) the Hoare annotation is: (let ((.cse32 (= ~p_dw_st~0 0))) (let ((.cse15 (<= 1 ~q_read_ev~0)) (.cse30 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse1 (= ~q_req_up~0 1)) (.cse21 (< ~c_num_read~0 ~p_num_write~0)) (.cse26 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse29 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse27 (= ~p_num_write~0 0)) (.cse28 (= ~c_num_read~0 0)) (.cse23 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse25 (= ~q_read_ev~0 2)) (.cse3 (not .cse32)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse9 (= ~q_free~0 1)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse11 (<= ~c_dr_pc~0 1)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse24 (<= ~q_req_up~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse20 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse2 (<= 2 ~E_1~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse12 (not (= ~c_dr_st~0 0))) (.cse22 (= ~q_free~0 0)) (.cse13 (<= ~t1_pc~0 0)) (.cse16 (= ~p_dw_i~0 1)) (.cse31 (<= ~c_dr_pc~0 0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 (not (= ~q_write_ev~0 0)) .cse21 .cse6 .cse7 .cse8 .cse11 .cse12 .cse22 .cse23 .cse13 .cse24 .cse25 .cse16 .cse18 .cse19 .cse26) (and .cse0 .cse27 .cse3 .cse28 .cse4 .cse5 .cse9 .cse12 .cse23 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse17 .cse29 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse22 .cse23 .cse13 .cse24 .cse25 .cse16 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse30 .cse8 .cse10 .cse22 .cse13 (<= ~p_num_write~0 1) .cse15 .cse16 .cse31 (<= 1 ~p_num_write~0) .cse18 .cse19) (and .cse0 .cse2 .cse27 .cse28 .cse4 .cse5 .cse6 .cse8 .cse9 .cse12 .cse23 .cse13 .cse16 .cse17 .cse31 .cse18 .cse19) (and .cse0 .cse2 .cse27 .cse28 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse25 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse22 .cse23 .cse13 .cse25 .cse16 .cse18 .cse19 .cse26) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse10 .cse11 .cse22 .cse23 .cse13 .cse24 .cse25 .cse16 .cse18 .cse19 .cse26) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse23 .cse13 .cse14 .cse24 .cse25 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse29 .cse19 .cse20) (and .cse0 .cse2 .cse27 .cse28 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse23 .cse13 .cse24 .cse32 .cse25 .cse16 .cse17 .cse31 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse24 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse8 .cse12 .cse22 .cse13 .cse16 .cse31 .cse18 .cse19)))) [2022-11-16 12:49:57,059 INFO L895 garLoopResultBuilder]: At program point L216(line 216) the Hoare annotation is: false [2022-11-16 12:49:57,060 INFO L895 garLoopResultBuilder]: At program point L216-1(lines 176 224) the Hoare annotation is: (let ((.cse12 (= ~p_dw_st~0 0))) (let ((.cse8 (= ~q_free~0 1)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse19 (= ~q_req_up~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse20 (not .cse12)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse7 (= ~m_st~0 0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse11 (<= ~t1_pc~0 0)) (.cse23 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse24 (not (= ~E_M~0 0))) (.cse18 (<= 1 ~q_read_ev~0)) (.cse13 (= ~p_dw_i~0 1)) (.cse15 (<= ~c_dr_pc~0 0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2))) (or (and .cse0 .cse1 (= ~p_num_write~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~q_req_up~0 0) .cse12 (= ~q_read_ev~0 2) .cse13 .cse14 .cse15 .cse16 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse17) (and .cse18 (let ((.cse21 (<= ~p_num_write~0 ~c_num_read~0)) (.cse22 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and .cse0 .cse19 .cse1 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~c_dr_pc~0 1) .cse10 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse11 .cse21 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse19 .cse1 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse21 .cse23 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse22)))) (and .cse0 .cse19 .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 (= ~q_free~0 0) .cse11 (<= ~p_num_write~0 1) .cse23 .cse24 .cse18 .cse13 .cse15 (<= 1 ~p_num_write~0) .cse16 .cse17)))) [2022-11-16 12:49:57,060 INFO L895 garLoopResultBuilder]: At program point L497(lines 492 499) the Hoare annotation is: false [2022-11-16 12:49:57,061 INFO L899 garLoopResultBuilder]: For program point L646(lines 646 650) no Hoare annotation was computed. [2022-11-16 12:49:57,061 INFO L899 garLoopResultBuilder]: For program point L646-2(lines 645 658) no Hoare annotation was computed. [2022-11-16 12:49:57,062 INFO L895 garLoopResultBuilder]: At program point L84(lines 72 86) the Hoare annotation is: (let ((.cse22 (not (= ~p_num_write~0 0))) (.cse23 (not (= ~c_num_read~0 0))) (.cse3 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse7 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse15 (not (<= 1 ~c_dr_pc~0))) (.cse17 (not (= ~q_free~0 1))) (.cse18 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse11 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse21 (not (<= ~c_dr_pc~0 0))) (.cse14 (not (<= 2 ~q_write_ev~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (not (= ~M_E~0 2))) (.cse4 (not (<= ~t1_pc~0 0))) (.cse5 (and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse27 (not (= ~q_free~0 0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse9 (not (<= ~c_dr_pc~0 1))) (.cse10 (= ~p_dw_st~0 0)) (.cse24 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse12 (not (= ~T1_E~0 ~M_E~0))) (.cse13 (not (= ~m_st~0 0))) (.cse16 (not (= ~p_dw_i~0 1))) (.cse25 (not (<= ~q_req_up~0 0))) (.cse26 (not (= ~q_read_ev~0 2))) (.cse19 (not (<= 2 ~E_1~0))) (.cse20 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse21 .cse1 (not .cse10) .cse2 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse4 .cse22 .cse5 .cse6 .cse23 .cse8 .cse24 .cse12 .cse13 .cse16 .cse17 .cse25 .cse26 .cse18 .cse19 .cse20) (or .cse0 .cse21 .cse1 .cse2 .cse4 .cse22 .cse5 .cse6 .cse23 .cse8 .cse24 .cse12 .cse13 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse22 .cse5 .cse6 (= ~E_M~0 0) .cse23 .cse10 .cse24 .cse11 .cse12 .cse17 .cse18) (or .cse0 .cse1 .cse2 (= ~q_read_ev~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse25 .cse18 .cse19 .cse20) (or .cse0 .cse21 .cse1 .cse2 .cse4 .cse5 .cse6 .cse27 .cse8 .cse10 .cse11 .cse12 .cse13 .cse16 .cse19 .cse20) (or .cse0 .cse21 .cse1 .cse2 .cse4 .cse5 .cse6 .cse27 .cse8 .cse10 .cse12 .cse13 .cse16 .cse26 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse27 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse14 .cse16 .cse25 .cse26 .cse19 .cse20) (or .cse0 .cse1 .cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse4 .cse5 (not (< ~c_num_read~0 ~p_num_write~0)) .cse6 .cse27 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 (= ~q_write_ev~0 0) .cse16 .cse25 .cse26 .cse19 .cse20))) [2022-11-16 12:49:57,062 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 69 87) no Hoare annotation was computed. [2022-11-16 12:49:57,062 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 69 87) no Hoare annotation was computed. [2022-11-16 12:49:57,063 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 79) no Hoare annotation was computed. [2022-11-16 12:49:57,063 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 82) no Hoare annotation was computed. [2022-11-16 12:49:57,063 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 73 82) no Hoare annotation was computed. [2022-11-16 12:49:57,063 INFO L902 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 69 87) the Hoare annotation is: true [2022-11-16 12:49:57,063 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1FINAL(lines 259 278) no Hoare annotation was computed. [2022-11-16 12:49:57,064 INFO L895 garLoopResultBuilder]: At program point L275(lines 262 277) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse27 (= ~q_read_ev~0 2)) (.cse26 (= ~p_dw_st~0 0))) (let ((.cse15 (not (= ~p_num_write~0 0))) (.cse3 (not .cse26)) (.cse18 (not (= ~q_free~0 1))) (.cse19 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse20 (not (<= ~c_dr_pc~0 1))) (.cse17 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse22 (not (<= 1 ~c_dr_pc~0))) (.cse23 (not (<= ~q_req_up~0 0))) (.cse24 (not .cse27)) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse4 (not (= ~M_E~0 2))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse16 (not (= ~c_num_read~0 0))) (.cse7 (not (= ~q_free~0 0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse10 (not (= ~m_st~0 0))) (.cse21 (not (<= 2 ~q_write_ev~0))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse12 (<= 1 exists_runnable_thread1_~__retres1~2)) (.cse25 (not .cse0)) (.cse13 (not (<= 2 ~E_1~0))) (.cse14 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse16 .cse8 .cse17 .cse9 .cse10 .cse11 .cse18 .cse12 .cse19 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse16 .cse8 .cse20 .cse9 .cse10 .cse21 .cse22 .cse11 .cse18 .cse12 .cse23 .cse24 .cse19 .cse13 .cse14) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse16 .cse8 .cse17 .cse9 .cse10 .cse21 .cse11 .cse18 .cse12 .cse23 .cse24 .cse19 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse4 (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) .cse5 .cse6 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse8 .cse20 .cse17 .cse9 .cse10 .cse21 .cse22 .cse11 .cse18 .cse12 .cse23 .cse24 .cse19 .cse13 .cse14) (or .cse2 .cse4 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse25 .cse5 (not (< ~c_num_read~0 ~p_num_write~0)) .cse6 .cse7 .cse8 .cse20 .cse26 .cse17 .cse9 .cse10 .cse21 .cse22 .cse11 .cse12 .cse23 .cse24 .cse13 .cse14) (or .cse1 .cse2 .cse4 (not (= ~q_req_up~0 1)) .cse5 .cse6 .cse16 .cse7 .cse8 .cse26 .cse9 .cse10 .cse21 .cse11 .cse12 (not (<= 1 ~p_num_write~0)) (not (<= 1 ~q_read_ev~0)) (and .cse25 .cse27) .cse13 (not (<= ~p_num_write~0 1)) .cse14)))) [2022-11-16 12:49:57,064 INFO L902 garLoopResultBuilder]: At program point exists_runnable_thread1ENTRY(lines 259 278) the Hoare annotation is: true [2022-11-16 12:49:57,064 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 272) no Hoare annotation was computed. [2022-11-16 12:49:57,064 INFO L899 garLoopResultBuilder]: For program point L263(lines 263 273) no Hoare annotation was computed. [2022-11-16 12:49:57,064 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 259 278) no Hoare annotation was computed. [2022-11-16 12:49:57,065 INFO L902 garLoopResultBuilder]: At program point error1ENTRY(lines 24 31) the Hoare annotation is: true [2022-11-16 12:49:57,065 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 28) no Hoare annotation was computed. [2022-11-16 12:49:57,065 INFO L899 garLoopResultBuilder]: For program point error1FINAL(lines 24 31) no Hoare annotation was computed. [2022-11-16 12:49:57,065 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 24 31) no Hoare annotation was computed. [2022-11-16 12:49:57,065 INFO L899 garLoopResultBuilder]: For program point L668(lines 668 673) no Hoare annotation was computed. [2022-11-16 12:49:57,065 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2FINAL(lines 660 679) no Hoare annotation was computed. [2022-11-16 12:49:57,065 INFO L899 garLoopResultBuilder]: For program point L664(lines 664 674) no Hoare annotation was computed. [2022-11-16 12:49:57,066 INFO L902 garLoopResultBuilder]: At program point exists_runnable_thread2ENTRY(lines 660 679) the Hoare annotation is: true [2022-11-16 12:49:57,066 INFO L902 garLoopResultBuilder]: At program point L676(lines 663 678) the Hoare annotation is: true [2022-11-16 12:49:57,066 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 660 679) no Hoare annotation was computed. [2022-11-16 12:49:57,066 INFO L899 garLoopResultBuilder]: For program point L306-1(lines 297 314) no Hoare annotation was computed. [2022-11-16 12:49:57,067 INFO L895 garLoopResultBuilder]: At program point reset_delta_events1ENTRY(lines 297 314) the Hoare annotation is: (let ((.cse32 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse18 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse14 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse15 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse19 (not (<= 2 |old(~q_write_ev~0)|))) (.cse28 (not (< 0 |old(~q_write_ev~0)|))) (.cse20 (not (<= 1 ~c_dr_pc~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse30 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse31 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse6 (and .cse32 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse7 (not (= ~q_free~0 0))) (.cse16 (not (<= ~c_dr_pc~0 1))) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse17 (= ~p_dw_st~0 0)) (.cse3 (not (= ~M_E~0 2))) (.cse4 (not (<= ~t1_pc~0 0))) (.cse23 (not (= ~p_num_write~0 0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse24 (not (= ~c_num_read~0 0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse25 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse10 (not (= ~m_st~0 0))) (.cse27 (not (= |old(~q_read_ev~0)| 2))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse21 (not (= ~q_free~0 1))) (.cse26 (not (<= ~q_req_up~0 0))) (.cse22 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse12 (not (<= 2 ~E_1~0))) (.cse29 (and .cse32 (= ~q_read_ev~0 2))) (.cse13 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse14 .cse4 .cse5 .cse15 .cse6 .cse8 .cse16 .cse17 .cse18 .cse9 .cse10 .cse19 .cse20 .cse11 .cse21 .cse22 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse23 .cse5 .cse6 .cse24 .cse8 .cse25 .cse9 .cse10 .cse11 .cse21 .cse22 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse14 .cse4 .cse5 .cse15 .cse6 .cse8 .cse16 .cse17 .cse9 .cse10 .cse19 .cse20 .cse11 .cse21 .cse26 .cse22 .cse12 .cse13) (or .cse0 .cse2 .cse3 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse23 .cse5 (= ~E_M~0 0) .cse6 .cse24 .cse17 .cse25 .cse18 .cse9 .cse21 .cse22) (or .cse0 .cse2 .cse3 .cse14 .cse4 .cse5 .cse15 .cse6 .cse8 .cse16 .cse25 .cse9 .cse10 (not (= |old(~q_read_ev~0)| 1)) .cse19 .cse20 .cse11 .cse21 .cse26 .cse22 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse16 .cse17 .cse25 .cse9 .cse10 .cse27 .cse28 .cse11 .cse26 .cse12 .cse29 .cse13) (or .cse2 .cse3 .cse30 .cse4 .cse31 .cse5 .cse6 .cse7 .cse8 .cse16 .cse17 .cse25 .cse9 .cse10 .cse27 .cse28 .cse20 .cse11 .cse26 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse30 .cse4 .cse31 .cse5 .cse6 .cse7 .cse8 .cse16 .cse17 .cse25 .cse9 .cse10 .cse27 .cse11 (= |old(~q_write_ev~0)| 0) .cse26 .cse12 .cse13) (or .cse1 .cse2 (not .cse17) .cse3 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse4 .cse23 .cse5 .cse24 .cse8 .cse25 .cse9 .cse10 .cse27 .cse11 .cse21 .cse26 .cse22 .cse12 .cse29 .cse13)))) [2022-11-16 12:49:57,067 INFO L899 garLoopResultBuilder]: For program point L301-1(lines 300 313) no Hoare annotation was computed. [2022-11-16 12:49:57,067 INFO L899 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 297 314) no Hoare annotation was computed. [2022-11-16 12:49:57,067 INFO L899 garLoopResultBuilder]: For program point L768-1(lines 762 785) no Hoare annotation was computed. [2022-11-16 12:49:57,067 INFO L899 garLoopResultBuilder]: For program point L763-1(lines 762 785) no Hoare annotation was computed. [2022-11-16 12:49:57,067 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 759 786) no Hoare annotation was computed. [2022-11-16 12:49:57,068 INFO L895 garLoopResultBuilder]: At program point reset_delta_events2ENTRY(lines 759 786) the Hoare annotation is: (let ((.cse15 (not (= ~m_st~0 0))) (.cse7 (= ~t1_st~0 0)) (.cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.cse18 (not (<= ~t1_pc~0 0))) (.cse19 (not (<= 2 ~m_st~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (<= 2 |old(~T1_E~0)|))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not (= ~c_num_read~0 0))) (.cse11 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse12 (not (= ~q_free~0 0))) (.cse13 (not (<= 2 |old(~E_M~0)|))) (.cse14 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse17 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (< ~local~0 ~token~0)) .cse13 .cse14 .cse15 .cse16 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse19 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (or .cse19 .cse1 (= |old(~E_M~0)| 0) .cse2 .cse4 .cse5 .cse8 .cse10 .cse11 .cse12 .cse14 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1)) .cse16) (or .cse19 .cse0 .cse1 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17) (or .cse19 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17))) [2022-11-16 12:49:57,068 INFO L899 garLoopResultBuilder]: For program point L778-1(lines 759 786) no Hoare annotation was computed. [2022-11-16 12:49:57,068 INFO L899 garLoopResultBuilder]: For program point L773-1(lines 762 785) no Hoare annotation was computed. [2022-11-16 12:49:57,073 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:49:57,076 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:49:57,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:49:57 BoogieIcfgContainer [2022-11-16 12:49:57,221 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:49:57,221 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:49:57,222 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:49:57,222 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:49:57,222 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:46:59" (3/4) ... [2022-11-16 12:49:57,226 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-16 12:49:57,233 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2022-11-16 12:49:57,233 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2022-11-16 12:49:57,233 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2022-11-16 12:49:57,234 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2022-11-16 12:49:57,234 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2022-11-16 12:49:57,234 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2022-11-16 12:49:57,234 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2022-11-16 12:49:57,234 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2022-11-16 12:49:57,235 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2022-11-16 12:49:57,235 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2022-11-16 12:49:57,235 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2022-11-16 12:49:57,235 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2022-11-16 12:49:57,235 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2022-11-16 12:49:57,235 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2022-11-16 12:49:57,244 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2022-11-16 12:49:57,245 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-16 12:49:57,246 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-16 12:49:57,247 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-16 12:49:57,274 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || p_dw_st == 0) || \old(q_read_ev) == q_read_ev) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local)) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(p_num_write <= c_num_read + 1)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || \old(q_write_ev) == 0) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(\old(q_read_ev) == \old(q_write_ev))) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(\old(q_req_up) <= 0)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(1 <= \old(q_read_ev))) || !(\old(q_req_up) == 1)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || (q_req_up <= 0 && q_write_ev == \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || (q_req_up <= 0 && q_read_ev == 2)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(\old(q_req_up) == 1)) || !(p_num_write <= c_num_read + 1)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || q_write_ev == \old(q_write_ev)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) [2022-11-16 12:49:57,275 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) && ((((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local)) [2022-11-16 12:49:57,275 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && ((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) [2022-11-16 12:49:57,277 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((!(p_dw_st == 0) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || (((m_st == 0 && __retres1 <= 0) && 0 <= __retres1) && !(t1_st == 0))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) [2022-11-16 12:49:57,278 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(token == local)) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (((((m_st == 0 && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && !(t1_st == 0)) && 0 <= \result)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(token == local))) && ((((((((((((!(p_dw_st == 0) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) [2022-11-16 12:49:57,388 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 12:49:57,388 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:49:57,391 INFO L158 Benchmark]: Toolchain (without parser) took 178990.40ms. Allocated memory was 127.9MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 93.2MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2022-11-16 12:49:57,393 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 96.5MB. Free memory was 71.4MB in the beginning and 71.4MB in the end (delta: 30.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:49:57,398 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.64ms. Allocated memory is still 127.9MB. Free memory was 93.2MB in the beginning and 99.0MB in the end (delta: -5.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 12:49:57,399 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.81ms. Allocated memory is still 127.9MB. Free memory was 99.0MB in the beginning and 96.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 12:49:57,400 INFO L158 Benchmark]: Boogie Preprocessor took 54.43ms. Allocated memory is still 127.9MB. Free memory was 96.4MB in the beginning and 93.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:49:57,400 INFO L158 Benchmark]: RCFGBuilder took 800.81ms. Allocated memory is still 127.9MB. Free memory was 93.8MB in the beginning and 67.5MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-16 12:49:57,402 INFO L158 Benchmark]: TraceAbstraction took 177486.62ms. Allocated memory was 127.9MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 67.0MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2022-11-16 12:49:57,403 INFO L158 Benchmark]: Witness Printer took 166.84ms. Allocated memory is still 3.9GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 12:49:57,404 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.24ms. Allocated memory is still 96.5MB. Free memory was 71.4MB in the beginning and 71.4MB in the end (delta: 30.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 424.64ms. Allocated memory is still 127.9MB. Free memory was 93.2MB in the beginning and 99.0MB in the end (delta: -5.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.81ms. Allocated memory is still 127.9MB. Free memory was 99.0MB in the beginning and 96.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.43ms. Allocated memory is still 127.9MB. Free memory was 96.4MB in the beginning and 93.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 800.81ms. Allocated memory is still 127.9MB. Free memory was 93.8MB in the beginning and 67.5MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 177486.62ms. Allocated memory was 127.9MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 67.0MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. * Witness Printer took 166.84ms. Allocated memory is still 3.9GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 496]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 28]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 208 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 177.3s, OverallIterations: 35, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 47.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 91.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18613 SdHoareTripleChecker+Valid, 16.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18161 mSDsluCounter, 24614 SdHoareTripleChecker+Invalid, 13.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17186 mSDsCounter, 4223 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18143 IncrementalHoareTripleChecker+Invalid, 22366 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4223 mSolverCounterUnsat, 7428 mSDtfsCounter, 18143 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3749 GetRequests, 3273 SyntacticMatches, 16 SemanticMatches, 460 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1452 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14282occurred in iteration=18, InterpolantAutomatonStates: 403, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 25.0s AutomataMinimizationTime, 35 MinimizatonAttempts, 9753 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 84 LocationsWithAnnotation, 16053 PreInvPairs, 18024 NumberOfFragments, 28642 HoareAnnotationTreeSize, 16053 FomulaSimplifications, 13096 FormulaSimplificationTreeSizeReduction, 19.7s HoareSimplificationTime, 84 FomulaSimplificationsInter, 574773 FormulaSimplificationTreeSizeReductionInter, 71.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 5734 NumberOfCodeBlocks, 5734 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 6171 ConstructedInterpolants, 0 QuantifiedInterpolants, 11614 SizeOfPredicates, 7 NumberOfNonLiveVariables, 6631 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 52 InterpolantComputations, 32 PerfectInterpolantSequences, 3229/3363 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 889]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 686]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 642]: Loop Invariant Derived loop invariant: ((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 563]: Loop Invariant Derived loop invariant: (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local) - InvariantResult [Line: 615]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(token == local)) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (((((m_st == 0 && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && !(t1_st == 0)) && 0 <= \result)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(token == local))) && ((((((((((((!(p_dw_st == 0) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: ((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 1) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2 - InvariantResult [Line: 680]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 860]: Loop Invariant Derived loop invariant: (((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2 - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(p_num_write == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(T1_E == M_E)) || !(q_free == 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || q_read_ev == 1) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(p_num_write <= c_num_read + 1)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || q_write_ev == 0) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local)) - InvariantResult [Line: 516]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 823]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 560]: Loop Invariant Derived loop invariant: ((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (1 <= t1_pc || !(m_pc <= 0))) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && ((t1_pc <= 1 && !(m_pc <= 1)) || m_pc <= 0)) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && ((t1_pc <= 1 && !(m_pc <= 1)) || m_pc <= 0)) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token) - InvariantResult [Line: 596]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && ((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) - InvariantResult [Line: 663]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((((((((T1_E == M_E && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && __retres1 <= 0) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && 0 <= __retres1) && M_E == 2)) || !(token == local)) && ((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(T1_E == M_E)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(T1_E == M_E)) || (__retres1 <= 0 && 0 <= __retres1)) || !(q_free == 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(q_read_ev == 1)) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((((((((T1_E == M_E && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && __retres1 <= 0) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && 0 <= __retres1) && M_E == 2)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(p_num_write <= c_num_read + 1)) || !(t1_pc <= 0)) || 0 < q_write_ev) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || q_write_ev == 0) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local)) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (((((((((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && 2 <= E_M) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 492]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 832]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: (((((((((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && 2 <= E_M) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || ((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((!(p_dw_st == 0) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || (((m_st == 0 && __retres1 <= 0) && 0 <= __retres1) && !(t1_st == 0))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && q_free == 0) && t1_pc <= 0) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) && token == local) && M_E == 2) || ((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && t1_pc <= 0) && q_req_up <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2) || (((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && !(c_dr_st == 0)) && t1_pc <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && c_num_read < p_num_write + 1) - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: M_E == 2 - InvariantResult [Line: 519]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token - InvariantResult [Line: 241]: Loop Invariant Derived loop invariant: ((((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 1) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 901]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || p_dw_st == 0) || \old(q_read_ev) == q_read_ev) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local)) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(p_num_write <= c_num_read + 1)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || \old(q_write_ev) == 0) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(\old(q_read_ev) == \old(q_write_ev))) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(\old(q_req_up) <= 0)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(1 <= \old(q_read_ev))) || !(\old(q_req_up) == 1)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || (q_req_up <= 0 && q_write_ev == \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || (q_req_up <= 0 && q_read_ev == 2)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(\old(q_req_up) == 1)) || !(p_num_write <= c_num_read + 1)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || q_write_ev == \old(q_write_ev)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && !(c_dr_st == 0)) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || (1 <= q_read_ev && (((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1) || (((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)))) || ((((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_num_write <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) && token == local) && M_E == 2) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && 1 <= q_read_ev) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1 - InvariantResult [Line: 473]: Loop Invariant Derived loop invariant: M_E == 2 - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && q_free == 0) && t1_pc <= 0) && p_num_write <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) && token == local) && M_E == 2) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && t1_pc <= 0) && q_req_up <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && !(c_dr_st == 0)) && t1_pc <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && q_req_up <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2)) || ((((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 519]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) || (((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) - InvariantResult [Line: 599]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) && ((((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local)) - InvariantResult [Line: 948]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: (((((((((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && 2 <= E_M) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || ((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || (((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1) - InvariantResult [Line: 870]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: (((((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || 1 <= __retres1) || !(2 <= E_1)) || !(token == local)) && ((((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(q_free == 1)) || 1 <= __retres1) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || 1 <= __retres1) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(q_free == 1)) || 1 <= __retres1) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || 1 <= __retres1) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((!(m_pc == t1_pc) || !(M_E == 2)) || !(p_num_write <= c_num_read + 1)) || !(c_dr_st == 0)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || 1 <= __retres1) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(q_req_up == 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || 1 <= __retres1) || !(1 <= p_num_write)) || !(1 <= q_read_ev)) || (!(c_dr_st == 0) && q_read_ev == 2)) || !(2 <= E_1)) || !(p_num_write <= 1)) || !(token == local)) - InvariantResult [Line: 424]: Loop Invariant Derived loop invariant: (((((((((((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && 2 <= E_M) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2)) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || ((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || (((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && q_free == 0) && t1_pc <= 0) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) && token == local) && M_E == 2)) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2)) || ((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || ((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 563]: Loop Invariant Derived loop invariant: ((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (1 <= t1_pc || !(m_pc <= 0))) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && ((t1_pc <= 1 && !(m_pc <= 1)) || m_pc <= 0)) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || (((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local) RESULT: Ultimate proved your program to be correct! [2022-11-16 12:49:57,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7c6affa-42d1-4b69-8b1e-ce580dc42352/bin/uautomizer-tPACEb0tL8/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