./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 e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/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_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f24e14c02d3357f8669328b41c4b37af446f7269afa24af78cb772dc24fa0c01 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:25:33,183 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:25:33,299 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:25:33,306 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:25:33,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:25:33,353 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:25:33,354 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:25:33,355 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:25:33,356 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:25:33,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:25:33,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:25:33,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:25:33,364 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:25:33,366 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:25:33,367 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:25:33,367 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:25:33,368 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:25:33,368 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:25:33,369 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:25:33,369 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:25:33,370 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:25:33,370 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:25:33,371 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:25:33,371 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:25:33,372 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:25:33,373 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:25:33,374 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:25:33,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:25:33,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:25:33,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:25:33,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:25:33,377 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:25:33,378 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:25:33,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:25:33,378 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:25:33,379 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:25:33,379 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:25:33,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:25:33,380 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:25:33,380 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/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_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP 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 [2023-11-06 22:25:33,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:25:33,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:25:33,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:25:33,763 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:25:33,764 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:25:33,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2023-11-06 22:25:36,902 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:25:37,269 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:25:37,270 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2023-11-06 22:25:37,296 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/data/60acff507/c23915e03f5e46ff9ad70c6e297625f2/FLAG6c9bcfb85 [2023-11-06 22:25:37,316 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/data/60acff507/c23915e03f5e46ff9ad70c6e297625f2 [2023-11-06 22:25:37,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:25:37,321 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:25:37,323 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:25:37,323 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:25:37,336 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:25:37,337 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:25:37" (1/1) ... [2023-11-06 22:25:37,338 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@481ec2c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:37, skipping insertion in model container [2023-11-06 22:25:37,339 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:25:37" (1/1) ... [2023-11-06 22:25:37,411 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:25:37,602 WARN L240 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_1147086c-d064-4d75-97ba-5e2eac2c8e77/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2023-11-06 22:25:37,669 WARN L240 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_1147086c-d064-4d75-97ba-5e2eac2c8e77/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2023-11-06 22:25:37,714 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:25:37,729 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:25:37,746 WARN L240 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_1147086c-d064-4d75-97ba-5e2eac2c8e77/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2023-11-06 22:25:37,783 WARN L240 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_1147086c-d064-4d75-97ba-5e2eac2c8e77/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2023-11-06 22:25:37,805 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:25:37,829 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:25:37,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:37 WrapperNode [2023-11-06 22:25:37,829 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:25:37,830 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:25:37,831 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:25:37,831 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:25:37,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:37" (1/1) ... [2023-11-06 22:25:37,852 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:37" (1/1) ... [2023-11-06 22:25:37,908 INFO L138 Inliner]: procedures = 55, calls = 60, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 410 [2023-11-06 22:25:37,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:25:37,909 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:25:37,910 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:25:37,910 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:25:37,925 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:37" (1/1) ... [2023-11-06 22:25:37,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:37" (1/1) ... [2023-11-06 22:25:37,931 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:37" (1/1) ... [2023-11-06 22:25:37,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:37" (1/1) ... [2023-11-06 22:25:37,942 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:37" (1/1) ... [2023-11-06 22:25:37,951 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:37" (1/1) ... [2023-11-06 22:25:37,955 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:37" (1/1) ... [2023-11-06 22:25:37,957 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:37" (1/1) ... [2023-11-06 22:25:37,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:25:37,964 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:25:37,964 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:25:37,964 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:25:37,965 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:37" (1/1) ... [2023-11-06 22:25:37,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:25:37,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:25:38,007 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:25:38,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:25:38,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:25:38,111 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-11-06 22:25:38,111 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-11-06 22:25:38,112 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-11-06 22:25:38,112 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-11-06 22:25:38,112 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-11-06 22:25:38,113 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-11-06 22:25:38,113 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-11-06 22:25:38,113 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-11-06 22:25:38,115 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2023-11-06 22:25:38,116 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2023-11-06 22:25:38,116 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-11-06 22:25:38,116 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-11-06 22:25:38,117 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-11-06 22:25:38,117 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-11-06 22:25:38,117 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2023-11-06 22:25:38,117 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2023-11-06 22:25:38,117 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-11-06 22:25:38,117 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-11-06 22:25:38,118 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2023-11-06 22:25:38,118 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2023-11-06 22:25:38,118 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-11-06 22:25:38,118 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-11-06 22:25:38,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:25:38,120 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-11-06 22:25:38,120 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-11-06 22:25:38,120 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2023-11-06 22:25:38,120 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2023-11-06 22:25:38,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:25:38,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:25:38,122 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-11-06 22:25:38,122 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-11-06 22:25:38,232 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:25:38,235 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:25:38,882 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:25:38,899 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:25:38,899 INFO L302 CfgBuilder]: Removed 8 assume(true) statements. [2023-11-06 22:25:38,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:25:38 BoogieIcfgContainer [2023-11-06 22:25:38,902 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:25:38,906 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:25:38,907 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:25:38,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:25:38,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:25:37" (1/3) ... [2023-11-06 22:25:38,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4071fd89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:25:38, skipping insertion in model container [2023-11-06 22:25:38,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:37" (2/3) ... [2023-11-06 22:25:38,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4071fd89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:25:38, skipping insertion in model container [2023-11-06 22:25:38,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:25:38" (3/3) ... [2023-11-06 22:25:38,913 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2023-11-06 22:25:38,935 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:25:38,936 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-06 22:25:39,015 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:25:39,022 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;@3aa543f9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:25:39,022 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-06 22:25:39,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 210 states, 164 states have (on average 1.524390243902439) internal successors, (250), 170 states have internal predecessors, (250), 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) [2023-11-06 22:25:39,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-06 22:25:39,042 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:39,042 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] [2023-11-06 22:25:39,043 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:39,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:39,049 INFO L85 PathProgramCache]: Analyzing trace with hash 14366042, now seen corresponding path program 1 times [2023-11-06 22:25:39,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:39,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579557957] [2023-11-06 22:25:39,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:39,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:39,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:25:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:39,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:25:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:39,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:25:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:39,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:25:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:39,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:25:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:39,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:39,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:39,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579557957] [2023-11-06 22:25:39,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579557957] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:39,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:39,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:25:39,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621396976] [2023-11-06 22:25:39,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:39,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:25:39,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:39,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:25:39,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:25:39,697 INFO L87 Difference]: Start difference. First operand has 210 states, 164 states have (on average 1.524390243902439) internal successors, (250), 170 states have internal predecessors, (250), 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) [2023-11-06 22:25:40,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:40,908 INFO L93 Difference]: Finished difference Result 536 states and 796 transitions. [2023-11-06 22:25:40,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:25:40,915 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 [2023-11-06 22:25:40,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:40,931 INFO L225 Difference]: With dead ends: 536 [2023-11-06 22:25:40,932 INFO L226 Difference]: Without dead ends: 333 [2023-11-06 22:25:40,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:25:40,943 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 526 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:40,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 638 Invalid, 680 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [100 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 22:25:40,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2023-11-06 22:25:41,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 292. [2023-11-06 22:25:41,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 231 states have (on average 1.4242424242424243) internal successors, (329), 236 states have internal predecessors, (329), 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) [2023-11-06 22:25:41,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 408 transitions. [2023-11-06 22:25:41,071 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 408 transitions. Word has length 57 [2023-11-06 22:25:41,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:41,072 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 408 transitions. [2023-11-06 22:25:41,073 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) [2023-11-06 22:25:41,073 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 408 transitions. [2023-11-06 22:25:41,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-06 22:25:41,077 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:41,078 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] [2023-11-06 22:25:41,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:25:41,078 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:41,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:41,079 INFO L85 PathProgramCache]: Analyzing trace with hash -897585954, now seen corresponding path program 1 times [2023-11-06 22:25:41,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:41,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059388835] [2023-11-06 22:25:41,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:41,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:41,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:25:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:41,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:25:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:41,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:25:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:41,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:25:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:41,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:25:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:41,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:41,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:41,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059388835] [2023-11-06 22:25:41,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059388835] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:41,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:41,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:25:41,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379756259] [2023-11-06 22:25:41,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:41,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:25:41,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:41,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:25:41,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:25:41,351 INFO L87 Difference]: Start difference. First operand 292 states and 408 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) [2023-11-06 22:25:42,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:42,547 INFO L93 Difference]: Finished difference Result 630 states and 888 transitions. [2023-11-06 22:25:42,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:25:42,548 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 [2023-11-06 22:25:42,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:42,561 INFO L225 Difference]: With dead ends: 630 [2023-11-06 22:25:42,561 INFO L226 Difference]: Without dead ends: 443 [2023-11-06 22:25:42,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:25:42,572 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 507 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:42,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 932 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 22:25:42,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2023-11-06 22:25:42,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 379. [2023-11-06 22:25:42,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 301 states have (on average 1.415282392026578) internal successors, (426), 307 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) [2023-11-06 22:25:42,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 527 transitions. [2023-11-06 22:25:42,683 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 527 transitions. Word has length 57 [2023-11-06 22:25:42,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:42,683 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 527 transitions. [2023-11-06 22:25:42,684 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) [2023-11-06 22:25:42,684 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 527 transitions. [2023-11-06 22:25:42,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-06 22:25:42,687 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:42,687 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] [2023-11-06 22:25:42,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:25:42,688 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:42,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:42,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1347993500, now seen corresponding path program 1 times [2023-11-06 22:25:42,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:42,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190943950] [2023-11-06 22:25:42,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:42,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:42,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:25:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:42,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:25:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:42,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:25:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:42,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:25:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:42,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:25:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:42,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:42,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:42,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190943950] [2023-11-06 22:25:42,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190943950] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:42,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:42,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:25:42,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721955687] [2023-11-06 22:25:42,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:42,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:25:42,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:42,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:25:42,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:25:42,875 INFO L87 Difference]: Start difference. First operand 379 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) [2023-11-06 22:25:43,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:43,459 INFO L93 Difference]: Finished difference Result 715 states and 1009 transitions. [2023-11-06 22:25:43,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:25:43,460 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2023-11-06 22:25:43,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:43,464 INFO L225 Difference]: With dead ends: 715 [2023-11-06 22:25:43,464 INFO L226 Difference]: Without dead ends: 441 [2023-11-06 22:25:43,465 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 [2023-11-06 22:25:43,467 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 540 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:43,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 495 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:25:43,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2023-11-06 22:25:43,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 379. [2023-11-06 22:25:43,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 301 states have (on average 1.4053156146179402) internal successors, (423), 307 states have internal predecessors, (423), 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) [2023-11-06 22:25:43,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 524 transitions. [2023-11-06 22:25:43,539 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 524 transitions. Word has length 57 [2023-11-06 22:25:43,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:43,540 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 524 transitions. [2023-11-06 22:25:43,540 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) [2023-11-06 22:25:43,540 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 524 transitions. [2023-11-06 22:25:43,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-06 22:25:43,544 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:43,544 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] [2023-11-06 22:25:43,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:25:43,545 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:43,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:43,546 INFO L85 PathProgramCache]: Analyzing trace with hash 450600222, now seen corresponding path program 1 times [2023-11-06 22:25:43,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:43,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127571961] [2023-11-06 22:25:43,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:43,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:43,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:25:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:43,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:25:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:43,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:25:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:43,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:25:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:43,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:25:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:43,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:43,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:43,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127571961] [2023-11-06 22:25:43,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127571961] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:43,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:43,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:25:43,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010443838] [2023-11-06 22:25:43,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:43,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:25:43,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:43,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:25:43,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:25:43,705 INFO L87 Difference]: Start difference. First operand 379 states and 524 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) [2023-11-06 22:25:44,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:44,452 INFO L93 Difference]: Finished difference Result 751 states and 1066 transitions. [2023-11-06 22:25:44,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:25:44,453 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 [2023-11-06 22:25:44,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:44,457 INFO L225 Difference]: With dead ends: 751 [2023-11-06 22:25:44,458 INFO L226 Difference]: Without dead ends: 478 [2023-11-06 22:25:44,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:25:44,476 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 259 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:44,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 846 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:25:44,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2023-11-06 22:25:44,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 388. [2023-11-06 22:25:44,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 310 states have (on average 1.3935483870967742) internal successors, (432), 316 states have internal predecessors, (432), 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) [2023-11-06 22:25:44,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 533 transitions. [2023-11-06 22:25:44,536 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 533 transitions. Word has length 57 [2023-11-06 22:25:44,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:44,537 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 533 transitions. [2023-11-06 22:25:44,537 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) [2023-11-06 22:25:44,537 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 533 transitions. [2023-11-06 22:25:44,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-06 22:25:44,539 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:44,539 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] [2023-11-06 22:25:44,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:25:44,540 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:44,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:44,540 INFO L85 PathProgramCache]: Analyzing trace with hash 378213664, now seen corresponding path program 1 times [2023-11-06 22:25:44,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:44,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763052396] [2023-11-06 22:25:44,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:44,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:44,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:25:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:44,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:25:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:44,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:25:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:44,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:25:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:44,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:25:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:44,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:44,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:44,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763052396] [2023-11-06 22:25:44,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763052396] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:44,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:44,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:25:44,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634604109] [2023-11-06 22:25:44,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:44,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:25:44,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:44,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:25:44,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:25:44,707 INFO L87 Difference]: Start difference. First operand 388 states and 533 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) [2023-11-06 22:25:46,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:46,017 INFO L93 Difference]: Finished difference Result 1567 states and 2250 transitions. [2023-11-06 22:25:46,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:25:46,018 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 [2023-11-06 22:25:46,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:46,029 INFO L225 Difference]: With dead ends: 1567 [2023-11-06 22:25:46,029 INFO L226 Difference]: Without dead ends: 1285 [2023-11-06 22:25:46,032 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 [2023-11-06 22:25:46,034 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 968 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:46,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [984 Valid, 785 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 22:25:46,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2023-11-06 22:25:46,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1114. [2023-11-06 22:25:46,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 889 states have (on average 1.3633295838020247) internal successors, (1212), 910 states have internal predecessors, (1212), 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) [2023-11-06 22:25:46,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1535 transitions. [2023-11-06 22:25:46,224 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1535 transitions. Word has length 57 [2023-11-06 22:25:46,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:46,225 INFO L495 AbstractCegarLoop]: Abstraction has 1114 states and 1535 transitions. [2023-11-06 22:25:46,225 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) [2023-11-06 22:25:46,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1535 transitions. [2023-11-06 22:25:46,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-06 22:25:46,227 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:46,227 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] [2023-11-06 22:25:46,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:25:46,227 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:46,228 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:46,228 INFO L85 PathProgramCache]: Analyzing trace with hash -391734706, now seen corresponding path program 1 times [2023-11-06 22:25:46,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:46,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069666555] [2023-11-06 22:25:46,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:46,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:46,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:25:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:46,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:25:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:46,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:25:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:46,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:25:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:46,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:25:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:46,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:25:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:46,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:25:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:46,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:46,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:46,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069666555] [2023-11-06 22:25:46,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069666555] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:46,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:46,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:25:46,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026450539] [2023-11-06 22:25:46,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:46,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:25:46,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:46,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:25:46,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:25:46,430 INFO L87 Difference]: Start difference. First operand 1114 states and 1535 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) [2023-11-06 22:25:47,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:47,345 INFO L93 Difference]: Finished difference Result 1337 states and 1850 transitions. [2023-11-06 22:25:47,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:25:47,346 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 [2023-11-06 22:25:47,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:47,355 INFO L225 Difference]: With dead ends: 1337 [2023-11-06 22:25:47,355 INFO L226 Difference]: Without dead ends: 1249 [2023-11-06 22:25:47,356 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 [2023-11-06 22:25:47,357 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 545 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:47,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 801 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:25:47,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2023-11-06 22:25:47,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1210. [2023-11-06 22:25:47,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 965 states have (on average 1.3647668393782384) internal successors, (1317), 988 states have internal predecessors, (1317), 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) [2023-11-06 22:25:47,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1667 transitions. [2023-11-06 22:25:47,534 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1667 transitions. Word has length 65 [2023-11-06 22:25:47,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:47,534 INFO L495 AbstractCegarLoop]: Abstraction has 1210 states and 1667 transitions. [2023-11-06 22:25:47,535 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) [2023-11-06 22:25:47,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1667 transitions. [2023-11-06 22:25:47,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-06 22:25:47,536 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:47,537 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] [2023-11-06 22:25:47,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:25:47,537 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:47,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:47,538 INFO L85 PathProgramCache]: Analyzing trace with hash 12051245, now seen corresponding path program 1 times [2023-11-06 22:25:47,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:47,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7738212] [2023-11-06 22:25:47,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:47,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:47,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:25:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:47,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:25:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:47,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:25:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:47,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:25:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:47,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:25:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:47,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:25:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:47,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:25:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:47,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:47,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:47,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7738212] [2023-11-06 22:25:47,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7738212] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:47,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:47,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:25:47,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069429211] [2023-11-06 22:25:47,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:47,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:25:47,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:47,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:25:47,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:25:47,692 INFO L87 Difference]: Start difference. First operand 1210 states and 1667 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) [2023-11-06 22:25:48,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:48,867 INFO L93 Difference]: Finished difference Result 1557 states and 2144 transitions. [2023-11-06 22:25:48,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:25:48,868 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 [2023-11-06 22:25:48,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:48,877 INFO L225 Difference]: With dead ends: 1557 [2023-11-06 22:25:48,877 INFO L226 Difference]: Without dead ends: 1380 [2023-11-06 22:25:48,879 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 [2023-11-06 22:25:48,880 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 571 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:48,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 1096 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:25:48,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2023-11-06 22:25:49,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1306. [2023-11-06 22:25:49,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 1041 states have (on average 1.3650336215177714) internal successors, (1421), 1066 states have internal predecessors, (1421), 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) [2023-11-06 22:25:49,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1801 transitions. [2023-11-06 22:25:49,068 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1801 transitions. Word has length 65 [2023-11-06 22:25:49,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:49,068 INFO L495 AbstractCegarLoop]: Abstraction has 1306 states and 1801 transitions. [2023-11-06 22:25:49,069 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) [2023-11-06 22:25:49,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1801 transitions. [2023-11-06 22:25:49,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-06 22:25:49,071 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:49,071 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] [2023-11-06 22:25:49,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:25:49,072 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:49,072 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:49,072 INFO L85 PathProgramCache]: Analyzing trace with hash -2016534865, now seen corresponding path program 1 times [2023-11-06 22:25:49,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:49,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449347261] [2023-11-06 22:25:49,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:49,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:49,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:25:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:49,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:25:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:49,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:25:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:49,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:25:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:49,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:25:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:49,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:25:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:49,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:25:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:49,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:49,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:49,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449347261] [2023-11-06 22:25:49,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449347261] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:49,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:49,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:25:49,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244762881] [2023-11-06 22:25:49,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:49,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:25:49,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:49,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:25:49,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:25:49,237 INFO L87 Difference]: Start difference. First operand 1306 states and 1801 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) [2023-11-06 22:25:50,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:50,130 INFO L93 Difference]: Finished difference Result 1607 states and 2215 transitions. [2023-11-06 22:25:50,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:25:50,131 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 [2023-11-06 22:25:50,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:50,141 INFO L225 Difference]: With dead ends: 1607 [2023-11-06 22:25:50,141 INFO L226 Difference]: Without dead ends: 1340 [2023-11-06 22:25:50,144 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 [2023-11-06 22:25:50,146 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 214 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:50,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 1124 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:25:50,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2023-11-06 22:25:50,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1311. [2023-11-06 22:25:50,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1311 states, 1045 states have (on average 1.3617224880382774) internal successors, (1423), 1070 states have internal predecessors, (1423), 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) [2023-11-06 22:25:50,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1804 transitions. [2023-11-06 22:25:50,333 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1804 transitions. Word has length 65 [2023-11-06 22:25:50,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:50,334 INFO L495 AbstractCegarLoop]: Abstraction has 1311 states and 1804 transitions. [2023-11-06 22:25:50,334 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) [2023-11-06 22:25:50,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1804 transitions. [2023-11-06 22:25:50,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-06 22:25:50,336 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:50,336 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] [2023-11-06 22:25:50,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:25:50,337 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:50,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:50,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1249073133, now seen corresponding path program 1 times [2023-11-06 22:25:50,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:50,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90144167] [2023-11-06 22:25:50,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:50,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:25:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:25:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:25:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:25:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:25:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:25:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:25:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:50,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:50,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90144167] [2023-11-06 22:25:50,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90144167] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:50,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:50,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:25:50,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893092062] [2023-11-06 22:25:50,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:50,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:25:50,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:50,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:25:50,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:25:50,508 INFO L87 Difference]: Start difference. First operand 1311 states and 1804 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) [2023-11-06 22:25:52,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:52,686 INFO L93 Difference]: Finished difference Result 2973 states and 4076 transitions. [2023-11-06 22:25:52,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-06 22:25:52,687 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 [2023-11-06 22:25:52,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:52,704 INFO L225 Difference]: With dead ends: 2973 [2023-11-06 22:25:52,704 INFO L226 Difference]: Without dead ends: 2701 [2023-11-06 22:25:52,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2023-11-06 22:25:52,709 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 1292 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1306 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 1751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:52,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1306 Valid, 1355 Invalid, 1751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-06 22:25:52,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2023-11-06 22:25:53,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2451. [2023-11-06 22:25:53,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2451 states, 1945 states have (on average 1.3388174807197943) internal successors, (2604), 1990 states have internal predecessors, (2604), 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) [2023-11-06 22:25:53,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 2451 states and 3288 transitions. [2023-11-06 22:25:53,080 INFO L78 Accepts]: Start accepts. Automaton has 2451 states and 3288 transitions. Word has length 65 [2023-11-06 22:25:53,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:53,080 INFO L495 AbstractCegarLoop]: Abstraction has 2451 states and 3288 transitions. [2023-11-06 22:25:53,081 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) [2023-11-06 22:25:53,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 3288 transitions. [2023-11-06 22:25:53,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-06 22:25:53,083 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:53,083 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] [2023-11-06 22:25:53,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:25:53,084 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:53,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:53,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1994445074, now seen corresponding path program 1 times [2023-11-06 22:25:53,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:53,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571771370] [2023-11-06 22:25:53,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:53,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:53,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:53,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:25:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:53,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:25:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:53,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:25:53,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:53,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:25:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:53,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:25:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:53,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:25:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:53,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:25:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:53,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:53,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:53,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571771370] [2023-11-06 22:25:53,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571771370] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:53,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:53,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:25:53,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297636846] [2023-11-06 22:25:53,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:53,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:25:53,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:53,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:25:53,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:25:53,213 INFO L87 Difference]: Start difference. First operand 2451 states and 3288 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) [2023-11-06 22:25:54,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:54,361 INFO L93 Difference]: Finished difference Result 4052 states and 5412 transitions. [2023-11-06 22:25:54,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:25:54,362 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 [2023-11-06 22:25:54,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:54,383 INFO L225 Difference]: With dead ends: 4052 [2023-11-06 22:25:54,383 INFO L226 Difference]: Without dead ends: 2640 [2023-11-06 22:25:54,388 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 [2023-11-06 22:25:54,389 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 310 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:54,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1004 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:25:54,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2640 states. [2023-11-06 22:25:54,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2640 to 2496. [2023-11-06 22:25:54,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 1981 states have (on average 1.3281171125694093) internal successors, (2631), 2026 states have internal predecessors, (2631), 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) [2023-11-06 22:25:54,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 3327 transitions. [2023-11-06 22:25:54,728 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 3327 transitions. Word has length 65 [2023-11-06 22:25:54,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:54,728 INFO L495 AbstractCegarLoop]: Abstraction has 2496 states and 3327 transitions. [2023-11-06 22:25:54,729 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) [2023-11-06 22:25:54,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 3327 transitions. [2023-11-06 22:25:54,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-06 22:25:54,731 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:54,731 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] [2023-11-06 22:25:54,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:25:54,731 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:54,732 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:54,732 INFO L85 PathProgramCache]: Analyzing trace with hash -608241680, now seen corresponding path program 1 times [2023-11-06 22:25:54,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:54,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139151958] [2023-11-06 22:25:54,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:54,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:54,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:25:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:54,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:25:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:54,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:25:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:54,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:25:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:54,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:25:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:54,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:25:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:54,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:25:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:54,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:54,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:54,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139151958] [2023-11-06 22:25:54,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139151958] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:54,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:54,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:25:54,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946861874] [2023-11-06 22:25:54,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:54,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:25:54,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:54,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:25:54,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:25:54,879 INFO L87 Difference]: Start difference. First operand 2496 states and 3327 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) [2023-11-06 22:25:56,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:56,063 INFO L93 Difference]: Finished difference Result 3931 states and 5166 transitions. [2023-11-06 22:25:56,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:25:56,064 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 [2023-11-06 22:25:56,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:56,085 INFO L225 Difference]: With dead ends: 3931 [2023-11-06 22:25:56,085 INFO L226 Difference]: Without dead ends: 2694 [2023-11-06 22:25:56,089 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 [2023-11-06 22:25:56,090 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 687 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:56,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 700 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:25:56,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2023-11-06 22:25:56,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 2474. [2023-11-06 22:25:56,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2474 states, 1967 states have (on average 1.3253685815963396) internal successors, (2607), 2006 states have internal predecessors, (2607), 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) [2023-11-06 22:25:56,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 3287 transitions. [2023-11-06 22:25:56,466 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 3287 transitions. Word has length 65 [2023-11-06 22:25:56,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:56,466 INFO L495 AbstractCegarLoop]: Abstraction has 2474 states and 3287 transitions. [2023-11-06 22:25:56,467 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) [2023-11-06 22:25:56,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3287 transitions. [2023-11-06 22:25:56,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-06 22:25:56,470 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:56,470 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] [2023-11-06 22:25:56,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:25:56,470 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:56,471 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:56,471 INFO L85 PathProgramCache]: Analyzing trace with hash -742255186, now seen corresponding path program 1 times [2023-11-06 22:25:56,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:56,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216245858] [2023-11-06 22:25:56,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:56,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:56,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:25:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:56,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:25:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:56,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:25:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:56,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:25:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:56,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:25:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:56,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:25:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:56,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:25:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:56,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:56,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:56,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216245858] [2023-11-06 22:25:56,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216245858] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:56,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:56,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:25:56,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086976935] [2023-11-06 22:25:56,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:56,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:25:56,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:56,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:25:56,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:25:56,611 INFO L87 Difference]: Start difference. First operand 2474 states and 3287 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) [2023-11-06 22:25:57,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:57,734 INFO L93 Difference]: Finished difference Result 5549 states and 7266 transitions. [2023-11-06 22:25:57,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:25:57,735 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 [2023-11-06 22:25:57,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:57,761 INFO L225 Difference]: With dead ends: 5549 [2023-11-06 22:25:57,762 INFO L226 Difference]: Without dead ends: 4117 [2023-11-06 22:25:57,767 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 [2023-11-06 22:25:57,768 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 525 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:57,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 684 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:25:57,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4117 states. [2023-11-06 22:25:58,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4117 to 3845. [2023-11-06 22:25:58,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3845 states, 3033 states have (on average 1.2937685459940653) internal successors, (3924), 3093 states have internal predecessors, (3924), 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) [2023-11-06 22:25:58,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 5028 transitions. [2023-11-06 22:25:58,223 INFO L78 Accepts]: Start accepts. Automaton has 3845 states and 5028 transitions. Word has length 65 [2023-11-06 22:25:58,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:58,224 INFO L495 AbstractCegarLoop]: Abstraction has 3845 states and 5028 transitions. [2023-11-06 22:25:58,224 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) [2023-11-06 22:25:58,224 INFO L276 IsEmpty]: Start isEmpty. Operand 3845 states and 5028 transitions. [2023-11-06 22:25:58,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-06 22:25:58,227 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:58,227 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] [2023-11-06 22:25:58,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:25:58,228 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:58,228 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:58,228 INFO L85 PathProgramCache]: Analyzing trace with hash -851736989, now seen corresponding path program 1 times [2023-11-06 22:25:58,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:58,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101092990] [2023-11-06 22:25:58,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:58,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:25:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:25:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:25:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:25:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:25:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:25:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:25:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:25:58,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:58,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101092990] [2023-11-06 22:25:58,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101092990] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:58,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:58,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:25:58,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190755356] [2023-11-06 22:25:58,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:58,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:25:58,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:58,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:25:58,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:25:58,313 INFO L87 Difference]: Start difference. First operand 3845 states and 5028 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) [2023-11-06 22:25:59,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:59,674 INFO L93 Difference]: Finished difference Result 8863 states and 11542 transitions. [2023-11-06 22:25:59,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:25:59,675 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 [2023-11-06 22:25:59,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:59,719 INFO L225 Difference]: With dead ends: 8863 [2023-11-06 22:25:59,719 INFO L226 Difference]: Without dead ends: 6039 [2023-11-06 22:25:59,729 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 [2023-11-06 22:25:59,730 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 519 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:59,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 555 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:25:59,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6039 states. [2023-11-06 22:26:00,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6039 to 5523. [2023-11-06 22:26:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5523 states, 4318 states have (on average 1.2792959703566467) internal successors, (5524), 4385 states have internal predecessors, (5524), 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) [2023-11-06 22:26:00,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5523 states to 5523 states and 7143 transitions. [2023-11-06 22:26:00,500 INFO L78 Accepts]: Start accepts. Automaton has 5523 states and 7143 transitions. Word has length 66 [2023-11-06 22:26:00,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:00,500 INFO L495 AbstractCegarLoop]: Abstraction has 5523 states and 7143 transitions. [2023-11-06 22:26:00,501 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) [2023-11-06 22:26:00,501 INFO L276 IsEmpty]: Start isEmpty. Operand 5523 states and 7143 transitions. [2023-11-06 22:26:00,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-06 22:26:00,504 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:00,504 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] [2023-11-06 22:26:00,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:26:00,505 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:00,505 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:00,505 INFO L85 PathProgramCache]: Analyzing trace with hash -352881076, now seen corresponding path program 1 times [2023-11-06 22:26:00,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:00,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163768101] [2023-11-06 22:26:00,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:00,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:00,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:26:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:00,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:26:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:00,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:26:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:00,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:26:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:00,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:26:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:00,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:26:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:00,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:26:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:00,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:26:00,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:00,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163768101] [2023-11-06 22:26:00,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163768101] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:00,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:00,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:26:00,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780435210] [2023-11-06 22:26:00,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:00,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:26:00,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:00,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:26:00,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:26:00,598 INFO L87 Difference]: Start difference. First operand 5523 states and 7143 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) [2023-11-06 22:26:02,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:02,210 INFO L93 Difference]: Finished difference Result 7153 states and 9145 transitions. [2023-11-06 22:26:02,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:26:02,210 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 [2023-11-06 22:26:02,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:02,255 INFO L225 Difference]: With dead ends: 7153 [2023-11-06 22:26:02,255 INFO L226 Difference]: Without dead ends: 7150 [2023-11-06 22:26:02,259 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 [2023-11-06 22:26:02,259 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 936 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:02,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 464 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:26:02,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7150 states. [2023-11-06 22:26:03,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7150 to 6577. [2023-11-06 22:26:03,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6577 states, 5121 states have (on average 1.2681116969341926) internal successors, (6494), 5197 states have internal predecessors, (6494), 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) [2023-11-06 22:26:03,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6577 states to 6577 states and 8432 transitions. [2023-11-06 22:26:03,270 INFO L78 Accepts]: Start accepts. Automaton has 6577 states and 8432 transitions. Word has length 73 [2023-11-06 22:26:03,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:03,271 INFO L495 AbstractCegarLoop]: Abstraction has 6577 states and 8432 transitions. [2023-11-06 22:26:03,271 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) [2023-11-06 22:26:03,271 INFO L276 IsEmpty]: Start isEmpty. Operand 6577 states and 8432 transitions. [2023-11-06 22:26:03,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-06 22:26:03,273 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:03,273 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] [2023-11-06 22:26:03,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:26:03,273 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:03,274 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:03,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1944959948, now seen corresponding path program 1 times [2023-11-06 22:26:03,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:03,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587341547] [2023-11-06 22:26:03,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:03,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:26:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:26:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:26:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:26:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:26:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:26:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:26:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:26:03,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:03,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587341547] [2023-11-06 22:26:03,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587341547] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:26:03,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615554714] [2023-11-06 22:26:03,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:03,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:26:03,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:26:03,422 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:26:03,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:26:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-06 22:26:03,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:26:03,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:26:03,900 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:26:03,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:26:03,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615554714] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:26:03,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:26:03,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2023-11-06 22:26:03,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015815335] [2023-11-06 22:26:03,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:26:03,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:26:03,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:03,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:26:03,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:26:03,999 INFO L87 Difference]: Start difference. First operand 6577 states and 8432 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) [2023-11-06 22:26:07,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:07,247 INFO L93 Difference]: Finished difference Result 14223 states and 17960 transitions. [2023-11-06 22:26:07,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-06 22:26:07,248 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 [2023-11-06 22:26:07,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:07,326 INFO L225 Difference]: With dead ends: 14223 [2023-11-06 22:26:07,327 INFO L226 Difference]: Without dead ends: 14220 [2023-11-06 22:26:07,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2023-11-06 22:26:07,334 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 1452 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:07,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 1001 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:26:07,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14220 states. [2023-11-06 22:26:08,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14220 to 11835. [2023-11-06 22:26:08,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11835 states, 9213 states have (on average 1.2594160425485728) internal successors, (11603), 9341 states have internal predecessors, (11603), 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) [2023-11-06 22:26:08,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11835 states to 11835 states and 15046 transitions. [2023-11-06 22:26:08,995 INFO L78 Accepts]: Start accepts. Automaton has 11835 states and 15046 transitions. Word has length 74 [2023-11-06 22:26:08,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:08,996 INFO L495 AbstractCegarLoop]: Abstraction has 11835 states and 15046 transitions. [2023-11-06 22:26:08,997 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) [2023-11-06 22:26:08,997 INFO L276 IsEmpty]: Start isEmpty. Operand 11835 states and 15046 transitions. [2023-11-06 22:26:09,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-06 22:26:09,001 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:09,001 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] [2023-11-06 22:26:09,018 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:26:09,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:26:09,208 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:09,208 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:09,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1924460340, now seen corresponding path program 2 times [2023-11-06 22:26:09,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:09,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624538226] [2023-11-06 22:26:09,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:09,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:09,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:26:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:09,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:26:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:09,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:26:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:09,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:26:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:09,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:26:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:09,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:26:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:09,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:26:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:09,291 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:26:09,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:09,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624538226] [2023-11-06 22:26:09,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624538226] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:09,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:09,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:26:09,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081464381] [2023-11-06 22:26:09,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:09,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:26:09,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:09,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:26:09,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:26:09,294 INFO L87 Difference]: Start difference. First operand 11835 states and 15046 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) [2023-11-06 22:26:10,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:10,988 INFO L93 Difference]: Finished difference Result 18378 states and 23388 transitions. [2023-11-06 22:26:10,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:26:10,988 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 [2023-11-06 22:26:10,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:11,021 INFO L225 Difference]: With dead ends: 18378 [2023-11-06 22:26:11,022 INFO L226 Difference]: Without dead ends: 8440 [2023-11-06 22:26:11,053 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 [2023-11-06 22:26:11,054 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 434 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:11,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 678 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:26:11,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8440 states. [2023-11-06 22:26:12,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8440 to 7888. [2023-11-06 22:26:12,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7888 states, 6160 states have (on average 1.2407467532467533) internal successors, (7643), 6244 states have internal predecessors, (7643), 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) [2023-11-06 22:26:12,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7888 states to 7888 states and 9872 transitions. [2023-11-06 22:26:12,259 INFO L78 Accepts]: Start accepts. Automaton has 7888 states and 9872 transitions. Word has length 77 [2023-11-06 22:26:12,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:12,260 INFO L495 AbstractCegarLoop]: Abstraction has 7888 states and 9872 transitions. [2023-11-06 22:26:12,260 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) [2023-11-06 22:26:12,260 INFO L276 IsEmpty]: Start isEmpty. Operand 7888 states and 9872 transitions. [2023-11-06 22:26:12,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-06 22:26:12,266 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:12,266 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] [2023-11-06 22:26:12,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:26:12,269 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:12,269 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:12,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1501980898, now seen corresponding path program 1 times [2023-11-06 22:26:12,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:12,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91262816] [2023-11-06 22:26:12,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:12,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:12,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:26:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:12,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:26:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:12,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:26:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:12,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:26:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:12,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:26:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:12,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:26:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:12,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:26:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:12,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-06 22:26:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:12,444 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:26:12,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:12,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91262816] [2023-11-06 22:26:12,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91262816] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:12,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:12,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:26:12,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64214953] [2023-11-06 22:26:12,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:12,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:26:12,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:12,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:26:12,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:26:12,448 INFO L87 Difference]: Start difference. First operand 7888 states and 9872 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) [2023-11-06 22:26:15,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:15,798 INFO L93 Difference]: Finished difference Result 21762 states and 27089 transitions. [2023-11-06 22:26:15,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-06 22:26:15,799 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 [2023-11-06 22:26:15,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:15,862 INFO L225 Difference]: With dead ends: 21762 [2023-11-06 22:26:15,862 INFO L226 Difference]: Without dead ends: 14919 [2023-11-06 22:26:15,884 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 [2023-11-06 22:26:15,884 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 623 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:15,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 1072 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:26:15,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14919 states. [2023-11-06 22:26:17,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14919 to 14060. [2023-11-06 22:26:17,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14060 states, 10836 states have (on average 1.211701734957549) internal successors, (13130), 11026 states have internal predecessors, (13130), 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) [2023-11-06 22:26:17,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14060 states to 14060 states and 17478 transitions. [2023-11-06 22:26:17,756 INFO L78 Accepts]: Start accepts. Automaton has 14060 states and 17478 transitions. Word has length 84 [2023-11-06 22:26:17,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:17,757 INFO L495 AbstractCegarLoop]: Abstraction has 14060 states and 17478 transitions. [2023-11-06 22:26:17,757 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) [2023-11-06 22:26:17,757 INFO L276 IsEmpty]: Start isEmpty. Operand 14060 states and 17478 transitions. [2023-11-06 22:26:17,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-06 22:26:17,767 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:17,768 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] [2023-11-06 22:26:17,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:26:17,768 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:17,769 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:17,769 INFO L85 PathProgramCache]: Analyzing trace with hash -2109222294, now seen corresponding path program 1 times [2023-11-06 22:26:17,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:17,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081425617] [2023-11-06 22:26:17,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:17,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:26:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:26:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:26:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:26:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:26:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:26:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:26:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:26:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,910 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 22:26:17,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:17,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081425617] [2023-11-06 22:26:17,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081425617] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:17,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:17,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:26:17,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988319465] [2023-11-06 22:26:17,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:17,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:26:17,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:17,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:26:17,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:26:17,913 INFO L87 Difference]: Start difference. First operand 14060 states and 17478 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) [2023-11-06 22:26:20,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:20,793 INFO L93 Difference]: Finished difference Result 24934 states and 30797 transitions. [2023-11-06 22:26:20,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 22:26:20,793 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 [2023-11-06 22:26:20,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:20,842 INFO L225 Difference]: With dead ends: 24934 [2023-11-06 22:26:20,843 INFO L226 Difference]: Without dead ends: 12535 [2023-11-06 22:26:20,877 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 [2023-11-06 22:26:20,878 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 1133 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:20,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 968 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 22:26:20,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12535 states. [2023-11-06 22:26:23,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12535 to 11635. [2023-11-06 22:26:23,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11635 states, 9002 states have (on average 1.2042879360142191) internal successors, (10841), 9159 states have internal predecessors, (10841), 1297 states have call successors, (1297), 1074 states have call predecessors, (1297), 1334 states have return successors, (2084), 1412 states have call predecessors, (2084), 1296 states have call successors, (2084) [2023-11-06 22:26:23,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11635 states to 11635 states and 14222 transitions. [2023-11-06 22:26:23,234 INFO L78 Accepts]: Start accepts. Automaton has 11635 states and 14222 transitions. Word has length 93 [2023-11-06 22:26:23,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:23,234 INFO L495 AbstractCegarLoop]: Abstraction has 11635 states and 14222 transitions. [2023-11-06 22:26:23,235 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) [2023-11-06 22:26:23,235 INFO L276 IsEmpty]: Start isEmpty. Operand 11635 states and 14222 transitions. [2023-11-06 22:26:23,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-06 22:26:23,243 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:23,243 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, 1] [2023-11-06 22:26:23,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:26:23,244 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:23,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:23,244 INFO L85 PathProgramCache]: Analyzing trace with hash -642669815, now seen corresponding path program 1 times [2023-11-06 22:26:23,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:23,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220349873] [2023-11-06 22:26:23,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:23,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:23,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:26:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:23,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:26:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:23,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:26:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:23,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:26:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:23,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:26:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:23,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:26:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:23,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:26:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:23,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-06 22:26:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:23,396 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 22:26:23,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:23,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220349873] [2023-11-06 22:26:23,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220349873] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:26:23,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912073813] [2023-11-06 22:26:23,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:23,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:26:23,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:26:23,399 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:26:23,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:26:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:23,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:26:23,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:26:23,546 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-06 22:26:23,546 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:26:23,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912073813] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:23,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:26:23,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-11-06 22:26:23,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634438953] [2023-11-06 22:26:23,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:23,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:26:23,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:23,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:26:23,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:26:23,550 INFO L87 Difference]: Start difference. First operand 11635 states and 14222 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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) [2023-11-06 22:26:24,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:24,908 INFO L93 Difference]: Finished difference Result 13550 states and 16888 transitions. [2023-11-06 22:26:24,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:26:24,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 93 [2023-11-06 22:26:24,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:24,944 INFO L225 Difference]: With dead ends: 13550 [2023-11-06 22:26:24,945 INFO L226 Difference]: Without dead ends: 11887 [2023-11-06 22:26:24,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:26:24,955 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 114 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 625 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 [2023-11-06 22:26:24,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 625 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:26:24,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11887 states. [2023-11-06 22:26:26,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11887 to 11887. [2023-11-06 22:26:26,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11887 states, 9206 states have (on average 1.20693026287204) internal successors, (11111), 9365 states have internal predecessors, (11111), 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) [2023-11-06 22:26:26,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11887 states to 11887 states and 14562 transitions. [2023-11-06 22:26:26,614 INFO L78 Accepts]: Start accepts. Automaton has 11887 states and 14562 transitions. Word has length 93 [2023-11-06 22:26:26,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:26,615 INFO L495 AbstractCegarLoop]: Abstraction has 11887 states and 14562 transitions. [2023-11-06 22:26:26,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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) [2023-11-06 22:26:26,615 INFO L276 IsEmpty]: Start isEmpty. Operand 11887 states and 14562 transitions. [2023-11-06 22:26:26,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-06 22:26:26,627 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:26,627 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, 1, 1] [2023-11-06 22:26:26,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:26:26,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:26:26,833 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:26,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:26,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1012040179, now seen corresponding path program 1 times [2023-11-06 22:26:26,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:26,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584200894] [2023-11-06 22:26:26,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:26,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:26,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:26:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:26,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:26:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:26,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:26:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:26,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:26:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:26,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:26:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:26,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:26:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:26,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:26:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:26,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:26:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:26,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:26:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:26,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-06 22:26:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:26,964 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-06 22:26:26,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:26,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584200894] [2023-11-06 22:26:26,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584200894] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:26:26,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989357267] [2023-11-06 22:26:26,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:26,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:26:26,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:26:26,967 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:26:26,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:26:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:27,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:26:27,095 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:26:27,207 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-06 22:26:27,208 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:26:27,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989357267] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:27,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:26:27,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2023-11-06 22:26:27,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573676486] [2023-11-06 22:26:27,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:27,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:26:27,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:27,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:26:27,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:26:27,211 INFO L87 Difference]: Start difference. First operand 11887 states and 14562 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 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) [2023-11-06 22:26:28,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:28,622 INFO L93 Difference]: Finished difference Result 13646 states and 17015 transitions. [2023-11-06 22:26:28,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:26:28,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 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 120 [2023-11-06 22:26:28,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:28,668 INFO L225 Difference]: With dead ends: 13646 [2023-11-06 22:26:28,668 INFO L226 Difference]: Without dead ends: 12624 [2023-11-06 22:26:28,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:26:28,680 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 197 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 396 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 [2023-11-06 22:26:28,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 396 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:26:28,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12624 states. [2023-11-06 22:26:30,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12624 to 12598. [2023-11-06 22:26:30,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12598 states, 9782 states have (on average 1.2149867102841954) internal successors, (11885), 9950 states have internal predecessors, (11885), 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) [2023-11-06 22:26:30,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12598 states to 12598 states and 15518 transitions. [2023-11-06 22:26:30,387 INFO L78 Accepts]: Start accepts. Automaton has 12598 states and 15518 transitions. Word has length 120 [2023-11-06 22:26:30,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:30,388 INFO L495 AbstractCegarLoop]: Abstraction has 12598 states and 15518 transitions. [2023-11-06 22:26:30,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 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) [2023-11-06 22:26:30,389 INFO L276 IsEmpty]: Start isEmpty. Operand 12598 states and 15518 transitions. [2023-11-06 22:26:30,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-06 22:26:30,405 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:30,405 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, 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] [2023-11-06 22:26:30,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:26:30,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:26:30,611 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:30,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:30,612 INFO L85 PathProgramCache]: Analyzing trace with hash -2064990252, now seen corresponding path program 1 times [2023-11-06 22:26:30,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:30,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492497636] [2023-11-06 22:26:30,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:30,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:30,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:26:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:30,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:26:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:30,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:26:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:30,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:26:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:30,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:26:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:30,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:26:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:30,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:26:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:30,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:26:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:30,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:26:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:30,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:26:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:30,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-06 22:26:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:30,767 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-11-06 22:26:30,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:30,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492497636] [2023-11-06 22:26:30,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492497636] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:26:30,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41238393] [2023-11-06 22:26:30,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:30,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:26:30,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:26:30,769 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:26:30,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:26:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:30,894 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:26:30,898 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:26:30,946 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-06 22:26:30,946 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:26:30,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41238393] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:30,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:26:30,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-11-06 22:26:30,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409351162] [2023-11-06 22:26:30,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:30,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:26:30,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:30,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:26:30,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:26:30,949 INFO L87 Difference]: Start difference. First operand 12598 states and 15518 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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) [2023-11-06 22:26:32,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:32,426 INFO L93 Difference]: Finished difference Result 14876 states and 18676 transitions. [2023-11-06 22:26:32,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:26:32,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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 137 [2023-11-06 22:26:32,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:32,464 INFO L225 Difference]: With dead ends: 14876 [2023-11-06 22:26:32,464 INFO L226 Difference]: Without dead ends: 12904 [2023-11-06 22:26:32,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:26:32,475 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 248 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 296 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 [2023-11-06 22:26:32,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 296 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:26:32,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12904 states. [2023-11-06 22:26:34,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12904 to 12838. [2023-11-06 22:26:34,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12838 states, 10001 states have (on average 1.2055794420557944) internal successors, (12057), 10166 states have internal predecessors, (12057), 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) [2023-11-06 22:26:34,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12838 states to 12838 states and 15684 transitions. [2023-11-06 22:26:34,351 INFO L78 Accepts]: Start accepts. Automaton has 12838 states and 15684 transitions. Word has length 137 [2023-11-06 22:26:34,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:34,351 INFO L495 AbstractCegarLoop]: Abstraction has 12838 states and 15684 transitions. [2023-11-06 22:26:34,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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) [2023-11-06 22:26:34,351 INFO L276 IsEmpty]: Start isEmpty. Operand 12838 states and 15684 transitions. [2023-11-06 22:26:34,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-06 22:26:34,362 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:34,362 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, 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] [2023-11-06 22:26:34,368 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-06 22:26:34,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:26:34,563 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:34,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:34,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1139168173, now seen corresponding path program 1 times [2023-11-06 22:26:34,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:34,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934123288] [2023-11-06 22:26:34,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:34,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:34,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:26:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:34,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:26:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:34,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:26:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:34,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:26:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:34,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:26:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:34,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:26:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:34,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:26:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:34,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:26:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:34,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:26:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:34,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:26:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:34,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-06 22:26:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:34,711 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-11-06 22:26:34,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:34,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934123288] [2023-11-06 22:26:34,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934123288] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:26:34,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224118319] [2023-11-06 22:26:34,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:34,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:26:34,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:26:34,714 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:26:34,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:26:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:34,837 INFO L262 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:26:34,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:26:34,870 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-06 22:26:34,870 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:26:34,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224118319] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:34,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:26:34,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-11-06 22:26:34,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564551800] [2023-11-06 22:26:34,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:34,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:26:34,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:34,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:26:34,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:26:34,873 INFO L87 Difference]: Start difference. First operand 12838 states and 15684 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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) [2023-11-06 22:26:36,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:36,651 INFO L93 Difference]: Finished difference Result 15099 states and 18631 transitions. [2023-11-06 22:26:36,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:26:36,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 137 [2023-11-06 22:26:36,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:36,695 INFO L225 Difference]: With dead ends: 15099 [2023-11-06 22:26:36,695 INFO L226 Difference]: Without dead ends: 12889 [2023-11-06 22:26:36,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:26:36,708 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 249 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 399 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 [2023-11-06 22:26:36,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 399 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:26:36,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12889 states. [2023-11-06 22:26:38,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12889 to 12820. [2023-11-06 22:26:39,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12820 states, 9983 states have (on average 1.2005409195632575) internal successors, (11985), 10148 states have internal predecessors, (11985), 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) [2023-11-06 22:26:39,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12820 states to 12820 states and 15612 transitions. [2023-11-06 22:26:39,033 INFO L78 Accepts]: Start accepts. Automaton has 12820 states and 15612 transitions. Word has length 137 [2023-11-06 22:26:39,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:39,034 INFO L495 AbstractCegarLoop]: Abstraction has 12820 states and 15612 transitions. [2023-11-06 22:26:39,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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) [2023-11-06 22:26:39,034 INFO L276 IsEmpty]: Start isEmpty. Operand 12820 states and 15612 transitions. [2023-11-06 22:26:39,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-06 22:26:39,046 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:39,047 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, 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] [2023-11-06 22:26:39,052 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-06 22:26:39,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:26:39,247 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:39,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:39,248 INFO L85 PathProgramCache]: Analyzing trace with hash -2040314323, now seen corresponding path program 1 times [2023-11-06 22:26:39,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:39,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984757780] [2023-11-06 22:26:39,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:39,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:39,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:26:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:39,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:26:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:39,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:26:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:39,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:26:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:39,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:26:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:39,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:26:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:39,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:26:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:39,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:26:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:39,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-06 22:26:39,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:39,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:26:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:39,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-06 22:26:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:39,381 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-06 22:26:39,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:39,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984757780] [2023-11-06 22:26:39,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984757780] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:26:39,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938324924] [2023-11-06 22:26:39,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:39,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:26:39,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:26:39,385 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:26:39,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:26:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:39,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:26:39,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:26:39,532 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-06 22:26:39,532 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:26:39,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938324924] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:39,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:26:39,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-11-06 22:26:39,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712095609] [2023-11-06 22:26:39,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:39,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:26:39,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:39,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:26:39,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:26:39,534 INFO L87 Difference]: Start difference. First operand 12820 states and 15612 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-06 22:26:41,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:41,590 INFO L93 Difference]: Finished difference Result 17046 states and 21052 transitions. [2023-11-06 22:26:41,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:26:41,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 138 [2023-11-06 22:26:41,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:41,626 INFO L225 Difference]: With dead ends: 17046 [2023-11-06 22:26:41,626 INFO L226 Difference]: Without dead ends: 14854 [2023-11-06 22:26:41,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:26:41,637 INFO L413 NwaCegarLoop]: 381 mSDtfsCounter, 111 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:41,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 644 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:26:41,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14854 states. [2023-11-06 22:26:43,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14854 to 14852. [2023-11-06 22:26:43,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14852 states, 11640 states have (on average 1.2039518900343642) internal successors, (14014), 11831 states have internal predecessors, (14014), 1612 states have call successors, (1612), 1311 states have call predecessors, (1612), 1598 states have return successors, (2601), 1722 states have call predecessors, (2601), 1611 states have call successors, (2601) [2023-11-06 22:26:43,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14852 states to 14852 states and 18227 transitions. [2023-11-06 22:26:43,632 INFO L78 Accepts]: Start accepts. Automaton has 14852 states and 18227 transitions. Word has length 138 [2023-11-06 22:26:43,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:43,632 INFO L495 AbstractCegarLoop]: Abstraction has 14852 states and 18227 transitions. [2023-11-06 22:26:43,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-06 22:26:43,633 INFO L276 IsEmpty]: Start isEmpty. Operand 14852 states and 18227 transitions. [2023-11-06 22:26:43,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-06 22:26:43,645 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:43,646 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, 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] [2023-11-06 22:26:43,651 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:26:43,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:26:43,846 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:43,847 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:43,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1720695070, now seen corresponding path program 1 times [2023-11-06 22:26:43,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:43,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302850223] [2023-11-06 22:26:43,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:43,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:43,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:26:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:43,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:26:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:43,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:26:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:43,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:26:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:43,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:26:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:43,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:26:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:43,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 22:26:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:43,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:26:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:43,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:26:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:43,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:26:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:43,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 22:26:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:43,976 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2023-11-06 22:26:43,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:43,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302850223] [2023-11-06 22:26:43,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302850223] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:26:43,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984941728] [2023-11-06 22:26:43,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:43,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:26:43,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:26:43,979 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:26:44,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:26:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:44,106 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:26:44,110 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:26:44,199 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:26:44,199 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:26:44,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984941728] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:44,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:26:44,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-11-06 22:26:44,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314352507] [2023-11-06 22:26:44,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:44,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:26:44,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:44,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:26:44,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:26:44,202 INFO L87 Difference]: Start difference. First operand 14852 states and 18227 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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) [2023-11-06 22:26:46,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:46,058 INFO L93 Difference]: Finished difference Result 16608 states and 20629 transitions. [2023-11-06 22:26:46,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:26:46,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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 139 [2023-11-06 22:26:46,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:46,094 INFO L225 Difference]: With dead ends: 16608 [2023-11-06 22:26:46,094 INFO L226 Difference]: Without dead ends: 14500 [2023-11-06 22:26:46,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:26:46,104 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 75 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 606 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 [2023-11-06 22:26:46,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 606 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:26:46,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14500 states. [2023-11-06 22:26:47,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14500 to 14444. [2023-11-06 22:26:47,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14444 states, 11313 states have (on average 1.1987094493061081) internal successors, (13561), 11500 states have internal predecessors, (13561), 1568 states have call successors, (1568), 1281 states have call predecessors, (1568), 1561 states have return successors, (2515), 1675 states have call predecessors, (2515), 1567 states have call successors, (2515) [2023-11-06 22:26:48,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14444 states to 14444 states and 17644 transitions. [2023-11-06 22:26:48,029 INFO L78 Accepts]: Start accepts. Automaton has 14444 states and 17644 transitions. Word has length 139 [2023-11-06 22:26:48,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:48,030 INFO L495 AbstractCegarLoop]: Abstraction has 14444 states and 17644 transitions. [2023-11-06 22:26:48,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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) [2023-11-06 22:26:48,030 INFO L276 IsEmpty]: Start isEmpty. Operand 14444 states and 17644 transitions. [2023-11-06 22:26:48,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-06 22:26:48,043 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:48,043 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] [2023-11-06 22:26:48,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:26:48,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-06 22:26:48,245 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:48,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:48,245 INFO L85 PathProgramCache]: Analyzing trace with hash 901242064, now seen corresponding path program 1 times [2023-11-06 22:26:48,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:48,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383094182] [2023-11-06 22:26:48,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:48,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:48,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:26:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:48,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:26:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:48,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:26:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:48,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:26:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:48,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:26:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:48,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:26:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:48,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:26:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:48,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-06 22:26:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:48,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:26:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:48,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 22:26:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:48,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:26:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:48,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:26:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:48,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:26:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:48,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-06 22:26:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:48,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-06 22:26:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:48,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 22:26:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:48,414 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-06 22:26:48,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:48,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383094182] [2023-11-06 22:26:48,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383094182] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:26:48,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577601903] [2023-11-06 22:26:48,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:48,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:26:48,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:26:48,416 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:26:48,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 22:26:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:48,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:26:48,550 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:26:48,607 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:26:48,608 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:26:48,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577601903] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:48,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:26:48,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2023-11-06 22:26:48,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096735964] [2023-11-06 22:26:48,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:48,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:26:48,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:48,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:26:48,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:26:48,611 INFO L87 Difference]: Start difference. First operand 14444 states and 17644 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) [2023-11-06 22:26:49,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:49,815 INFO L93 Difference]: Finished difference Result 19592 states and 23864 transitions. [2023-11-06 22:26:49,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:26:49,816 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 [2023-11-06 22:26:49,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:49,834 INFO L225 Difference]: With dead ends: 19592 [2023-11-06 22:26:49,834 INFO L226 Difference]: Without dead ends: 9010 [2023-11-06 22:26:49,844 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 [2023-11-06 22:26:49,845 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 34 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:49,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1315 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:26:49,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9010 states. [2023-11-06 22:26:50,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9010 to 8568. [2023-11-06 22:26:50,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8568 states, 6878 states have (on average 1.1961325966850829) internal successors, (8227), 6963 states have internal predecessors, (8227), 870 states have call successors, (870), 675 states have call predecessors, (870), 818 states have return successors, (1355), 933 states have call predecessors, (1355), 869 states have call successors, (1355) [2023-11-06 22:26:50,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8568 states to 8568 states and 10452 transitions. [2023-11-06 22:26:50,875 INFO L78 Accepts]: Start accepts. Automaton has 8568 states and 10452 transitions. Word has length 145 [2023-11-06 22:26:50,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:50,876 INFO L495 AbstractCegarLoop]: Abstraction has 8568 states and 10452 transitions. [2023-11-06 22:26:50,876 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) [2023-11-06 22:26:50,876 INFO L276 IsEmpty]: Start isEmpty. Operand 8568 states and 10452 transitions. [2023-11-06 22:26:50,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-06 22:26:50,885 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:50,885 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, 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] [2023-11-06 22:26:50,890 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:26:51,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:26:51,086 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:51,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:51,086 INFO L85 PathProgramCache]: Analyzing trace with hash 796778198, now seen corresponding path program 1 times [2023-11-06 22:26:51,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:51,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659106661] [2023-11-06 22:26:51,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:51,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:51,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:26:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:51,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:26:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:51,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:26:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:51,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:26:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:51,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:26:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:51,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:26:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:51,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 22:26:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:51,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:26:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:51,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:26:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:51,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:26:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:51,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-06 22:26:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:51,206 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-11-06 22:26:51,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:51,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659106661] [2023-11-06 22:26:51,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659106661] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:26:51,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917503685] [2023-11-06 22:26:51,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:51,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:26:51,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:26:51,209 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:26:51,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 22:26:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:51,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:26:51,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:26:51,439 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-11-06 22:26:51,440 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:26:51,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917503685] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:51,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:26:51,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2023-11-06 22:26:51,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687538148] [2023-11-06 22:26:51,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:51,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:26:51,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:51,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:26:51,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:26:51,443 INFO L87 Difference]: Start difference. First operand 8568 states and 10452 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 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) [2023-11-06 22:26:52,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:52,825 INFO L93 Difference]: Finished difference Result 11194 states and 13840 transitions. [2023-11-06 22:26:52,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:26:52,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 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 140 [2023-11-06 22:26:52,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:52,848 INFO L225 Difference]: With dead ends: 11194 [2023-11-06 22:26:52,848 INFO L226 Difference]: Without dead ends: 8554 [2023-11-06 22:26:52,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:26:52,856 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 302 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 400 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 [2023-11-06 22:26:52,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 400 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:26:52,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8554 states. [2023-11-06 22:26:53,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8554 to 7460. [2023-11-06 22:26:53,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7460 states, 5977 states have (on average 1.1796888070938598) internal successors, (7051), 6042 states have internal predecessors, (7051), 760 states have call successors, (760), 592 states have call predecessors, (760), 721 states have return successors, (1157), 827 states have call predecessors, (1157), 759 states have call successors, (1157) [2023-11-06 22:26:53,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7460 states to 7460 states and 8968 transitions. [2023-11-06 22:26:53,896 INFO L78 Accepts]: Start accepts. Automaton has 7460 states and 8968 transitions. Word has length 140 [2023-11-06 22:26:53,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:53,897 INFO L495 AbstractCegarLoop]: Abstraction has 7460 states and 8968 transitions. [2023-11-06 22:26:53,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 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) [2023-11-06 22:26:53,897 INFO L276 IsEmpty]: Start isEmpty. Operand 7460 states and 8968 transitions. [2023-11-06 22:26:53,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-06 22:26:53,906 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:53,906 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, 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] [2023-11-06 22:26:53,911 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:26:54,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-06 22:26:54,107 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:54,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:54,107 INFO L85 PathProgramCache]: Analyzing trace with hash 915219672, now seen corresponding path program 1 times [2023-11-06 22:26:54,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:54,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871076163] [2023-11-06 22:26:54,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:54,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:54,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:26:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:54,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:26:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:54,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:26:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:54,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:26:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:54,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:26:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:54,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:26:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:54,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 22:26:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:54,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:26:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:54,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:26:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:54,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:26:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:54,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-06 22:26:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:54,244 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-11-06 22:26:54,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:54,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871076163] [2023-11-06 22:26:54,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871076163] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:26:54,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086388972] [2023-11-06 22:26:54,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:54,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:26:54,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:26:54,247 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:26:54,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 22:26:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:54,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:26:54,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:26:54,462 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-11-06 22:26:54,462 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:26:54,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086388972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:54,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:26:54,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2023-11-06 22:26:54,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370123669] [2023-11-06 22:26:54,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:54,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:26:54,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:54,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:26:54,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:26:54,465 INFO L87 Difference]: Start difference. First operand 7460 states and 8968 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 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) [2023-11-06 22:26:55,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:55,747 INFO L93 Difference]: Finished difference Result 9502 states and 11509 transitions. [2023-11-06 22:26:55,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:26:55,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 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 140 [2023-11-06 22:26:55,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:55,763 INFO L225 Difference]: With dead ends: 9502 [2023-11-06 22:26:55,764 INFO L226 Difference]: Without dead ends: 6798 [2023-11-06 22:26:55,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:26:55,770 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 339 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:55,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 395 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:26:55,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6798 states. [2023-11-06 22:26:56,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6798 to 6776. [2023-11-06 22:26:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6776 states, 5419 states have (on average 1.1620225133788522) internal successors, (6297), 5474 states have internal predecessors, (6297), 684 states have call successors, (684), 542 states have call predecessors, (684), 671 states have return successors, (1028), 761 states have call predecessors, (1028), 683 states have call successors, (1028) [2023-11-06 22:26:56,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6776 states to 6776 states and 8009 transitions. [2023-11-06 22:26:56,699 INFO L78 Accepts]: Start accepts. Automaton has 6776 states and 8009 transitions. Word has length 140 [2023-11-06 22:26:56,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:56,699 INFO L495 AbstractCegarLoop]: Abstraction has 6776 states and 8009 transitions. [2023-11-06 22:26:56,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 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) [2023-11-06 22:26:56,700 INFO L276 IsEmpty]: Start isEmpty. Operand 6776 states and 8009 transitions. [2023-11-06 22:26:56,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-06 22:26:56,707 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:56,708 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, 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] [2023-11-06 22:26:56,713 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:26:56,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-06 22:26:56,909 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:56,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:56,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1990453610, now seen corresponding path program 1 times [2023-11-06 22:26:56,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:56,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132814102] [2023-11-06 22:26:56,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:56,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:56,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:26:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:56,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:26:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:56,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:26:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:57,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:26:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:57,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:26:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:57,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:26:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:57,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 22:26:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:57,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:26:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:57,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:26:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:57,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:26:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:57,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-06 22:26:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:57,030 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-11-06 22:26:57,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:57,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132814102] [2023-11-06 22:26:57,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132814102] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:26:57,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330072944] [2023-11-06 22:26:57,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:57,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:26:57,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:26:57,033 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:26:57,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-06 22:26:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:57,150 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:26:57,152 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:26:57,173 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-11-06 22:26:57,173 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:26:57,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330072944] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:57,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:26:57,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2023-11-06 22:26:57,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775265450] [2023-11-06 22:26:57,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:57,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:26:57,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:57,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:26:57,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:26:57,176 INFO L87 Difference]: Start difference. First operand 6776 states and 8009 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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) [2023-11-06 22:26:58,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:58,020 INFO L93 Difference]: Finished difference Result 7976 states and 9436 transitions. [2023-11-06 22:26:58,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:26:58,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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 140 [2023-11-06 22:26:58,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:58,033 INFO L225 Difference]: With dead ends: 7976 [2023-11-06 22:26:58,033 INFO L226 Difference]: Without dead ends: 5535 [2023-11-06 22:26:58,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:26:58,038 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 7 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:58,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1048 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:26:58,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5535 states. [2023-11-06 22:26:58,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5535 to 5535. [2023-11-06 22:26:58,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5535 states, 4401 states have (on average 1.1631447398318564) internal successors, (5119), 4445 states have internal predecessors, (5119), 560 states have call successors, (560), 453 states have call predecessors, (560), 572 states have return successors, (843), 637 states have call predecessors, (843), 559 states have call successors, (843) [2023-11-06 22:26:58,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5535 states to 5535 states and 6522 transitions. [2023-11-06 22:26:58,799 INFO L78 Accepts]: Start accepts. Automaton has 5535 states and 6522 transitions. Word has length 140 [2023-11-06 22:26:58,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:58,800 INFO L495 AbstractCegarLoop]: Abstraction has 5535 states and 6522 transitions. [2023-11-06 22:26:58,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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) [2023-11-06 22:26:58,800 INFO L276 IsEmpty]: Start isEmpty. Operand 5535 states and 6522 transitions. [2023-11-06 22:26:58,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-06 22:26:58,805 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:58,805 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, 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] [2023-11-06 22:26:58,810 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-06 22:26:59,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-06 22:26:59,006 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:59,006 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:59,006 INFO L85 PathProgramCache]: Analyzing trace with hash 313711574, now seen corresponding path program 1 times [2023-11-06 22:26:59,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:59,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942689795] [2023-11-06 22:26:59,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:59,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:59,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:26:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:59,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:26:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:59,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:26:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:59,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:26:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:59,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:26:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:59,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:26:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:59,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 22:26:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:59,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:26:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:59,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:26:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:59,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:26:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:59,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-06 22:26:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:59,149 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-11-06 22:26:59,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:59,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942689795] [2023-11-06 22:26:59,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942689795] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:59,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:59,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:26:59,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871725121] [2023-11-06 22:26:59,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:59,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:26:59,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:59,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:26:59,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:26:59,153 INFO L87 Difference]: Start difference. First operand 5535 states and 6522 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 4 states have internal predecessors, (85), 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) [2023-11-06 22:27:00,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:27:00,681 INFO L93 Difference]: Finished difference Result 5705 states and 6710 transitions. [2023-11-06 22:27:00,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:27:00,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 4 states have internal predecessors, (85), 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 140 [2023-11-06 22:27:00,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:27:00,689 INFO L225 Difference]: With dead ends: 5705 [2023-11-06 22:27:00,689 INFO L226 Difference]: Without dead ends: 4743 [2023-11-06 22:27:00,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:27:00,692 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 572 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:27:00,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 642 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:27:00,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4743 states. [2023-11-06 22:27:01,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4743 to 4743. [2023-11-06 22:27:01,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4743 states, 3754 states have (on average 1.1726158763985082) internal successors, (4402), 3790 states have internal predecessors, (4402), 477 states have call successors, (477), 396 states have call predecessors, (477), 511 states have return successors, (749), 556 states have call predecessors, (749), 476 states have call successors, (749) [2023-11-06 22:27:01,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4743 states to 4743 states and 5628 transitions. [2023-11-06 22:27:01,314 INFO L78 Accepts]: Start accepts. Automaton has 4743 states and 5628 transitions. Word has length 140 [2023-11-06 22:27:01,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:27:01,314 INFO L495 AbstractCegarLoop]: Abstraction has 4743 states and 5628 transitions. [2023-11-06 22:27:01,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 4 states have internal predecessors, (85), 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) [2023-11-06 22:27:01,315 INFO L276 IsEmpty]: Start isEmpty. Operand 4743 states and 5628 transitions. [2023-11-06 22:27:01,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-06 22:27:01,320 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:27:01,320 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] [2023-11-06 22:27:01,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-06 22:27:01,321 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:27:01,321 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:01,321 INFO L85 PathProgramCache]: Analyzing trace with hash 299517924, now seen corresponding path program 1 times [2023-11-06 22:27:01,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:01,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799359833] [2023-11-06 22:27:01,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:01,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:01,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:27:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:01,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:27:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:01,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:27:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:01,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:27:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:01,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:27:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:01,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:27:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:01,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:27:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:01,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-06 22:27:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:01,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:27:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:01,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-06 22:27:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:01,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-06 22:27:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:01,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:27:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:01,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:27:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:01,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-06 22:27:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:01,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-06 22:27:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:01,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-06 22:27:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:01,407 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-11-06 22:27:01,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:01,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799359833] [2023-11-06 22:27:01,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799359833] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:01,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:01,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:27:01,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171945573] [2023-11-06 22:27:01,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:01,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:27:01,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:01,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:27:01,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:27:01,410 INFO L87 Difference]: Start difference. First operand 4743 states and 5628 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) [2023-11-06 22:27:02,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:27:02,236 INFO L93 Difference]: Finished difference Result 5291 states and 6246 transitions. [2023-11-06 22:27:02,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:27:02,237 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 [2023-11-06 22:27:02,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:27:02,246 INFO L225 Difference]: With dead ends: 5291 [2023-11-06 22:27:02,246 INFO L226 Difference]: Without dead ends: 4542 [2023-11-06 22:27:02,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:27:02,249 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 266 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:27:02,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 169 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:27:02,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4542 states. [2023-11-06 22:27:02,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4542 to 4318. [2023-11-06 22:27:02,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4318 states, 3425 states have (on average 1.1743065693430657) internal successors, (4022), 3458 states have internal predecessors, (4022), 431 states have call successors, (431), 356 states have call predecessors, (431), 461 states have return successors, (685), 503 states have call predecessors, (685), 430 states have call successors, (685) [2023-11-06 22:27:02,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4318 states to 4318 states and 5138 transitions. [2023-11-06 22:27:02,827 INFO L78 Accepts]: Start accepts. Automaton has 4318 states and 5138 transitions. Word has length 147 [2023-11-06 22:27:02,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:27:02,828 INFO L495 AbstractCegarLoop]: Abstraction has 4318 states and 5138 transitions. [2023-11-06 22:27:02,828 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) [2023-11-06 22:27:02,828 INFO L276 IsEmpty]: Start isEmpty. Operand 4318 states and 5138 transitions. [2023-11-06 22:27:02,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-06 22:27:02,833 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:27:02,833 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] [2023-11-06 22:27:02,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-06 22:27:02,833 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:27:02,834 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:02,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1372385945, now seen corresponding path program 1 times [2023-11-06 22:27:02,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:02,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187035759] [2023-11-06 22:27:02,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:02,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:02,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:27:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:02,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:27:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:02,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:27:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:02,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:27:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:02,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:27:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:02,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:27:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:02,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:27:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:02,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-06 22:27:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:02,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:27:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:02,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:27:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:02,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-06 22:27:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:02,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:27:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:02,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:27:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:02,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-06 22:27:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:02,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-06 22:27:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:02,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-06 22:27:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:02,988 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-06 22:27:02,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:02,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187035759] [2023-11-06 22:27:02,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187035759] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:27:02,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032218982] [2023-11-06 22:27:02,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:02,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:27:02,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:27:02,991 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:27:03,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-06 22:27:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:03,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:27:03,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:27:03,300 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-06 22:27:03,301 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:27:03,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032218982] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:03,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:27:03,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-11-06 22:27:03,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563278576] [2023-11-06 22:27:03,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:03,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:27:03,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:03,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:27:03,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:27:03,303 INFO L87 Difference]: Start difference. First operand 4318 states and 5138 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) [2023-11-06 22:27:03,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:27:03,812 INFO L93 Difference]: Finished difference Result 6154 states and 7298 transitions. [2023-11-06 22:27:03,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:27:03,814 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 [2023-11-06 22:27:03,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:27:03,824 INFO L225 Difference]: With dead ends: 6154 [2023-11-06 22:27:03,824 INFO L226 Difference]: Without dead ends: 2114 [2023-11-06 22:27:03,829 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 [2023-11-06 22:27:03,830 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 38 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 231 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 [2023-11-06 22:27:03,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 231 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:27:03,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2023-11-06 22:27:04,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 2114. [2023-11-06 22:27:04,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2114 states, 1691 states have (on average 1.1608515671200472) internal successors, (1963), 1708 states have internal predecessors, (1963), 202 states have call successors, (202), 168 states have call predecessors, (202), 220 states have return successors, (303), 237 states have call predecessors, (303), 201 states have call successors, (303) [2023-11-06 22:27:04,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 2468 transitions. [2023-11-06 22:27:04,240 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 2468 transitions. Word has length 158 [2023-11-06 22:27:04,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:27:04,240 INFO L495 AbstractCegarLoop]: Abstraction has 2114 states and 2468 transitions. [2023-11-06 22:27:04,241 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) [2023-11-06 22:27:04,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 2468 transitions. [2023-11-06 22:27:04,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-11-06 22:27:04,243 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:27:04,243 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] [2023-11-06 22:27:04,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-06 22:27:04,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-11-06 22:27:04,444 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:27:04,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:04,445 INFO L85 PathProgramCache]: Analyzing trace with hash -2131801496, now seen corresponding path program 1 times [2023-11-06 22:27:04,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:04,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239505837] [2023-11-06 22:27:04,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:04,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:04,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:27:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:04,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:27:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:04,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:27:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:04,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:27:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:04,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:27:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:04,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:27:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:04,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:27:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:04,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:27:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:04,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:27:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:04,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-06 22:27:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:04,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-06 22:27:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:04,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:27:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:04,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:27:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:04,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-06 22:27:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:04,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-06 22:27:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:04,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-06 22:27:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:04,574 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-06 22:27:04,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:04,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239505837] [2023-11-06 22:27:04,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239505837] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:04,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:04,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:27:04,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828499977] [2023-11-06 22:27:04,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:04,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:27:04,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:04,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:27:04,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:27:04,578 INFO L87 Difference]: Start difference. First operand 2114 states and 2468 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) [2023-11-06 22:27:05,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:27:05,331 INFO L93 Difference]: Finished difference Result 3978 states and 4678 transitions. [2023-11-06 22:27:05,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:27:05,331 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 [2023-11-06 22:27:05,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:27:05,336 INFO L225 Difference]: With dead ends: 3978 [2023-11-06 22:27:05,336 INFO L226 Difference]: Without dead ends: 2217 [2023-11-06 22:27:05,339 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 [2023-11-06 22:27:05,340 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 190 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:27:05,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 361 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:27:05,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2023-11-06 22:27:05,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 1673. [2023-11-06 22:27:05,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1342 states have (on average 1.1669150521609537) internal successors, (1566), 1358 states have internal predecessors, (1566), 158 states have call successors, (158), 132 states have call predecessors, (158), 172 states have return successors, (235), 182 states have call predecessors, (235), 157 states have call successors, (235) [2023-11-06 22:27:05,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 1959 transitions. [2023-11-06 22:27:05,605 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 1959 transitions. Word has length 159 [2023-11-06 22:27:05,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:27:05,606 INFO L495 AbstractCegarLoop]: Abstraction has 1673 states and 1959 transitions. [2023-11-06 22:27:05,606 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) [2023-11-06 22:27:05,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 1959 transitions. [2023-11-06 22:27:05,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-06 22:27:05,608 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:27:05,608 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] [2023-11-06 22:27:05,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-06 22:27:05,608 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:27:05,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:05,609 INFO L85 PathProgramCache]: Analyzing trace with hash -601274853, now seen corresponding path program 1 times [2023-11-06 22:27:05,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:05,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604883124] [2023-11-06 22:27:05,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:05,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:05,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:27:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:05,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:27:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:05,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:27:05,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:05,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:27:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:05,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:27:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:05,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:27:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:05,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:27:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:05,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:27:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:05,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:27:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:05,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:27:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:05,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-06 22:27:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:05,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:27:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:05,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:27:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:05,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:27:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:05,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:27:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:05,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-06 22:27:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:05,912 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-06 22:27:05,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:05,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604883124] [2023-11-06 22:27:05,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604883124] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:27:05,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127968988] [2023-11-06 22:27:05,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:05,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:27:05,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:27:05,915 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:27:05,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-06 22:27:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:06,064 INFO L262 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 22:27:06,068 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:27:06,279 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-06 22:27:06,280 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:27:06,565 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-11-06 22:27:06,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127968988] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:27:06,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:27:06,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2023-11-06 22:27:06,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154665607] [2023-11-06 22:27:06,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:27:06,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 22:27:06,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:06,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 22:27:06,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:27:06,570 INFO L87 Difference]: Start difference. First operand 1673 states and 1959 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) [2023-11-06 22:27:07,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:27:07,949 INFO L93 Difference]: Finished difference Result 3708 states and 4437 transitions. [2023-11-06 22:27:07,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 22:27:07,950 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 [2023-11-06 22:27:07,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:27:07,954 INFO L225 Difference]: With dead ends: 3708 [2023-11-06 22:27:07,954 INFO L226 Difference]: Without dead ends: 1960 [2023-11-06 22:27:07,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 357 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2023-11-06 22:27:07,957 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 729 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:27:07,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 475 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:27:07,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2023-11-06 22:27:08,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 1760. [2023-11-06 22:27:08,260 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) [2023-11-06 22:27:08,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2046 transitions. [2023-11-06 22:27:08,263 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2046 transitions. Word has length 162 [2023-11-06 22:27:08,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:27:08,263 INFO L495 AbstractCegarLoop]: Abstraction has 1760 states and 2046 transitions. [2023-11-06 22:27:08,264 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) [2023-11-06 22:27:08,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2046 transitions. [2023-11-06 22:27:08,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-11-06 22:27:08,266 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:27:08,266 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] [2023-11-06 22:27:08,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-06 22:27:08,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-11-06 22:27:08,466 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:27:08,467 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:08,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1690825224, now seen corresponding path program 1 times [2023-11-06 22:27:08,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:08,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38449900] [2023-11-06 22:27:08,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:08,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:08,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:27:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:08,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:27:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:08,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:27:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:08,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:27:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:08,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:27:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:08,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:27:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:08,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:27:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:08,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:27:08,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:08,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:27:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:08,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-06 22:27:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:08,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-06 22:27:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:08,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-06 22:27:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:08,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:27:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:08,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:27:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:08,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-06 22:27:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:08,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-06 22:27:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:08,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-06 22:27:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:08,630 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-11-06 22:27:08,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:08,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38449900] [2023-11-06 22:27:08,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38449900] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:27:08,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115380999] [2023-11-06 22:27:08,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:08,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:27:08,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:27:08,632 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:27:08,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-06 22:27:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:08,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:27:08,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:27:08,826 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2023-11-06 22:27:08,826 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:27:08,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115380999] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:08,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:27:08,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2023-11-06 22:27:08,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764244773] [2023-11-06 22:27:08,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:08,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:27:08,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:08,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:27:08,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:27:08,830 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) [2023-11-06 22:27:09,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:27:09,335 INFO L93 Difference]: Finished difference Result 3405 states and 3969 transitions. [2023-11-06 22:27:09,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:27:09,337 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 [2023-11-06 22:27:09,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:27:09,340 INFO L225 Difference]: With dead ends: 3405 [2023-11-06 22:27:09,341 INFO L226 Difference]: Without dead ends: 1477 [2023-11-06 22:27:09,344 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 [2023-11-06 22:27:09,345 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 151 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:27:09,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 227 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:27:09,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2023-11-06 22:27:09,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1440. [2023-11-06 22:27:09,590 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) [2023-11-06 22:27:09,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 1649 transitions. [2023-11-06 22:27:09,593 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 1649 transitions. Word has length 179 [2023-11-06 22:27:09,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:27:09,593 INFO L495 AbstractCegarLoop]: Abstraction has 1440 states and 1649 transitions. [2023-11-06 22:27:09,593 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) [2023-11-06 22:27:09,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 1649 transitions. [2023-11-06 22:27:09,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2023-11-06 22:27:09,595 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:27:09,595 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] [2023-11-06 22:27:09,601 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-06 22:27:09,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-11-06 22:27:09,796 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:27:09,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:09,797 INFO L85 PathProgramCache]: Analyzing trace with hash 381265670, now seen corresponding path program 1 times [2023-11-06 22:27:09,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:09,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365612552] [2023-11-06 22:27:09,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:09,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:09,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:27:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:09,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:27:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:09,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:27:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:09,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:27:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:09,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:27:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:09,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:27:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:09,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:27:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:09,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:27:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:09,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:27:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:09,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:27:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:09,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-06 22:27:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:09,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:27:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:09,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:27:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:09,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-06 22:27:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:09,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-06 22:27:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:09,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 22:27:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:09,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-06 22:27:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:09,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-11-06 22:27:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:09,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-11-06 22:27:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:09,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-11-06 22:27:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:09,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:27:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:09,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:27:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:09,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-06 22:27:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:09,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2023-11-06 22:27:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:09,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2023-11-06 22:27:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:09,991 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 75 proven. 16 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2023-11-06 22:27:09,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:09,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365612552] [2023-11-06 22:27:09,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365612552] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:27:09,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154495671] [2023-11-06 22:27:09,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:09,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:27:09,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:27:09,994 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:27:10,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-06 22:27:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:10,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:27:10,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:27:10,373 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 256 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-06 22:27:10,373 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:27:10,663 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 107 proven. 7 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2023-11-06 22:27:10,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154495671] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:27:10,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:27:10,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2023-11-06 22:27:10,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332832173] [2023-11-06 22:27:10,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:27:10,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:27:10,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:10,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:27:10,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:27:10,667 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) [2023-11-06 22:27:11,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:27:11,472 INFO L93 Difference]: Finished difference Result 1743 states and 1984 transitions. [2023-11-06 22:27:11,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:27:11,473 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 [2023-11-06 22:27:11,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:27:11,474 INFO L225 Difference]: With dead ends: 1743 [2023-11-06 22:27:11,474 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:27:11,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 551 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2023-11-06 22:27:11,476 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 282 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:27:11,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 389 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:27:11,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:27:11,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:27:11,478 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) [2023-11-06 22:27:11,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:27:11,478 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 253 [2023-11-06 22:27:11,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:27:11,478 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:27:11,479 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) [2023-11-06 22:27:11,479 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:27:11,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:27:11,481 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-11-06 22:27:11,482 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-11-06 22:27:11,488 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-06 22:27:11,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-11-06 22:27:11,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:29:10,255 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 812 822) no Hoare annotation was computed. [2023-11-06 22:29:10,255 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 812 822) no Hoare annotation was computed. [2023-11-06 22:29:10,256 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 812 822) the Hoare annotation is: (let ((.cse7 (= ~E_M~0 0)) (.cse11 (< |old(~m_st~0)| 2)) (.cse0 (< ~T1_E~0 2)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))) (.cse3 (not (= ~t1_pc~0 1))) (.cse14 (< ~E_M~0 2)) (.cse4 (not (= ~q_write_ev~0 ~q_read_ev~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))) (.cse9 (not (= ~q_free~0 0))) (.cse10 (= ~p_dw_pc~0 1)) (.cse12 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse13 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~E_1~0 2) (not (= (+ ~local~0 1) ~token~0)) .cse13) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 (< 0 ~t1_pc~0) .cse2 .cse14 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13) (or .cse1 (and (<= ~t1_pc~0 0) (<= ~m_pc~0 0)) .cse2 .cse4 .cse5 (and (<= 1 ~m_pc~0) (or (< ~m_pc~0 2) (< 1 ~t1_pc~0))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 (< |old(~t1_st~0)| 2) .cse3 .cse14 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 (not (= ~token~0 ~local~0))))) [2023-11-06 22:29:10,257 INFO L899 garLoopResultBuilder]: For program point update_channels1EXIT(lines 226 240) no Hoare annotation was computed. [2023-11-06 22:29:10,257 INFO L899 garLoopResultBuilder]: For program point L48-1(lines 48 52) no Hoare annotation was computed. [2023-11-06 22:29:10,262 INFO L895 garLoopResultBuilder]: At program point update_fifo_q_returnLabel#1(lines 39 58) the Hoare annotation is: (let ((.cse26 (= ~p_dw_pc~0 1))) (let ((.cse6 (not (= |old(~q_req_up~0)| 1))) (.cse1 (<= ~q_req_up~0 0)) (.cse25 (< 0 ~c_dr_pc~0)) (.cse18 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse24 (< 0 |old(~q_req_up~0)|)) (.cse9 (not (= ~q_free~0 0))) (.cse10 (not .cse26)) (.cse14 (not (= |old(~q_read_ev~0)| 2))) (.cse0 (= ~c_dr_st~0 0)) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse3 (< 0 ~t1_pc~0)) (.cse4 (< |old(~q_write_ev~0)| 2)) (.cse5 (not (= ~M_E~0 2))) (.cse7 (< ~E_M~0 2)) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse20 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse21 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~T1_E~0 ~M_E~0))) (.cse13 (not (= ~m_st~0 0))) (.cse15 (not (= ~c_dr_pc~0 1))) (.cse16 (< ~E_1~0 2)) (.cse17 (not (= ~p_dw_i~0 1))) (.cse22 (not (= ~q_free~0 1))) (.cse23 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse19 (not (= ~token~0 ~local~0)))) (and (or .cse0 (and .cse1 (= ~q_read_ev~0 2)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 (< |old(~q_read_ev~0)| 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse11 .cse12 .cse13 .cse15 .cse16 (and .cse1 .cse21) .cse17 .cse22 .cse23 .cse19) (or .cse24 .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse20 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse22 .cse23 .cse19) (or .cse0 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse11 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse12 .cse13 .cse16 .cse17 .cse25 .cse19) (or .cse24 .cse2 (not .cse11) .cse3 .cse5 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse7 (not (= ~p_num_write~0 0)) .cse8 (not (= ~c_num_read~0 0)) (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse12 .cse13 .cse14 .cse16 .cse17 .cse22 .cse23 .cse25 .cse19) (or .cse24 .cse0 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= |old(~q_write_ev~0)| 0) .cse18 .cse19) (or .cse24 .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse20 .cse26 .cse21 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse22 .cse23 .cse19)))) [2023-11-06 22:29:10,263 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 47) no Hoare annotation was computed. [2023-11-06 22:29:10,263 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 226 240) the Hoare annotation is: (let ((.cse7 (= ~p_dw_pc~0 1)) (.cse29 (= ~q_ev~0 |old(~q_ev~0)|)) (.cse33 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse30 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse31 (= ~q_read_ev~0 2))) (let ((.cse4 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~c_num_read~0 0))) (.cse9 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse28 (< 0 ~c_dr_pc~0)) (.cse13 (< 0 |old(~q_req_up~0)|)) (.cse23 (and .cse29 .cse33 .cse30 .cse31)) (.cse24 (not (= ~q_free~0 0))) (.cse25 (not .cse7)) (.cse26 (not (= |old(~q_read_ev~0)| 2))) (.cse27 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse14 (< 0 ~t1_pc~0)) (.cse15 (< |old(~q_write_ev~0)| 2)) (.cse2 (not (= ~M_E~0 2))) (.cse32 (not (= |old(~q_req_up~0)| 1))) (.cse3 (and .cse29 .cse33 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse30)) (.cse16 (< ~E_M~0 2)) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse17 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse8 (= ~p_dw_st~0 0)) (.cse10 (not (= ~T1_E~0 ~M_E~0))) (.cse18 (not (= ~m_st~0 0))) (.cse19 (not (= ~c_dr_pc~0 1))) (.cse20 (< ~E_1~0 2)) (.cse21 (not (= ~p_dw_i~0 1))) (.cse11 (not (= ~q_free~0 1))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse22 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~E_M~0 0) (= ~m_pc~0 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse0 .cse1 .cse14 .cse15 .cse2 .cse3 .cse16 .cse5 .cse17 .cse8 .cse10 .cse18 .cse19 .cse20 .cse21 .cse11 .cse12 .cse22) (or .cse13 .cse0 .cse1 .cse14 .cse2 .cse23 .cse16 .cse5 .cse24 .cse25 .cse8 .cse10 .cse18 .cse26 .cse19 .cse20 .cse21 (= |old(~q_write_ev~0)| 0) .cse27 .cse22) (or .cse0 .cse1 .cse14 .cse2 .cse3 .cse16 .cse5 .cse24 .cse8 .cse10 .cse18 .cse20 .cse21 .cse28 .cse22) (or .cse13 .cse1 (not .cse8) .cse14 .cse2 (and .cse29 (= ~q_write_ev~0 2) .cse30 .cse31) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse16 .cse4 .cse5 .cse6 .cse9 .cse10 .cse18 .cse26 .cse20 .cse21 .cse11 .cse12 .cse28 .cse22) (or .cse13 .cse0 .cse1 .cse14 .cse15 .cse2 .cse23 .cse16 .cse5 .cse24 .cse25 .cse8 .cse10 .cse18 .cse26 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse14 .cse15 .cse2 .cse32 .cse16 .cse5 .cse24 .cse25 .cse8 (and (= ~q_req_up~0 1) .cse29 .cse33 .cse31) .cse10 .cse18 .cse26 .cse19 .cse20 .cse21 .cse27 .cse22) (or .cse0 .cse1 .cse14 .cse15 .cse2 .cse3 .cse16 .cse5 .cse17 .cse7 .cse8 .cse10 .cse18 .cse19 .cse20 .cse21 .cse11 .cse12 .cse22) (or .cse0 (< |old(~q_read_ev~0)| 1) .cse1 .cse14 .cse15 .cse2 .cse32 .cse3 .cse16 .cse5 .cse17 .cse8 .cse10 .cse18 .cse19 .cse20 .cse21 .cse11 .cse12 .cse22)))) [2023-11-06 22:29:10,264 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 42 57) no Hoare annotation was computed. [2023-11-06 22:29:10,264 INFO L899 garLoopResultBuilder]: For program point L230-1(lines 226 240) no Hoare annotation was computed. [2023-11-06 22:29:10,264 INFO L899 garLoopResultBuilder]: For program point L803-2(lines 787 811) no Hoare annotation was computed. [2023-11-06 22:29:10,264 INFO L899 garLoopResultBuilder]: For program point L795(lines 795 799) no Hoare annotation was computed. [2023-11-06 22:29:10,264 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 606) no Hoare annotation was computed. [2023-11-06 22:29:10,264 INFO L899 garLoopResultBuilder]: For program point L795-2(lines 795 799) no Hoare annotation was computed. [2023-11-06 22:29:10,265 INFO L895 garLoopResultBuilder]: At program point L630(lines 618 632) the Hoare annotation is: (let ((.cse37 (= ~p_num_write~0 0)) (.cse35 (= ~c_num_read~0 0)) (.cse36 (= ~p_last_write~0 ~q_buf_0~0)) (.cse38 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse27 (= ~m_pc~0 1)) (.cse34 (= ~q_free~0 0)) (.cse33 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse10 (= ~p_dw_pc~0 1)) (.cse26 (= ~E_M~0 0)) (.cse39 (= ~p_dw_st~0 0)) (.cse32 (= ~c_last_read~0 ~p_last_write~0)) (.cse31 (<= 2 ~m_st~0)) (.cse41 (= ~M_E~0 2)) (.cse18 (= |old(~t1_st~0)| ~t1_st~0)) (.cse40 (= ~m_st~0 |old(~m_st~0)|)) (.cse20 (= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0))) (let ((.cse24 (and .cse18 .cse40 .cse20)) (.cse2 (< 0 ~t1_pc~0)) (.cse28 (not .cse41)) (.cse29 (and (= ~T1_E~0 2) .cse41)) (.cse16 (<= 2 ~t1_st~0)) (.cse30 (and .cse18 .cse40)) (.cse9 (and .cse31 .cse20)) (.cse11 (< |old(~m_st~0)| 2)) (.cse23 (not (= (+ ~local~0 1) ~token~0))) (.cse19 (= ~m_st~0 0)) (.cse15 (and .cse37 .cse35 .cse36 .cse18 .cse38 (not .cse27) .cse40 .cse34 .cse31 .cse33 (not .cse10) (not .cse26) .cse39 .cse32)) (.cse0 (< ~T1_E~0 2)) (.cse1 (not .cse39)) (.cse17 (< |old(~t1_st~0)| 2)) (.cse21 (not (= ~t1_pc~0 1))) (.cse3 (< ~E_M~0 2)) (.cse4 (not .cse38)) (.cse5 (not .cse37)) (.cse6 (not .cse36)) (.cse7 (not .cse35)) (.cse8 (not .cse34)) (.cse12 (not .cse33)) (.cse22 (not (= |old(~m_st~0)| 0))) (.cse13 (< ~E_1~0 2)) (.cse14 (not .cse32)) (.cse25 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse16 .cse1 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse17 (and .cse18 .cse19 .cse20) .cse21 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse22 .cse13 .cse23 .cse14) (or .cse0 .cse1 .cse24 .cse21 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse25) (or .cse1 .cse4 .cse5 .cse6 .cse26 .cse27 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14 .cse15) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse2 .cse24 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14) (or .cse0 .cse1 .cse2 .cse28 .cse17 .cse3 .cse4 .cse5 .cse29 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse20) (or .cse0 .cse1 .cse30 .cse17 .cse21 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 (and .cse16 .cse20) .cse25) (or .cse0 .cse1 .cse28 .cse17 .cse21 .cse3 .cse4 .cse5 .cse29 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse20) (or .cse0 (and .cse16 .cse31 .cse20) .cse1 .cse17 .cse21 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse30 .cse17 .cse21 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse10 .cse12 .cse14 .cse25) (or .cse0 .cse1 .cse21 .cse4 .cse5 .cse6 .cse26 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse23 .cse14 (and .cse19 (<= ~E_M~0 1) .cse20) .cse15) (or .cse0 .cse1 .cse17 .cse21 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse22 .cse13 .cse14 (and (<= 1 ~m_pc~0) (< ~m_pc~0 2)) .cse20 .cse25)))) [2023-11-06 22:29:10,265 INFO L899 garLoopResultBuilder]: For program point L620(lines 620 625) no Hoare annotation was computed. [2023-11-06 22:29:10,265 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 787 811) the Hoare annotation is: (let ((.cse20 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse18 (< 0 ~t1_pc~0)) (.cse16 (= ~E_M~0 0)) (.cse12 (< |old(~m_st~0)| 2)) (.cse2 (and .cse20 (= ~m_st~0 |old(~m_st~0)|))) (.cse19 (not (= ~token~0 ~local~0))) (.cse0 (< ~T1_E~0 2)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse3 (< |old(~t1_st~0)| 2)) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (< ~E_M~0 2)) (.cse6 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse7 (not (= ~p_num_write~0 0))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (= ~c_num_read~0 0))) (.cse10 (not (= ~q_free~0 0))) (.cse11 (= ~p_dw_pc~0 1)) (.cse13 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse14 (< ~E_1~0 2)) (.cse17 (not (= (+ ~local~0 1) ~token~0))) (.cse15 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse15) (or .cse0 .cse1 .cse18 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse18 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15) (or .cse1 .cse2 .cse6 .cse7 .cse8 .cse16 (= ~m_pc~0 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse19) (or .cse0 (and .cse20 (= ~m_st~0 0)) .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 (not (= |old(~m_st~0)| 0)) .cse14 .cse17 .cse15)))) [2023-11-06 22:29:10,266 INFO L895 garLoopResultBuilder]: At program point is_transmit1_triggered_returnLabel#1(lines 615 633) the Hoare annotation is: (let ((.cse27 (= ~m_pc~0 1)) (.cse11 (= ~p_dw_pc~0 1)) (.cse26 (= ~E_M~0 0)) (.cse42 (= ~c_last_read~0 ~p_last_write~0)) (.cse40 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse39 (= ~q_free~0 0)) (.cse35 (= ~c_num_read~0 0)) (.cse36 (= ~p_last_write~0 ~q_buf_0~0)) (.cse34 (= ~p_num_write~0 0)) (.cse37 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse41 (= ~p_dw_st~0 0)) (.cse33 (<= 2 ~m_st~0)) (.cse23 (= |old(~t1_st~0)| ~t1_st~0)) (.cse38 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (= |activate_threads2_is_transmit1_triggered_#res#1| 0)) (.cse15 (= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse43 (= ~M_E~0 2))) (let ((.cse19 (not (= |old(~m_st~0)| 0))) (.cse30 (not .cse43)) (.cse31 (and (= ~T1_E~0 2) .cse43)) (.cse18 (and .cse14 .cse15)) (.cse2 (and .cse23 .cse38)) (.cse17 (not (= ~token~0 ~local~0))) (.cse32 (and .cse14 .cse33 .cse15)) (.cse24 (= ~m_st~0 0)) (.cse25 (not (= (+ ~local~0 1) ~token~0))) (.cse21 (< 0 ~t1_pc~0)) (.cse29 (and .cse14 .cse23 .cse38 .cse15)) (.cse0 (< ~T1_E~0 2)) (.cse13 (<= 2 ~t1_st~0)) (.cse1 (not .cse41)) (.cse3 (< |old(~t1_st~0)| 2)) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (< ~E_M~0 2)) (.cse6 (not .cse37)) (.cse7 (not .cse34)) (.cse8 (not .cse36)) (.cse9 (not .cse35)) (.cse10 (not .cse39)) (.cse22 (< |old(~m_st~0)| 2)) (.cse12 (not .cse40)) (.cse20 (< ~E_1~0 2)) (.cse16 (not .cse42)) (.cse28 (and .cse34 .cse35 .cse36 .cse23 .cse37 (not .cse27) .cse38 .cse39 .cse33 .cse40 (not .cse11) (not .cse26) .cse41 .cse42))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (and .cse13 .cse14 .cse15) .cse16 .cse17) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse12 .cse19 .cse20 .cse16 (and (<= 1 ~m_pc~0) (< ~m_pc~0 2)) .cse17) (or .cse0 .cse13 .cse1 .cse21 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse22 .cse12 .cse20 .cse16) (or .cse0 .cse1 .cse3 (and .cse14 .cse23 .cse24 .cse15) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse20 .cse25 .cse16) (or .cse1 .cse6 .cse7 .cse8 .cse26 .cse27 .cse9 .cse10 .cse11 .cse22 .cse12 .cse16 .cse28) (or .cse0 .cse1 .cse29 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse22 .cse12 .cse20 .cse16 .cse28 .cse17) (or .cse0 .cse1 .cse21 .cse30 .cse3 .cse5 .cse6 .cse7 .cse31 .cse8 .cse9 .cse10 .cse11 .cse22 .cse18 .cse12 .cse20 .cse16) (or .cse0 .cse1 .cse21 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse22 .cse12 .cse32 .cse20 .cse16 .cse28) (or .cse0 .cse1 .cse30 .cse3 .cse4 .cse5 .cse6 .cse7 .cse31 .cse8 .cse9 .cse10 .cse11 .cse22 .cse18 .cse12 .cse20 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse27 .cse9 .cse10 .cse11 .cse12 .cse16 .cse17) (or .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse26 .cse9 .cse10 .cse11 .cse22 .cse12 .cse32 .cse20 (and .cse14 .cse24 (<= ~E_M~0 1) .cse15) .cse25 .cse16 .cse28) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse21 .cse29 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16) (or .cse0 (and .cse13 .cse14 .cse33 .cse15) .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse22 .cse12 .cse20 .cse16 .cse28)))) [2023-11-06 22:29:10,266 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 787 811) no Hoare annotation was computed. [2023-11-06 22:29:10,266 INFO L899 garLoopResultBuilder]: For program point L600(lines 600 609) no Hoare annotation was computed. [2023-11-06 22:29:10,266 INFO L899 garLoopResultBuilder]: For program point L600-2(lines 600 609) no Hoare annotation was computed. [2023-11-06 22:29:10,266 INFO L895 garLoopResultBuilder]: At program point is_master_triggered_returnLabel#1(lines 596 614) the Hoare annotation is: (let ((.cse21 (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse17 (= |old(~t1_st~0)| ~t1_st~0)) (.cse18 (= ~m_st~0 |old(~m_st~0)|)) (.cse22 (= |activate_threads2_is_master_triggered_#res#1| 0))) (let ((.cse16 (= ~E_M~0 0)) (.cse20 (< 0 ~t1_pc~0)) (.cse19 (not (= (+ ~local~0 1) ~token~0))) (.cse15 (not (= ~token~0 ~local~0))) (.cse0 (< ~T1_E~0 2)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (and .cse21 .cse17 .cse18 .cse22)) (.cse23 (< |old(~t1_st~0)| 2)) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (< ~E_M~0 2)) (.cse5 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse6 (not (= ~p_num_write~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 (= ~p_dw_pc~0 1)) (.cse11 (< |old(~m_st~0)| 2)) (.cse12 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse13 (< ~E_1~0 2)) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse1 .cse2 .cse5 .cse6 .cse7 .cse16 (= ~m_pc~0 1) .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (or .cse0 .cse1 .cse2 (and .cse17 .cse18 (<= ~E_M~0 1)) .cse3 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse19 .cse14) (or .cse0 .cse1 .cse20 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse20 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14) (or .cse0 .cse1 (and .cse21 .cse17 (= ~m_st~0 0) .cse22) .cse23 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 (not (= |old(~m_st~0)| 0)) .cse13 .cse19 .cse14) (or .cse0 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15) (or .cse0 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2023-11-06 22:29:10,266 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 628) no Hoare annotation was computed. [2023-11-06 22:29:10,267 INFO L899 garLoopResultBuilder]: For program point L619-2(lines 619 628) no Hoare annotation was computed. [2023-11-06 22:29:10,267 INFO L895 garLoopResultBuilder]: At program point L611(lines 599 613) the Hoare annotation is: (let ((.cse22 (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse19 (= |old(~t1_st~0)| ~t1_st~0)) (.cse20 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse2 (< 0 ~t1_pc~0)) (.cse13 (= ~E_M~0 0)) (.cse5 (and .cse22 .cse19 .cse20)) (.cse14 (< |old(~m_st~0)| 2)) (.cse17 (not (= ~token~0 ~local~0))) (.cse0 (< ~T1_E~0 2)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse15 (< |old(~t1_st~0)| 2)) (.cse16 (not (= ~t1_pc~0 1))) (.cse3 (< ~E_M~0 2)) (.cse4 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse6 (not (= ~p_num_write~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 (= ~p_dw_pc~0 1)) (.cse11 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse18 (< ~E_1~0 2)) (.cse21 (not (= (+ ~local~0 1) ~token~0))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse1 .cse4 .cse5 .cse6 .cse7 .cse13 (= ~m_pc~0 1) .cse8 .cse9 .cse10 .cse14 .cse11 .cse12) (or .cse0 .cse1 .cse15 .cse16 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse11 .cse18 .cse12) (or .cse0 .cse1 (and .cse19 .cse20 (<= ~E_M~0 1)) .cse16 .cse4 .cse5 .cse6 .cse7 .cse13 .cse8 .cse9 .cse10 .cse14 .cse11 .cse18 .cse21 .cse12) (or .cse0 .cse1 .cse15 .cse16 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse11 .cse18 .cse12) (or .cse0 .cse1 .cse16 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse11 .cse18 .cse12 .cse17) (or .cse0 .cse1 .cse15 .cse16 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= |old(~m_st~0)| 0)) .cse18 (and .cse22 .cse19 (= ~m_st~0 0)) .cse21 .cse12)))) [2023-11-06 22:29:10,267 INFO L899 garLoopResultBuilder]: For program point L803(lines 803 807) no Hoare annotation was computed. [2023-11-06 22:29:10,268 INFO L895 garLoopResultBuilder]: At program point L321(line 321) the Hoare annotation is: (let ((.cse25 (= ~p_dw_pc~0 1)) (.cse20 (= |old(~p_dw_st~0)| 0)) (.cse29 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse22 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse10 (and .cse29 (= ~p_dw_st~0 0))) (.cse15 (not .cse20)) (.cse19 (< 0 ~q_req_up~0)) (.cse27 (not .cse25)) (.cse23 (not (= ~c_dr_pc~0 1))) (.cse24 (< ~q_write_ev~0 2)) (.cse28 (not (= ~q_read_ev~0 2))) (.cse1 (< 0 ~t1_pc~0)) (.cse3 (< ~E_M~0 2)) (.cse26 (not (= ~q_free~0 0))) (.cse9 (not (= ~m_st~0 0))) (.cse11 (< ~E_1~0 2)) (.cse12 (not (= ~p_dw_i~0 1))) (.cse17 (< 0 ~c_dr_pc~0)) (.cse18 (not (= ~token~0 ~local~0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (not (= ~M_E~0 2))) (.cse21 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse29)) (.cse4 (not (= ~p_num_write~0 0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (= ~c_num_read~0 0))) (.cse7 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse8 (not (= ~T1_E~0 ~M_E~0))) (.cse13 (not (= ~q_free~0 1))) (.cse14 (= |old(~c_dr_st~0)| 0)) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse19 .cse20 .cse21 .cse3 .cse5 .cse22 .cse8 .cse9 .cse23 .cse11 .cse12 .cse13 .cse14 .cse24 .cse16 .cse18) (or .cse0 .cse1 .cse2 .cse20 .cse21 .cse3 .cse5 .cse22 .cse25 .cse8 .cse9 .cse23 .cse11 .cse12 .cse13 .cse14 .cse24 .cse16 .cse18) (or .cse0 .cse1 .cse2 .cse19 .cse20 .cse21 .cse3 .cse5 .cse26 .cse27 .cse8 .cse9 (= ~q_write_ev~0 0) .cse23 .cse11 .cse12 .cse14 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse28 .cse18) (or .cse0 .cse1 .cse2 .cse19 .cse3 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse19 .cse20 .cse21 .cse3 .cse5 .cse26 .cse27 .cse8 .cse9 .cse23 .cse11 .cse12 .cse14 .cse24 .cse28 .cse18) (or .cse0 .cse1 .cse2 .cse20 .cse21 .cse3 .cse5 .cse26 .cse8 .cse9 .cse11 .cse12 .cse14 .cse17 .cse18) (or .cse0 .cse2 .cse20 .cse21 .cse4 .cse5 (= ~E_M~0 0) (= ~m_pc~0 1) .cse6 .cse25 .cse7 .cse8 .cse13 .cse14 .cse16)))) [2023-11-06 22:29:10,268 INFO L895 garLoopResultBuilder]: At program point L323-2(lines 323 327) the Hoare annotation is: (let ((.cse20 (= activate_threads1_~tmp~1 0)) (.cse26 (= ~p_dw_pc~0 1)) (.cse37 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse10 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse11 (= ~p_dw_st~0 0)) (.cse23 (= |old(~p_dw_st~0)| 0))) (let ((.cse21 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse16 (not .cse23)) (.cse31 (not .cse11)) (.cse18 (< 0 ~c_dr_pc~0)) (.cse36 (not (= ~c_dr_st~0 0))) (.cse25 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse24 (and .cse37 .cse10)) (.cse4 (not (= ~p_num_write~0 0))) (.cse29 (= ~E_M~0 0)) (.cse30 (= ~m_pc~0 1)) (.cse6 (not (= ~c_num_read~0 0))) (.cse7 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse14 (not (= ~q_free~0 1))) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (< 0 ~t1_pc~0)) (.cse2 (not (= ~M_E~0 2))) (.cse33 (< 0 ~q_req_up~0)) (.cse3 (< ~E_M~0 2)) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse32 (not (= ~q_free~0 0))) (.cse34 (not .cse26)) (.cse8 (not (= ~T1_E~0 ~M_E~0))) (.cse9 (not (= ~m_st~0 0))) (.cse27 (not (= ~c_dr_pc~0 1))) (.cse35 (and .cse37 .cse20 .cse10)) (.cse12 (< ~E_1~0 2)) (.cse13 (not (= ~p_dw_i~0 1))) (.cse15 (= |old(~c_dr_st~0)| 0)) (.cse28 (< ~q_write_ev~0 2)) (.cse22 (not (= ~q_read_ev~0 2))) (.cse19 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and .cse10 .cse11) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse20 .cse0 .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse22 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse23 .cse24 .cse3 .cse5 .cse25 .cse26 .cse8 .cse9 .cse27 .cse12 .cse13 .cse14 .cse15 .cse28 .cse17 .cse19) (or .cse20 .cse0 .cse2 .cse23 .cse4 .cse5 .cse29 .cse30 .cse6 .cse26 .cse7 .cse8 .cse14 .cse15 .cse22 .cse17) (or .cse0 .cse31 .cse1 .cse2 .cse23 .cse3 .cse5 .cse32 .cse26 .cse8 .cse9 .cse12 .cse13 .cse15 .cse18 .cse19) (or .cse20 .cse0 .cse1 .cse2 .cse23 .cse3 .cse5 .cse25 .cse26 .cse8 .cse9 .cse27 .cse12 .cse13 .cse14 .cse15 .cse28 .cse22 .cse17 .cse19) (or .cse0 .cse1 .cse2 .cse33 .cse23 .cse3 .cse5 .cse32 .cse34 .cse8 .cse9 (= ~q_write_ev~0 0) .cse27 .cse35 .cse12 .cse13 .cse15 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse22 .cse19) (or .cse0 .cse1 .cse2 .cse33 .cse3 .cse21 .cse4 (and .cse20 .cse10 .cse11) .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse16 .cse22 .cse17 .cse18 .cse19) (or .cse20 .cse0 .cse1 .cse2 .cse33 .cse23 .cse3 .cse5 .cse25 .cse8 .cse9 .cse27 .cse12 .cse13 .cse14 .cse15 .cse28 .cse22 .cse17 .cse19) (or .cse0 .cse1 .cse2 .cse23 (and .cse20 .cse31) .cse3 .cse5 .cse32 .cse8 .cse9 .cse12 .cse13 .cse15 .cse22 .cse18 .cse19) (or .cse0 .cse1 .cse2 (and .cse36 .cse11) .cse23 .cse24 .cse3 .cse5 .cse32 .cse8 .cse9 .cse12 .cse13 .cse15 .cse18 .cse19) (or .cse0 (and (= ~q_read_ev~0 1) .cse36 .cse11) .cse1 .cse2 .cse33 .cse23 .cse3 .cse5 .cse25 .cse8 .cse9 .cse27 .cse12 .cse13 .cse14 .cse15 .cse28 .cse17 (and .cse37 .cse10 .cse26) .cse19) (or .cse0 .cse2 .cse23 .cse24 .cse4 .cse5 .cse29 .cse30 .cse6 .cse26 .cse7 .cse8 .cse14 .cse15 .cse17) (or .cse0 .cse1 .cse2 .cse33 .cse23 .cse3 .cse5 .cse32 .cse34 .cse8 .cse9 .cse27 .cse35 .cse12 .cse13 .cse15 .cse28 .cse22 .cse19)))) [2023-11-06 22:29:10,268 INFO L899 garLoopResultBuilder]: For program point L321-1(line 321) no Hoare annotation was computed. [2023-11-06 22:29:10,269 INFO L899 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 315 339) no Hoare annotation was computed. [2023-11-06 22:29:10,269 INFO L899 garLoopResultBuilder]: For program point L331(lines 331 335) no Hoare annotation was computed. [2023-11-06 22:29:10,269 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 315 339) the Hoare annotation is: (let ((.cse25 (= ~p_dw_pc~0 1)) (.cse20 (= |old(~p_dw_st~0)| 0)) (.cse29 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse22 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse10 (and .cse29 (= ~p_dw_st~0 0))) (.cse15 (not .cse20)) (.cse19 (< 0 ~q_req_up~0)) (.cse27 (not .cse25)) (.cse23 (not (= ~c_dr_pc~0 1))) (.cse24 (< ~q_write_ev~0 2)) (.cse28 (not (= ~q_read_ev~0 2))) (.cse1 (< 0 ~t1_pc~0)) (.cse3 (< ~E_M~0 2)) (.cse26 (not (= ~q_free~0 0))) (.cse9 (not (= ~m_st~0 0))) (.cse11 (< ~E_1~0 2)) (.cse12 (not (= ~p_dw_i~0 1))) (.cse17 (< 0 ~c_dr_pc~0)) (.cse18 (not (= ~token~0 ~local~0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (not (= ~M_E~0 2))) (.cse21 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse29)) (.cse4 (not (= ~p_num_write~0 0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (= ~c_num_read~0 0))) (.cse7 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse8 (not (= ~T1_E~0 ~M_E~0))) (.cse13 (not (= ~q_free~0 1))) (.cse14 (= |old(~c_dr_st~0)| 0)) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse19 .cse20 .cse21 .cse3 .cse5 .cse22 .cse8 .cse9 .cse23 .cse11 .cse12 .cse13 .cse14 .cse24 .cse16 .cse18) (or .cse0 .cse1 .cse2 .cse20 .cse21 .cse3 .cse5 .cse22 .cse25 .cse8 .cse9 .cse23 .cse11 .cse12 .cse13 .cse14 .cse24 .cse16 .cse18) (or .cse0 .cse1 .cse2 .cse19 .cse20 .cse21 .cse3 .cse5 .cse26 .cse27 .cse8 .cse9 (= ~q_write_ev~0 0) .cse23 .cse11 .cse12 .cse14 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse28 .cse18) (or .cse0 .cse1 .cse2 .cse19 .cse3 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse19 .cse20 .cse21 .cse3 .cse5 .cse26 .cse27 .cse8 .cse9 .cse23 .cse11 .cse12 .cse14 .cse24 .cse28 .cse18) (or .cse0 .cse1 .cse2 .cse20 .cse21 .cse3 .cse5 .cse26 .cse8 .cse9 .cse11 .cse12 .cse14 .cse17 .cse18) (or .cse0 .cse2 .cse20 .cse21 .cse4 .cse5 (= ~E_M~0 0) (= ~m_pc~0 1) .cse6 .cse25 .cse7 .cse8 .cse13 .cse14 .cse16)))) [2023-11-06 22:29:10,269 INFO L899 garLoopResultBuilder]: For program point L329(line 329) no Hoare annotation was computed. [2023-11-06 22:29:10,269 INFO L899 garLoopResultBuilder]: For program point L331-2(lines 315 339) no Hoare annotation was computed. [2023-11-06 22:29:10,269 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2023-11-06 22:29:10,269 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 634 641) no Hoare annotation was computed. [2023-11-06 22:29:10,270 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 634 641) the Hoare annotation is: true [2023-11-06 22:29:10,270 INFO L899 garLoopResultBuilder]: For program point L735-1(lines 734 757) no Hoare annotation was computed. [2023-11-06 22:29:10,270 INFO L899 garLoopResultBuilder]: For program point L750-1(lines 731 758) no Hoare annotation was computed. [2023-11-06 22:29:10,270 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 731 758) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (< 0 ~t1_pc~0)) (.cse17 (< ~t1_st~0 2)) (.cse13 (not (= ~m_st~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse18 (< ~m_st~0 2)) (.cse19 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse4 (not (= ~p_num_write~0 0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (= ~c_num_read~0 0))) (.cse7 (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)|))) (.cse8 (not (= ~q_free~0 0))) (.cse9 (< |old(~E_1~0)| 2)) (.cse10 (= ~p_dw_pc~0 1)) (.cse11 (< |old(~E_M~0)| 2)) (.cse12 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse15 (< |old(~T1_E~0)| 2)) (.cse16 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse1 .cse2 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15) (or .cse17 .cse1 .cse19 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (and (<= 1 ~m_pc~0) (< ~m_pc~0 2)) .cse16) (or .cse1 (= |old(~E_M~0)| 0) .cse18 .cse3 .cse4 .cse5 (= ~m_pc~0 1) .cse6 .cse7 .cse8 .cse10 .cse12 .cse14) (or .cse17 .cse1 .cse18 .cse19 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15) (or .cse17 .cse1 .cse19 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= (+ ~local~0 1) ~token~0)) .cse14 .cse15) (or .cse1 .cse18 .cse19 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16))) [2023-11-06 22:29:10,270 INFO L899 garLoopResultBuilder]: For program point L745-1(lines 734 757) no Hoare annotation was computed. [2023-11-06 22:29:10,270 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 731 758) no Hoare annotation was computed. [2023-11-06 22:29:10,270 INFO L899 garLoopResultBuilder]: For program point L740-1(lines 734 757) no Hoare annotation was computed. [2023-11-06 22:29:10,270 INFO L899 garLoopResultBuilder]: For program point L288-1(lines 279 296) no Hoare annotation was computed. [2023-11-06 22:29:10,271 INFO L899 garLoopResultBuilder]: For program point L283-1(lines 282 295) no Hoare annotation was computed. [2023-11-06 22:29:10,271 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 279 296) the Hoare annotation is: (let ((.cse29 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse25 (= ~q_read_ev~0 2)) (.cse28 (= ~p_dw_pc~0 1))) (let ((.cse24 (< 0 ~c_dr_pc~0)) (.cse4 (< 0 ~q_req_up~0)) (.cse7 (not (= ~q_free~0 0))) (.cse8 (not .cse28)) (.cse12 (not (= |old(~q_read_ev~0)| 2))) (.cse16 (and .cse29 .cse25)) (.cse2 (< 0 ~t1_pc~0)) (.cse26 (< |old(~q_write_ev~0)| 2)) (.cse5 (< ~E_M~0 2)) (.cse27 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse11 (not (= ~m_st~0 0))) (.cse13 (not (= ~c_dr_pc~0 1))) (.cse14 (< ~E_1~0 2)) (.cse15 (not (= ~p_dw_i~0 1))) (.cse17 (not (= ~token~0 ~local~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse3 (not (= ~M_E~0 2))) (.cse18 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse19 (and .cse29 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse20 (not (= ~c_num_read~0 0))) (.cse9 (= ~p_dw_st~0 0)) (.cse21 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse10 (not (= ~T1_E~0 ~M_E~0))) (.cse22 (not (= ~q_free~0 1))) (.cse23 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse18 .cse6 .cse19 .cse20 .cse21 .cse10 .cse11 .cse14 .cse15 .cse22 .cse23 .cse24 .cse17) (or .cse1 (not .cse9) .cse2 .cse3 .cse4 (and (= ~q_write_ev~0 2) .cse25) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse5 .cse18 .cse6 .cse20 .cse21 .cse10 .cse11 .cse12 .cse14 .cse15 .cse22 .cse23 .cse24 .cse17) (or .cse0 .cse1 .cse2 .cse26 .cse3 .cse4 .cse5 .cse6 .cse19 .cse27 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse22 .cse23 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse19 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse24 .cse17) (or .cse0 .cse1 .cse2 .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse26 .cse3 .cse5 .cse6 .cse19 .cse27 .cse28 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse22 .cse23 .cse17) (or .cse0 .cse1 .cse3 .cse18 .cse6 (= ~E_M~0 0) (= ~m_pc~0 1) .cse19 .cse20 .cse28 .cse9 .cse21 .cse10 .cse22 .cse23)))) [2023-11-06 22:29:10,271 INFO L899 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 279 296) no Hoare annotation was computed. [2023-11-06 22:29:10,271 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 98) no Hoare annotation was computed. [2023-11-06 22:29:10,271 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 101) no Hoare annotation was computed. [2023-11-06 22:29:10,271 INFO L899 garLoopResultBuilder]: For program point L92-2(lines 92 101) no Hoare annotation was computed. [2023-11-06 22:29:10,271 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 88 106) no Hoare annotation was computed. [2023-11-06 22:29:10,272 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 88 106) the Hoare annotation is: true [2023-11-06 22:29:10,272 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 88 106) no Hoare annotation was computed. [2023-11-06 22:29:10,272 INFO L895 garLoopResultBuilder]: At program point L103(lines 91 105) the Hoare annotation is: (let ((.cse23 (= ~p_dw_pc~0 1))) (let ((.cse7 (not (= ~p_num_write~0 0))) (.cse9 (not (= ~c_num_read~0 0))) (.cse10 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse18 (< 0 ~c_dr_pc~0)) (.cse24 (not (= ~q_free~0 0))) (.cse16 (not (= ~q_read_ev~0 2))) (.cse1 (= ~p_dw_st~0 0)) (.cse20 (= ~c_dr_st~0 0)) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (< 0 ~t1_pc~0)) (.cse3 (not (= ~M_E~0 2))) (.cse4 (< 0 ~q_req_up~0)) (.cse5 (= is_do_read_c_triggered_~__retres1~1 0)) (.cse6 (< ~E_M~0 2)) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse21 (= ~E_M~0 0)) (.cse22 (= ~m_pc~0 1)) (.cse25 (not .cse23)) (.cse28 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse11 (not (= ~T1_E~0 ~M_E~0))) (.cse12 (not (= ~m_st~0 0))) (.cse26 (not (= ~c_dr_pc~0 1))) (.cse13 (< ~E_1~0 2)) (.cse14 (not (= ~p_dw_i~0 1))) (.cse15 (not (= ~q_free~0 1))) (.cse27 (< ~q_write_ev~0 2)) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse19 (not (= ~token~0 ~local~0)))) (and (or .cse0 (not .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse20 .cse0 .cse3 .cse5 .cse7 .cse8 .cse21 .cse22 .cse9 .cse23 .cse1 .cse10 .cse11 .cse15 .cse17) (or .cse20 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 .cse1 .cse11 .cse12 .cse26 .cse13 .cse14 .cse27 .cse16 .cse19) (or .cse20 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse21 .cse22 .cse25 .cse28 .cse1 .cse11 .cse12 .cse26 .cse13 .cse14 .cse15 .cse27 .cse17 .cse19) (or .cse20 .cse0 .cse2 .cse3 .cse5 .cse6 .cse8 .cse21 .cse22 .cse24 .cse11 .cse12 .cse13 .cse14 .cse18 .cse19) (or .cse20 .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse21 .cse22 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19) (or .cse20 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse24 .cse25 (<= 1 ~q_write_ev~0) .cse1 .cse11 .cse12 (= ~q_write_ev~0 0) .cse26 .cse13 .cse14 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse16 .cse19) (or .cse20 .cse0 .cse2 .cse3 .cse5 .cse6 .cse8 .cse21 .cse22 .cse28 .cse23 .cse1 .cse11 .cse12 .cse26 .cse13 .cse14 .cse15 .cse27 .cse17 .cse19) (or .cse20 .cse0 .cse2 (not (= ~q_read_ev~0 1)) .cse3 .cse4 .cse5 .cse6 .cse8 .cse21 .cse22 .cse25 .cse28 .cse11 .cse12 .cse26 .cse13 .cse14 .cse15 .cse27 .cse17 .cse19)))) [2023-11-06 22:29:10,272 INFO L899 garLoopResultBuilder]: For program point L960(lines 960 966) no Hoare annotation was computed. [2023-11-06 22:29:10,272 INFO L895 garLoopResultBuilder]: At program point main1_returnLabel#1(lines 473 484) the Hoare annotation is: (= ~M_E~0 2) [2023-11-06 22:29:10,273 INFO L895 garLoopResultBuilder]: At program point L927(line 927) the Hoare annotation is: (let ((.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse15 (<= 2 ~m_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (<= 2 ~E_M~0)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse8 (= ~m_st~0 0)) (.cse19 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (not (= ~p_dw_pc~0 1))) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse3 .cse4 .cse5 .cse7 .cse19 .cse9 .cse15 .cse10 .cse12 (not (= ~E_M~0 0)) .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16))) [2023-11-06 22:29:10,273 INFO L899 garLoopResultBuilder]: For program point L927-1(line 927) no Hoare annotation was computed. [2023-11-06 22:29:10,273 INFO L895 garLoopResultBuilder]: At program point transmit1_T1_WAIT#1(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)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (= ~q_free~0 0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (not (= ~p_dw_pc~0 1))) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0))) (or (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) .cse0 .cse1 .cse2 (<= 2 ~E_M~0) .cse3 .cse4 .cse5 .cse6 (<= 2 ~T1_E~0) .cse7 .cse8 .cse9 (= ~token~0 ~local~0)) (and .cse0 .cse1 .cse2 .cse3 (or (< 0 ~t1_pc~0) (< 0 ~m_pc~0)) .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (< ~m_pc~0 1) (and (<= ~t1_pc~0 1) (<= 2 ~m_pc~0)))))) [2023-11-06 22:29:10,273 INFO L895 garLoopResultBuilder]: At program point L250-1(lines 241 258) the Hoare annotation is: (let ((.cse9 (not (= ~c_dr_st~0 0))) (.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 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~T1_E~0 2)) (.cse7 (= ~m_st~0 0)) (.cse8 (= ~q_free~0 1)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= ~t1_pc~0 0)) (.cse17 (= ~p_dw_st~0 0)) (.cse12 (= ~p_dw_i~0 1)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse15 (= ~token~0 ~local~0)) (.cse16 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 (not .cse17) .cse2 .cse3 .cse4 .cse6 .cse8 (not (= ~m_pc~0 1)) .cse9 .cse10 (not (= ~p_dw_pc~0 1)) (not (= ~E_M~0 0)) .cse13 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 (<= ~q_req_up~0 0) (= ~q_write_ev~0 2) .cse17 (= ~q_read_ev~0 2) .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-11-06 22:29:10,273 INFO L899 garLoopResultBuilder]: For program point L696-1(lines 686 724) no Hoare annotation was computed. [2023-11-06 22:29:10,273 INFO L899 garLoopResultBuilder]: For program point L564(lines 564 572) no Hoare annotation was computed. [2023-11-06 22:29:10,273 INFO L899 garLoopResultBuilder]: For program point L878(lines 878 883) no Hoare annotation was computed. [2023-11-06 22:29:10,274 INFO L899 garLoopResultBuilder]: For program point L713(lines 713 720) no Hoare annotation was computed. [2023-11-06 22:29:10,274 INFO L899 garLoopResultBuilder]: For program point L713-2(lines 713 720) no Hoare annotation was computed. [2023-11-06 22:29:10,274 INFO L899 garLoopResultBuilder]: For program point L350(line 350) no Hoare annotation was computed. [2023-11-06 22:29:10,274 INFO L895 garLoopResultBuilder]: At program point do_write_p_returnLabel#1(lines 132 171) the Hoare annotation is: (let ((.cse0 (= ~q_req_up~0 1)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~T1_E~0 2)) (.cse7 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse8 (= ~m_st~0 0)) (.cse16 (not (= ~c_dr_st~0 0))) (.cse10 (= ~q_free~0 0)) (.cse11 (<= ~t1_pc~0 0)) (.cse12 (= ~p_dw_i~0 1)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse14 (= ~token~0 ~local~0)) (.cse15 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 (= ~c_num_read~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 1 ~q_read_ev~0) .cse12 (= ~p_num_write~0 1) .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 (= ~c_dr_pc~0 1) (= ~p_dw_pc~0 1) (= ~q_read_ev~0 2) .cse12 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-11-06 22:29:10,274 INFO L899 garLoopResultBuilder]: For program point L532(line 532) no Hoare annotation was computed. [2023-11-06 22:29:10,274 INFO L895 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (let ((.cse14 (= ~p_dw_pc~0 1))) (let ((.cse8 (not (= ~m_pc~0 1))) (.cse1 (= ~c_num_read~0 ~p_num_write~0)) (.cse7 (= ~q_free~0 1)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse23 (not .cse14)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (<= 2 ~E_1~0)) (.cse20 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse22 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~m_st~0 0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse21 (= ~q_free~0 0)) (.cse11 (<= ~t1_pc~0 0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse13 (<= ~q_req_up~0 0)) (.cse15 (= ~q_read_ev~0 2)) (.cse16 (= ~p_dw_i~0 1)) (.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) (and .cse0 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19) (and .cse0 .cse20 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse9 .cse21 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19) (and (= ~p_num_write~0 0) .cse20 (= ~c_num_read~0 0) .cse2 .cse3 .cse5 .cse7 .cse8 .cse10 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse23 (not (= ~E_M~0 0)) .cse17 .cse19) (and .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10 .cse21 .cse11 .cse16 (<= ~c_dr_pc~0 0) .cse18 .cse19) (and .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse23 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse20 .cse2 .cse22 .cse3 (not (= ~q_write_ev~0 0)) .cse4 .cse5 .cse6 .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19)))) [2023-11-06 22:29:10,275 INFO L895 garLoopResultBuilder]: At program point L912(line 912) the Hoare annotation is: (let ((.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse15 (<= 2 ~m_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (<= 2 ~E_M~0)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse8 (= ~m_st~0 0)) (.cse19 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (not (= ~p_dw_pc~0 1))) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse3 .cse4 .cse5 .cse7 .cse19 .cse9 .cse15 .cse10 .cse12 (not (= ~E_M~0 0)) .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16))) [2023-11-06 22:29:10,275 INFO L899 garLoopResultBuilder]: For program point L400-1(line 400) no Hoare annotation was computed. [2023-11-06 22:29:10,275 INFO L899 garLoopResultBuilder]: For program point L912-1(line 912) no Hoare annotation was computed. [2023-11-06 22:29:10,275 INFO L899 garLoopResultBuilder]: For program point L846-1(lines 835 858) no Hoare annotation was computed. [2023-11-06 22:29:10,275 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 144) no Hoare annotation was computed. [2023-11-06 22:29:10,275 INFO L899 garLoopResultBuilder]: For program point L962(lines 962 965) no Hoare annotation was computed. [2023-11-06 22:29:10,276 INFO L895 garLoopResultBuilder]: At program point L897(line 897) the Hoare annotation is: (and (<= 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) (= ~T1_E~0 2) (= ~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) (not (= ~p_dw_pc~0 1)) (= ~p_dw_st~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2023-11-06 22:29:10,276 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 356) no Hoare annotation was computed. [2023-11-06 22:29:10,276 INFO L899 garLoopResultBuilder]: For program point L897-1(line 897) no Hoare annotation was computed. [2023-11-06 22:29:10,276 INFO L899 garLoopResultBuilder]: For program point L352-1(lines 347 387) no Hoare annotation was computed. [2023-11-06 22:29:10,276 INFO L899 garLoopResultBuilder]: For program point L699(lines 699 706) no Hoare annotation was computed. [2023-11-06 22:29:10,276 INFO L899 garLoopResultBuilder]: For program point L699-2(lines 699 706) no Hoare annotation was computed. [2023-11-06 22:29:10,276 INFO L899 garLoopResultBuilder]: For program point L567(lines 567 571) no Hoare annotation was computed. [2023-11-06 22:29:10,276 INFO L895 garLoopResultBuilder]: At program point L435(line 435) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1))) (let ((.cse21 (not (= ~m_pc~0 1))) (.cse19 (= ~c_num_read~0 ~p_num_write~0)) (.cse20 (= ~q_free~0 1)) (.cse23 (not .cse13)) (.cse22 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (<= ~q_req_up~0 0)) (.cse18 (= ~q_req_up~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse24 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~m_st~0 0)) (.cse7 (<= 2 ~q_write_ev~0)) (.cse8 (not (= ~c_dr_st~0 0))) (.cse9 (= ~q_free~0 0)) (.cse10 (<= ~t1_pc~0 0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse14 (= ~q_read_ev~0 2)) (.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 .cse18 .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse7 .cse8 .cse10 .cse11 .cse13 (<= 1 ~q_read_ev~0) .cse15 .cse22 .cse16 .cse17) (and (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse5 .cse20 .cse21 .cse8 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse23 (not (= ~E_M~0 0)) .cse22 .cse17) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse15 .cse22 .cse16 .cse17) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse10 .cse11 .cse23 .cse15 .cse22 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse24 .cse3 (not (= ~q_write_ev~0 0)) .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse15 (<= ~c_dr_pc~0 0) .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse24 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2023-11-06 22:29:10,277 INFO L899 garLoopResultBuilder]: For program point L435-1(line 435) no Hoare annotation was computed. [2023-11-06 22:29:10,277 INFO L899 garLoopResultBuilder]: For program point L402(lines 402 407) no Hoare annotation was computed. [2023-11-06 22:29:10,277 INFO L895 garLoopResultBuilder]: At program point transmit1_returnLabel#1(lines 560 595) the Hoare annotation is: (let ((.cse15 (<= 2 ~m_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (<= 2 ~E_M~0)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse8 (= ~m_st~0 0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (not (= ~p_dw_pc~0 1))) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse3 .cse4 .cse5 .cse7 (or (< 0 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse15 .cse10 .cse12 (not (= ~E_M~0 0)) .cse13 .cse14 (or (< ~m_pc~0 1) (and (<= ~t1_pc~0 1) (<= 2 ~m_pc~0)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~m_pc~0 1)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~token~0 ~local~0)))) [2023-11-06 22:29:10,277 INFO L895 garLoopResultBuilder]: At program point init_model2_returnLabel#1(lines 860 869) the Hoare annotation is: (and (<= 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) (= ~T1_E~0 2) (= ~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) (not (= ~p_dw_pc~0 1)) (= ~p_dw_st~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2023-11-06 22:29:10,278 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 143) no Hoare annotation was computed. [2023-11-06 22:29:10,278 INFO L895 garLoopResultBuilder]: At program point L651-1(lines 642 659) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse5 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse11 (<= ~t1_pc~0 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)) (.cse6 (= ~T1_E~0 2)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse12 (not (= ~p_dw_pc~0 1))) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~token~0 ~local~0) .cse15) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (not (= ~m_pc~0 1)) .cse9 (<= 2 ~m_st~0) .cse10 .cse12 (not (= ~E_M~0 0)) .cse13 .cse14 .cse15))) [2023-11-06 22:29:10,278 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)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (= ~q_free~0 0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (not (= ~p_dw_pc~0 1))) (.cse8 (not (= ~E_M~0 0))) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0))) (or (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) .cse0 .cse1 (= (+ ~local~0 1) ~token~0) .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~T1_E~0) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (or (< 0 ~t1_pc~0) (< 0 ~m_pc~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (or (< ~m_pc~0 1) (and (<= ~t1_pc~0 1) (<= 2 ~m_pc~0)))))) [2023-11-06 22:29:10,278 INFO L899 garLoopResultBuilder]: For program point L585-1(line 585) no Hoare annotation was computed. [2023-11-06 22:29:10,279 INFO L895 garLoopResultBuilder]: At program point L420(line 420) the Hoare annotation is: (and (<= 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) (= ~T1_E~0 2) (= ~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) (= ~q_write_ev~0 2) (= ~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)) [2023-11-06 22:29:10,279 INFO L899 garLoopResultBuilder]: For program point L420-1(line 420) no Hoare annotation was computed. [2023-11-06 22:29:10,279 INFO L895 garLoopResultBuilder]: At program point L899(line 899) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse5 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse11 (<= ~t1_pc~0 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)) (.cse6 (= ~T1_E~0 2)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse12 (not (= ~p_dw_pc~0 1))) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~token~0 ~local~0) .cse15) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (not (= ~m_pc~0 1)) .cse9 (<= 2 ~m_st~0) .cse10 .cse12 (not (= ~E_M~0 0)) .cse13 .cse14 .cse15))) [2023-11-06 22:29:10,279 INFO L895 garLoopResultBuilder]: At program point do_read_c_DR_WAIT_WRITE#1(lines 176 224) the Hoare annotation is: (and (<= 2 ~E_1~0) (not (= ~p_dw_st~0 0)) (= ~p_last_write~0 ~q_buf_0~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) (= ~m_pc~0 ~t1_pc~0) (<= 2 ~E_M~0) (= ~T1_E~0 2) (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|) (= ~m_st~0 0) (<= 2 ~q_write_ev~0) (not (= ~c_dr_st~0 0)) (= ~q_free~0 0) (<= ~t1_pc~0 0) (= ~c_dr_pc~0 1) (<= ~q_req_up~0 0) (= ~p_dw_pc~0 1) (<= 1 ~q_read_ev~0) (= ~p_dw_i~0 1) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2023-11-06 22:29:10,280 INFO L895 garLoopResultBuilder]: At program point L899-1(line 899) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse5 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse11 (<= ~t1_pc~0 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)) (.cse6 (= ~T1_E~0 2)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse12 (not (= ~p_dw_pc~0 1))) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~token~0 ~local~0) .cse15) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (not (= ~m_pc~0 1)) .cse9 (<= 2 ~m_st~0) .cse10 .cse12 (not (= ~E_M~0 0)) .cse13 .cse14 .cse15))) [2023-11-06 22:29:10,280 INFO L899 garLoopResultBuilder]: For program point L189(lines 188 219) no Hoare annotation was computed. [2023-11-06 22:29:10,280 INFO L895 garLoopResultBuilder]: At program point L916(line 916) the Hoare annotation is: (let ((.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse15 (<= 2 ~m_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (<= 2 ~E_M~0)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse8 (= ~m_st~0 0)) (.cse19 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (not (= ~p_dw_pc~0 1))) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse3 .cse4 .cse5 .cse7 .cse19 .cse9 .cse15 .cse10 .cse12 (not (= ~E_M~0 0)) .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16))) [2023-11-06 22:29:10,280 INFO L895 garLoopResultBuilder]: At program point L916-1(line 916) the Hoare annotation is: (let ((.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse15 (<= 2 ~m_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (<= 2 ~E_M~0)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse8 (= ~m_st~0 0)) (.cse19 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (not (= ~p_dw_pc~0 1))) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse3 .cse4 .cse5 .cse7 .cse19 .cse9 .cse15 .cse10 .cse12 (not (= ~E_M~0 0)) .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16))) [2023-11-06 22:29:10,281 INFO L902 garLoopResultBuilder]: At program point start_simulation2_returnLabel#1(lines 889 947) the Hoare annotation is: true [2023-11-06 22:29:10,281 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 218) no Hoare annotation was computed. [2023-11-06 22:29:10,281 INFO L899 garLoopResultBuilder]: For program point L520(lines 520 528) no Hoare annotation was computed. [2023-11-06 22:29:10,281 INFO L895 garLoopResultBuilder]: At program point L900(line 900) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse5 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse11 (<= ~t1_pc~0 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)) (.cse6 (= ~T1_E~0 2)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse12 (not (= ~p_dw_pc~0 1))) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~token~0 ~local~0) .cse15) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (not (= ~m_pc~0 1)) .cse9 (<= 2 ~m_st~0) .cse10 .cse12 (not (= ~E_M~0 0)) .cse13 .cse14 .cse15))) [2023-11-06 22:29:10,281 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:29:10,282 INFO L895 garLoopResultBuilder]: At program point master_returnLabel#1(lines 516 559) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (<= 2 ~m_st~0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (not (= ~p_dw_pc~0 1))) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 (<= 2 ~t1_st~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~token~0 ~local~0)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~t1_pc~0 0) .cse10 .cse11 .cse12 .cse13))) [2023-11-06 22:29:10,282 INFO L899 garLoopResultBuilder]: For program point L190-1(lines 190 200) no Hoare annotation was computed. [2023-11-06 22:29:10,282 INFO L895 garLoopResultBuilder]: At program point stop_simulation2_returnLabel#1(lines 870 888) the Hoare annotation is: (let ((.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse15 (<= 2 ~m_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (<= 2 ~E_M~0)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse8 (= ~m_st~0 0)) (.cse19 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (not (= ~p_dw_pc~0 1))) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse3 .cse4 .cse5 .cse7 .cse19 .cse9 .cse15 .cse10 .cse12 (not (= ~E_M~0 0)) .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16))) [2023-11-06 22:29:10,282 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 (not (= ~p_dw_pc~0 1))) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse3 .cse4 .cse5 .cse6 (<= ~t1_pc~0 0) .cse7 .cse8 .cse9 .cse10) (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~token~0 ~local~0)))) [2023-11-06 22:29:10,283 INFO L899 garLoopResultBuilder]: For program point L537-1(line 537) no Hoare annotation was computed. [2023-11-06 22:29:10,283 INFO L895 garLoopResultBuilder]: At program point fire_time_events2_returnLabel#1(lines 823 831) the Hoare annotation is: (let ((.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse15 (<= 2 ~m_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (<= 2 ~E_M~0)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse8 (= ~m_st~0 0)) (.cse19 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (not (= ~p_dw_pc~0 1))) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse3 .cse4 .cse5 .cse7 .cse19 .cse9 .cse15 .cse10 .cse12 (not (= ~E_M~0 0)) .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16))) [2023-11-06 22:29:10,283 INFO L895 garLoopResultBuilder]: At program point L917(line 917) the Hoare annotation is: (let ((.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse15 (<= 2 ~m_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (<= 2 ~E_M~0)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse8 (= ~m_st~0 0)) (.cse19 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (not (= ~p_dw_pc~0 1))) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse3 .cse4 .cse5 .cse7 .cse19 .cse9 .cse15 .cse10 .cse12 (not (= ~E_M~0 0)) .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16))) [2023-11-06 22:29:10,284 INFO L895 garLoopResultBuilder]: At program point L372(lines 347 387) the Hoare annotation is: (let ((.cse31 (= ~p_dw_st~0 0)) (.cse14 (= ~p_dw_pc~0 1))) (let ((.cse8 (not (= ~m_pc~0 1))) (.cse28 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse26 (<= ~c_dr_pc~0 0)) (.cse30 (not .cse14)) (.cse1 (= ~c_num_read~0 ~p_num_write~0)) (.cse25 (<= 1 ~q_read_ev~0)) (.cse27 (= ~p_num_write~0 0)) (.cse22 (= ~c_num_read~0 0)) (.cse23 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse7 (= ~q_free~0 1)) (.cse13 (<= ~q_req_up~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse20 (= ~q_req_up~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse21 (not .cse31)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse29 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~m_st~0 0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse24 (= ~q_free~0 0)) (.cse11 (<= ~t1_pc~0 0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse15 (= ~q_read_ev~0 2)) (.cse16 (= ~p_dw_i~0 1)) (.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) (and .cse20 .cse0 .cse21 .cse22 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse9 .cse24 .cse11 .cse25 .cse16 (= ~p_num_write~0 1) .cse26 .cse18 .cse19) (and .cse0 .cse21 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19) (and .cse0 .cse27 .cse22 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse28 .cse11 .cse16 .cse17 .cse26 .cse18 .cse19) (and .cse0 .cse21 .cse2 .cse29 .cse3 .cse4 .cse5 .cse6 .cse9 .cse24 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19) (and .cse27 .cse21 .cse22 .cse2 .cse3 .cse5 .cse7 .cse8 .cse10 .cse28 .cse30 (not (= ~E_M~0 0)) .cse17 .cse19) (and .cse0 .cse21 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse27 .cse22 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse28 .cse11 .cse13 .cse31 .cse15 .cse16 .cse17 .cse26 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10 .cse24 .cse11 .cse16 .cse26 .cse18 .cse19) (and .cse0 .cse21 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse30 .cse16 .cse17 .cse18 .cse19) (and .cse20 .cse0 .cse21 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse25 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse21 .cse2 .cse29 .cse3 (not (= ~q_write_ev~0 0)) .cse4 .cse5 .cse6 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19) (and .cse0 .cse27 .cse22 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse20 .cse0 .cse21 .cse2 .cse29 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse24 .cse11 .cse12 .cse14 .cse15 .cse16 .cse18 .cse19)))) [2023-11-06 22:29:10,284 INFO L895 garLoopResultBuilder]: At program point L851-1(lines 832 859) the Hoare annotation is: (let ((.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse15 (<= 2 ~m_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (<= 2 ~E_M~0)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse8 (= ~m_st~0 0)) (.cse19 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (not (= ~p_dw_pc~0 1))) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse3 .cse4 .cse5 .cse7 .cse19 .cse9 .cse15 .cse10 .cse12 (not (= ~E_M~0 0)) .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16))) [2023-11-06 22:29:10,284 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 213) no Hoare annotation was computed. [2023-11-06 22:29:10,285 INFO L895 garLoopResultBuilder]: At program point L422(line 422) the Hoare annotation is: (let ((.cse9 (not (= ~c_dr_st~0 0))) (.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 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~T1_E~0 2)) (.cse7 (= ~m_st~0 0)) (.cse8 (= ~q_free~0 1)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= ~t1_pc~0 0)) (.cse17 (= ~p_dw_st~0 0)) (.cse12 (= ~p_dw_i~0 1)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse15 (= ~token~0 ~local~0)) (.cse16 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 (not .cse17) .cse2 .cse3 .cse4 .cse6 .cse8 (not (= ~m_pc~0 1)) .cse9 .cse10 (not (= ~p_dw_pc~0 1)) (not (= ~E_M~0 0)) .cse13 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 (<= ~q_req_up~0 0) (= ~q_write_ev~0 2) .cse17 (= ~q_read_ev~0 2) .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-11-06 22:29:10,285 INFO L895 garLoopResultBuilder]: At program point L422-1(line 422) the Hoare annotation is: (let ((.cse9 (not (= ~c_dr_st~0 0))) (.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 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~T1_E~0 2)) (.cse7 (= ~m_st~0 0)) (.cse8 (= ~q_free~0 1)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= ~t1_pc~0 0)) (.cse17 (= ~p_dw_st~0 0)) (.cse12 (= ~p_dw_i~0 1)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse15 (= ~token~0 ~local~0)) (.cse16 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 (not .cse17) .cse2 .cse3 .cse4 .cse6 .cse8 (not (= ~m_pc~0 1)) .cse9 .cse10 (not (= ~p_dw_pc~0 1)) (not (= ~E_M~0 0)) .cse13 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 (<= ~q_req_up~0 0) (= ~q_write_ev~0 2) .cse17 (= ~q_read_ev~0 2) .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-11-06 22:29:10,285 INFO L895 garLoopResultBuilder]: At program point L439(line 439) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1))) (let ((.cse18 (= ~c_num_read~0 ~p_num_write~0)) (.cse19 (= ~q_free~0 1)) (.cse7 (<= 2 ~q_write_ev~0)) (.cse21 (not .cse13)) (.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse12 (<= ~q_req_up~0 0)) (.cse14 (= ~q_read_ev~0 2)) (.cse0 (<= 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)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~m_st~0 0)) (.cse8 (not (= ~c_dr_st~0 0))) (.cse9 (= ~q_free~0 0)) (.cse10 (<= ~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 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 .cse20 .cse16 .cse17) (and (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse5 .cse19 (not (= ~m_pc~0 1)) .cse8 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse21 (not (= ~E_M~0 0)) .cse20 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse10 .cse11 .cse21 .cse15 .cse20 .cse16 .cse17) (and .cse0 .cse1 .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse15 (<= ~c_dr_pc~0 0) .cse16 .cse17)))) [2023-11-06 22:29:10,286 INFO L895 garLoopResultBuilder]: At program point L439-1(line 439) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1))) (let ((.cse18 (= ~c_num_read~0 ~p_num_write~0)) (.cse19 (= ~q_free~0 1)) (.cse7 (<= 2 ~q_write_ev~0)) (.cse21 (not .cse13)) (.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse12 (<= ~q_req_up~0 0)) (.cse14 (= ~q_read_ev~0 2)) (.cse0 (<= 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)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~m_st~0 0)) (.cse8 (not (= ~c_dr_st~0 0))) (.cse9 (= ~q_free~0 0)) (.cse10 (<= ~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 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 .cse20 .cse16 .cse17) (and (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse5 .cse19 (not (= ~m_pc~0 1)) .cse8 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse21 (not (= ~E_M~0 0)) .cse20 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse10 .cse11 .cse21 .cse15 .cse20 .cse16 .cse17) (and .cse0 .cse1 .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 (not (= ~q_write_ev~0 0)) .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse15 (<= ~c_dr_pc~0 0) .cse16 .cse17)))) [2023-11-06 22:29:10,286 INFO L895 garLoopResultBuilder]: At program point start_simulation1_returnLabel#1(lines 413 455) the Hoare annotation is: (= ~M_E~0 2) [2023-11-06 22:29:10,286 INFO L895 garLoopResultBuilder]: At program point L918(line 918) the Hoare annotation is: (let ((.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse15 (<= 2 ~m_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (<= 2 ~E_M~0)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse8 (= ~m_st~0 0)) (.cse19 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (not (= ~p_dw_pc~0 1))) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse3 .cse4 .cse5 .cse7 .cse19 .cse9 .cse15 .cse10 .cse12 (not (= ~E_M~0 0)) .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16))) [2023-11-06 22:29:10,287 INFO L895 garLoopResultBuilder]: At program point L885(lines 874 887) the Hoare annotation is: (let ((.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse15 (<= 2 ~m_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (<= 2 ~E_M~0)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse8 (= ~m_st~0 0)) (.cse19 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (not (= ~p_dw_pc~0 1))) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse3 .cse4 .cse5 .cse7 .cse19 .cse9 .cse15 .cse10 .cse12 (not (= ~E_M~0 0)) .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16))) [2023-11-06 22:29:10,287 INFO L895 garLoopResultBuilder]: At program point L687(line 687) the Hoare annotation is: (let ((.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse15 (<= 2 ~m_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (<= 2 ~E_M~0)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse8 (= ~m_st~0 0)) (.cse19 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (not (= ~p_dw_pc~0 1))) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse3 .cse4 .cse5 .cse7 .cse19 .cse9 .cse15 .cse10 .cse12 (not (= ~E_M~0 0)) .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16))) [2023-11-06 22:29:10,287 INFO L895 garLoopResultBuilder]: At program point L423(line 423) the Hoare annotation is: (let ((.cse9 (not (= ~c_dr_st~0 0))) (.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 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~T1_E~0 2)) (.cse7 (= ~m_st~0 0)) (.cse8 (= ~q_free~0 1)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= ~t1_pc~0 0)) (.cse17 (= ~p_dw_st~0 0)) (.cse12 (= ~p_dw_i~0 1)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse15 (= ~token~0 ~local~0)) (.cse16 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 (not .cse17) .cse2 .cse3 .cse4 .cse6 .cse8 (not (= ~m_pc~0 1)) .cse9 .cse10 (not (= ~p_dw_pc~0 1)) (not (= ~E_M~0 0)) .cse13 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 (<= ~q_req_up~0 0) (= ~q_write_ev~0 2) .cse17 (= ~q_read_ev~0 2) .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-11-06 22:29:10,288 INFO L899 garLoopResultBuilder]: For program point L357(lines 347 387) no Hoare annotation was computed. [2023-11-06 22:29:10,288 INFO L899 garLoopResultBuilder]: For program point L836(lines 836 840) no Hoare annotation was computed. [2023-11-06 22:29:10,288 INFO L899 garLoopResultBuilder]: For program point L836-2(lines 835 858) no Hoare annotation was computed. [2023-11-06 22:29:10,288 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse14 (= ~p_dw_pc~0 1))) (let ((.cse8 (not (= ~m_pc~0 1))) (.cse23 (<= 1 ~q_write_ev~0)) (.cse1 (= ~c_num_read~0 ~p_num_write~0)) (.cse7 (= ~q_free~0 1)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse20 (not .cse14)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (<= 2 ~E_1~0)) (.cse19 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~m_st~0 0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse22 (= ~q_free~0 0)) (.cse11 (<= ~t1_pc~0 0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse13 (<= ~q_req_up~0 0)) (.cse24 (= ~q_read_ev~0 2)) (.cse15 (= ~p_dw_i~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse18 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~q_read_ev~0 1) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and (= ~p_num_write~0 0) .cse19 (= ~c_num_read~0 0) .cse2 .cse3 .cse5 .cse7 .cse8 .cse10 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse20 (not (= ~E_M~0 0)) .cse16 .cse18) (and .cse0 .cse19 .cse2 .cse21 .cse3 .cse4 .cse5 .cse6 .cse22 .cse11 .cse12 .cse13 .cse14 .cse23 .cse24 .cse15 .cse17 .cse18) (and .cse0 .cse19 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse23 .cse24 .cse15 .cse17 .cse18) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10 .cse22 .cse11 .cse15 (<= ~c_dr_pc~0 0) .cse17 .cse18) (and .cse0 .cse19 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse20 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse19 .cse2 .cse21 .cse3 (not (= ~q_write_ev~0 0)) .cse4 .cse5 .cse6 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse24 .cse15 .cse17 .cse18)))) [2023-11-06 22:29:10,289 INFO L899 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2023-11-06 22:29:10,289 INFO L895 garLoopResultBuilder]: At program point error2_returnLabel#1(lines 492 499) the Hoare annotation is: false [2023-11-06 22:29:10,289 INFO L899 garLoopResultBuilder]: For program point L936(lines 936 940) no Hoare annotation was computed. [2023-11-06 22:29:10,289 INFO L895 garLoopResultBuilder]: At program point eval2_returnLabel#1(lines 680 730) the Hoare annotation is: (let ((.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse15 (<= 2 ~m_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (<= 2 ~E_M~0)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse8 (= ~m_st~0 0)) (.cse19 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (not (= ~p_dw_pc~0 1))) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse3 .cse4 .cse5 .cse7 .cse19 .cse9 .cse15 .cse10 .cse12 (not (= ~E_M~0 0)) .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16))) [2023-11-06 22:29:10,289 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:29:10,290 INFO L899 garLoopResultBuilder]: For program point L441(line 441) no Hoare annotation was computed. [2023-11-06 22:29:10,290 INFO L899 garLoopResultBuilder]: For program point L177(lines 177 185) no Hoare annotation was computed. [2023-11-06 22:29:10,290 INFO L899 garLoopResultBuilder]: For program point L689(line 689) no Hoare annotation was computed. [2023-11-06 22:29:10,290 INFO L895 garLoopResultBuilder]: At program point init_model1_returnLabel#1(lines 456 472) the Hoare annotation is: (and (<= 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) (= ~T1_E~0 2) (= ~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) (= ~q_write_ev~0 2) (= ~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)) [2023-11-06 22:29:10,291 INFO L895 garLoopResultBuilder]: At program point L904-1(lines 904 941) the Hoare annotation is: (let ((.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse15 (<= 2 ~m_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (<= 2 ~E_M~0)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse8 (= ~m_st~0 0)) (.cse19 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (not (= ~p_dw_pc~0 1))) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse3 .cse4 .cse5 .cse7 .cse19 .cse9 .cse15 .cse10 .cse12 (not (= ~E_M~0 0)) .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16))) [2023-11-06 22:29:10,291 INFO L895 garLoopResultBuilder]: At program point do_read_c_returnLabel#1(lines 173 225) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse12 (= ~p_dw_st~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= ~T1_E~0 2)) (.cse5 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse9 (not (= ~c_dr_st~0 0))) (.cse10 (<= ~t1_pc~0 0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse13 (= ~p_dw_i~0 1)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~token~0 ~local~0)) (.cse16 (= ~M_E~0 2))) (or (and .cse0 (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~q_req_up~0 0) (not (= ~p_dw_pc~0 1)) .cse12 (= ~q_read_ev~0 2) .cse13 .cse14 .cse15 .cse16) (and (= ~q_req_up~0 1) .cse0 (not .cse12) (= ~c_num_read~0 ~p_num_write~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 1 ~q_read_ev~0) .cse13 .cse14 .cse15 .cse16))) [2023-11-06 22:29:10,291 INFO L895 garLoopResultBuilder]: At program point L409(lines 398 411) the Hoare annotation is: (let ((.cse14 (= ~p_dw_pc~0 1))) (let ((.cse8 (not (= ~m_pc~0 1))) (.cse1 (= ~c_num_read~0 ~p_num_write~0)) (.cse7 (= ~q_free~0 1)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse23 (not .cse14)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (<= 2 ~E_1~0)) (.cse20 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse22 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~m_st~0 0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse21 (= ~q_free~0 0)) (.cse11 (<= ~t1_pc~0 0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse13 (<= ~q_req_up~0 0)) (.cse15 (= ~q_read_ev~0 2)) (.cse16 (= ~p_dw_i~0 1)) (.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) (and .cse0 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19) (and .cse0 .cse20 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse9 .cse21 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19) (and (= ~p_num_write~0 0) .cse20 (= ~c_num_read~0 0) .cse2 .cse3 .cse5 .cse7 .cse8 .cse10 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse23 (not (= ~E_M~0 0)) .cse17 .cse19) (and .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10 .cse21 .cse11 .cse16 (<= ~c_dr_pc~0 0) .cse18 .cse19) (and .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse23 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse20 .cse2 .cse22 .cse3 (not (= ~q_write_ev~0 0)) .cse4 .cse5 .cse6 .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19)))) [2023-11-06 22:29:10,292 INFO L899 garLoopResultBuilder]: For program point L921(line 921) no Hoare annotation was computed. [2023-11-06 22:29:10,292 INFO L899 garLoopResultBuilder]: For program point L376(lines 376 383) no Hoare annotation was computed. [2023-11-06 22:29:10,292 INFO L895 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: false [2023-11-06 22:29:10,292 INFO L895 garLoopResultBuilder]: At program point stop_simulation1_returnLabel#1(lines 394 412) the Hoare annotation is: (let ((.cse14 (= ~p_dw_pc~0 1))) (let ((.cse8 (not (= ~m_pc~0 1))) (.cse1 (= ~c_num_read~0 ~p_num_write~0)) (.cse7 (= ~q_free~0 1)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse23 (not .cse14)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (<= 2 ~E_1~0)) (.cse20 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse22 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~m_st~0 0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse21 (= ~q_free~0 0)) (.cse11 (<= ~t1_pc~0 0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse13 (<= ~q_req_up~0 0)) (.cse15 (= ~q_read_ev~0 2)) (.cse16 (= ~p_dw_i~0 1)) (.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) (and .cse0 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19) (and .cse0 .cse20 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse9 .cse21 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19) (and (= ~p_num_write~0 0) .cse20 (= ~c_num_read~0 0) .cse2 .cse3 .cse5 .cse7 .cse8 .cse10 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse23 (not (= ~E_M~0 0)) .cse17 .cse19) (and .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10 .cse21 .cse11 .cse16 (<= ~c_dr_pc~0 0) .cse18 .cse19) (and .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse23 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse20 .cse2 .cse22 .cse3 (not (= ~q_write_ev~0 0)) .cse4 .cse5 .cse6 .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19)))) [2023-11-06 22:29:10,293 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:29:10,293 INFO L899 garLoopResultBuilder]: For program point L905(line 905) no Hoare annotation was computed. [2023-11-06 22:29:10,293 INFO L895 garLoopResultBuilder]: At program point L575-1(lines 575 588) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse4 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse9 (<= 2 ~T1_E~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse14 (not (= ~m_pc~0 1))) (.cse6 (= ~q_free~0 0)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse10 (not (= ~p_dw_pc~0 1))) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 (= (+ ~local~0 1) ~token~0) .cse3 .cse4 .cse5 .cse13 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse13 .cse14 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~token~0 ~local~0)) (and .cse1 .cse2 .cse3 .cse5 .cse14 .cse6 .cse7 .cse8 .cse10 (not (= ~E_M~0 0)) .cse11 .cse12))) [2023-11-06 22:29:10,293 INFO L899 garLoopResultBuilder]: For program point L245(lines 245 249) no Hoare annotation was computed. [2023-11-06 22:29:10,293 INFO L899 garLoopResultBuilder]: For program point L245-2(lines 244 257) no Hoare annotation was computed. [2023-11-06 22:29:10,294 INFO L899 garLoopResultBuilder]: For program point L691(lines 691 695) no Hoare annotation was computed. [2023-11-06 22:29:10,294 INFO L899 garLoopResultBuilder]: For program point L691-1(lines 686 724) no Hoare annotation was computed. [2023-11-06 22:29:10,294 INFO L895 garLoopResultBuilder]: At program point L427-1(lines 427 449) the Hoare annotation is: (let ((.cse28 (= ~p_dw_st~0 0)) (.cse14 (= ~p_dw_pc~0 1))) (let ((.cse8 (not (= ~m_pc~0 1))) (.cse22 (= ~p_num_write~0 0)) (.cse23 (= ~c_num_read~0 0)) (.cse24 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse25 (<= ~c_dr_pc~0 0)) (.cse1 (= ~c_num_read~0 ~p_num_write~0)) (.cse7 (= ~q_free~0 1)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse27 (not .cse14)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (<= 2 ~E_1~0)) (.cse20 (not .cse28)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse26 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~m_st~0 0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse21 (= ~q_free~0 0)) (.cse11 (<= ~t1_pc~0 0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse13 (<= ~q_req_up~0 0)) (.cse15 (= ~q_read_ev~0 2)) (.cse16 (= ~p_dw_i~0 1)) (.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) (and .cse0 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19) (and .cse0 .cse22 .cse23 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse24 .cse11 .cse16 .cse17 .cse25 .cse18 .cse19) (and .cse0 .cse20 .cse2 .cse26 .cse3 .cse4 .cse5 .cse6 .cse9 .cse21 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19) (and .cse22 .cse20 .cse23 .cse2 .cse3 .cse5 .cse7 .cse8 .cse10 .cse24 .cse27 (not (= ~E_M~0 0)) .cse17 .cse19) (and .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse22 .cse23 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse24 .cse11 .cse13 .cse28 .cse15 .cse16 .cse17 .cse25 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10 .cse21 .cse11 .cse16 .cse25 .cse18 .cse19) (and .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse27 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse20 .cse2 .cse26 .cse3 (not (= ~q_write_ev~0 0)) .cse4 .cse5 .cse6 .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19)))) [2023-11-06 22:29:10,294 INFO L899 garLoopResultBuilder]: For program point L361(lines 361 368) no Hoare annotation was computed. [2023-11-06 22:29:10,295 INFO L895 garLoopResultBuilder]: At program point eval1_returnLabel#1(lines 340 393) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1))) (let ((.cse21 (not (= ~m_pc~0 1))) (.cse19 (= ~c_num_read~0 ~p_num_write~0)) (.cse20 (= ~q_free~0 1)) (.cse23 (not .cse13)) (.cse22 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (<= ~q_req_up~0 0)) (.cse18 (= ~q_req_up~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse24 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~m_st~0 0)) (.cse7 (<= 2 ~q_write_ev~0)) (.cse8 (not (= ~c_dr_st~0 0))) (.cse9 (= ~q_free~0 0)) (.cse10 (<= ~t1_pc~0 0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse14 (= ~q_read_ev~0 2)) (.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 .cse18 .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse7 .cse8 .cse10 .cse11 .cse13 (<= 1 ~q_read_ev~0) .cse15 .cse22 .cse16 .cse17) (and (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse5 .cse20 .cse21 .cse8 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse23 (not (= ~E_M~0 0)) .cse22 .cse17) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse15 .cse22 .cse16 .cse17) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse10 .cse11 .cse23 .cse15 .cse22 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse24 .cse3 (not (= ~q_write_ev~0 0)) .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse15 (<= ~c_dr_pc~0 0) .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse24 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2023-11-06 22:29:10,295 INFO L899 garLoopResultBuilder]: For program point L576(line 576) no Hoare annotation was computed. [2023-11-06 22:29:10,295 INFO L899 garLoopResultBuilder]: For program point L444(lines 444 448) no Hoare annotation was computed. [2023-11-06 22:29:10,295 INFO L899 garLoopResultBuilder]: For program point L923(lines 923 932) no Hoare annotation was computed. [2023-11-06 22:29:10,295 INFO L899 garLoopResultBuilder]: For program point L923-2(lines 923 932) no Hoare annotation was computed. [2023-11-06 22:29:10,296 INFO L899 garLoopResultBuilder]: For program point L180(lines 180 184) no Hoare annotation was computed. [2023-11-06 22:29:10,296 INFO L895 garLoopResultBuilder]: At program point L147-1(lines 147 165) the Hoare annotation is: (let ((.cse1 (= ~p_num_write~0 0)) (.cse10 (= ~q_free~0 1)) (.cse20 (<= ~q_req_up~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse21 (<= 1 ~q_read_ev~0)) (.cse15 (<= ~c_dr_pc~0 0)) (.cse24 (= ~q_req_up~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse2 (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 (= ~T1_E~0 2)) (.cse8 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse9 (= ~m_st~0 0)) (.cse11 (not (= ~m_pc~0 1))) (.cse19 (<= 2 ~q_write_ev~0)) (.cse12 (not (= ~c_dr_st~0 0))) (.cse18 (= ~q_free~0 0)) (.cse13 (<= ~t1_pc~0 0)) (.cse22 (= ~c_dr_pc~0 1)) (.cse23 (= ~q_read_ev~0 2)) (.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 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse18 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse13 .cse20 .cse21 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse22 .cse20 .cse23 .cse14 .cse16 .cse17) (and .cse24 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse19 .cse18 .cse13 .cse21 .cse14 (= ~p_num_write~0 1) .cse15 .cse16 .cse17) (and .cse24 .cse0 .cse2 .cse4 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse18 .cse13 .cse22 .cse23 .cse14 .cse16 .cse17))) [2023-11-06 22:29:10,296 INFO L899 garLoopResultBuilder]: For program point L428(line 428) no Hoare annotation was computed. [2023-11-06 22:29:10,296 INFO L899 garLoopResultBuilder]: For program point L841-1(lines 835 858) no Hoare annotation was computed. [2023-11-06 22:29:10,296 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:29:10,297 INFO L902 garLoopResultBuilder]: At program point main2_returnLabel#1(lines 948 959) the Hoare annotation is: true [2023-11-06 22:29:10,297 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 496) no Hoare annotation was computed. [2023-11-06 22:29:10,297 INFO L899 garLoopResultBuilder]: For program point L148(lines 147 165) no Hoare annotation was computed. [2023-11-06 22:29:10,297 INFO L895 garLoopResultBuilder]: At program point L710-1(lines 686 724) the Hoare annotation is: (let ((.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse15 (<= 2 ~m_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (<= 2 ~E_M~0)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse8 (= ~m_st~0 0)) (.cse19 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (not (= ~p_dw_pc~0 1))) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse3 .cse4 .cse5 .cse7 .cse19 .cse9 .cse15 .cse10 .cse12 (not (= ~E_M~0 0)) .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16))) [2023-11-06 22:29:10,298 INFO L895 garLoopResultBuilder]: At program point $Ultimate##101(lines 545 551) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= (+ ~local~0 1) ~token~0) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= 2 ~T1_E~0) (not (= ~p_dw_pc~0 1)) (= ~p_dw_st~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2023-11-06 22:29:10,298 INFO L895 garLoopResultBuilder]: At program point L545-1(lines 531 552) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1)) (.cse13 (<= 2 ~t1_st~0)) (.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 (not (= ~p_dw_pc~0 1))) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~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) (and .cse12 .cse13 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~token~0 ~local~0)) (and .cse12 .cse13 .cse0 .cse1 .cse2 (= (+ ~local~0 1) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2023-11-06 22:29:10,298 INFO L895 garLoopResultBuilder]: At program point L149(lines 149 157) the Hoare annotation is: (let ((.cse17 (<= 2 ~q_write_ev~0)) (.cse0 (<= 2 ~E_1~0)) (.cse15 (= ~p_num_write~0 0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse16 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse7 (= ~m_st~0 0)) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (= ~c_dr_st~0 0))) (.cse10 (<= ~t1_pc~0 0)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (<= ~c_dr_pc~0 0)) (.cse13 (= ~token~0 ~local~0)) (.cse14 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~q_free~0 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse16 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse10 (<= ~q_req_up~0 0) (<= 1 ~q_read_ev~0) .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 (= ~c_num_read~0 ~p_num_write~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse9 .cse10 (= ~c_dr_pc~0 1) (= ~q_read_ev~0 2) .cse11 .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse16 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2023-11-06 22:29:10,299 INFO L899 garLoopResultBuilder]: For program point L496(line 496) no Hoare annotation was computed. [2023-11-06 22:29:10,299 INFO L895 garLoopResultBuilder]: At program point L876(line 876) the Hoare annotation is: (let ((.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse15 (<= 2 ~m_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (<= 2 ~E_M~0)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse8 (= ~m_st~0 0)) (.cse19 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= 2 ~T1_E~0)) (.cse12 (not (= ~p_dw_pc~0 1))) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse15 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse3 .cse4 .cse5 .cse7 .cse19 .cse9 .cse15 .cse10 .cse12 (not (= ~E_M~0 0)) .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16))) [2023-11-06 22:29:10,299 INFO L899 garLoopResultBuilder]: For program point L876-1(line 876) no Hoare annotation was computed. [2023-11-06 22:29:10,300 INFO L895 garLoopResultBuilder]: At program point L348(line 348) the Hoare annotation is: (let ((.cse31 (= ~p_dw_st~0 0)) (.cse14 (= ~p_dw_pc~0 1))) (let ((.cse8 (not (= ~m_pc~0 1))) (.cse28 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse26 (<= ~c_dr_pc~0 0)) (.cse30 (not .cse14)) (.cse1 (= ~c_num_read~0 ~p_num_write~0)) (.cse25 (<= 1 ~q_read_ev~0)) (.cse27 (= ~p_num_write~0 0)) (.cse22 (= ~c_num_read~0 0)) (.cse23 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse7 (= ~q_free~0 1)) (.cse13 (<= ~q_req_up~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse20 (= ~q_req_up~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse21 (not .cse31)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse29 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~m_st~0 0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse24 (= ~q_free~0 0)) (.cse11 (<= ~t1_pc~0 0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse15 (= ~q_read_ev~0 2)) (.cse16 (= ~p_dw_i~0 1)) (.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) (and .cse20 .cse0 .cse21 .cse22 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse9 .cse24 .cse11 .cse25 .cse16 (= ~p_num_write~0 1) .cse26 .cse18 .cse19) (and .cse0 .cse21 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19) (and .cse0 .cse27 .cse22 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse28 .cse11 .cse16 .cse17 .cse26 .cse18 .cse19) (and .cse0 .cse21 .cse2 .cse29 .cse3 .cse4 .cse5 .cse6 .cse9 .cse24 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19) (and .cse27 .cse21 .cse22 .cse2 .cse3 .cse5 .cse7 .cse8 .cse10 .cse28 .cse30 (not (= ~E_M~0 0)) .cse17 .cse19) (and .cse0 .cse21 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse27 .cse22 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse28 .cse11 .cse13 .cse31 .cse15 .cse16 .cse17 .cse26 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10 .cse24 .cse11 .cse16 .cse26 .cse18 .cse19) (and .cse0 .cse21 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse30 .cse16 .cse17 .cse18 .cse19) (and .cse20 .cse0 .cse21 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse25 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse21 .cse2 .cse29 .cse3 (not (= ~q_write_ev~0 0)) .cse4 .cse5 .cse6 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19) (and .cse0 .cse27 .cse22 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse20 .cse0 .cse21 .cse2 .cse29 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse24 .cse11 .cse12 .cse14 .cse15 .cse16 .cse18 .cse19)))) [2023-11-06 22:29:10,300 INFO L895 garLoopResultBuilder]: At program point L216(line 216) the Hoare annotation is: false [2023-11-06 22:29:10,300 INFO L895 garLoopResultBuilder]: At program point L216-1(lines 188 219) the Hoare annotation is: (let ((.cse13 (= ~p_dw_st~0 0))) (let ((.cse8 (= ~q_free~0 1)) (.cse12 (= ~p_dw_pc~0 1)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse20 (= ~q_req_up~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse21 (not .cse13)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~T1_E~0 2)) (.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)) (.cse19 (<= 1 ~q_read_ev~0)) (.cse14 (= ~p_dw_i~0 1)) (.cse16 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0)) (.cse18 (= ~M_E~0 2))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~q_req_up~0 0) (not .cse12) .cse13 (= ~q_read_ev~0 2) .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 (let ((.cse22 (= ~c_num_read~0 ~p_num_write~0))) (or (and .cse20 .cse0 .cse21 .cse22 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse20 .cse0 .cse21 .cse22 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~c_dr_pc~0 1) .cse12 .cse14 .cse15 .cse17 .cse18)))) (and .cse20 .cse0 .cse21 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 (= ~q_free~0 0) .cse11 .cse19 .cse14 (= ~p_num_write~0 1) .cse16 .cse17 .cse18)))) [2023-11-06 22:29:10,301 INFO L899 garLoopResultBuilder]: For program point L646(lines 646 650) no Hoare annotation was computed. [2023-11-06 22:29:10,301 INFO L899 garLoopResultBuilder]: For program point L646-2(lines 645 658) no Hoare annotation was computed. [2023-11-06 22:29:10,301 INFO L895 garLoopResultBuilder]: At program point L84(lines 72 86) the Hoare annotation is: (let ((.cse20 (= ~p_dw_pc~0 1))) (let ((.cse19 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse23 (< ~q_write_ev~0 2)) (.cse0 (= ~c_dr_st~0 0)) (.cse24 (not (= ~q_free~0 0))) (.cse26 (not .cse20)) (.cse22 (not (= ~c_dr_pc~0 1))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse21 (= ~p_dw_st~0 0)) (.cse2 (< 0 ~t1_pc~0)) (.cse3 (not (= ~M_E~0 2))) (.cse18 (< 0 ~q_req_up~0)) (.cse4 (< ~E_M~0 2)) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (not (= ~c_num_read~0 0))) (.cse8 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse10 (not (= ~m_st~0 0))) (.cse11 (< ~E_1~0 2)) (.cse12 (not (= ~p_dw_i~0 1))) (.cse13 (not (= ~q_free~0 1))) (.cse14 (= is_do_write_p_triggered_~__retres1~0 0)) (.cse25 (not (= ~q_read_ev~0 2))) (.cse15 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse16 (< 0 ~c_dr_pc~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 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse19 (and (= ~q_read_ev~0 1) .cse20) .cse21 (and .cse20 .cse14) .cse9 .cse10 .cse22 .cse11 .cse12 .cse13 .cse23 .cse15 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse24 .cse20 .cse21 .cse9 .cse10 .cse11 .cse12 .cse14 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse24 .cse21 .cse9 .cse10 .cse11 .cse12 .cse14 .cse25 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse24 .cse26 .cse21 .cse9 .cse10 .cse22 .cse11 .cse12 .cse14 .cse23 .cse25 .cse17) (or .cse0 .cse1 .cse3 .cse5 .cse6 (= ~E_M~0 0) (= ~m_pc~0 1) .cse7 .cse20 .cse21 .cse8 .cse9 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse19 .cse20 .cse21 .cse9 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse23 .cse15 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse24 .cse26 .cse21 .cse9 .cse10 (= ~q_write_ev~0 0) .cse22 .cse11 .cse12 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse14 .cse25 .cse17) (or .cse1 (not .cse21) .cse2 .cse3 .cse18 .cse4 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse16 .cse17)))) [2023-11-06 22:29:10,301 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 69 87) no Hoare annotation was computed. [2023-11-06 22:29:10,302 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 69 87) no Hoare annotation was computed. [2023-11-06 22:29:10,302 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 79) no Hoare annotation was computed. [2023-11-06 22:29:10,302 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 69 87) the Hoare annotation is: true [2023-11-06 22:29:10,302 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 82) no Hoare annotation was computed. [2023-11-06 22:29:10,302 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 73 82) no Hoare annotation was computed. [2023-11-06 22:29:10,302 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1FINAL(lines 259 278) no Hoare annotation was computed. [2023-11-06 22:29:10,303 INFO L895 garLoopResultBuilder]: At program point L275(lines 262 277) the Hoare annotation is: (let ((.cse25 (= ~p_dw_st~0 0)) (.cse0 (= ~c_dr_st~0 0))) (let ((.cse24 (not .cse0)) (.cse20 (not (= ~q_free~0 0))) (.cse8 (not (= ~p_dw_pc~0 1))) (.cse11 (not (= ~c_dr_pc~0 1))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (not .cse25)) (.cse3 (< 0 ~t1_pc~0)) (.cse4 (not (= ~M_E~0 2))) (.cse5 (< 0 ~q_req_up~0)) (.cse6 (< ~E_M~0 2)) (.cse22 (not (= ~p_num_write~0 0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse23 (not (= ~c_num_read~0 0))) (.cse26 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse10 (not (= ~m_st~0 0))) (.cse12 (< ~E_1~0 2)) (.cse13 (not (= ~p_dw_i~0 1))) (.cse14 (not (= ~q_free~0 1))) (.cse15 (<= 1 exists_runnable_thread1_~__retres1~2)) (.cse16 (< ~q_write_ev~0 2)) (.cse17 (not (= ~q_read_ev~0 2))) (.cse18 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse21 (< 0 ~c_dr_pc~0)) (.cse19 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~c_num_read~0 ~p_num_write~0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse20 .cse9 .cse10 .cse12 .cse13 .cse15 .cse21 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse22 .cse7 .cse23 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse1 .cse3 .cse4 (not (= ~p_num_write~0 1)) (not (= ~q_req_up~0 1)) .cse24 .cse6 .cse7 .cse23 .cse20 .cse25 (< ~q_read_ev~0 1) .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse21 .cse19) (or .cse1 .cse3 .cse4 .cse5 .cse24 .cse6 .cse7 .cse20 .cse8 .cse25 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse15 .cse16 .cse17 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse22 .cse7 .cse23 .cse26 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse18 .cse21 .cse19) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse22 .cse7 .cse23 .cse26 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse21 .cse19)))) [2023-11-06 22:29:10,303 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 272) no Hoare annotation was computed. [2023-11-06 22:29:10,303 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 259 278) the Hoare annotation is: true [2023-11-06 22:29:10,303 INFO L899 garLoopResultBuilder]: For program point L263(lines 263 273) no Hoare annotation was computed. [2023-11-06 22:29:10,304 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 259 278) no Hoare annotation was computed. [2023-11-06 22:29:10,304 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 24 31) the Hoare annotation is: true [2023-11-06 22:29:10,304 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 28) no Hoare annotation was computed. [2023-11-06 22:29:10,304 INFO L899 garLoopResultBuilder]: For program point error1FINAL(lines 24 31) no Hoare annotation was computed. [2023-11-06 22:29:10,304 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 24 31) no Hoare annotation was computed. [2023-11-06 22:29:10,304 INFO L899 garLoopResultBuilder]: For program point L668(lines 668 673) no Hoare annotation was computed. [2023-11-06 22:29:10,305 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2FINAL(lines 660 679) no Hoare annotation was computed. [2023-11-06 22:29:10,305 INFO L899 garLoopResultBuilder]: For program point L664(lines 664 674) no Hoare annotation was computed. [2023-11-06 22:29:10,305 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 660 679) the Hoare annotation is: true [2023-11-06 22:29:10,305 INFO L902 garLoopResultBuilder]: At program point L676(lines 663 678) the Hoare annotation is: true [2023-11-06 22:29:10,305 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 660 679) no Hoare annotation was computed. [2023-11-06 22:29:10,305 INFO L899 garLoopResultBuilder]: For program point L306-1(lines 297 314) no Hoare annotation was computed. [2023-11-06 22:29:10,306 INFO L899 garLoopResultBuilder]: For program point L301-1(lines 300 313) no Hoare annotation was computed. [2023-11-06 22:29:10,306 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 297 314) the Hoare annotation is: (let ((.cse30 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse26 (= ~q_read_ev~0 2)) (.cse31 (= ~p_dw_pc~0 1))) (let ((.cse2 (< |old(~q_write_ev~0)| 1)) (.cse25 (< 0 ~c_dr_pc~0)) (.cse4 (< 0 ~q_req_up~0)) (.cse8 (not (= ~q_free~0 0))) (.cse9 (not .cse31)) (.cse13 (not (= |old(~q_read_ev~0)| 2))) (.cse17 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse27 (and .cse30 .cse26)) (.cse1 (< 0 ~t1_pc~0)) (.cse28 (< |old(~q_write_ev~0)| 2)) (.cse5 (< ~E_M~0 2)) (.cse29 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse12 (not (= ~m_st~0 0))) (.cse14 (not (= ~c_dr_pc~0 1))) (.cse15 (< ~E_1~0 2)) (.cse16 (not (= ~p_dw_i~0 1))) (.cse18 (not (= ~token~0 ~local~0))) (.cse19 (= ~c_dr_st~0 0)) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse3 (not (= ~M_E~0 2))) (.cse20 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (and .cse30 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse21 (not (= ~c_num_read~0 0))) (.cse10 (= ~p_dw_st~0 0)) (.cse22 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse11 (not (= ~T1_E~0 ~M_E~0))) (.cse23 (not (= ~q_free~0 1))) (.cse24 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse19 .cse0 .cse1 .cse3 .cse5 .cse20 .cse6 .cse7 .cse21 .cse22 .cse11 .cse12 .cse15 .cse16 .cse23 .cse24 .cse25 .cse18) (or .cse0 (not .cse10) .cse1 .cse3 .cse4 (and (= ~q_write_ev~0 2) .cse26) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse5 .cse20 .cse6 .cse21 .cse22 .cse11 .cse12 .cse13 .cse15 .cse16 .cse23 .cse24 .cse25 .cse18) (or .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse18) (or .cse19 .cse0 .cse1 .cse28 .cse3 .cse4 .cse5 .cse6 .cse7 .cse29 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse23 .cse24 .cse18) (or .cse19 .cse0 .cse1 (and (= ~q_read_ev~0 1) .cse30) .cse28 .cse3 .cse4 .cse5 .cse6 .cse9 .cse29 .cse11 .cse12 (not (= |old(~q_read_ev~0)| 1)) .cse14 .cse15 .cse16 .cse23 .cse24 .cse18) (or .cse19 .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse15 .cse16 .cse25 .cse18) (or .cse19 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= |old(~q_write_ev~0)| 0) .cse17 .cse27 .cse18) (or .cse19 .cse0 .cse1 .cse28 .cse3 .cse5 .cse6 .cse7 .cse29 .cse31 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse23 .cse24 .cse18) (or .cse19 .cse0 .cse3 .cse20 .cse6 (= ~E_M~0 0) (= ~m_pc~0 1) .cse7 .cse21 .cse31 .cse10 .cse22 .cse11 .cse23 .cse24)))) [2023-11-06 22:29:10,306 INFO L899 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 297 314) no Hoare annotation was computed. [2023-11-06 22:29:10,307 INFO L899 garLoopResultBuilder]: For program point L768-1(lines 762 785) no Hoare annotation was computed. [2023-11-06 22:29:10,307 INFO L899 garLoopResultBuilder]: For program point L763-1(lines 762 785) no Hoare annotation was computed. [2023-11-06 22:29:10,307 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 759 786) no Hoare annotation was computed. [2023-11-06 22:29:10,307 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 759 786) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (< 0 ~t1_pc~0)) (.cse17 (< ~t1_st~0 2)) (.cse13 (not (= ~m_st~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse18 (< ~m_st~0 2)) (.cse19 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse4 (not (= ~p_num_write~0 0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (= ~c_num_read~0 0))) (.cse7 (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)|))) (.cse8 (not (= ~q_free~0 0))) (.cse9 (< |old(~E_1~0)| 2)) (.cse10 (= ~p_dw_pc~0 1)) (.cse11 (< |old(~E_M~0)| 2)) (.cse12 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse15 (< |old(~T1_E~0)| 2)) (.cse16 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse1 .cse2 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15) (or .cse17 .cse1 .cse19 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (and (<= 1 ~m_pc~0) (< ~m_pc~0 2)) .cse16) (or .cse1 (= |old(~E_M~0)| 0) .cse18 .cse3 .cse4 .cse5 (= ~m_pc~0 1) .cse6 .cse7 .cse8 .cse10 .cse12 .cse14) (or .cse17 .cse1 .cse18 .cse19 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15) (or .cse17 .cse1 .cse19 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= (+ ~local~0 1) ~token~0)) .cse14 .cse15) (or .cse1 .cse18 .cse19 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16))) [2023-11-06 22:29:10,308 INFO L899 garLoopResultBuilder]: For program point L778-1(lines 759 786) no Hoare annotation was computed. [2023-11-06 22:29:10,308 INFO L899 garLoopResultBuilder]: For program point L773-1(lines 762 785) no Hoare annotation was computed. [2023-11-06 22:29:10,312 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:29:10,314 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:29:10,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:29:10 BoogieIcfgContainer [2023-11-06 22:29:10,581 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:29:10,582 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:29:10,582 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:29:10,582 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:29:10,583 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:25:38" (3/4) ... [2023-11-06 22:29:10,585 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:29:10,590 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2023-11-06 22:29:10,590 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2023-11-06 22:29:10,591 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2023-11-06 22:29:10,591 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2023-11-06 22:29:10,591 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2023-11-06 22:29:10,591 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2023-11-06 22:29:10,591 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2023-11-06 22:29:10,591 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2023-11-06 22:29:10,592 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2023-11-06 22:29:10,592 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2023-11-06 22:29:10,592 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2023-11-06 22:29:10,592 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2023-11-06 22:29:10,593 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2023-11-06 22:29:10,593 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2023-11-06 22:29:10,619 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2023-11-06 22:29:10,620 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:29:10,622 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:29:10,623 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:29:10,667 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((c_dr_st == 0) || ((q_req_up <= 0) && (q_read_ev == 2))) || !((m_pc == t1_pc))) || (0 < t1_pc)) || (\old(q_write_ev) < 2)) || !((M_E == 2))) || !((\old(q_req_up) == 1))) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !((p_dw_pc == 1))) || (p_dw_st == 0)) || !((T1_E == M_E))) || !((m_st == 0))) || !((\old(q_read_ev) == 2))) || !((c_dr_pc == 1))) || (E_1 < 2)) || !((p_dw_i == 1))) || !(((c_num_read + 1) == p_num_write))) || !((token == local))) && ((((((((((((((((((((c_dr_st == 0) || (\old(q_read_ev) < 1)) || !((m_pc == t1_pc))) || (0 < t1_pc)) || (\old(q_write_ev) < 2)) || !((M_E == 2))) || !((\old(q_req_up) == 1))) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((c_num_read == p_num_write))) || (p_dw_st == 0)) || !((T1_E == M_E))) || !((m_st == 0))) || !((c_dr_pc == 1))) || (E_1 < 2)) || ((q_req_up <= 0) && (q_write_ev == \old(q_write_ev)))) || !((p_dw_i == 1))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || !((token == local)))) && (((((((((((((((((((0 < \old(q_req_up)) || (c_dr_st == 0)) || !((m_pc == t1_pc))) || (0 < t1_pc)) || (\old(q_write_ev) < 2)) || !((M_E == 2))) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((p_dw_pc == 1))) || !((c_num_read == p_num_write))) || (p_dw_st == 0)) || !((T1_E == M_E))) || !((m_st == 0))) || !((c_dr_pc == 1))) || (E_1 < 2)) || !((p_dw_i == 1))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || !((token == local)))) && (((((((((((((((c_dr_st == 0) || !((m_pc == t1_pc))) || (0 < t1_pc)) || !((M_E == 2))) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || (p_dw_st == 0)) || (\old(q_read_ev) == q_read_ev)) || !((T1_E == M_E))) || !((m_st == 0))) || (E_1 < 2)) || !((p_dw_i == 1))) || (0 < c_dr_pc)) || !((token == local)))) && ((((((((((((((((((((0 < \old(q_req_up)) || !((m_pc == t1_pc))) || !((p_dw_st == 0))) || (0 < t1_pc)) || !((M_E == 2))) || !((\old(q_read_ev) == \old(q_write_ev)))) || (E_M < 2)) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((c_dr_pc == p_dw_pc))) || !((T1_E == M_E))) || !((m_st == 0))) || !((\old(q_read_ev) == 2))) || (E_1 < 2)) || !((p_dw_i == 1))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || (0 < c_dr_pc)) || !((token == local)))) && (((((((((((((((((((0 < \old(q_req_up)) || (c_dr_st == 0)) || !((m_pc == t1_pc))) || (0 < t1_pc)) || !((M_E == 2))) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !((p_dw_pc == 1))) || (p_dw_st == 0)) || !((T1_E == M_E))) || !((m_st == 0))) || !((\old(q_read_ev) == 2))) || !((c_dr_pc == 1))) || (E_1 < 2)) || !((p_dw_i == 1))) || (\old(q_write_ev) == 0)) || !(((c_num_read + 1) == p_num_write))) || !((token == local)))) && ((((((((((((((((((0 < \old(q_req_up)) || (c_dr_st == 0)) || !((m_pc == t1_pc))) || (0 < t1_pc)) || (\old(q_write_ev) < 2)) || !((M_E == 2))) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !((p_dw_pc == 1))) || (p_dw_st == 0)) || !((T1_E == M_E))) || !((m_st == 0))) || !((\old(q_read_ev) == 2))) || !((c_dr_pc == 1))) || (E_1 < 2)) || !((p_dw_i == 1))) || !((token == local)))) && (((((((((((((((((((c_dr_st == 0) || !((m_pc == t1_pc))) || (0 < t1_pc)) || (\old(q_write_ev) < 2)) || !((M_E == 2))) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((c_num_read == p_num_write))) || (p_dw_pc == 1)) || (q_write_ev == \old(q_write_ev))) || (p_dw_st == 0)) || !((T1_E == M_E))) || !((m_st == 0))) || !((c_dr_pc == 1))) || (E_1 < 2)) || !((p_dw_i == 1))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || !((token == local)))) [2023-11-06 22:29:10,668 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((T1_E < 2) || !((m_pc == t1_pc))) || !((p_dw_st == 0))) || (0 < t1_pc)) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || (((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st)))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write))) && ((((((((((((!((p_dw_st == 0)) || !((q_write_ev == q_read_ev))) || (((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st)))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || (E_M == 0)) || (m_pc == 1)) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write)))) && (((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || (((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st)))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write))) || !((token == local)))) && (((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (0 < t1_pc)) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || (((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st)))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write)))) && (((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (((\old(t1_st) == t1_st) && (m_st == \old(m_st))) && (E_M <= 1))) || !((t1_pc == 1))) || !((q_write_ev == q_read_ev))) || (((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st)))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || (E_M == 0)) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !(((local + 1) == token))) || !((c_last_read == p_last_write)))) && ((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || (((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st)))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write)))) && ((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || (((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st)))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || !((token == local)))) && (((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((\old(m_st) == 0))) || (E_1 < 2)) || (((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == 0))) || !(((local + 1) == token))) || !((c_last_read == p_last_write)))) [2023-11-06 22:29:10,669 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || ((((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st))) && (\result == 0))) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || !((token == local))) && ((((((((((((!((p_dw_st == 0)) || ((((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st))) && (\result == 0))) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || (E_M == 0)) || (m_pc == 1)) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write)))) && (((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || ((((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st))) && (\result == 0))) || (((\old(t1_st) == t1_st) && (m_st == \old(m_st))) && (E_M <= 1))) || !((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))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !(((local + 1) == token))) || !((c_last_read == p_last_write)))) && (((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (0 < t1_pc)) || ((((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st))) && (\result == 0))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write)))) && ((((((((((((((T1_E < 2) || !((m_pc == t1_pc))) || !((p_dw_st == 0))) || (0 < t1_pc)) || ((((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st))) && (\result == 0))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write)))) && (((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || ((((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == 0)) && (\result == 0))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((\old(m_st) == 0))) || (E_1 < 2)) || !(((local + 1) == token))) || !((c_last_read == p_last_write)))) && (((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || ((((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st))) && (\result == 0))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write))) || !((token == local)))) && ((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || ((((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st))) && (\result == 0))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write)))) [2023-11-06 22:29:10,680 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (0 < t1_pc)) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || ((2 <= m_st) && (__retres1 == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (m_st == \old(m_st))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) && ((((((((((((((((T1_E < 2) || (2 <= t1_st)) || !((p_dw_st == 0))) || (0 < t1_pc)) || (\old(t1_st) < 2)) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write)))) && (((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (\old(t1_st) < 2)) || (((\old(t1_st) == t1_st) && (m_st == 0)) && (__retres1 == 0))) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((\old(m_st) == 0))) || (E_1 < 2)) || !(((local + 1) == token))) || !((c_last_read == p_last_write)))) && (((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (((\old(t1_st) == t1_st) && (m_st == \old(m_st))) && (__retres1 == 0))) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (m_st == \old(m_st))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || !((token == local)))) && ((((((((((((!((p_dw_st == 0)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || (E_M == 0)) || (m_pc == 1)) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (m_st == \old(m_st))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write)))) && ((((((((((((((T1_E < 2) || !((m_pc == t1_pc))) || !((p_dw_st == 0))) || (0 < t1_pc)) || (((\old(t1_st) == t1_st) && (m_st == \old(m_st))) && (__retres1 == 0))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write)))) && ((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (0 < t1_pc)) || !((M_E == 2))) || (\old(t1_st) < 2)) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || ((T1_E == 2) && (M_E == 2))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || (__retres1 == 0))) && ((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || ((\old(t1_st) == t1_st) && (m_st == \old(m_st)))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write))) || ((2 <= t1_st) && (__retres1 == 0))) || !((token == local)))) && ((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || !((M_E == 2))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || ((T1_E == 2) && (M_E == 2))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || (__retres1 == 0))) && (((((((((((((((((T1_E < 2) || (((2 <= t1_st) && (2 <= m_st)) && (__retres1 == 0))) || !((p_dw_st == 0))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (m_st == \old(m_st))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write)))) && ((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || ((\old(t1_st) == t1_st) && (m_st == \old(m_st)))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || (m_pc == 1)) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write))) || !((token == local)))) && ((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || !((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 <= m_st) && (__retres1 == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !(((local + 1) == token))) || !((c_last_read == p_last_write))) || (((m_st == 0) && (E_M <= 1)) && (__retres1 == 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_pc == 1))) && (m_st == \old(m_st))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write)))) && ((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((\old(m_st) == 0))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || ((1 <= m_pc) && (m_pc < 2))) || (__retres1 == 0)) || !((token == local)))) [2023-11-06 22:29:10,680 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || ((\old(t1_st) == t1_st) && (m_st == \old(m_st)))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || (((2 <= t1_st) && (\result == 0)) && (__retres1 == 0))) || !((c_last_read == p_last_write))) || !((token == local))) && ((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || ((\result == 0) && (__retres1 == 0))) || !((c_dr_pc == p_dw_pc))) || !((\old(m_st) == 0))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || ((1 <= m_pc) && (m_pc < 2))) || !((token == local)))) && ((((((((((((((((T1_E < 2) || (2 <= t1_st)) || !((p_dw_st == 0))) || (0 < t1_pc)) || (\old(t1_st) < 2)) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write)))) && (((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (\old(t1_st) < 2)) || ((((\result == 0) && (\old(t1_st) == t1_st)) && (m_st == 0)) && (__retres1 == 0))) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((\old(m_st) == 0))) || (E_1 < 2)) || !(((local + 1) == token))) || !((c_last_read == p_last_write)))) && ((((((((((((!((p_dw_st == 0)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || (E_M == 0)) || (m_pc == 1)) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (m_st == \old(m_st))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write)))) && (((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || ((((\result == 0) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st))) && (__retres1 == 0))) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (m_st == \old(m_st))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || !((token == local)))) && ((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (0 < t1_pc)) || !((M_E == 2))) || (\old(t1_st) < 2)) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || ((T1_E == 2) && (M_E == 2))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || ((\result == 0) && (__retres1 == 0))) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write)))) && ((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (0 < t1_pc)) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (((\result == 0) && (2 <= m_st)) && (__retres1 == 0))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (m_st == \old(m_st))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write)))) && ((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || !((M_E == 2))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || ((T1_E == 2) && (M_E == 2))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || ((\result == 0) && (__retres1 == 0))) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write)))) && ((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || ((\old(t1_st) == t1_st) && (m_st == \old(m_st)))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || (m_pc == 1)) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write))) || !((token == local)))) && ((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || !((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))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (((\result == 0) && (2 <= m_st)) && (__retres1 == 0))) || (E_1 < 2)) || ((((\result == 0) && (m_st == 0)) && (E_M <= 1)) && (__retres1 == 0))) || !(((local + 1) == token))) || !((c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (m_st == \old(m_st))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write)))) && ((((((((((((((T1_E < 2) || !((m_pc == t1_pc))) || !((p_dw_st == 0))) || (0 < t1_pc)) || ((((\result == 0) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st))) && (__retres1 == 0))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write)))) && (((((((((((((((((T1_E < 2) || ((((2 <= t1_st) && (\result == 0)) && (2 <= m_st)) && (__retres1 == 0))) || !((p_dw_st == 0))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (m_st == \old(m_st))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write)))) [2023-11-06 22:29:10,804 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((c_dr_st == 0) || ((q_req_up <= 0) && (q_read_ev == 2))) || !((m_pc == t1_pc))) || (0 < t1_pc)) || (\old(q_write_ev) < 2)) || !((M_E == 2))) || !((\old(q_req_up) == 1))) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !((p_dw_pc == 1))) || (p_dw_st == 0)) || !((T1_E == M_E))) || !((m_st == 0))) || !((\old(q_read_ev) == 2))) || !((c_dr_pc == 1))) || (E_1 < 2)) || !((p_dw_i == 1))) || !(((c_num_read + 1) == p_num_write))) || !((token == local))) && ((((((((((((((((((((c_dr_st == 0) || (\old(q_read_ev) < 1)) || !((m_pc == t1_pc))) || (0 < t1_pc)) || (\old(q_write_ev) < 2)) || !((M_E == 2))) || !((\old(q_req_up) == 1))) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((c_num_read == p_num_write))) || (p_dw_st == 0)) || !((T1_E == M_E))) || !((m_st == 0))) || !((c_dr_pc == 1))) || (E_1 < 2)) || ((q_req_up <= 0) && (q_write_ev == \old(q_write_ev)))) || !((p_dw_i == 1))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || !((token == local)))) && (((((((((((((((((((0 < \old(q_req_up)) || (c_dr_st == 0)) || !((m_pc == t1_pc))) || (0 < t1_pc)) || (\old(q_write_ev) < 2)) || !((M_E == 2))) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((p_dw_pc == 1))) || !((c_num_read == p_num_write))) || (p_dw_st == 0)) || !((T1_E == M_E))) || !((m_st == 0))) || !((c_dr_pc == 1))) || (E_1 < 2)) || !((p_dw_i == 1))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || !((token == local)))) && (((((((((((((((c_dr_st == 0) || !((m_pc == t1_pc))) || (0 < t1_pc)) || !((M_E == 2))) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || (p_dw_st == 0)) || (\old(q_read_ev) == q_read_ev)) || !((T1_E == M_E))) || !((m_st == 0))) || (E_1 < 2)) || !((p_dw_i == 1))) || (0 < c_dr_pc)) || !((token == local)))) && ((((((((((((((((((((0 < \old(q_req_up)) || !((m_pc == t1_pc))) || !((p_dw_st == 0))) || (0 < t1_pc)) || !((M_E == 2))) || !((\old(q_read_ev) == \old(q_write_ev)))) || (E_M < 2)) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((c_dr_pc == p_dw_pc))) || !((T1_E == M_E))) || !((m_st == 0))) || !((\old(q_read_ev) == 2))) || (E_1 < 2)) || !((p_dw_i == 1))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || (0 < c_dr_pc)) || !((token == local)))) && (((((((((((((((((((0 < \old(q_req_up)) || (c_dr_st == 0)) || !((m_pc == t1_pc))) || (0 < t1_pc)) || !((M_E == 2))) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !((p_dw_pc == 1))) || (p_dw_st == 0)) || !((T1_E == M_E))) || !((m_st == 0))) || !((\old(q_read_ev) == 2))) || !((c_dr_pc == 1))) || (E_1 < 2)) || !((p_dw_i == 1))) || (\old(q_write_ev) == 0)) || !(((c_num_read + 1) == p_num_write))) || !((token == local)))) && ((((((((((((((((((0 < \old(q_req_up)) || (c_dr_st == 0)) || !((m_pc == t1_pc))) || (0 < t1_pc)) || (\old(q_write_ev) < 2)) || !((M_E == 2))) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !((p_dw_pc == 1))) || (p_dw_st == 0)) || !((T1_E == M_E))) || !((m_st == 0))) || !((\old(q_read_ev) == 2))) || !((c_dr_pc == 1))) || (E_1 < 2)) || !((p_dw_i == 1))) || !((token == local)))) && (((((((((((((((((((c_dr_st == 0) || !((m_pc == t1_pc))) || (0 < t1_pc)) || (\old(q_write_ev) < 2)) || !((M_E == 2))) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((c_num_read == p_num_write))) || (p_dw_pc == 1)) || (q_write_ev == \old(q_write_ev))) || (p_dw_st == 0)) || !((T1_E == M_E))) || !((m_st == 0))) || !((c_dr_pc == 1))) || (E_1 < 2)) || !((p_dw_i == 1))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || !((token == local)))) [2023-11-06 22:29:10,805 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((T1_E < 2) || !((m_pc == t1_pc))) || !((p_dw_st == 0))) || (0 < t1_pc)) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || (((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st)))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write))) && ((((((((((((!((p_dw_st == 0)) || !((q_write_ev == q_read_ev))) || (((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st)))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || (E_M == 0)) || (m_pc == 1)) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write)))) && (((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || (((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st)))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write))) || !((token == local)))) && (((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (0 < t1_pc)) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || (((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st)))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write)))) && (((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (((\old(t1_st) == t1_st) && (m_st == \old(m_st))) && (E_M <= 1))) || !((t1_pc == 1))) || !((q_write_ev == q_read_ev))) || (((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st)))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || (E_M == 0)) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !(((local + 1) == token))) || !((c_last_read == p_last_write)))) && ((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || (((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st)))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write)))) && ((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || (((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st)))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || !((token == local)))) && (((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((\old(m_st) == 0))) || (E_1 < 2)) || (((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == 0))) || !(((local + 1) == token))) || !((c_last_read == p_last_write)))) [2023-11-06 22:29:10,805 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || ((((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st))) && (\result == 0))) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || !((token == local))) && ((((((((((((!((p_dw_st == 0)) || ((((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st))) && (\result == 0))) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || (E_M == 0)) || (m_pc == 1)) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write)))) && (((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || ((((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st))) && (\result == 0))) || (((\old(t1_st) == t1_st) && (m_st == \old(m_st))) && (E_M <= 1))) || !((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))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !(((local + 1) == token))) || !((c_last_read == p_last_write)))) && (((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (0 < t1_pc)) || ((((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st))) && (\result == 0))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write)))) && ((((((((((((((T1_E < 2) || !((m_pc == t1_pc))) || !((p_dw_st == 0))) || (0 < t1_pc)) || ((((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st))) && (\result == 0))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write)))) && (((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || ((((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == 0)) && (\result == 0))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((\old(m_st) == 0))) || (E_1 < 2)) || !(((local + 1) == token))) || !((c_last_read == p_last_write)))) && (((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || ((((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st))) && (\result == 0))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write))) || !((token == local)))) && ((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || ((((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st))) && (\result == 0))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write)))) [2023-11-06 22:29:10,813 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (0 < t1_pc)) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || ((2 <= m_st) && (__retres1 == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (m_st == \old(m_st))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) && ((((((((((((((((T1_E < 2) || (2 <= t1_st)) || !((p_dw_st == 0))) || (0 < t1_pc)) || (\old(t1_st) < 2)) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write)))) && (((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (\old(t1_st) < 2)) || (((\old(t1_st) == t1_st) && (m_st == 0)) && (__retres1 == 0))) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((\old(m_st) == 0))) || (E_1 < 2)) || !(((local + 1) == token))) || !((c_last_read == p_last_write)))) && (((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (((\old(t1_st) == t1_st) && (m_st == \old(m_st))) && (__retres1 == 0))) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (m_st == \old(m_st))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || !((token == local)))) && ((((((((((((!((p_dw_st == 0)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || (E_M == 0)) || (m_pc == 1)) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (m_st == \old(m_st))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write)))) && ((((((((((((((T1_E < 2) || !((m_pc == t1_pc))) || !((p_dw_st == 0))) || (0 < t1_pc)) || (((\old(t1_st) == t1_st) && (m_st == \old(m_st))) && (__retres1 == 0))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write)))) && ((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (0 < t1_pc)) || !((M_E == 2))) || (\old(t1_st) < 2)) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || ((T1_E == 2) && (M_E == 2))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || (__retres1 == 0))) && ((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || ((\old(t1_st) == t1_st) && (m_st == \old(m_st)))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write))) || ((2 <= t1_st) && (__retres1 == 0))) || !((token == local)))) && ((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || !((M_E == 2))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || ((T1_E == 2) && (M_E == 2))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || (__retres1 == 0))) && (((((((((((((((((T1_E < 2) || (((2 <= t1_st) && (2 <= m_st)) && (__retres1 == 0))) || !((p_dw_st == 0))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (m_st == \old(m_st))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write)))) && ((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || ((\old(t1_st) == t1_st) && (m_st == \old(m_st)))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || (m_pc == 1)) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write))) || !((token == local)))) && ((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || !((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 <= m_st) && (__retres1 == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !(((local + 1) == token))) || !((c_last_read == p_last_write))) || (((m_st == 0) && (E_M <= 1)) && (__retres1 == 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_pc == 1))) && (m_st == \old(m_st))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write)))) && ((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((\old(m_st) == 0))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || ((1 <= m_pc) && (m_pc < 2))) || (__retres1 == 0)) || !((token == local)))) [2023-11-06 22:29:10,814 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || ((\old(t1_st) == t1_st) && (m_st == \old(m_st)))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || (((2 <= t1_st) && (\result == 0)) && (__retres1 == 0))) || !((c_last_read == p_last_write))) || !((token == local))) && ((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || ((\result == 0) && (__retres1 == 0))) || !((c_dr_pc == p_dw_pc))) || !((\old(m_st) == 0))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || ((1 <= m_pc) && (m_pc < 2))) || !((token == local)))) && ((((((((((((((((T1_E < 2) || (2 <= t1_st)) || !((p_dw_st == 0))) || (0 < t1_pc)) || (\old(t1_st) < 2)) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write)))) && (((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (\old(t1_st) < 2)) || ((((\result == 0) && (\old(t1_st) == t1_st)) && (m_st == 0)) && (__retres1 == 0))) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((\old(m_st) == 0))) || (E_1 < 2)) || !(((local + 1) == token))) || !((c_last_read == p_last_write)))) && ((((((((((((!((p_dw_st == 0)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || (E_M == 0)) || (m_pc == 1)) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (m_st == \old(m_st))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write)))) && (((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || ((((\result == 0) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st))) && (__retres1 == 0))) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (m_st == \old(m_st))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || !((token == local)))) && ((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (0 < t1_pc)) || !((M_E == 2))) || (\old(t1_st) < 2)) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || ((T1_E == 2) && (M_E == 2))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || ((\result == 0) && (__retres1 == 0))) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write)))) && ((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (0 < t1_pc)) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (((\result == 0) && (2 <= m_st)) && (__retres1 == 0))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (m_st == \old(m_st))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write)))) && ((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || !((M_E == 2))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || ((T1_E == 2) && (M_E == 2))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || ((\result == 0) && (__retres1 == 0))) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write)))) && ((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || ((\old(t1_st) == t1_st) && (m_st == \old(m_st)))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || (m_pc == 1)) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write))) || !((token == local)))) && ((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || !((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))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (((\result == 0) && (2 <= m_st)) && (__retres1 == 0))) || (E_1 < 2)) || ((((\result == 0) && (m_st == 0)) && (E_M <= 1)) && (__retres1 == 0))) || !(((local + 1) == token))) || !((c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (m_st == \old(m_st))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write)))) && ((((((((((((((T1_E < 2) || !((m_pc == t1_pc))) || !((p_dw_st == 0))) || (0 < t1_pc)) || ((((\result == 0) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st))) && (__retres1 == 0))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write)))) && (((((((((((((((((T1_E < 2) || ((((2 <= t1_st) && (\result == 0)) && (2 <= m_st)) && (__retres1 == 0))) || !((p_dw_st == 0))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (m_st == \old(m_st))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write)))) [2023-11-06 22:29:10,884 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:29:10,885 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:29:10,886 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:29:10,891 INFO L158 Benchmark]: Toolchain (without parser) took 213565.78ms. Allocated memory was 113.2MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 80.8MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 188.8MB. Max. memory is 16.1GB. [2023-11-06 22:29:10,891 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 113.2MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:29:10,892 INFO L158 Benchmark]: CACSL2BoogieTranslator took 507.18ms. Allocated memory is still 113.2MB. Free memory was 80.5MB in the beginning and 63.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 22:29:10,894 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.41ms. Allocated memory is still 113.2MB. Free memory was 63.7MB in the beginning and 60.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:29:10,896 INFO L158 Benchmark]: Boogie Preprocessor took 53.72ms. Allocated memory is still 113.2MB. Free memory was 60.9MB in the beginning and 58.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:29:10,896 INFO L158 Benchmark]: RCFGBuilder took 938.45ms. Allocated memory was 113.2MB in the beginning and 157.3MB in the end (delta: 44.0MB). Free memory was 58.5MB in the beginning and 113.3MB in the end (delta: -54.8MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2023-11-06 22:29:10,897 INFO L158 Benchmark]: TraceAbstraction took 211674.64ms. Allocated memory was 157.3MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 112.8MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2023-11-06 22:29:10,900 INFO L158 Benchmark]: Witness Printer took 304.22ms. Allocated memory is still 4.0GB. Free memory was 3.8GB in the beginning and 3.8GB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-06 22:29:10,902 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 113.2MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 507.18ms. Allocated memory is still 113.2MB. Free memory was 80.5MB in the beginning and 63.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.41ms. Allocated memory is still 113.2MB. Free memory was 63.7MB in the beginning and 60.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.72ms. Allocated memory is still 113.2MB. Free memory was 60.9MB in the beginning and 58.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 938.45ms. Allocated memory was 113.2MB in the beginning and 157.3MB in the end (delta: 44.0MB). Free memory was 58.5MB in the beginning and 113.3MB in the end (delta: -54.8MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. * TraceAbstraction took 211674.64ms. Allocated memory was 157.3MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 112.8MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. * Witness Printer took 304.22ms. Allocated memory is still 4.0GB. Free memory was 3.8GB in the beginning and 3.8GB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. 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]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 28]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 210 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 211.3s, OverallIterations: 35, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 50.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 118.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16351 SdHoareTripleChecker+Valid, 15.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15945 mSDsluCounter, 23816 SdHoareTripleChecker+Invalid, 13.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16756 mSDsCounter, 3403 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15876 IncrementalHoareTripleChecker+Invalid, 19279 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3403 mSolverCounterUnsat, 7060 mSDtfsCounter, 15876 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3884 GetRequests, 3431 SyntacticMatches, 5 SemanticMatches, 448 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1363 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14852occurred in iteration=23, InterpolantAutomatonStates: 384, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 29.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 10023 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 84 LocationsWithAnnotation, 17076 PreInvPairs, 19064 NumberOfFragments, 26682 HoareAnnotationTreeSize, 17076 FomulaSimplifications, 1083480 FormulaSimplificationTreeSizeReduction, 55.4s HoareSimplificationTime, 84 FomulaSimplificationsInter, 201993 FormulaSimplificationTreeSizeReductionInter, 62.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 5889 NumberOfCodeBlocks, 5889 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 6325 ConstructedInterpolants, 0 QuantifiedInterpolants, 11144 SizeOfPredicates, 4 NumberOfNonLiveVariables, 6917 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 53 InterpolantComputations, 32 PerfectInterpolantSequences, 3227/3371 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: 642]: 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)) && (T1_E == 2)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (q_free == 0)) && (c_dr_pc == p_dw_pc)) && (t1_pc <= 0)) && !((p_dw_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (token == local)) && (M_E == 2)) || (((((((((((((((((2 <= t1_st) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (q_free == 0)) && (c_dr_pc == p_dw_pc)) && (t1_pc <= 0)) && !((p_dw_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (M_E == 2))) || (((((((((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_write_ev == q_read_ev)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (M_E == 2))) - InvariantResult [Line: 560]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && ((local + 1) == token)) && (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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) || (((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || (((((((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_write_ev == q_read_ev)) && ((0 < t1_pc) || (0 < m_pc))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && ((m_pc < 1) || ((t1_pc <= 1) && (2 <= m_pc))))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (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)) && !((m_pc == 1))) && (q_free == 0)) && (c_dr_pc == p_dw_pc)) && (2 <= T1_E)) && !((p_dw_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (token == local))) - InvariantResult [Line: 575]: 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)) && (2 <= T1_E)) && !((p_dw_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) || ((((((((((((((2 <= E_1) && (p_num_write == 0)) && (c_num_read == 0)) && ((local + 1) == token)) && (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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || (((((((((((((((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)) && !((m_pc == 1))) && (q_free == 0)) && (c_dr_pc == p_dw_pc)) && (2 <= T1_E)) && !((p_dw_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (token == local))) || ((((((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_write_ev == q_read_ev)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((c_dr_st == 0) || ((q_req_up <= 0) && (q_read_ev == 2))) || !((m_pc == t1_pc))) || (0 < t1_pc)) || (\old(q_write_ev) < 2)) || !((M_E == 2))) || !((\old(q_req_up) == 1))) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !((p_dw_pc == 1))) || (p_dw_st == 0)) || !((T1_E == M_E))) || !((m_st == 0))) || !((\old(q_read_ev) == 2))) || !((c_dr_pc == 1))) || (E_1 < 2)) || !((p_dw_i == 1))) || !(((c_num_read + 1) == p_num_write))) || !((token == local))) && ((((((((((((((((((((c_dr_st == 0) || (\old(q_read_ev) < 1)) || !((m_pc == t1_pc))) || (0 < t1_pc)) || (\old(q_write_ev) < 2)) || !((M_E == 2))) || !((\old(q_req_up) == 1))) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((c_num_read == p_num_write))) || (p_dw_st == 0)) || !((T1_E == M_E))) || !((m_st == 0))) || !((c_dr_pc == 1))) || (E_1 < 2)) || ((q_req_up <= 0) && (q_write_ev == \old(q_write_ev)))) || !((p_dw_i == 1))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || !((token == local)))) && (((((((((((((((((((0 < \old(q_req_up)) || (c_dr_st == 0)) || !((m_pc == t1_pc))) || (0 < t1_pc)) || (\old(q_write_ev) < 2)) || !((M_E == 2))) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((p_dw_pc == 1))) || !((c_num_read == p_num_write))) || (p_dw_st == 0)) || !((T1_E == M_E))) || !((m_st == 0))) || !((c_dr_pc == 1))) || (E_1 < 2)) || !((p_dw_i == 1))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || !((token == local)))) && (((((((((((((((c_dr_st == 0) || !((m_pc == t1_pc))) || (0 < t1_pc)) || !((M_E == 2))) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || (p_dw_st == 0)) || (\old(q_read_ev) == q_read_ev)) || !((T1_E == M_E))) || !((m_st == 0))) || (E_1 < 2)) || !((p_dw_i == 1))) || (0 < c_dr_pc)) || !((token == local)))) && ((((((((((((((((((((0 < \old(q_req_up)) || !((m_pc == t1_pc))) || !((p_dw_st == 0))) || (0 < t1_pc)) || !((M_E == 2))) || !((\old(q_read_ev) == \old(q_write_ev)))) || (E_M < 2)) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((c_dr_pc == p_dw_pc))) || !((T1_E == M_E))) || !((m_st == 0))) || !((\old(q_read_ev) == 2))) || (E_1 < 2)) || !((p_dw_i == 1))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || (0 < c_dr_pc)) || !((token == local)))) && (((((((((((((((((((0 < \old(q_req_up)) || (c_dr_st == 0)) || !((m_pc == t1_pc))) || (0 < t1_pc)) || !((M_E == 2))) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !((p_dw_pc == 1))) || (p_dw_st == 0)) || !((T1_E == M_E))) || !((m_st == 0))) || !((\old(q_read_ev) == 2))) || !((c_dr_pc == 1))) || (E_1 < 2)) || !((p_dw_i == 1))) || (\old(q_write_ev) == 0)) || !(((c_num_read + 1) == p_num_write))) || !((token == local)))) && ((((((((((((((((((0 < \old(q_req_up)) || (c_dr_st == 0)) || !((m_pc == t1_pc))) || (0 < t1_pc)) || (\old(q_write_ev) < 2)) || !((M_E == 2))) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !((p_dw_pc == 1))) || (p_dw_st == 0)) || !((T1_E == M_E))) || !((m_st == 0))) || !((\old(q_read_ev) == 2))) || !((c_dr_pc == 1))) || (E_1 < 2)) || !((p_dw_i == 1))) || !((token == local)))) && (((((((((((((((((((c_dr_st == 0) || !((m_pc == t1_pc))) || (0 < t1_pc)) || (\old(q_write_ev) < 2)) || !((M_E == 2))) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((c_num_read == p_num_write))) || (p_dw_pc == 1)) || (q_write_ev == \old(q_write_ev))) || (p_dw_st == 0)) || !((T1_E == M_E))) || !((m_st == 0))) || !((c_dr_pc == 1))) || (E_1 < 2)) || !((p_dw_i == 1))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || !((token == local)))) - InvariantResult [Line: 473]: Loop Invariant Derived loop invariant: (M_E == 2) - InvariantResult [Line: 823]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && ((local + 1) == token)) && (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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) || (((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || (((((((((((((((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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (token == local))) || ((((((((((((((((2 <= t1_st) && (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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || ((((((((((((((((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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (token == local))) || ((((((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_write_ev == q_read_ev)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (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)) && !((m_pc == 1))) && (q_free == 0)) && (c_dr_pc == p_dw_pc)) && (2 <= T1_E)) && !((p_dw_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (token == local))) - InvariantResult [Line: 615]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || ((\old(t1_st) == t1_st) && (m_st == \old(m_st)))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || (((2 <= t1_st) && (\result == 0)) && (__retres1 == 0))) || !((c_last_read == p_last_write))) || !((token == local))) && ((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || ((\result == 0) && (__retres1 == 0))) || !((c_dr_pc == p_dw_pc))) || !((\old(m_st) == 0))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || ((1 <= m_pc) && (m_pc < 2))) || !((token == local)))) && ((((((((((((((((T1_E < 2) || (2 <= t1_st)) || !((p_dw_st == 0))) || (0 < t1_pc)) || (\old(t1_st) < 2)) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write)))) && (((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (\old(t1_st) < 2)) || ((((\result == 0) && (\old(t1_st) == t1_st)) && (m_st == 0)) && (__retres1 == 0))) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((\old(m_st) == 0))) || (E_1 < 2)) || !(((local + 1) == token))) || !((c_last_read == p_last_write)))) && ((((((((((((!((p_dw_st == 0)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || (E_M == 0)) || (m_pc == 1)) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (m_st == \old(m_st))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write)))) && (((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || ((((\result == 0) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st))) && (__retres1 == 0))) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (m_st == \old(m_st))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || !((token == local)))) && ((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (0 < t1_pc)) || !((M_E == 2))) || (\old(t1_st) < 2)) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || ((T1_E == 2) && (M_E == 2))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || ((\result == 0) && (__retres1 == 0))) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write)))) && ((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (0 < t1_pc)) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (((\result == 0) && (2 <= m_st)) && (__retres1 == 0))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (m_st == \old(m_st))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write)))) && ((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || !((M_E == 2))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || ((T1_E == 2) && (M_E == 2))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || ((\result == 0) && (__retres1 == 0))) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write)))) && ((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || ((\old(t1_st) == t1_st) && (m_st == \old(m_st)))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || (m_pc == 1)) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write))) || !((token == local)))) && ((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || !((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))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (((\result == 0) && (2 <= m_st)) && (__retres1 == 0))) || (E_1 < 2)) || ((((\result == 0) && (m_st == 0)) && (E_M <= 1)) && (__retres1 == 0))) || !(((local + 1) == token))) || !((c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (m_st == \old(m_st))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write)))) && ((((((((((((((T1_E < 2) || !((m_pc == t1_pc))) || !((p_dw_st == 0))) || (0 < t1_pc)) || ((((\result == 0) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st))) && (__retres1 == 0))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write)))) && (((((((((((((((((T1_E < 2) || ((((2 <= t1_st) && (\result == 0)) && (2 <= m_st)) && (__retres1 == 0))) || !((p_dw_st == 0))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (m_st == \old(m_st))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write)))) - InvariantResult [Line: 889]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((c_dr_st == 0) || !((m_pc == t1_pc))) || (0 < t1_pc)) || !((M_E == 2))) || (E_M < 2)) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((c_dr_pc == p_dw_pc))) || !((T1_E == M_E))) || !((m_st == 0))) || (E_1 < 2)) || !((p_dw_i == 1))) || !((q_free == 1))) || (__retres1 == 0)) || !((c_last_read == p_last_write))) || (0 < c_dr_pc)) || !((token == local))) && ((((((((((((((((((((c_dr_st == 0) || !((m_pc == t1_pc))) || (0 < t1_pc)) || !((M_E == 2))) || (0 < q_req_up)) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((c_num_read == p_num_write))) || ((q_read_ev == 1) && (p_dw_pc == 1))) || (p_dw_st == 0)) || ((p_dw_pc == 1) && (__retres1 == 0))) || !((T1_E == M_E))) || !((m_st == 0))) || !((c_dr_pc == 1))) || (E_1 < 2)) || !((p_dw_i == 1))) || !((q_free == 1))) || (q_write_ev < 2)) || !((c_last_read == p_last_write))) || !((token == local)))) && ((((((((((((((((c_dr_st == 0) || !((m_pc == t1_pc))) || (0 < t1_pc)) || !((M_E == 2))) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (p_dw_st == 0)) || !((T1_E == M_E))) || !((m_st == 0))) || (E_1 < 2)) || !((p_dw_i == 1))) || (__retres1 == 0)) || (0 < c_dr_pc)) || !((token == local)))) && ((((((((((((((((c_dr_st == 0) || !((m_pc == t1_pc))) || (0 < t1_pc)) || !((M_E == 2))) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || (p_dw_st == 0)) || !((T1_E == M_E))) || !((m_st == 0))) || (E_1 < 2)) || !((p_dw_i == 1))) || (__retres1 == 0)) || !((q_read_ev == 2))) || (0 < c_dr_pc)) || !((token == local)))) && (((((((((((((((((((c_dr_st == 0) || !((m_pc == t1_pc))) || (0 < t1_pc)) || !((M_E == 2))) || (0 < q_req_up)) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !((p_dw_pc == 1))) || (p_dw_st == 0)) || !((T1_E == M_E))) || !((m_st == 0))) || !((c_dr_pc == 1))) || (E_1 < 2)) || !((p_dw_i == 1))) || (__retres1 == 0)) || (q_write_ev < 2)) || !((q_read_ev == 2))) || !((token == local)))) && (((((((((((((((c_dr_st == 0) || !((m_pc == t1_pc))) || !((M_E == 2))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || (E_M == 0)) || (m_pc == 1)) || !((c_num_read == 0))) || (p_dw_pc == 1)) || (p_dw_st == 0)) || !((c_dr_pc == p_dw_pc))) || !((T1_E == M_E))) || !((q_free == 1))) || (__retres1 == 0)) || !((c_last_read == p_last_write)))) && (((((((((((((((((((c_dr_st == 0) || !((m_pc == t1_pc))) || (0 < t1_pc)) || !((M_E == 2))) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((c_num_read == p_num_write))) || (p_dw_pc == 1)) || (p_dw_st == 0)) || !((T1_E == M_E))) || !((m_st == 0))) || !((c_dr_pc == 1))) || (E_1 < 2)) || !((p_dw_i == 1))) || !((q_free == 1))) || (__retres1 == 0)) || (q_write_ev < 2)) || !((c_last_read == p_last_write))) || !((token == local)))) && ((((((((((((((((((((c_dr_st == 0) || !((m_pc == t1_pc))) || (0 < t1_pc)) || !((M_E == 2))) || (0 < q_req_up)) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !((p_dw_pc == 1))) || (p_dw_st == 0)) || !((T1_E == M_E))) || !((m_st == 0))) || (q_write_ev == 0)) || !((c_dr_pc == 1))) || (E_1 < 2)) || !((p_dw_i == 1))) || !(((c_num_read + 1) == p_num_write))) || (__retres1 == 0)) || !((q_read_ev == 2))) || !((token == local)))) && ((((((((((((((((((((!((m_pc == t1_pc)) || !((p_dw_st == 0))) || (0 < t1_pc)) || !((M_E == 2))) || (0 < q_req_up)) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((c_dr_pc == p_dw_pc))) || !((T1_E == M_E))) || !((m_st == 0))) || (E_1 < 2)) || !((p_dw_i == 1))) || !((q_free == 1))) || (__retres1 == 0)) || !((q_read_ev == 2))) || !((c_last_read == p_last_write))) || (0 < c_dr_pc)) || !((token == local)))) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (token == local)) && (M_E == 2)) || (((((((((((((((((((((q_req_up == 1) && (2 <= E_1)) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && !((m_pc == 1))) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (p_dw_pc == 1)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (token == local)) && (M_E == 2))) || ((((((((((((((p_num_write == 0) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (c_last_read == p_last_write)) && (M_E == 2))) || ((((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && !((m_pc == 1))) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (token == local)) && (M_E == 2))) || ((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (c_dr_pc == 1)) && !((p_dw_pc == 1))) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (token == local)) && (M_E == 2))) || (((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && !((q_write_ev == 0))) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (token == local)) && (M_E == 2))) || ((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (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))) || (((((((((((((((((((q_req_up == 1) && (2 <= E_1)) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (token == local)) && (M_E == 2))) - InvariantResult [Line: 545]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && ((local + 1) == token)) && (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)) && !((p_dw_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (1 <= tmp___1)) && (m_st == 0)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (token == local)) && (M_E == 2)) - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: (M_E == 2) - InvariantResult [Line: 948]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 516]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) || (((((((((((((((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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) - InvariantResult [Line: 596]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || ((((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st))) && (\result == 0))) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || !((token == local))) && ((((((((((((!((p_dw_st == 0)) || ((((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st))) && (\result == 0))) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || (E_M == 0)) || (m_pc == 1)) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write)))) && (((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || ((((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st))) && (\result == 0))) || (((\old(t1_st) == t1_st) && (m_st == \old(m_st))) && (E_M <= 1))) || !((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))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !(((local + 1) == token))) || !((c_last_read == p_last_write)))) && (((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (0 < t1_pc)) || ((((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st))) && (\result == 0))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write)))) && ((((((((((((((T1_E < 2) || !((m_pc == t1_pc))) || !((p_dw_st == 0))) || (0 < t1_pc)) || ((((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st))) && (\result == 0))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write)))) && (((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || ((((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == 0)) && (\result == 0))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((\old(m_st) == 0))) || (E_1 < 2)) || !(((local + 1) == token))) || !((c_last_read == p_last_write)))) && (((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || ((((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st))) && (\result == 0))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write))) || !((token == local)))) && ((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || ((((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st))) && (\result == 0))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write)))) - InvariantResult [Line: 870]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && ((local + 1) == token)) && (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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) || (((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || (((((((((((((((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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (token == local))) || ((((((((((((((((2 <= t1_st) && (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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || ((((((((((((((((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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (token == local))) || ((((((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_write_ev == q_read_ev)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (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)) && !((m_pc == 1))) && (q_free == 0)) && (c_dr_pc == p_dw_pc)) && (2 <= T1_E)) && !((p_dw_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (token == local))) - InvariantResult [Line: 663]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((!((m_pc == t1_pc)) || !((p_dw_st == 0))) || (0 < t1_pc)) || !((M_E == 2))) || (0 < q_req_up)) || (__retres1 == 0)) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((c_dr_pc == p_dw_pc))) || !((T1_E == M_E))) || !((m_st == 0))) || (E_1 < 2)) || !((p_dw_i == 1))) || !((q_free == 1))) || !((q_read_ev == 2))) || !((c_last_read == p_last_write))) || (0 < c_dr_pc)) || !((token == local))) && (((((((((((((((c_dr_st == 0) || !((m_pc == t1_pc))) || !((M_E == 2))) || (__retres1 == 0)) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || (E_M == 0)) || (m_pc == 1)) || !((c_num_read == 0))) || (p_dw_pc == 1)) || (p_dw_st == 0)) || !((c_dr_pc == p_dw_pc))) || !((T1_E == M_E))) || !((q_free == 1))) || !((c_last_read == p_last_write)))) && (((((((((((((((((((c_dr_st == 0) || !((m_pc == t1_pc))) || (0 < t1_pc)) || !((M_E == 2))) || (0 < q_req_up)) || (__retres1 == 0)) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !((p_dw_pc == 1))) || (p_dw_st == 0)) || !((T1_E == M_E))) || !((m_st == 0))) || !((c_dr_pc == 1))) || (E_1 < 2)) || !((p_dw_i == 1))) || (q_write_ev < 2)) || !((q_read_ev == 2))) || !((token == local)))) && ((((((((((((((((((((((c_dr_st == 0) || !((m_pc == t1_pc))) || (0 < t1_pc)) || !((M_E == 2))) || (0 < q_req_up)) || (__retres1 == 0)) || (E_M < 2)) || !((p_last_write == q_buf_0))) || (E_M == 0)) || (m_pc == 1)) || !((p_dw_pc == 1))) || !((c_num_read == p_num_write))) || (p_dw_st == 0)) || !((T1_E == M_E))) || !((m_st == 0))) || !((c_dr_pc == 1))) || (E_1 < 2)) || !((p_dw_i == 1))) || !((q_free == 1))) || (q_write_ev < 2)) || !((c_last_read == p_last_write))) || !((token == local)))) && ((((((((((((((((c_dr_st == 0) || !((m_pc == t1_pc))) || (0 < t1_pc)) || !((M_E == 2))) || (__retres1 == 0)) || (E_M < 2)) || !((p_last_write == q_buf_0))) || (E_M == 0)) || (m_pc == 1)) || !((q_free == 0))) || !((T1_E == M_E))) || !((m_st == 0))) || (E_1 < 2)) || !((p_dw_i == 1))) || (0 < c_dr_pc)) || !((token == local)))) && ((((((((((((((((((((c_dr_st == 0) || !((m_pc == t1_pc))) || (0 < t1_pc)) || !((M_E == 2))) || (__retres1 == 0)) || (E_M < 2)) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || (E_M == 0)) || (m_pc == 1)) || !((c_num_read == 0))) || !((c_dr_pc == p_dw_pc))) || !((T1_E == M_E))) || !((m_st == 0))) || (E_1 < 2)) || !((p_dw_i == 1))) || !((q_free == 1))) || !((c_last_read == p_last_write))) || (0 < c_dr_pc)) || !((token == local)))) && (((((((((((((((((((((c_dr_st == 0) || !((m_pc == t1_pc))) || (0 < t1_pc)) || !((M_E == 2))) || (0 < q_req_up)) || (__retres1 == 0)) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !((p_dw_pc == 1))) || (1 <= q_write_ev)) || (p_dw_st == 0)) || !((T1_E == M_E))) || !((m_st == 0))) || (q_write_ev == 0)) || !((c_dr_pc == 1))) || (E_1 < 2)) || !((p_dw_i == 1))) || !(((c_num_read + 1) == p_num_write))) || !((q_read_ev == 2))) || !((token == local)))) && (((((((((((((((((((((c_dr_st == 0) || !((m_pc == t1_pc))) || (0 < t1_pc)) || !((M_E == 2))) || (__retres1 == 0)) || (E_M < 2)) || !((p_last_write == q_buf_0))) || (E_M == 0)) || (m_pc == 1)) || !((c_num_read == p_num_write))) || (p_dw_pc == 1)) || (p_dw_st == 0)) || !((T1_E == M_E))) || !((m_st == 0))) || !((c_dr_pc == 1))) || (E_1 < 2)) || !((p_dw_i == 1))) || !((q_free == 1))) || (q_write_ev < 2)) || !((c_last_read == p_last_write))) || !((token == local)))) && ((((((((((((((((((((((c_dr_st == 0) || !((m_pc == t1_pc))) || (0 < t1_pc)) || !((q_read_ev == 1))) || !((M_E == 2))) || (0 < q_req_up)) || (__retres1 == 0)) || (E_M < 2)) || !((p_last_write == q_buf_0))) || (E_M == 0)) || (m_pc == 1)) || !((p_dw_pc == 1))) || !((c_num_read == p_num_write))) || !((T1_E == M_E))) || !((m_st == 0))) || !((c_dr_pc == 1))) || (E_1 < 2)) || !((p_dw_i == 1))) || !((q_free == 1))) || (q_write_ev < 2)) || !((c_last_read == p_last_write))) || !((token == local)))) - InvariantResult [Line: 173]: 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)) && (T1_E == 2)) && (1 <= tmp___1)) && (m_st == 0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && !((p_dw_pc == 1))) && (p_dw_st == 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (token == local)) && (M_E == 2)) || ((((((((((((((((((((q_req_up == 1) && (2 <= E_1)) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (1 <= tmp___1)) && (m_st == 0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (token == local)) && (M_E == 2))) - InvariantResult [Line: 563]: 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)) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && (2 <= T1_E)) && !((p_dw_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (token == local)) || (((((((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_write_ev == q_read_ev)) && ((0 < t1_pc) || (0 < m_pc))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && ((m_pc < 1) || ((t1_pc <= 1) && (2 <= m_pc))))) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && ((local + 1) == token)) && (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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) || (((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || (((((((((((((((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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (token == local))) || ((((((((((((((((2 <= t1_st) && (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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || ((((((((((((((((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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (token == local))) || ((((((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_write_ev == q_read_ev)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (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)) && !((m_pc == 1))) && (q_free == 0)) && (c_dr_pc == p_dw_pc)) && (2 <= T1_E)) && !((p_dw_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (token == local))) - InvariantResult [Line: 860]: 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)) && (T1_E == 2)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (q_free == 0)) && (c_dr_pc == p_dw_pc)) && (t1_pc <= 0)) && !((p_dw_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (token == local)) && (M_E == 2)) - InvariantResult [Line: 832]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && ((local + 1) == token)) && (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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) || (((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || (((((((((((((((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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (token == local))) || ((((((((((((((((2 <= t1_st) && (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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || ((((((((((((((((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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (token == local))) || ((((((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_write_ev == q_read_ev)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (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)) && !((m_pc == 1))) && (q_free == 0)) && (c_dr_pc == p_dw_pc)) && (2 <= T1_E)) && !((p_dw_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (token == local))) - InvariantResult [Line: 456]: 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)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (c_dr_pc == p_dw_pc)) && (t1_pc <= 0)) && (q_req_up <= 0)) && (q_write_ev == 2)) && (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: 398]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((2 <= E_1) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && !((m_pc == 1))) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (token == local)) && (M_E == 2)) || ((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (token == local)) && (M_E == 2))) || ((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && (2 <= q_write_ev)) && (q_free == 0)) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (token == local)) && (M_E == 2))) || ((((((((((((((p_num_write == 0) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (c_last_read == p_last_write)) && (M_E == 2))) || ((((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && !((m_pc == 1))) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (token == local)) && (M_E == 2))) || (((((((((((((2 <= E_1) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (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))) || ((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (c_dr_pc == 1)) && !((p_dw_pc == 1))) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (token == local)) && (M_E == 2))) || (((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && !((q_write_ev == 0))) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (token == local)) && (M_E == 2))) - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (0 < t1_pc)) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || ((2 <= m_st) && (__retres1 == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (m_st == \old(m_st))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) && ((((((((((((((((T1_E < 2) || (2 <= t1_st)) || !((p_dw_st == 0))) || (0 < t1_pc)) || (\old(t1_st) < 2)) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write)))) && (((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (\old(t1_st) < 2)) || (((\old(t1_st) == t1_st) && (m_st == 0)) && (__retres1 == 0))) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((\old(m_st) == 0))) || (E_1 < 2)) || !(((local + 1) == token))) || !((c_last_read == p_last_write)))) && (((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (((\old(t1_st) == t1_st) && (m_st == \old(m_st))) && (__retres1 == 0))) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (m_st == \old(m_st))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || !((token == local)))) && ((((((((((((!((p_dw_st == 0)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || (E_M == 0)) || (m_pc == 1)) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (m_st == \old(m_st))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write)))) && ((((((((((((((T1_E < 2) || !((m_pc == t1_pc))) || !((p_dw_st == 0))) || (0 < t1_pc)) || (((\old(t1_st) == t1_st) && (m_st == \old(m_st))) && (__retres1 == 0))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write)))) && ((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (0 < t1_pc)) || !((M_E == 2))) || (\old(t1_st) < 2)) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || ((T1_E == 2) && (M_E == 2))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || (__retres1 == 0))) && ((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || ((\old(t1_st) == t1_st) && (m_st == \old(m_st)))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write))) || ((2 <= t1_st) && (__retres1 == 0))) || !((token == local)))) && ((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || !((M_E == 2))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || ((T1_E == 2) && (M_E == 2))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || (__retres1 == 0))) && (((((((((((((((((T1_E < 2) || (((2 <= t1_st) && (2 <= m_st)) && (__retres1 == 0))) || !((p_dw_st == 0))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (m_st == \old(m_st))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write)))) && ((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || ((\old(t1_st) == t1_st) && (m_st == \old(m_st)))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || (m_pc == 1)) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write))) || !((token == local)))) && ((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || !((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 <= m_st) && (__retres1 == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !(((local + 1) == token))) || !((c_last_read == p_last_write))) || (((m_st == 0) && (E_M <= 1)) && (__retres1 == 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_pc == 1))) && (m_st == \old(m_st))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write)))) && ((((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((\old(m_st) == 0))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || ((1 <= m_pc) && (m_pc < 2))) || (__retres1 == 0)) || !((token == local)))) - InvariantResult [Line: 492]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 149]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (1 <= tmp___1)) && (m_st == 0)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (p_dw_i == 1)) && (c_dr_pc <= 0)) && (token == local)) && (M_E == 2)) || (((((((((((((((((((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)) && (T1_E == 2)) && (1 <= tmp___1)) && (m_st == 0)) && !((m_pc == 1))) && (2 <= q_write_ev)) && (t1_pc <= 0)) && (q_req_up <= 0)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (c_dr_pc <= 0)) && (token == local)) && (M_E == 2))) || (((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (1 <= tmp___1)) && (m_st == 0)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (token == local)) && (M_E == 2))) || (((((((((((((((((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)) && (T1_E == 2)) && (1 <= tmp___1)) && (m_st == 0)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (p_dw_i == 1)) && (c_dr_pc <= 0)) && (token == local)) && (M_E == 2))) - InvariantResult [Line: 680]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && ((local + 1) == token)) && (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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) || (((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || (((((((((((((((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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (token == local))) || ((((((((((((((((2 <= t1_st) && (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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || ((((((((((((((((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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (token == local))) || ((((((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_write_ev == q_read_ev)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (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)) && !((m_pc == 1))) && (q_free == 0)) && (c_dr_pc == p_dw_pc)) && (2 <= T1_E)) && !((p_dw_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (token == local))) - InvariantResult [Line: 241]: 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)) && (T1_E == 2)) && (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)) || ((((((((((((((p_num_write == 0) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (c_last_read == p_last_write)) && (M_E == 2))) || ((((((((((((((((((((2 <= E_1) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (c_dr_pc == p_dw_pc)) && (t1_pc <= 0)) && (q_req_up <= 0)) && (q_write_ev == 2)) && (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: 904]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && ((local + 1) == token)) && (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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) || (((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || (((((((((((((((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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (token == local))) || ((((((((((((((((2 <= t1_st) && (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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || ((((((((((((((((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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (token == local))) || ((((((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_write_ev == q_read_ev)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (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)) && !((m_pc == 1))) && (q_free == 0)) && (c_dr_pc == p_dw_pc)) && (2 <= T1_E)) && !((p_dw_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (token == local))) - InvariantResult [Line: 188]: 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)) && (T1_E == 2)) && (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_pc == 1))) && (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)) || ((1 <= q_read_ev) && ((((((((((((((((((((q_req_up == 1) && (2 <= E_1)) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (1 <= tmp___1)) && (m_st == 0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (c_dr_pc <= 0)) && (token == local)) && (M_E == 2)) || ((((((((((((((((((((q_req_up == 1) && (2 <= E_1)) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (1 <= tmp___1)) && (m_st == 0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (token == local)) && (M_E == 2))))) || ((((((((((((((((((((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)) && (T1_E == 2)) && (1 <= tmp___1)) && (m_st == 0)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (p_num_write == 1)) && (c_dr_pc <= 0)) && (token == local)) && (M_E == 2))) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((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)) && (T1_E == 2)) && (1 <= tmp___1)) && (m_st == 0)) && (q_free == 1)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (p_dw_i == 1)) && (c_dr_pc <= 0)) && (token == local)) && (M_E == 2)) || ((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (1 <= tmp___1)) && (m_st == 0)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (p_dw_i == 1)) && (c_dr_pc <= 0)) && (token == local)) && (M_E == 2))) || ((((((((((((((((((((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)) && (T1_E == 2)) && (1 <= tmp___1)) && (m_st == 0)) && (q_free == 1)) && !((m_pc == 1))) && (2 <= q_write_ev)) && (t1_pc <= 0)) && (q_req_up <= 0)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (c_dr_pc <= 0)) && (token == local)) && (M_E == 2))) || (((((((((((((((((((((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)) && (T1_E == 2)) && (1 <= tmp___1)) && (m_st == 0)) && (q_free == 1)) && !((m_pc == 1))) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (token == local)) && (M_E == 2))) || ((((((((((((((((((((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)) && (T1_E == 2)) && (1 <= tmp___1)) && (m_st == 0)) && !((m_pc == 1))) && (2 <= q_write_ev)) && (q_free == 0)) && (t1_pc <= 0)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (p_num_write == 1)) && (c_dr_pc <= 0)) && (token == local)) && (M_E == 2))) || ((((((((((((((((((((q_req_up == 1) && (2 <= E_1)) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (1 <= tmp___1)) && (m_st == 0)) && !((m_pc == 1))) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (token == local)) && (M_E == 2))) - InvariantResult [Line: 531]: 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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (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_pc == 1))) && (q_free == 0)) && (c_dr_pc == p_dw_pc)) && (2 <= T1_E)) && !((p_dw_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (token == local))) || (((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && ((local + 1) == token)) && (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)) && !((p_dw_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) - InvariantResult [Line: 599]: Loop Invariant Derived loop invariant: (((((((((((((((((((((T1_E < 2) || !((m_pc == t1_pc))) || !((p_dw_st == 0))) || (0 < t1_pc)) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || (((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st)))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write))) && ((((((((((((!((p_dw_st == 0)) || !((q_write_ev == q_read_ev))) || (((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st)))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || (E_M == 0)) || (m_pc == 1)) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write)))) && (((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || (((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st)))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((c_last_read == p_last_write))) || !((token == local)))) && (((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (0 < t1_pc)) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || (((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st)))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write)))) && (((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (((\old(t1_st) == t1_st) && (m_st == \old(m_st))) && (E_M <= 1))) || !((t1_pc == 1))) || !((q_write_ev == q_read_ev))) || (((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st)))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || (E_M == 0)) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !(((local + 1) == token))) || !((c_last_read == p_last_write)))) && ((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || (((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st)))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write)))) && ((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || (((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == \old(m_st)))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || (\old(m_st) < 2)) || !((c_dr_pc == p_dw_pc))) || (E_1 < 2)) || !((c_last_read == p_last_write))) || !((token == local)))) && (((((((((((((((((T1_E < 2) || !((p_dw_st == 0))) || (\old(t1_st) < 2)) || !((t1_pc == 1))) || (E_M < 2)) || !((q_write_ev == q_read_ev))) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((\old(m_st) == 0))) || (E_1 < 2)) || (((0 == __retres1) && (\old(t1_st) == t1_st)) && (m_st == 0))) || !(((local + 1) == token))) || !((c_last_read == p_last_write)))) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((((((((((((((((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)) && (T1_E == 2)) && (1 <= tmp___1)) && (m_st == 0)) && (2 <= q_write_ev)) && (q_free == 0)) && (t1_pc <= 0)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (p_num_write == 1)) && (c_dr_pc <= 0)) && (token == local)) && (M_E == 2)) || ((((((((((((((((((((q_req_up == 1) && (2 <= E_1)) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (1 <= tmp___1)) && (m_st == 0)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (token == local)) && (M_E == 2))) || (((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (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))) - InvariantResult [Line: 686]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && ((local + 1) == token)) && (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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) || (((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || (((((((((((((((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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (token == local))) || ((((((((((((((((2 <= t1_st) && (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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || ((((((((((((((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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || ((((((((((((((((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_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (token == local))) || ((((((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_write_ev == q_read_ev)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (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)) && !((m_pc == 1))) && (q_free == 0)) && (c_dr_pc == p_dw_pc)) && (2 <= T1_E)) && !((p_dw_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (token == local))) - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((c_dr_st == 0) || !((m_pc == t1_pc))) || !((p_dw_st == 0))) || (0 < t1_pc)) || !((M_E == 2))) || (0 < q_req_up)) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((p_dw_pc == 1))) || !((c_num_read == p_num_write))) || !((T1_E == M_E))) || !((m_st == 0))) || !((c_dr_pc == 1))) || (E_1 < 2)) || !((p_dw_i == 1))) || !((q_free == 1))) || (1 <= __retres1)) || (q_write_ev < 2)) || !((q_read_ev == 2))) || !((c_last_read == p_last_write))) || !((token == local))) && (((((((((((((((c_dr_st == 0) || !((m_pc == t1_pc))) || !((p_dw_st == 0))) || (0 < t1_pc)) || !((M_E == 2))) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !((T1_E == M_E))) || !((m_st == 0))) || (E_1 < 2)) || !((p_dw_i == 1))) || (1 <= __retres1)) || (0 < c_dr_pc)) || !((token == local)))) && (((((((((((((((((((((c_dr_st == 0) || !((m_pc == t1_pc))) || !((p_dw_st == 0))) || (0 < t1_pc)) || !((M_E == 2))) || (0 < q_req_up)) || (E_M < 2)) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((T1_E == M_E))) || !((m_st == 0))) || !((c_dr_pc == 1))) || (E_1 < 2)) || !((p_dw_i == 1))) || !((q_free == 1))) || (1 <= __retres1)) || (q_write_ev < 2)) || !((q_read_ev == 2))) || !((c_last_read == p_last_write))) || !((token == local)))) && (((((((((((((((((((!((m_pc == t1_pc)) || (0 < t1_pc)) || !((M_E == 2))) || !((p_num_write == 1))) || !((q_req_up == 1))) || !((c_dr_st == 0))) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((q_free == 0))) || (p_dw_st == 0)) || (q_read_ev < 1)) || !((T1_E == M_E))) || !((m_st == 0))) || (E_1 < 2)) || !((p_dw_i == 1))) || (1 <= __retres1)) || (q_write_ev < 2)) || (0 < c_dr_pc)) || !((token == local)))) && (((((((((((((((((((!((m_pc == t1_pc)) || (0 < t1_pc)) || !((M_E == 2))) || (0 < q_req_up)) || !((c_dr_st == 0))) || (E_M < 2)) || !((p_last_write == q_buf_0))) || !((q_free == 0))) || !((p_dw_pc == 1))) || (p_dw_st == 0)) || !((T1_E == M_E))) || !((m_st == 0))) || !((c_dr_pc == 1))) || (E_1 < 2)) || !((p_dw_i == 1))) || !(((c_num_read + 1) == p_num_write))) || (1 <= __retres1)) || (q_write_ev < 2)) || !((q_read_ev == 2))) || !((token == local)))) && (((((((((((((((((((c_dr_st == 0) || !((m_pc == t1_pc))) || !((p_dw_st == 0))) || (0 < t1_pc)) || !((M_E == 2))) || (E_M < 2)) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((c_dr_pc == p_dw_pc))) || !((T1_E == M_E))) || !((m_st == 0))) || (E_1 < 2)) || !((p_dw_i == 1))) || !((q_free == 1))) || (1 <= __retres1)) || !((c_last_read == p_last_write))) || (0 < c_dr_pc)) || !((token == local)))) && ((((((((((((((((((((!((m_pc == t1_pc)) || !((p_dw_st == 0))) || (0 < t1_pc)) || !((M_E == 2))) || (0 < q_req_up)) || (E_M < 2)) || !((p_num_write == 0))) || !((p_last_write == q_buf_0))) || !((c_num_read == 0))) || !((c_dr_pc == p_dw_pc))) || !((T1_E == M_E))) || !((m_st == 0))) || (E_1 < 2)) || !((p_dw_i == 1))) || !((q_free == 1))) || (1 <= __retres1)) || (q_write_ev < 2)) || !((q_read_ev == 2))) || !((c_last_read == p_last_write))) || (0 < c_dr_pc)) || !((token == local)))) - InvariantResult [Line: 427]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((2 <= E_1) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && !((m_pc == 1))) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (token == local)) && (M_E == 2)) || ((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (token == local)) && (M_E == 2))) || (((((((((((((((((2 <= E_1) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (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))) || ((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && (2 <= q_write_ev)) && (q_free == 0)) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (token == local)) && (M_E == 2))) || ((((((((((((((p_num_write == 0) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (c_last_read == p_last_write)) && (M_E == 2))) || ((((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && !((m_pc == 1))) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (token == local)) && (M_E == 2))) || ((((((((((((((((((((2 <= E_1) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (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))) || (((((((((((((2 <= E_1) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (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))) || ((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (c_dr_pc == 1)) && !((p_dw_pc == 1))) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (token == local)) && (M_E == 2))) || (((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && !((q_write_ev == 0))) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (token == local)) && (M_E == 2))) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((2 <= E_1) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && !((m_pc == 1))) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (token == local)) && (M_E == 2)) || (((((((((((((((((((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)) && (T1_E == 2)) && (1 <= tmp___1)) && (m_st == 0)) && (2 <= q_write_ev)) && (q_free == 0)) && (t1_pc <= 0)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (p_num_write == 1)) && (c_dr_pc <= 0)) && (token == local)) && (M_E == 2))) || ((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (token == local)) && (M_E == 2))) || (((((((((((((((((2 <= E_1) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (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))) || ((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && (2 <= q_write_ev)) && (q_free == 0)) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (token == local)) && (M_E == 2))) || ((((((((((((((p_num_write == 0) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (c_last_read == p_last_write)) && (M_E == 2))) || ((((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && !((m_pc == 1))) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (token == local)) && (M_E == 2))) || ((((((((((((((((((((2 <= E_1) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (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))) || (((((((((((((2 <= E_1) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (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))) || ((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (c_dr_pc == 1)) && !((p_dw_pc == 1))) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (token == local)) && (M_E == 2))) || (((((((((((((((((((q_req_up == 1) && (2 <= E_1)) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (token == local)) && (M_E == 2))) || (((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && !((q_write_ev == 0))) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (token == local)) && (M_E == 2))) || ((((((((((((((((((((2 <= E_1) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (1 <= tmp___1)) && (m_st == 0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (token == local)) && (M_E == 2))) || (((((((((((((((((((q_req_up == 1) && (2 <= E_1)) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (token == local)) && (M_E == 2))) - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((2 <= E_1) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && !((m_pc == 1))) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (token == local)) && (M_E == 2)) || ((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (token == local)) && (M_E == 2))) || ((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && (2 <= q_write_ev)) && (q_free == 0)) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (token == local)) && (M_E == 2))) || ((((((((((((((p_num_write == 0) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (c_dr_pc == p_dw_pc)) && !((p_dw_pc == 1))) && !((E_M == 0))) && (c_last_read == p_last_write)) && (M_E == 2))) || ((((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && !((m_pc == 1))) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (token == local)) && (M_E == 2))) || (((((((((((((2 <= E_1) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (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))) || ((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (c_dr_pc == 1)) && !((p_dw_pc == 1))) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (token == local)) && (M_E == 2))) || (((((((((((((((((((2 <= E_1) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && !((q_write_ev == 0))) && (2 <= E_M)) && (T1_E == 2)) && (m_st == 0)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (token == local)) && (M_E == 2))) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:29:11,110 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1147086c-d064-4d75-97ba-5e2eac2c8e77/bin/uautomizer-verify-WvqO1wxjHP/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