./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 0792bb078b549cb8c62d642eddb09d42b03fb2451c67a454a8e8576be6796f29 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:46:48,301 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:46:48,370 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 01:46:48,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:46:48,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:46:48,401 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:46:48,402 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:46:48,403 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:46:48,404 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:46:48,404 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:46:48,405 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:46:48,405 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:46:48,406 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:46:48,407 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:46:48,407 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:46:48,408 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:46:48,408 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:46:48,409 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:46:48,409 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:46:48,410 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:46:48,410 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:46:48,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:46:48,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:46:48,412 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:46:48,412 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:46:48,413 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:46:48,413 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:46:48,414 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:46:48,414 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:46:48,414 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:46:48,415 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:46:48,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:46:48,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:46:48,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:46:48,416 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:46:48,416 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:46:48,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:46:48,417 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:46:48,417 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:46:48,417 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:46:48,417 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:46:48,418 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:46:48,418 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_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/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_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 0792bb078b549cb8c62d642eddb09d42b03fb2451c67a454a8e8576be6796f29 [2023-11-29 01:46:48,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:46:48,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:46:48,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:46:48,645 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:46:48,645 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:46:48,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c [2023-11-29 01:46:51,406 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:46:51,629 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:46:51,630 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c [2023-11-29 01:46:51,644 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/data/a54368b42/fcf292309d3543ff9811fd551bf414ff/FLAGe2b496c89 [2023-11-29 01:46:51,657 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/data/a54368b42/fcf292309d3543ff9811fd551bf414ff [2023-11-29 01:46:51,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:46:51,661 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:46:51,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:46:51,662 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:46:51,666 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:46:51,667 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:46:51" (1/1) ... [2023-11-29 01:46:51,668 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c978eea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:46:51, skipping insertion in model container [2023-11-29 01:46:51,668 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:46:51" (1/1) ... [2023-11-29 01:46:51,710 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:46:51,835 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_7a2acaed-24c9-4971-8447-a42e1ad8b255/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[914,927] [2023-11-29 01:46:51,882 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_7a2acaed-24c9-4971-8447-a42e1ad8b255/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[7115,7128] [2023-11-29 01:46:51,921 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:46:51,933 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:46:51,942 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_7a2acaed-24c9-4971-8447-a42e1ad8b255/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[914,927] [2023-11-29 01:46:51,964 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_7a2acaed-24c9-4971-8447-a42e1ad8b255/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[7115,7128] [2023-11-29 01:46:51,989 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:46:52,010 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:46:52,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:46:52 WrapperNode [2023-11-29 01:46:52,011 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:46:52,012 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:46:52,012 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:46:52,012 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:46:52,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:46:52" (1/1) ... [2023-11-29 01:46:52,028 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:46:52" (1/1) ... [2023-11-29 01:46:52,066 INFO L138 Inliner]: procedures = 57, calls = 63, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 470 [2023-11-29 01:46:52,067 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:46:52,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:46:52,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:46:52,068 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:46:52,078 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:46:52" (1/1) ... [2023-11-29 01:46:52,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:46:52" (1/1) ... [2023-11-29 01:46:52,081 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:46:52" (1/1) ... [2023-11-29 01:46:52,099 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 01:46:52,099 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:46:52" (1/1) ... [2023-11-29 01:46:52,099 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:46:52" (1/1) ... [2023-11-29 01:46:52,110 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:46:52" (1/1) ... [2023-11-29 01:46:52,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:46:52" (1/1) ... [2023-11-29 01:46:52,122 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:46:52" (1/1) ... [2023-11-29 01:46:52,124 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:46:52" (1/1) ... [2023-11-29 01:46:52,129 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:46:52,130 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:46:52,130 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:46:52,130 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:46:52,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:46:52" (1/1) ... [2023-11-29 01:46:52,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:46:52,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:46:52,162 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:46:52,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:46:52,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:46:52,196 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-11-29 01:46:52,197 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-11-29 01:46:52,197 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-11-29 01:46:52,197 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-11-29 01:46:52,197 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-11-29 01:46:52,197 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-11-29 01:46:52,197 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-11-29 01:46:52,197 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-11-29 01:46:52,198 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2023-11-29 01:46:52,198 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2023-11-29 01:46:52,198 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-11-29 01:46:52,198 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-11-29 01:46:52,198 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-11-29 01:46:52,198 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-11-29 01:46:52,198 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2023-11-29 01:46:52,199 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2023-11-29 01:46:52,199 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-11-29 01:46:52,199 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-11-29 01:46:52,199 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2023-11-29 01:46:52,199 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2023-11-29 01:46:52,199 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-11-29 01:46:52,199 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-11-29 01:46:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:46:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-11-29 01:46:52,200 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-11-29 01:46:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2023-11-29 01:46:52,200 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2023-11-29 01:46:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:46:52,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:46:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-11-29 01:46:52,201 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-11-29 01:46:52,302 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:46:52,305 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:46:52,769 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:46:52,810 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:46:52,810 INFO L309 CfgBuilder]: Removed 9 assume(true) statements. [2023-11-29 01:46:52,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:46:52 BoogieIcfgContainer [2023-11-29 01:46:52,811 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:46:52,814 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:46:52,814 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:46:52,816 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:46:52,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:46:51" (1/3) ... [2023-11-29 01:46:52,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d20f2c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:46:52, skipping insertion in model container [2023-11-29 01:46:52,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:46:52" (2/3) ... [2023-11-29 01:46:52,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d20f2c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:46:52, skipping insertion in model container [2023-11-29 01:46:52,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:46:52" (3/3) ... [2023-11-29 01:46:52,819 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.02.cil-1.c [2023-11-29 01:46:52,833 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:46:52,833 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-29 01:46:52,880 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:46:52,885 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=LoopHeads, 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;@3d57ee29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:46:52,886 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-29 01:46:52,891 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 162 states have (on average 1.6358024691358024) internal successors, (265), 168 states have internal predecessors, (265), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2023-11-29 01:46:52,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 01:46:52,902 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:46:52,902 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] [2023-11-29 01:46:52,903 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:46:52,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:46:52,907 INFO L85 PathProgramCache]: Analyzing trace with hash -998187491, now seen corresponding path program 1 times [2023-11-29 01:46:52,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:46:52,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308653458] [2023-11-29 01:46:52,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:46:52,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:46:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:53,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:46:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:53,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:46:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:53,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:46:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:53,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:46:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:53,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:46:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:53,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:46:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:53,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:46:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:53,218 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-29 01:46:53,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:46:53,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308653458] [2023-11-29 01:46:53,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308653458] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:46:53,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:46:53,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:46:53,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747244652] [2023-11-29 01:46:53,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:46:53,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:46:53,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:46:53,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:46:53,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:46:53,255 INFO L87 Difference]: Start difference. First operand has 209 states, 162 states have (on average 1.6358024691358024) internal successors, (265), 168 states have internal predecessors, (265), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 01:46:54,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:46:54,003 INFO L93 Difference]: Finished difference Result 422 states and 654 transitions. [2023-11-29 01:46:54,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 01:46:54,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2023-11-29 01:46:54,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:46:54,017 INFO L225 Difference]: With dead ends: 422 [2023-11-29 01:46:54,017 INFO L226 Difference]: Without dead ends: 221 [2023-11-29 01:46:54,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-29 01:46:54,025 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 439 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:46:54,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 478 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 01:46:54,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2023-11-29 01:46:54,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 204. [2023-11-29 01:46:54,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 159 states have (on average 1.5031446540880504) internal successors, (239), 163 states have internal predecessors, (239), 30 states have call successors, (30), 14 states have call predecessors, (30), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-29 01:46:54,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 297 transitions. [2023-11-29 01:46:54,087 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 297 transitions. Word has length 58 [2023-11-29 01:46:54,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:46:54,087 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 297 transitions. [2023-11-29 01:46:54,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 01:46:54,088 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 297 transitions. [2023-11-29 01:46:54,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 01:46:54,091 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:46:54,092 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] [2023-11-29 01:46:54,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:46:54,092 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:46:54,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:46:54,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1030398619, now seen corresponding path program 1 times [2023-11-29 01:46:54,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:46:54,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381902707] [2023-11-29 01:46:54,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:46:54,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:46:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:54,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:46:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:54,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:46:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:54,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:46:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:54,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:46:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:54,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:46:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:54,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:46:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:54,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:46:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:54,328 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-29 01:46:54,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:46:54,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381902707] [2023-11-29 01:46:54,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381902707] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:46:54,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:46:54,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:46:54,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522401271] [2023-11-29 01:46:54,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:46:54,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:46:54,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:46:54,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:46:54,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:46:54,332 INFO L87 Difference]: Start difference. First operand 204 states and 297 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 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-29 01:46:55,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:46:55,175 INFO L93 Difference]: Finished difference Result 410 states and 594 transitions. [2023-11-29 01:46:55,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 01:46:55,179 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 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 58 [2023-11-29 01:46:55,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:46:55,184 INFO L225 Difference]: With dead ends: 410 [2023-11-29 01:46:55,185 INFO L226 Difference]: Without dead ends: 329 [2023-11-29 01:46:55,186 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-29 01:46:55,188 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 437 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 01:46:55,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 755 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 01:46:55,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2023-11-29 01:46:55,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 292. [2023-11-29 01:46:55,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 227 states have (on average 1.475770925110132) internal successors, (335), 233 states have internal predecessors, (335), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2023-11-29 01:46:55,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 420 transitions. [2023-11-29 01:46:55,235 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 420 transitions. Word has length 58 [2023-11-29 01:46:55,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:46:55,236 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 420 transitions. [2023-11-29 01:46:55,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 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-29 01:46:55,236 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 420 transitions. [2023-11-29 01:46:55,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 01:46:55,240 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:46:55,240 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] [2023-11-29 01:46:55,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:46:55,240 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:46:55,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:46:55,241 INFO L85 PathProgramCache]: Analyzing trace with hash -60763428, now seen corresponding path program 1 times [2023-11-29 01:46:55,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:46:55,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118750882] [2023-11-29 01:46:55,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:46:55,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:46:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:55,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:46:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:55,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:46:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:55,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:46:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:55,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:46:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:55,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:46:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:55,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:46:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:55,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:46:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:55,448 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-29 01:46:55,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:46:55,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118750882] [2023-11-29 01:46:55,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118750882] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:46:55,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:46:55,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 01:46:55,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134549542] [2023-11-29 01:46:55,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:46:55,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 01:46:55,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:46:55,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 01:46:55,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:46:55,452 INFO L87 Difference]: Start difference. First operand 292 states and 420 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 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-29 01:46:56,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:46:56,222 INFO L93 Difference]: Finished difference Result 488 states and 696 transitions. [2023-11-29 01:46:56,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:46:56,222 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 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 58 [2023-11-29 01:46:56,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:46:56,226 INFO L225 Difference]: With dead ends: 488 [2023-11-29 01:46:56,226 INFO L226 Difference]: Without dead ends: 326 [2023-11-29 01:46:56,228 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-29 01:46:56,230 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 350 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:46:56,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 952 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 01:46:56,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2023-11-29 01:46:56,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 296. [2023-11-29 01:46:56,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 230 states have (on average 1.4652173913043478) internal successors, (337), 236 states have internal predecessors, (337), 41 states have call successors, (41), 21 states have call predecessors, (41), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2023-11-29 01:46:56,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 423 transitions. [2023-11-29 01:46:56,265 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 423 transitions. Word has length 58 [2023-11-29 01:46:56,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:46:56,265 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 423 transitions. [2023-11-29 01:46:56,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 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-29 01:46:56,266 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 423 transitions. [2023-11-29 01:46:56,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 01:46:56,268 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:46:56,269 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] [2023-11-29 01:46:56,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 01:46:56,269 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:46:56,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:46:56,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1990220570, now seen corresponding path program 1 times [2023-11-29 01:46:56,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:46:56,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716637752] [2023-11-29 01:46:56,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:46:56,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:46:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:56,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:46:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:56,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:46:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:56,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:46:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:56,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:46:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:56,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:46:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:56,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:46:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:56,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:46:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:56,448 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-29 01:46:56,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:46:56,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716637752] [2023-11-29 01:46:56,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716637752] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:46:56,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:46:56,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 01:46:56,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046422690] [2023-11-29 01:46:56,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:46:56,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 01:46:56,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:46:56,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 01:46:56,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:46:56,452 INFO L87 Difference]: Start difference. First operand 296 states and 423 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 01:46:58,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:46:58,226 INFO L93 Difference]: Finished difference Result 1129 states and 1574 transitions. [2023-11-29 01:46:58,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-29 01:46:58,226 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 58 [2023-11-29 01:46:58,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:46:58,234 INFO L225 Difference]: With dead ends: 1129 [2023-11-29 01:46:58,234 INFO L226 Difference]: Without dead ends: 951 [2023-11-29 01:46:58,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2023-11-29 01:46:58,238 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 1771 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 1439 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1789 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 1883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 1439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:46:58,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1789 Valid, 1279 Invalid, 1883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 1439 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 01:46:58,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2023-11-29 01:46:58,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 834. [2023-11-29 01:46:58,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 649 states have (on average 1.4006163328197228) internal successors, (909), 663 states have internal predecessors, (909), 98 states have call successors, (98), 74 states have call predecessors, (98), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) [2023-11-29 01:46:58,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1121 transitions. [2023-11-29 01:46:58,321 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1121 transitions. Word has length 58 [2023-11-29 01:46:58,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:46:58,321 INFO L495 AbstractCegarLoop]: Abstraction has 834 states and 1121 transitions. [2023-11-29 01:46:58,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 01:46:58,322 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1121 transitions. [2023-11-29 01:46:58,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 01:46:58,323 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:46:58,323 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] [2023-11-29 01:46:58,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 01:46:58,324 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:46:58,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:46:58,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1408145877, now seen corresponding path program 1 times [2023-11-29 01:46:58,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:46:58,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849802220] [2023-11-29 01:46:58,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:46:58,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:46:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:58,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:46:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:58,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:46:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:58,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:46:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:58,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:46:58,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:58,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:46:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:58,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:46:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:58,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:46:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:58,478 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-29 01:46:58,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:46:58,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849802220] [2023-11-29 01:46:58,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849802220] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:46:58,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:46:58,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 01:46:58,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861943601] [2023-11-29 01:46:58,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:46:58,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 01:46:58,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:46:58,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 01:46:58,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:46:58,481 INFO L87 Difference]: Start difference. First operand 834 states and 1121 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 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-29 01:46:59,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:46:59,191 INFO L93 Difference]: Finished difference Result 1648 states and 2197 transitions. [2023-11-29 01:46:59,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:46:59,192 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2023-11-29 01:46:59,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:46:59,198 INFO L225 Difference]: With dead ends: 1648 [2023-11-29 01:46:59,198 INFO L226 Difference]: Without dead ends: 938 [2023-11-29 01:46:59,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-11-29 01:46:59,202 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 353 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:46:59,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 948 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 01:46:59,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2023-11-29 01:46:59,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 850. [2023-11-29 01:46:59,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 661 states have (on average 1.3857791225416036) internal successors, (916), 675 states have internal predecessors, (916), 98 states have call successors, (98), 74 states have call predecessors, (98), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) [2023-11-29 01:46:59,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1132 transitions. [2023-11-29 01:46:59,292 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1132 transitions. Word has length 59 [2023-11-29 01:46:59,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:46:59,292 INFO L495 AbstractCegarLoop]: Abstraction has 850 states and 1132 transitions. [2023-11-29 01:46:59,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 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-29 01:46:59,293 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1132 transitions. [2023-11-29 01:46:59,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 01:46:59,294 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:46:59,294 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] [2023-11-29 01:46:59,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 01:46:59,294 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:46:59,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:46:59,295 INFO L85 PathProgramCache]: Analyzing trace with hash 515082157, now seen corresponding path program 1 times [2023-11-29 01:46:59,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:46:59,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537365453] [2023-11-29 01:46:59,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:46:59,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:46:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:59,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:46:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:59,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:46:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:59,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:46:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:59,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:46:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:59,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:46:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:59,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:46:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:59,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:46:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:46:59,398 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-29 01:46:59,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:46:59,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537365453] [2023-11-29 01:46:59,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537365453] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:46:59,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:46:59,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:46:59,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318337944] [2023-11-29 01:46:59,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:46:59,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:46:59,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:46:59,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:46:59,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:46:59,402 INFO L87 Difference]: Start difference. First operand 850 states and 1132 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 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-29 01:47:00,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:47:00,035 INFO L93 Difference]: Finished difference Result 2371 states and 3104 transitions. [2023-11-29 01:47:00,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:47:00,036 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 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 59 [2023-11-29 01:47:00,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:47:00,046 INFO L225 Difference]: With dead ends: 2371 [2023-11-29 01:47:00,046 INFO L226 Difference]: Without dead ends: 1646 [2023-11-29 01:47:00,048 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-29 01:47:00,049 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 871 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:47:00,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 425 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 01:47:00,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2023-11-29 01:47:00,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1514. [2023-11-29 01:47:00,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1158 states have (on average 1.3316062176165804) internal successors, (1542), 1184 states have internal predecessors, (1542), 178 states have call successors, (178), 141 states have call predecessors, (178), 176 states have return successors, (246), 190 states have call predecessors, (246), 176 states have call successors, (246) [2023-11-29 01:47:00,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 1966 transitions. [2023-11-29 01:47:00,183 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 1966 transitions. Word has length 59 [2023-11-29 01:47:00,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:47:00,184 INFO L495 AbstractCegarLoop]: Abstraction has 1514 states and 1966 transitions. [2023-11-29 01:47:00,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 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-29 01:47:00,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1966 transitions. [2023-11-29 01:47:00,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 01:47:00,185 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:47:00,186 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] [2023-11-29 01:47:00,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 01:47:00,186 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:47:00,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:47:00,187 INFO L85 PathProgramCache]: Analyzing trace with hash -529059355, now seen corresponding path program 1 times [2023-11-29 01:47:00,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:47:00,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086877203] [2023-11-29 01:47:00,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:00,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:47:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:00,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:47:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:00,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:47:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:00,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:47:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:00,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:47:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:00,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:47:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:00,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:47:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:00,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:47:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:00,264 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-29 01:47:00,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:47:00,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086877203] [2023-11-29 01:47:00,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086877203] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:47:00,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:47:00,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:47:00,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166300996] [2023-11-29 01:47:00,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:47:00,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:47:00,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:47:00,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:47:00,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:47:00,266 INFO L87 Difference]: Start difference. First operand 1514 states and 1966 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 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-29 01:47:00,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:47:00,966 INFO L93 Difference]: Finished difference Result 3681 states and 4738 transitions. [2023-11-29 01:47:00,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 01:47:00,966 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 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 60 [2023-11-29 01:47:00,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:47:00,981 INFO L225 Difference]: With dead ends: 3681 [2023-11-29 01:47:00,981 INFO L226 Difference]: Without dead ends: 2292 [2023-11-29 01:47:00,985 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-29 01:47:00,986 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 403 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:47:00,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 622 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 01:47:00,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2292 states. [2023-11-29 01:47:01,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2292 to 2048. [2023-11-29 01:47:01,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2048 states, 1561 states have (on average 1.3164638052530429) internal successors, (2055), 1592 states have internal predecessors, (2055), 242 states have call successors, (242), 196 states have call predecessors, (242), 243 states have return successors, (329), 261 states have call predecessors, (329), 240 states have call successors, (329) [2023-11-29 01:47:01,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 2626 transitions. [2023-11-29 01:47:01,200 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 2626 transitions. Word has length 60 [2023-11-29 01:47:01,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:47:01,200 INFO L495 AbstractCegarLoop]: Abstraction has 2048 states and 2626 transitions. [2023-11-29 01:47:01,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 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-29 01:47:01,201 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2626 transitions. [2023-11-29 01:47:01,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-29 01:47:01,202 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:47:01,202 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] [2023-11-29 01:47:01,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 01:47:01,202 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:47:01,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:47:01,203 INFO L85 PathProgramCache]: Analyzing trace with hash -2816761, now seen corresponding path program 1 times [2023-11-29 01:47:01,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:47:01,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932480696] [2023-11-29 01:47:01,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:01,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:47:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:01,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:47:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:01,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:47:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:01,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:47:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:01,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 01:47:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:01,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:47:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:01,270 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-29 01:47:01,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:47:01,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932480696] [2023-11-29 01:47:01,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932480696] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:47:01,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:47:01,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:47:01,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609829561] [2023-11-29 01:47:01,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:47:01,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:47:01,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:47:01,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:47:01,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:47:01,272 INFO L87 Difference]: Start difference. First operand 2048 states and 2626 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 01:47:01,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:47:01,911 INFO L93 Difference]: Finished difference Result 2190 states and 2847 transitions. [2023-11-29 01:47:01,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 01:47:01,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2023-11-29 01:47:01,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:47:01,922 INFO L225 Difference]: With dead ends: 2190 [2023-11-29 01:47:01,922 INFO L226 Difference]: Without dead ends: 2078 [2023-11-29 01:47:01,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:47:01,925 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 361 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:47:01,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 426 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 01:47:01,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2023-11-29 01:47:02,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 2048. [2023-11-29 01:47:02,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2048 states, 1561 states have (on average 1.315823190262652) internal successors, (2054), 1592 states have internal predecessors, (2054), 242 states have call successors, (242), 196 states have call predecessors, (242), 243 states have return successors, (329), 261 states have call predecessors, (329), 240 states have call successors, (329) [2023-11-29 01:47:02,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 2625 transitions. [2023-11-29 01:47:02,154 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 2625 transitions. Word has length 61 [2023-11-29 01:47:02,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:47:02,154 INFO L495 AbstractCegarLoop]: Abstraction has 2048 states and 2625 transitions. [2023-11-29 01:47:02,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 01:47:02,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2625 transitions. [2023-11-29 01:47:02,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-29 01:47:02,155 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:47:02,155 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] [2023-11-29 01:47:02,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 01:47:02,156 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:47:02,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:47:02,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1389602171, now seen corresponding path program 1 times [2023-11-29 01:47:02,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:47:02,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201187148] [2023-11-29 01:47:02,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:02,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:47:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:02,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:47:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:02,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:47:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:02,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:47:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:02,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 01:47:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:02,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:47:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:02,254 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-29 01:47:02,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:47:02,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201187148] [2023-11-29 01:47:02,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201187148] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:47:02,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:47:02,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:47:02,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671675231] [2023-11-29 01:47:02,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:47:02,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:47:02,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:47:02,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:47:02,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:47:02,257 INFO L87 Difference]: Start difference. First operand 2048 states and 2625 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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-29 01:47:03,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:47:03,186 INFO L93 Difference]: Finished difference Result 2323 states and 3051 transitions. [2023-11-29 01:47:03,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 01:47:03,186 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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 61 [2023-11-29 01:47:03,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:47:03,198 INFO L225 Difference]: With dead ends: 2323 [2023-11-29 01:47:03,199 INFO L226 Difference]: Without dead ends: 2215 [2023-11-29 01:47:03,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-11-29 01:47:03,201 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 589 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:47:03,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 543 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 01:47:03,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2023-11-29 01:47:03,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 2156. [2023-11-29 01:47:03,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 1651 states have (on average 1.327680193821926) internal successors, (2192), 1683 states have internal predecessors, (2192), 253 states have call successors, (253), 202 states have call predecessors, (253), 250 states have return successors, (343), 272 states have call predecessors, (343), 251 states have call successors, (343) [2023-11-29 01:47:03,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 2788 transitions. [2023-11-29 01:47:03,396 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 2788 transitions. Word has length 61 [2023-11-29 01:47:03,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:47:03,396 INFO L495 AbstractCegarLoop]: Abstraction has 2156 states and 2788 transitions. [2023-11-29 01:47:03,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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-29 01:47:03,396 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2788 transitions. [2023-11-29 01:47:03,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-29 01:47:03,397 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:47:03,397 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] [2023-11-29 01:47:03,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 01:47:03,397 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:47:03,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:47:03,398 INFO L85 PathProgramCache]: Analyzing trace with hash 618846533, now seen corresponding path program 1 times [2023-11-29 01:47:03,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:47:03,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759871784] [2023-11-29 01:47:03,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:03,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:47:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:03,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:47:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:03,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:47:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:03,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:47:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:03,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 01:47:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:03,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:47:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:03,503 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-29 01:47:03,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:47:03,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759871784] [2023-11-29 01:47:03,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759871784] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:47:03,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:47:03,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:47:03,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452678971] [2023-11-29 01:47:03,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:47:03,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:47:03,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:47:03,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:47:03,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:47:03,505 INFO L87 Difference]: Start difference. First operand 2156 states and 2788 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-29 01:47:04,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:47:04,611 INFO L93 Difference]: Finished difference Result 2568 states and 3417 transitions. [2023-11-29 01:47:04,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 01:47:04,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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 61 [2023-11-29 01:47:04,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:47:04,633 INFO L225 Difference]: With dead ends: 2568 [2023-11-29 01:47:04,633 INFO L226 Difference]: Without dead ends: 2352 [2023-11-29 01:47:04,634 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-29 01:47:04,635 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 594 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:47:04,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 883 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 01:47:04,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2352 states. [2023-11-29 01:47:04,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2352 to 2257. [2023-11-29 01:47:04,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 1734 states have (on average 1.3356401384083045) internal successors, (2316), 1767 states have internal predecessors, (2316), 264 states have call successors, (264), 208 states have call predecessors, (264), 257 states have return successors, (356), 284 states have call predecessors, (356), 262 states have call successors, (356) [2023-11-29 01:47:04,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 2936 transitions. [2023-11-29 01:47:04,863 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 2936 transitions. Word has length 61 [2023-11-29 01:47:04,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:47:04,863 INFO L495 AbstractCegarLoop]: Abstraction has 2257 states and 2936 transitions. [2023-11-29 01:47:04,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-29 01:47:04,863 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 2936 transitions. [2023-11-29 01:47:04,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-29 01:47:04,864 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:47:04,865 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] [2023-11-29 01:47:04,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 01:47:04,865 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:47:04,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:47:04,865 INFO L85 PathProgramCache]: Analyzing trace with hash 603327815, now seen corresponding path program 1 times [2023-11-29 01:47:04,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:47:04,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157391312] [2023-11-29 01:47:04,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:04,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:47:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:04,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:47:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:04,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:47:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:04,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:47:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:04,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 01:47:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:04,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:47:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:04,992 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-29 01:47:04,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:47:04,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157391312] [2023-11-29 01:47:04,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157391312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:47:04,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:47:04,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:47:04,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332281251] [2023-11-29 01:47:04,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:47:04,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:47:04,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:47:04,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:47:04,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:47:04,994 INFO L87 Difference]: Start difference. First operand 2257 states and 2936 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-29 01:47:06,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:47:06,223 INFO L93 Difference]: Finished difference Result 2989 states and 4049 transitions. [2023-11-29 01:47:06,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 01:47:06,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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 61 [2023-11-29 01:47:06,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:47:06,236 INFO L225 Difference]: With dead ends: 2989 [2023-11-29 01:47:06,236 INFO L226 Difference]: Without dead ends: 2672 [2023-11-29 01:47:06,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-11-29 01:47:06,240 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 608 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:47:06,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 874 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1376 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 01:47:06,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2023-11-29 01:47:06,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 2459. [2023-11-29 01:47:06,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2459 states, 1902 states have (on average 1.35068349106204) internal successors, (2569), 1937 states have internal predecessors, (2569), 284 states have call successors, (284), 220 states have call predecessors, (284), 271 states have return successors, (384), 306 states have call predecessors, (384), 282 states have call successors, (384) [2023-11-29 01:47:06,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 3237 transitions. [2023-11-29 01:47:06,450 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 3237 transitions. Word has length 61 [2023-11-29 01:47:06,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:47:06,450 INFO L495 AbstractCegarLoop]: Abstraction has 2459 states and 3237 transitions. [2023-11-29 01:47:06,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-29 01:47:06,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 3237 transitions. [2023-11-29 01:47:06,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-29 01:47:06,451 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:47:06,451 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] [2023-11-29 01:47:06,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 01:47:06,452 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:47:06,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:47:06,452 INFO L85 PathProgramCache]: Analyzing trace with hash 250239433, now seen corresponding path program 1 times [2023-11-29 01:47:06,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:47:06,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514775667] [2023-11-29 01:47:06,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:06,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:47:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:06,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:47:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:06,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:47:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:06,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:47:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:06,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 01:47:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:06,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:47:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:06,553 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-29 01:47:06,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:47:06,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514775667] [2023-11-29 01:47:06,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514775667] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:47:06,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:47:06,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:47:06,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764516037] [2023-11-29 01:47:06,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:47:06,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:47:06,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:47:06,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:47:06,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:47:06,555 INFO L87 Difference]: Start difference. First operand 2459 states and 3237 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-29 01:47:07,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:47:07,671 INFO L93 Difference]: Finished difference Result 3693 states and 5100 transitions. [2023-11-29 01:47:07,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 01:47:07,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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 61 [2023-11-29 01:47:07,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:47:07,689 INFO L225 Difference]: With dead ends: 3693 [2023-11-29 01:47:07,689 INFO L226 Difference]: Without dead ends: 3174 [2023-11-29 01:47:07,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-11-29 01:47:07,693 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 635 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:47:07,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 870 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 01:47:07,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3174 states. [2023-11-29 01:47:07,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3174 to 2840. [2023-11-29 01:47:07,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2840 states, 2217 states have (on average 1.3716734325665314) internal successors, (3041), 2256 states have internal predecessors, (3041), 322 states have call successors, (322), 244 states have call predecessors, (322), 299 states have return successors, (444), 348 states have call predecessors, (444), 320 states have call successors, (444) [2023-11-29 01:47:07,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 3807 transitions. [2023-11-29 01:47:07,959 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 3807 transitions. Word has length 61 [2023-11-29 01:47:07,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:47:07,960 INFO L495 AbstractCegarLoop]: Abstraction has 2840 states and 3807 transitions. [2023-11-29 01:47:07,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-29 01:47:07,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 3807 transitions. [2023-11-29 01:47:07,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-29 01:47:07,962 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:47:07,962 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] [2023-11-29 01:47:07,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 01:47:07,963 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:47:07,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:47:07,963 INFO L85 PathProgramCache]: Analyzing trace with hash -2116455161, now seen corresponding path program 1 times [2023-11-29 01:47:07,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:47:07,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792347529] [2023-11-29 01:47:07,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:07,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:47:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:08,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:47:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:08,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:47:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:08,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:47:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:08,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 01:47:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:08,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:47:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:08,069 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-29 01:47:08,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:47:08,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792347529] [2023-11-29 01:47:08,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792347529] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:47:08,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:47:08,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:47:08,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433061481] [2023-11-29 01:47:08,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:47:08,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:47:08,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:47:08,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:47:08,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:47:08,071 INFO L87 Difference]: Start difference. First operand 2840 states and 3807 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-29 01:47:08,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:47:08,898 INFO L93 Difference]: Finished difference Result 3953 states and 5505 transitions. [2023-11-29 01:47:08,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 01:47:08,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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 61 [2023-11-29 01:47:08,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:47:08,915 INFO L225 Difference]: With dead ends: 3953 [2023-11-29 01:47:08,915 INFO L226 Difference]: Without dead ends: 3053 [2023-11-29 01:47:08,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 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-29 01:47:08,920 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 589 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:47:08,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 456 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 01:47:08,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3053 states. [2023-11-29 01:47:09,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3053 to 2840. [2023-11-29 01:47:09,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2840 states, 2217 states have (on average 1.3676138926477222) internal successors, (3032), 2256 states have internal predecessors, (3032), 322 states have call successors, (322), 244 states have call predecessors, (322), 299 states have return successors, (444), 348 states have call predecessors, (444), 320 states have call successors, (444) [2023-11-29 01:47:09,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 3798 transitions. [2023-11-29 01:47:09,194 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 3798 transitions. Word has length 61 [2023-11-29 01:47:09,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:47:09,195 INFO L495 AbstractCegarLoop]: Abstraction has 2840 states and 3798 transitions. [2023-11-29 01:47:09,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-29 01:47:09,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 3798 transitions. [2023-11-29 01:47:09,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-29 01:47:09,197 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:47:09,197 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] [2023-11-29 01:47:09,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 01:47:09,198 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:47:09,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:47:09,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1222968823, now seen corresponding path program 1 times [2023-11-29 01:47:09,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:47:09,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542679757] [2023-11-29 01:47:09,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:09,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:47:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:09,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:47:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:09,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:47:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:09,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:47:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:09,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 01:47:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:09,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:47:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:09,293 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-29 01:47:09,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:47:09,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542679757] [2023-11-29 01:47:09,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542679757] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:47:09,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:47:09,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:47:09,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741864428] [2023-11-29 01:47:09,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:47:09,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:47:09,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:47:09,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:47:09,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:47:09,295 INFO L87 Difference]: Start difference. First operand 2840 states and 3798 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-29 01:47:10,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:47:10,448 INFO L93 Difference]: Finished difference Result 5117 states and 7254 transitions. [2023-11-29 01:47:10,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 01:47:10,448 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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 61 [2023-11-29 01:47:10,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:47:10,474 INFO L225 Difference]: With dead ends: 5117 [2023-11-29 01:47:10,475 INFO L226 Difference]: Without dead ends: 4218 [2023-11-29 01:47:10,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2023-11-29 01:47:10,480 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 612 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:47:10,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 678 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 01:47:10,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4218 states. [2023-11-29 01:47:10,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4218 to 3735. [2023-11-29 01:47:10,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3735 states, 2958 states have (on average 1.3999323867478026) internal successors, (4141), 3019 states have internal predecessors, (4141), 414 states have call successors, (414), 298 states have call predecessors, (414), 361 states have return successors, (564), 426 states have call predecessors, (564), 412 states have call successors, (564) [2023-11-29 01:47:10,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3735 states to 3735 states and 5119 transitions. [2023-11-29 01:47:10,839 INFO L78 Accepts]: Start accepts. Automaton has 3735 states and 5119 transitions. Word has length 61 [2023-11-29 01:47:10,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:47:10,839 INFO L495 AbstractCegarLoop]: Abstraction has 3735 states and 5119 transitions. [2023-11-29 01:47:10,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-29 01:47:10,840 INFO L276 IsEmpty]: Start isEmpty. Operand 3735 states and 5119 transitions. [2023-11-29 01:47:10,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-29 01:47:10,841 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:47:10,841 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] [2023-11-29 01:47:10,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 01:47:10,841 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:47:10,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:47:10,842 INFO L85 PathProgramCache]: Analyzing trace with hash 700259211, now seen corresponding path program 1 times [2023-11-29 01:47:10,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:47:10,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380702895] [2023-11-29 01:47:10,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:10,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:47:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:10,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:47:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:10,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:47:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:10,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:47:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:10,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 01:47:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:10,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:47:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:10,961 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-29 01:47:10,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:47:10,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380702895] [2023-11-29 01:47:10,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380702895] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:47:10,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:47:10,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:47:10,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638089106] [2023-11-29 01:47:10,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:47:10,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:47:10,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:47:10,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:47:10,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:47:10,963 INFO L87 Difference]: Start difference. First operand 3735 states and 5119 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-29 01:47:12,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:47:12,475 INFO L93 Difference]: Finished difference Result 7166 states and 10337 transitions. [2023-11-29 01:47:12,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 01:47:12,476 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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 61 [2023-11-29 01:47:12,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:47:12,496 INFO L225 Difference]: With dead ends: 7166 [2023-11-29 01:47:12,496 INFO L226 Difference]: Without dead ends: 5372 [2023-11-29 01:47:12,506 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-29 01:47:12,507 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 1298 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1315 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:47:12,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1315 Valid, 728 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 01:47:12,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5372 states. [2023-11-29 01:47:12,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5372 to 4670. [2023-11-29 01:47:12,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4670 states, 3735 states have (on average 1.4008032128514056) internal successors, (5232), 3805 states have internal predecessors, (5232), 506 states have call successors, (506), 356 states have call predecessors, (506), 427 states have return successors, (743), 517 states have call predecessors, (743), 504 states have call successors, (743) [2023-11-29 01:47:12,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4670 states to 4670 states and 6481 transitions. [2023-11-29 01:47:12,919 INFO L78 Accepts]: Start accepts. Automaton has 4670 states and 6481 transitions. Word has length 61 [2023-11-29 01:47:12,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:47:12,919 INFO L495 AbstractCegarLoop]: Abstraction has 4670 states and 6481 transitions. [2023-11-29 01:47:12,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-29 01:47:12,920 INFO L276 IsEmpty]: Start isEmpty. Operand 4670 states and 6481 transitions. [2023-11-29 01:47:12,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-29 01:47:12,921 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:47:12,921 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-29 01:47:12,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 01:47:12,922 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:47:12,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:47:12,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1574279004, now seen corresponding path program 1 times [2023-11-29 01:47:12,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:47:12,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602495867] [2023-11-29 01:47:12,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:12,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:47:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:12,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:47:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:12,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:47:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:12,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:47:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:12,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:47:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:12,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:47:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:12,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:47:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:12,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:47:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:12,992 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-29 01:47:12,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:47:12,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602495867] [2023-11-29 01:47:12,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602495867] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:47:12,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:47:12,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:47:12,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478796657] [2023-11-29 01:47:12,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:47:12,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:47:12,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:47:12,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:47:12,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:47:12,995 INFO L87 Difference]: Start difference. First operand 4670 states and 6481 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-29 01:47:13,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:47:13,854 INFO L93 Difference]: Finished difference Result 7013 states and 9429 transitions. [2023-11-29 01:47:13,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 01:47:13,855 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-29 01:47:13,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:47:13,873 INFO L225 Difference]: With dead ends: 7013 [2023-11-29 01:47:13,873 INFO L226 Difference]: Without dead ends: 5089 [2023-11-29 01:47:13,878 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-29 01:47:13,878 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 530 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:47:13,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 573 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 01:47:13,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5089 states. [2023-11-29 01:47:14,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5089 to 4846. [2023-11-29 01:47:14,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4846 states, 3872 states have (on average 1.3948863636363635) internal successors, (5401), 3944 states have internal predecessors, (5401), 525 states have call successors, (525), 373 states have call predecessors, (525), 447 states have return successors, (765), 537 states have call predecessors, (765), 523 states have call successors, (765) [2023-11-29 01:47:14,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4846 states to 4846 states and 6691 transitions. [2023-11-29 01:47:14,291 INFO L78 Accepts]: Start accepts. Automaton has 4846 states and 6691 transitions. Word has length 66 [2023-11-29 01:47:14,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:47:14,292 INFO L495 AbstractCegarLoop]: Abstraction has 4846 states and 6691 transitions. [2023-11-29 01:47:14,292 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-29 01:47:14,292 INFO L276 IsEmpty]: Start isEmpty. Operand 4846 states and 6691 transitions. [2023-11-29 01:47:14,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-29 01:47:14,294 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:47:14,294 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] [2023-11-29 01:47:14,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 01:47:14,295 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:47:14,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:47:14,295 INFO L85 PathProgramCache]: Analyzing trace with hash -2074207797, now seen corresponding path program 1 times [2023-11-29 01:47:14,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:47:14,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062087517] [2023-11-29 01:47:14,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:14,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:47:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:14,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:47:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:14,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:47:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:14,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:47:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:14,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:47:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:14,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:47:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:14,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:47:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:14,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:47:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:14,383 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-29 01:47:14,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:47:14,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062087517] [2023-11-29 01:47:14,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062087517] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:47:14,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:47:14,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:47:14,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346048576] [2023-11-29 01:47:14,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:47:14,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:47:14,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:47:14,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:47:14,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:47:14,386 INFO L87 Difference]: Start difference. First operand 4846 states and 6691 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 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-29 01:47:15,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:47:15,464 INFO L93 Difference]: Finished difference Result 5690 states and 7719 transitions. [2023-11-29 01:47:15,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:47:15,465 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 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 67 [2023-11-29 01:47:15,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:47:15,481 INFO L225 Difference]: With dead ends: 5690 [2023-11-29 01:47:15,481 INFO L226 Difference]: Without dead ends: 5687 [2023-11-29 01:47:15,483 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-29 01:47:15,483 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 819 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:47:15,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 550 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 01:47:15,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5687 states. [2023-11-29 01:47:15,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5687 to 5124. [2023-11-29 01:47:15,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5124 states, 4079 states have (on average 1.3868595243932336) internal successors, (5657), 4154 states have internal predecessors, (5657), 557 states have call successors, (557), 401 states have call predecessors, (557), 486 states have return successors, (816), 577 states have call predecessors, (816), 556 states have call successors, (816) [2023-11-29 01:47:15,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5124 states to 5124 states and 7030 transitions. [2023-11-29 01:47:15,887 INFO L78 Accepts]: Start accepts. Automaton has 5124 states and 7030 transitions. Word has length 67 [2023-11-29 01:47:15,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:47:15,887 INFO L495 AbstractCegarLoop]: Abstraction has 5124 states and 7030 transitions. [2023-11-29 01:47:15,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 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-29 01:47:15,888 INFO L276 IsEmpty]: Start isEmpty. Operand 5124 states and 7030 transitions. [2023-11-29 01:47:15,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-29 01:47:15,890 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:47:15,890 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] [2023-11-29 01:47:15,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 01:47:15,891 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:47:15,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:47:15,891 INFO L85 PathProgramCache]: Analyzing trace with hash 123364814, now seen corresponding path program 1 times [2023-11-29 01:47:15,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:47:15,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850695655] [2023-11-29 01:47:15,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:15,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:47:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:15,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:47:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:16,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:47:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:16,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:47:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:16,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:47:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:16,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:47:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:16,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:47:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:16,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:47:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:16,038 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-29 01:47:16,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:47:16,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850695655] [2023-11-29 01:47:16,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850695655] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:47:16,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264192819] [2023-11-29 01:47:16,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:16,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:47:16,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:47:16,048 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:47:16,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 01:47:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:16,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 01:47:16,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:47:16,416 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-29 01:47:16,416 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:47:16,494 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-29 01:47:16,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264192819] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:47:16,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:47:16,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2023-11-29 01:47:16,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583135773] [2023-11-29 01:47:16,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:47:16,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 01:47:16,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:47:16,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 01:47:16,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:47:16,497 INFO L87 Difference]: Start difference. First operand 5124 states and 7030 transitions. Second operand has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 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-29 01:47:18,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:47:18,665 INFO L93 Difference]: Finished difference Result 8297 states and 10939 transitions. [2023-11-29 01:47:18,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 01:47:18,665 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 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 68 [2023-11-29 01:47:18,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:47:18,684 INFO L225 Difference]: With dead ends: 8297 [2023-11-29 01:47:18,684 INFO L226 Difference]: Without dead ends: 8294 [2023-11-29 01:47:18,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 164 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-29 01:47:18,687 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 999 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:47:18,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1055 Valid, 1125 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1344 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 01:47:18,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8294 states. [2023-11-29 01:47:19,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8294 to 7452. [2023-11-29 01:47:19,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7452 states, 5845 states have (on average 1.3536355859709153) internal successors, (7912), 5947 states have internal predecessors, (7912), 828 states have call successors, (828), 636 states have call predecessors, (828), 777 states have return successors, (1188), 877 states have call predecessors, (1188), 827 states have call successors, (1188) [2023-11-29 01:47:19,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7452 states to 7452 states and 9928 transitions. [2023-11-29 01:47:19,447 INFO L78 Accepts]: Start accepts. Automaton has 7452 states and 9928 transitions. Word has length 68 [2023-11-29 01:47:19,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:47:19,447 INFO L495 AbstractCegarLoop]: Abstraction has 7452 states and 9928 transitions. [2023-11-29 01:47:19,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 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-29 01:47:19,448 INFO L276 IsEmpty]: Start isEmpty. Operand 7452 states and 9928 transitions. [2023-11-29 01:47:19,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-29 01:47:19,451 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:47:19,451 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] [2023-11-29 01:47:19,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 01:47:19,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 01:47:19,652 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:47:19,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:47:19,652 INFO L85 PathProgramCache]: Analyzing trace with hash 2067840267, now seen corresponding path program 2 times [2023-11-29 01:47:19,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:47:19,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166088350] [2023-11-29 01:47:19,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:19,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:47:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:19,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:47:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:19,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:47:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:19,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:47:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:19,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:47:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:19,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:47:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:19,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:47:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:19,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:47:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:19,714 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-29 01:47:19,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:47:19,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166088350] [2023-11-29 01:47:19,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166088350] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:47:19,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:47:19,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:47:19,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138236776] [2023-11-29 01:47:19,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:47:19,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:47:19,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:47:19,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:47:19,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:47:19,716 INFO L87 Difference]: Start difference. First operand 7452 states and 9928 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 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-29 01:47:20,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:47:20,745 INFO L93 Difference]: Finished difference Result 9627 states and 12648 transitions. [2023-11-29 01:47:20,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 01:47:20,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 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 71 [2023-11-29 01:47:20,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:47:20,757 INFO L225 Difference]: With dead ends: 9627 [2023-11-29 01:47:20,757 INFO L226 Difference]: Without dead ends: 5386 [2023-11-29 01:47:20,764 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-29 01:47:20,765 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 485 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:47:20,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 608 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 01:47:20,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5386 states. [2023-11-29 01:47:21,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5386 to 4754. [2023-11-29 01:47:21,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4754 states, 3813 states have (on average 1.3815892997639654) internal successors, (5268), 3877 states have internal predecessors, (5268), 513 states have call successors, (513), 367 states have call predecessors, (513), 426 states have return successors, (731), 518 states have call predecessors, (731), 512 states have call successors, (731) [2023-11-29 01:47:21,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4754 states to 4754 states and 6512 transitions. [2023-11-29 01:47:21,306 INFO L78 Accepts]: Start accepts. Automaton has 4754 states and 6512 transitions. Word has length 71 [2023-11-29 01:47:21,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:47:21,307 INFO L495 AbstractCegarLoop]: Abstraction has 4754 states and 6512 transitions. [2023-11-29 01:47:21,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 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-29 01:47:21,307 INFO L276 IsEmpty]: Start isEmpty. Operand 4754 states and 6512 transitions. [2023-11-29 01:47:21,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-29 01:47:21,310 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:47:21,310 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 01:47:21,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 01:47:21,311 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:47:21,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:47:21,311 INFO L85 PathProgramCache]: Analyzing trace with hash -963374144, now seen corresponding path program 1 times [2023-11-29 01:47:21,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:47:21,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890481735] [2023-11-29 01:47:21,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:21,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:47:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:21,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:47:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:21,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:47:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:21,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:47:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:21,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:47:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:21,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:47:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:21,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:47:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:21,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:47:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:21,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 01:47:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:21,443 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 01:47:21,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:47:21,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890481735] [2023-11-29 01:47:21,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890481735] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:47:21,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:47:21,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:47:21,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125984331] [2023-11-29 01:47:21,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:47:21,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:47:21,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:47:21,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:47:21,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:47:21,446 INFO L87 Difference]: Start difference. First operand 4754 states and 6512 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 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-29 01:47:22,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:47:22,919 INFO L93 Difference]: Finished difference Result 8866 states and 11578 transitions. [2023-11-29 01:47:22,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 01:47:22,919 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 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 76 [2023-11-29 01:47:22,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:47:22,930 INFO L225 Difference]: With dead ends: 8866 [2023-11-29 01:47:22,930 INFO L226 Difference]: Without dead ends: 6280 [2023-11-29 01:47:22,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2023-11-29 01:47:22,936 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 847 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:47:22,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 835 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 01:47:22,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6280 states. [2023-11-29 01:47:23,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6280 to 6035. [2023-11-29 01:47:23,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6035 states, 4766 states have (on average 1.344313890054553) internal successors, (6407), 4860 states have internal predecessors, (6407), 663 states have call successors, (663), 495 states have call predecessors, (663), 604 states have return successors, (992), 688 states have call predecessors, (992), 662 states have call successors, (992) [2023-11-29 01:47:23,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6035 states to 6035 states and 8062 transitions. [2023-11-29 01:47:23,572 INFO L78 Accepts]: Start accepts. Automaton has 6035 states and 8062 transitions. Word has length 76 [2023-11-29 01:47:23,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:47:23,572 INFO L495 AbstractCegarLoop]: Abstraction has 6035 states and 8062 transitions. [2023-11-29 01:47:23,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 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-29 01:47:23,572 INFO L276 IsEmpty]: Start isEmpty. Operand 6035 states and 8062 transitions. [2023-11-29 01:47:23,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 01:47:23,575 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:47:23,575 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:47:23,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 01:47:23,576 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:47:23,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:47:23,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1927183056, now seen corresponding path program 1 times [2023-11-29 01:47:23,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:47:23,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108058928] [2023-11-29 01:47:23,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:23,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:47:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:23,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:47:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:23,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:47:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:23,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:47:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:23,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:47:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:23,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:47:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:23,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:47:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:23,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:47:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:23,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 01:47:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:23,681 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 01:47:23,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:47:23,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108058928] [2023-11-29 01:47:23,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108058928] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:47:23,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:47:23,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 01:47:23,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114693238] [2023-11-29 01:47:23,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:47:23,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 01:47:23,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:47:23,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 01:47:23,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:47:23,683 INFO L87 Difference]: Start difference. First operand 6035 states and 8062 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 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-29 01:47:25,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:47:25,069 INFO L93 Difference]: Finished difference Result 8473 states and 11056 transitions. [2023-11-29 01:47:25,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 01:47:25,070 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 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 86 [2023-11-29 01:47:25,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:47:25,083 INFO L225 Difference]: With dead ends: 8473 [2023-11-29 01:47:25,083 INFO L226 Difference]: Without dead ends: 5546 [2023-11-29 01:47:25,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2023-11-29 01:47:25,091 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 1299 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1330 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:47:25,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1330 Valid, 838 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 01:47:25,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5546 states. [2023-11-29 01:47:25,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5546 to 5180. [2023-11-29 01:47:25,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5180 states, 4108 states have (on average 1.3522395326192795) internal successors, (5555), 4191 states have internal predecessors, (5555), 563 states have call successors, (563), 408 states have call predecessors, (563), 507 states have return successors, (828), 589 states have call predecessors, (828), 562 states have call successors, (828) [2023-11-29 01:47:25,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5180 states to 5180 states and 6946 transitions. [2023-11-29 01:47:25,615 INFO L78 Accepts]: Start accepts. Automaton has 5180 states and 6946 transitions. Word has length 86 [2023-11-29 01:47:25,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:47:25,616 INFO L495 AbstractCegarLoop]: Abstraction has 5180 states and 6946 transitions. [2023-11-29 01:47:25,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 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-29 01:47:25,616 INFO L276 IsEmpty]: Start isEmpty. Operand 5180 states and 6946 transitions. [2023-11-29 01:47:25,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-29 01:47:25,621 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:47:25,621 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, 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] [2023-11-29 01:47:25,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 01:47:25,621 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:47:25,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:47:25,622 INFO L85 PathProgramCache]: Analyzing trace with hash 952142814, now seen corresponding path program 1 times [2023-11-29 01:47:25,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:47:25,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977524986] [2023-11-29 01:47:25,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:25,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:47:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:25,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:47:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:25,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:47:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:25,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:47:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:25,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 01:47:25,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:25,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:47:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:25,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 01:47:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:25,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:47:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:25,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:47:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 01:47:25,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:47:25,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977524986] [2023-11-29 01:47:25,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977524986] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:47:25,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031082273] [2023-11-29 01:47:25,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:25,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:47:25,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:47:25,719 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:47:25,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 01:47:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:25,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:47:25,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:47:25,860 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-29 01:47:25,860 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:47:25,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031082273] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:47:25,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:47:25,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 01:47:25,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336963494] [2023-11-29 01:47:25,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:47:25,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:47:25,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:47:25,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:47:25,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:47:25,862 INFO L87 Difference]: Start difference. First operand 5180 states and 6946 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-29 01:47:26,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:47:26,474 INFO L93 Difference]: Finished difference Result 8096 states and 11428 transitions. [2023-11-29 01:47:26,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:47:26,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 99 [2023-11-29 01:47:26,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:47:26,492 INFO L225 Difference]: With dead ends: 8096 [2023-11-29 01:47:26,493 INFO L226 Difference]: Without dead ends: 6586 [2023-11-29 01:47:26,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:47:26,500 INFO L413 NwaCegarLoop]: 399 mSDtfsCounter, 133 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:47:26,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 665 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:47:26,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6586 states. [2023-11-29 01:47:27,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6586 to 6581. [2023-11-29 01:47:27,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6581 states, 5267 states have (on average 1.3740269603189672) internal successors, (7237), 5362 states have internal predecessors, (7237), 703 states have call successors, (703), 496 states have call predecessors, (703), 609 states have return successors, (1148), 731 states have call predecessors, (1148), 702 states have call successors, (1148) [2023-11-29 01:47:27,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6581 states to 6581 states and 9088 transitions. [2023-11-29 01:47:27,074 INFO L78 Accepts]: Start accepts. Automaton has 6581 states and 9088 transitions. Word has length 99 [2023-11-29 01:47:27,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:47:27,075 INFO L495 AbstractCegarLoop]: Abstraction has 6581 states and 9088 transitions. [2023-11-29 01:47:27,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-29 01:47:27,075 INFO L276 IsEmpty]: Start isEmpty. Operand 6581 states and 9088 transitions. [2023-11-29 01:47:27,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-29 01:47:27,081 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:47:27,081 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:47:27,086 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 01:47:27,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:47:27,282 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:47:27,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:47:27,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1291156472, now seen corresponding path program 1 times [2023-11-29 01:47:27,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:47:27,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880161286] [2023-11-29 01:47:27,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:27,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:47:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:27,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:47:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:27,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:47:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:27,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:47:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:27,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:47:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:27,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:47:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:27,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:47:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:27,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:47:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:27,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 01:47:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:27,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 01:47:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:27,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 01:47:27,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:27,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 01:47:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:27,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:47:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:27,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:47:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:27,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 01:47:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:27,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-29 01:47:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:27,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 01:47:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:27,427 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-11-29 01:47:27,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:47:27,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880161286] [2023-11-29 01:47:27,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880161286] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:47:27,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946792219] [2023-11-29 01:47:27,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:27,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:47:27,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:47:27,429 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:47:27,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 01:47:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:27,541 INFO L262 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 01:47:27,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:47:27,587 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 01:47:27,587 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:47:27,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946792219] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:47:27,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:47:27,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2023-11-29 01:47:27,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729070035] [2023-11-29 01:47:27,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:47:27,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:47:27,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:47:27,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:47:27,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-11-29 01:47:27,590 INFO L87 Difference]: Start difference. First operand 6581 states and 9088 transitions. Second operand has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-29 01:47:28,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:47:28,095 INFO L93 Difference]: Finished difference Result 7929 states and 10742 transitions. [2023-11-29 01:47:28,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 01:47:28,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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 131 [2023-11-29 01:47:28,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:47:28,106 INFO L225 Difference]: With dead ends: 7929 [2023-11-29 01:47:28,106 INFO L226 Difference]: Without dead ends: 5496 [2023-11-29 01:47:28,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 159 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-29 01:47:28,111 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 32 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:47:28,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1319 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:47:28,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5496 states. [2023-11-29 01:47:28,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5496 to 5398. [2023-11-29 01:47:28,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5398 states, 4423 states have (on average 1.4031200542618132) internal successors, (6206), 4487 states have internal predecessors, (6206), 545 states have call successors, (545), 355 states have call predecessors, (545), 428 states have return successors, (927), 563 states have call predecessors, (927), 544 states have call successors, (927) [2023-11-29 01:47:28,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5398 states to 5398 states and 7678 transitions. [2023-11-29 01:47:28,496 INFO L78 Accepts]: Start accepts. Automaton has 5398 states and 7678 transitions. Word has length 131 [2023-11-29 01:47:28,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:47:28,497 INFO L495 AbstractCegarLoop]: Abstraction has 5398 states and 7678 transitions. [2023-11-29 01:47:28,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-29 01:47:28,497 INFO L276 IsEmpty]: Start isEmpty. Operand 5398 states and 7678 transitions. [2023-11-29 01:47:28,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-29 01:47:28,503 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:47:28,503 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2023-11-29 01:47:28,508 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 01:47:28,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:47:28,704 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:47:28,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:47:28,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1855357641, now seen corresponding path program 1 times [2023-11-29 01:47:28,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:47:28,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348351407] [2023-11-29 01:47:28,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:28,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:47:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:28,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:47:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:28,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:47:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:28,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:47:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:28,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 01:47:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:28,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:47:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:28,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 01:47:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:28,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:47:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:28,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 01:47:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:28,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:47:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:28,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 01:47:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:28,826 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-29 01:47:28,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:47:28,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348351407] [2023-11-29 01:47:28,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348351407] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:47:28,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962350268] [2023-11-29 01:47:28,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:28,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:47:28,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:47:28,828 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:47:28,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 01:47:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:28,946 INFO L262 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:47:28,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:47:29,075 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-29 01:47:29,075 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:47:29,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962350268] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:47:29,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:47:29,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-11-29 01:47:29,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251280045] [2023-11-29 01:47:29,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:47:29,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:47:29,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:47:29,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:47:29,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:47:29,077 INFO L87 Difference]: Start difference. First operand 5398 states and 7678 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 01:47:29,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:47:29,607 INFO L93 Difference]: Finished difference Result 10217 states and 15024 transitions. [2023-11-29 01:47:29,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:47:29,607 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 127 [2023-11-29 01:47:29,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:47:29,628 INFO L225 Difference]: With dead ends: 10217 [2023-11-29 01:47:29,629 INFO L226 Difference]: Without dead ends: 7306 [2023-11-29 01:47:29,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:47:29,641 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 208 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:47:29,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 406 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:47:29,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2023-11-29 01:47:30,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7270. [2023-11-29 01:47:30,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7270 states, 5981 states have (on average 1.416652733656579) internal successors, (8473), 6066 states have internal predecessors, (8473), 727 states have call successors, (727), 471 states have call predecessors, (727), 560 states have return successors, (1216), 740 states have call predecessors, (1216), 726 states have call successors, (1216) [2023-11-29 01:47:30,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7270 states to 7270 states and 10416 transitions. [2023-11-29 01:47:30,485 INFO L78 Accepts]: Start accepts. Automaton has 7270 states and 10416 transitions. Word has length 127 [2023-11-29 01:47:30,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:47:30,485 INFO L495 AbstractCegarLoop]: Abstraction has 7270 states and 10416 transitions. [2023-11-29 01:47:30,485 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 01:47:30,485 INFO L276 IsEmpty]: Start isEmpty. Operand 7270 states and 10416 transitions. [2023-11-29 01:47:30,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-29 01:47:30,492 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:47:30,492 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:47:30,496 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 01:47:30,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:47:30,693 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:47:30,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:47:30,693 INFO L85 PathProgramCache]: Analyzing trace with hash 668138680, now seen corresponding path program 1 times [2023-11-29 01:47:30,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:47:30,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379257112] [2023-11-29 01:47:30,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:30,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:47:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:30,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:47:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:30,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:47:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:30,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:47:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:30,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 01:47:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:30,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:47:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:30,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 01:47:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:30,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:47:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:30,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 01:47:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:30,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:47:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:30,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 01:47:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-29 01:47:30,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:47:30,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379257112] [2023-11-29 01:47:30,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379257112] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:47:30,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239361135] [2023-11-29 01:47:30,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:30,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:47:30,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:47:30,786 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:47:30,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 01:47:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:30,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:47:30,895 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:47:30,993 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-29 01:47:30,994 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:47:30,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239361135] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:47:30,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:47:30,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-11-29 01:47:30,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214466145] [2023-11-29 01:47:30,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:47:30,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:47:30,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:47:30,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:47:30,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:47:30,996 INFO L87 Difference]: Start difference. First operand 7270 states and 10416 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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-29 01:47:31,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:47:31,871 INFO L93 Difference]: Finished difference Result 18920 states and 27991 transitions. [2023-11-29 01:47:31,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:47:31,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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 127 [2023-11-29 01:47:31,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:47:31,906 INFO L225 Difference]: With dead ends: 18920 [2023-11-29 01:47:31,906 INFO L226 Difference]: Without dead ends: 12918 [2023-11-29 01:47:31,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:47:31,921 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 211 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:47:31,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 405 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:47:31,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12918 states. [2023-11-29 01:47:32,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12918 to 12853. [2023-11-29 01:47:32,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12853 states, 10598 states have (on average 1.42668428005284) internal successors, (15120), 10755 states have internal predecessors, (15120), 1277 states have call successors, (1277), 830 states have call predecessors, (1277), 976 states have return successors, (2124), 1275 states have call predecessors, (2124), 1276 states have call successors, (2124) [2023-11-29 01:47:32,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12853 states to 12853 states and 18521 transitions. [2023-11-29 01:47:32,821 INFO L78 Accepts]: Start accepts. Automaton has 12853 states and 18521 transitions. Word has length 127 [2023-11-29 01:47:32,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:47:32,821 INFO L495 AbstractCegarLoop]: Abstraction has 12853 states and 18521 transitions. [2023-11-29 01:47:32,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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-29 01:47:32,821 INFO L276 IsEmpty]: Start isEmpty. Operand 12853 states and 18521 transitions. [2023-11-29 01:47:32,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-29 01:47:32,835 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:47:32,835 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:47:32,840 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 01:47:33,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:47:33,036 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:47:33,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:47:33,036 INFO L85 PathProgramCache]: Analyzing trace with hash -506822965, now seen corresponding path program 1 times [2023-11-29 01:47:33,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:47:33,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640840225] [2023-11-29 01:47:33,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:33,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:47:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:33,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:47:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:33,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:47:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:33,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:47:33,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:33,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:47:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:33,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:47:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:33,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:47:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:33,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:47:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:33,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 01:47:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:33,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 01:47:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:33,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 01:47:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:33,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 01:47:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:33,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:47:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:33,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:47:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:33,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 01:47:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:33,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 01:47:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:33,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 01:47:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:33,143 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-29 01:47:33,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:47:33,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640840225] [2023-11-29 01:47:33,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640840225] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:47:33,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:47:33,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:47:33,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514884300] [2023-11-29 01:47:33,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:47:33,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:47:33,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:47:33,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:47:33,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:47:33,145 INFO L87 Difference]: Start difference. First operand 12853 states and 18521 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 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-29 01:47:34,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:47:34,482 INFO L93 Difference]: Finished difference Result 14008 states and 19909 transitions. [2023-11-29 01:47:34,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 01:47:34,483 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 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 145 [2023-11-29 01:47:34,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:47:34,512 INFO L225 Difference]: With dead ends: 14008 [2023-11-29 01:47:34,512 INFO L226 Difference]: Without dead ends: 12846 [2023-11-29 01:47:34,519 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-29 01:47:34,519 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 373 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:47:34,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 697 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 01:47:34,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12846 states. [2023-11-29 01:47:35,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12846 to 12761. [2023-11-29 01:47:35,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12761 states, 10528 states have (on average 1.4282864741641337) internal successors, (15037), 10685 states have internal predecessors, (15037), 1266 states have call successors, (1266), 821 states have call predecessors, (1266), 965 states have return successors, (2108), 1262 states have call predecessors, (2108), 1265 states have call successors, (2108) [2023-11-29 01:47:35,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12761 states to 12761 states and 18411 transitions. [2023-11-29 01:47:35,579 INFO L78 Accepts]: Start accepts. Automaton has 12761 states and 18411 transitions. Word has length 145 [2023-11-29 01:47:35,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:47:35,580 INFO L495 AbstractCegarLoop]: Abstraction has 12761 states and 18411 transitions. [2023-11-29 01:47:35,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 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-29 01:47:35,580 INFO L276 IsEmpty]: Start isEmpty. Operand 12761 states and 18411 transitions. [2023-11-29 01:47:35,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-29 01:47:35,594 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:47:35,594 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:47:35,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 01:47:35,595 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:47:35,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:47:35,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1362634231, now seen corresponding path program 1 times [2023-11-29 01:47:35,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:47:35,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206268587] [2023-11-29 01:47:35,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:35,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:47:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:35,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:47:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:35,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:47:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:35,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:47:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:35,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:47:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:35,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:47:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:35,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:47:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:35,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:47:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:35,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 01:47:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:35,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 01:47:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:35,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 01:47:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:35,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:47:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:35,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:47:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:35,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:47:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:35,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 01:47:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:35,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-29 01:47:35,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:35,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-29 01:47:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:35,783 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-11-29 01:47:35,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:47:35,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206268587] [2023-11-29 01:47:35,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206268587] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:47:35,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094715435] [2023-11-29 01:47:35,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:35,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:47:35,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:47:35,784 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:47:35,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 01:47:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:35,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 01:47:35,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:47:36,057 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-29 01:47:36,058 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:47:36,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094715435] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:47:36,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:47:36,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2023-11-29 01:47:36,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955065492] [2023-11-29 01:47:36,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:47:36,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:47:36,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:47:36,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:47:36,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-11-29 01:47:36,060 INFO L87 Difference]: Start difference. First operand 12761 states and 18411 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 01:47:37,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:47:37,326 INFO L93 Difference]: Finished difference Result 14898 states and 21032 transitions. [2023-11-29 01:47:37,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:47:37,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 147 [2023-11-29 01:47:37,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:47:37,356 INFO L225 Difference]: With dead ends: 14898 [2023-11-29 01:47:37,356 INFO L226 Difference]: Without dead ends: 13616 [2023-11-29 01:47:37,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-11-29 01:47:37,364 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 165 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:47:37,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 421 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 01:47:37,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13616 states. [2023-11-29 01:47:38,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13616 to 13577. [2023-11-29 01:47:38,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13577 states, 11192 states have (on average 1.41234810578985) internal successors, (15807), 11354 states have internal predecessors, (15807), 1340 states have call successors, (1340), 876 states have call predecessors, (1340), 1043 states have return successors, (2224), 1354 states have call predecessors, (2224), 1339 states have call successors, (2224) [2023-11-29 01:47:38,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13577 states to 13577 states and 19371 transitions. [2023-11-29 01:47:38,365 INFO L78 Accepts]: Start accepts. Automaton has 13577 states and 19371 transitions. Word has length 147 [2023-11-29 01:47:38,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:47:38,365 INFO L495 AbstractCegarLoop]: Abstraction has 13577 states and 19371 transitions. [2023-11-29 01:47:38,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 01:47:38,365 INFO L276 IsEmpty]: Start isEmpty. Operand 13577 states and 19371 transitions. [2023-11-29 01:47:38,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-11-29 01:47:38,381 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:47:38,381 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:47:38,385 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 01:47:38,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:47:38,582 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:47:38,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:47:38,582 INFO L85 PathProgramCache]: Analyzing trace with hash -2111036548, now seen corresponding path program 1 times [2023-11-29 01:47:38,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:47:38,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187616388] [2023-11-29 01:47:38,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:38,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:47:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:38,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:47:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:38,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:47:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:38,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:47:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:38,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 01:47:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:38,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:47:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:38,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 01:47:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:38,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 01:47:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:38,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:47:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:38,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 01:47:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:38,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:47:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:38,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 01:47:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:38,685 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 01:47:38,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:47:38,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187616388] [2023-11-29 01:47:38,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187616388] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:47:38,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849961638] [2023-11-29 01:47:38,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:38,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:47:38,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:47:38,686 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:47:38,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 01:47:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:38,812 INFO L262 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:47:38,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:47:38,894 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-29 01:47:38,894 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:47:38,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849961638] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:47:38,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:47:38,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 01:47:38,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887400247] [2023-11-29 01:47:38,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:47:38,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:47:38,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:47:38,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:47:38,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:47:38,896 INFO L87 Difference]: Start difference. First operand 13577 states and 19371 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-29 01:47:39,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:47:39,864 INFO L93 Difference]: Finished difference Result 23668 states and 34406 transitions. [2023-11-29 01:47:39,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:47:39,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 143 [2023-11-29 01:47:39,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:47:39,890 INFO L225 Difference]: With dead ends: 23668 [2023-11-29 01:47:39,890 INFO L226 Difference]: Without dead ends: 13126 [2023-11-29 01:47:39,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:47:39,910 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 230 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:47:39,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 291 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:47:39,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13126 states. [2023-11-29 01:47:40,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13126 to 10573. [2023-11-29 01:47:40,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10573 states, 8733 states have (on average 1.3565784953624185) internal successors, (11847), 8831 states have internal predecessors, (11847), 1017 states have call successors, (1017), 706 states have call predecessors, (1017), 821 states have return successors, (1608), 1039 states have call predecessors, (1608), 1016 states have call successors, (1608) [2023-11-29 01:47:40,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10573 states to 10573 states and 14472 transitions. [2023-11-29 01:47:40,985 INFO L78 Accepts]: Start accepts. Automaton has 10573 states and 14472 transitions. Word has length 143 [2023-11-29 01:47:40,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:47:40,985 INFO L495 AbstractCegarLoop]: Abstraction has 10573 states and 14472 transitions. [2023-11-29 01:47:40,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-29 01:47:40,985 INFO L276 IsEmpty]: Start isEmpty. Operand 10573 states and 14472 transitions. [2023-11-29 01:47:40,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-11-29 01:47:40,993 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:47:40,994 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:47:40,998 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 01:47:41,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-29 01:47:41,194 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:47:41,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:47:41,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1070527267, now seen corresponding path program 1 times [2023-11-29 01:47:41,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:47:41,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756876249] [2023-11-29 01:47:41,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:41,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:47:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:41,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:47:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:41,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:47:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:41,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:47:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:41,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 01:47:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:41,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:47:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:41,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 01:47:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:41,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 01:47:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:41,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:47:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:41,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:47:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:41,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:47:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:41,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 01:47:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:41,303 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 01:47:41,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:47:41,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756876249] [2023-11-29 01:47:41,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756876249] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:47:41,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478313653] [2023-11-29 01:47:41,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:41,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:47:41,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:47:41,305 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:47:41,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 01:47:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:41,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:47:41,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:47:41,466 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-29 01:47:41,466 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:47:41,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478313653] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:47:41,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:47:41,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 01:47:41,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687877604] [2023-11-29 01:47:41,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:47:41,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:47:41,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:47:41,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:47:41,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:47:41,468 INFO L87 Difference]: Start difference. First operand 10573 states and 14472 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 01:47:42,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:47:42,375 INFO L93 Difference]: Finished difference Result 19961 states and 27697 transitions. [2023-11-29 01:47:42,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:47:42,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 143 [2023-11-29 01:47:42,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:47:42,393 INFO L225 Difference]: With dead ends: 19961 [2023-11-29 01:47:42,393 INFO L226 Difference]: Without dead ends: 11381 [2023-11-29 01:47:42,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:47:42,403 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 242 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:47:42,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 404 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:47:42,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11381 states. [2023-11-29 01:47:43,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11381 to 11325. [2023-11-29 01:47:43,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11325 states, 9408 states have (on average 1.3296130952380953) internal successors, (12509), 9506 states have internal predecessors, (12509), 1031 states have call successors, (1031), 762 states have call predecessors, (1031), 884 states have return successors, (1748), 1060 states have call predecessors, (1748), 1030 states have call successors, (1748) [2023-11-29 01:47:43,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11325 states to 11325 states and 15288 transitions. [2023-11-29 01:47:43,218 INFO L78 Accepts]: Start accepts. Automaton has 11325 states and 15288 transitions. Word has length 143 [2023-11-29 01:47:43,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:47:43,219 INFO L495 AbstractCegarLoop]: Abstraction has 11325 states and 15288 transitions. [2023-11-29 01:47:43,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 01:47:43,219 INFO L276 IsEmpty]: Start isEmpty. Operand 11325 states and 15288 transitions. [2023-11-29 01:47:43,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-29 01:47:43,225 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:47:43,225 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:47:43,229 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 01:47:43,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-29 01:47:43,425 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:47:43,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:47:43,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1522050028, now seen corresponding path program 1 times [2023-11-29 01:47:43,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:47:43,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178111827] [2023-11-29 01:47:43,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:43,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:47:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:43,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:47:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:43,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:47:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:43,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:47:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:43,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 01:47:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:43,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:47:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:43,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 01:47:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:43,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:47:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:43,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 01:47:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:43,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 01:47:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:43,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:47:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:43,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 01:47:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:43,529 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 01:47:43,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:47:43,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178111827] [2023-11-29 01:47:43,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178111827] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:47:43,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445155740] [2023-11-29 01:47:43,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:43,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:47:43,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:47:43,530 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:47:43,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 01:47:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:43,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:47:43,657 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:47:43,681 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-29 01:47:43,681 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:47:43,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445155740] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:47:43,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:47:43,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 01:47:43,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353724321] [2023-11-29 01:47:43,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:47:43,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:47:43,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:47:43,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:47:43,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:47:43,684 INFO L87 Difference]: Start difference. First operand 11325 states and 15288 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 01:47:45,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:47:45,066 INFO L93 Difference]: Finished difference Result 28687 states and 39680 transitions. [2023-11-29 01:47:45,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:47:45,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 144 [2023-11-29 01:47:45,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:47:45,109 INFO L225 Difference]: With dead ends: 28687 [2023-11-29 01:47:45,109 INFO L226 Difference]: Without dead ends: 19355 [2023-11-29 01:47:45,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:47:45,127 INFO L413 NwaCegarLoop]: 397 mSDtfsCounter, 133 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:47:45,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 660 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:47:45,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19355 states. [2023-11-29 01:47:46,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19355 to 19353. [2023-11-29 01:47:46,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19353 states, 16061 states have (on average 1.3324824108087914) internal successors, (21401), 16240 states have internal predecessors, (21401), 1799 states have call successors, (1799), 1303 states have call predecessors, (1799), 1491 states have return successors, (3342), 1817 states have call predecessors, (3342), 1798 states have call successors, (3342) [2023-11-29 01:47:46,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19353 states to 19353 states and 26542 transitions. [2023-11-29 01:47:46,630 INFO L78 Accepts]: Start accepts. Automaton has 19353 states and 26542 transitions. Word has length 144 [2023-11-29 01:47:46,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:47:46,630 INFO L495 AbstractCegarLoop]: Abstraction has 19353 states and 26542 transitions. [2023-11-29 01:47:46,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 01:47:46,630 INFO L276 IsEmpty]: Start isEmpty. Operand 19353 states and 26542 transitions. [2023-11-29 01:47:46,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-29 01:47:46,645 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:47:46,646 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:47:46,651 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 01:47:46,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:47:46,846 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:47:46,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:47:46,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1796361806, now seen corresponding path program 1 times [2023-11-29 01:47:46,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:47:46,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650194794] [2023-11-29 01:47:46,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:46,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:47:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:46,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:47:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:46,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:47:46,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:46,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:47:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:46,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 01:47:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:46,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:47:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:46,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 01:47:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:46,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:47:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:46,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 01:47:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:46,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:47:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:46,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:47:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:46,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-29 01:47:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:46,953 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-11-29 01:47:46,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:47:46,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650194794] [2023-11-29 01:47:46,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650194794] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:47:46,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108991082] [2023-11-29 01:47:46,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:46,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:47:46,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:47:46,955 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:47:46,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 01:47:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:47,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:47:47,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:47:47,116 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-29 01:47:47,117 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:47:47,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108991082] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:47:47,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:47:47,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 01:47:47,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719497272] [2023-11-29 01:47:47,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:47:47,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:47:47,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:47:47,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:47:47,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:47:47,119 INFO L87 Difference]: Start difference. First operand 19353 states and 26542 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 01:47:48,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:47:48,647 INFO L93 Difference]: Finished difference Result 36793 states and 51627 transitions. [2023-11-29 01:47:48,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:47:48,647 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), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 145 [2023-11-29 01:47:48,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:47:48,681 INFO L225 Difference]: With dead ends: 36793 [2023-11-29 01:47:48,681 INFO L226 Difference]: Without dead ends: 20109 [2023-11-29 01:47:48,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:47:48,700 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 249 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:47:48,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 296 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:47:48,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20109 states. [2023-11-29 01:47:49,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20109 to 18455. [2023-11-29 01:47:50,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18455 states, 15307 states have (on average 1.2964656693016268) internal successors, (19845), 15460 states have internal predecessors, (19845), 1727 states have call successors, (1727), 1243 states have call predecessors, (1727), 1419 states have return successors, (2879), 1755 states have call predecessors, (2879), 1726 states have call successors, (2879) [2023-11-29 01:47:50,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18455 states to 18455 states and 24451 transitions. [2023-11-29 01:47:50,050 INFO L78 Accepts]: Start accepts. Automaton has 18455 states and 24451 transitions. Word has length 145 [2023-11-29 01:47:50,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:47:50,050 INFO L495 AbstractCegarLoop]: Abstraction has 18455 states and 24451 transitions. [2023-11-29 01:47:50,050 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), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 01:47:50,050 INFO L276 IsEmpty]: Start isEmpty. Operand 18455 states and 24451 transitions. [2023-11-29 01:47:50,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-29 01:47:50,064 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:47:50,064 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:47:50,106 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-29 01:47:50,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-11-29 01:47:50,264 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:47:50,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:47:50,265 INFO L85 PathProgramCache]: Analyzing trace with hash 681942383, now seen corresponding path program 1 times [2023-11-29 01:47:50,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:47:50,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887323035] [2023-11-29 01:47:50,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:50,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:47:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:50,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:47:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:50,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:47:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:50,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:47:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:50,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 01:47:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:50,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:47:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:50,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 01:47:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:50,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:47:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:50,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 01:47:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:50,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:47:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:50,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:47:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:50,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-29 01:47:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:50,358 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-11-29 01:47:50,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:47:50,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887323035] [2023-11-29 01:47:50,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887323035] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:47:50,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569572208] [2023-11-29 01:47:50,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:50,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:47:50,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:47:50,360 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:47:50,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 01:47:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:50,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:47:50,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:47:50,490 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-29 01:47:50,491 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:47:50,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569572208] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:47:50,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:47:50,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 01:47:50,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547398610] [2023-11-29 01:47:50,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:47:50,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:47:50,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:47:50,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:47:50,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:47:50,493 INFO L87 Difference]: Start difference. First operand 18455 states and 24451 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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-29 01:47:52,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:47:52,774 INFO L93 Difference]: Finished difference Result 50356 states and 68144 transitions. [2023-11-29 01:47:52,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:47:52,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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 145 [2023-11-29 01:47:52,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:47:52,851 INFO L225 Difference]: With dead ends: 50356 [2023-11-29 01:47:52,851 INFO L226 Difference]: Without dead ends: 33898 [2023-11-29 01:47:52,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:47:52,876 INFO L413 NwaCegarLoop]: 398 mSDtfsCounter, 139 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:47:52,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 657 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:47:52,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33898 states. [2023-11-29 01:47:55,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33898 to 33896. [2023-11-29 01:47:55,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33896 states, 28214 states have (on average 1.2900687601899765) internal successors, (36398), 28503 states have internal predecessors, (36398), 3137 states have call successors, (3137), 2275 states have call predecessors, (3137), 2543 states have return successors, (6095), 3125 states have call predecessors, (6095), 3136 states have call successors, (6095) [2023-11-29 01:47:55,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33896 states to 33896 states and 45630 transitions. [2023-11-29 01:47:55,765 INFO L78 Accepts]: Start accepts. Automaton has 33896 states and 45630 transitions. Word has length 145 [2023-11-29 01:47:55,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:47:55,766 INFO L495 AbstractCegarLoop]: Abstraction has 33896 states and 45630 transitions. [2023-11-29 01:47:55,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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-29 01:47:55,766 INFO L276 IsEmpty]: Start isEmpty. Operand 33896 states and 45630 transitions. [2023-11-29 01:47:55,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-29 01:47:55,782 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:47:55,782 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:47:55,787 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 01:47:55,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-11-29 01:47:55,983 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:47:55,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:47:55,983 INFO L85 PathProgramCache]: Analyzing trace with hash 433185173, now seen corresponding path program 1 times [2023-11-29 01:47:55,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:47:55,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612927081] [2023-11-29 01:47:55,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:55,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:47:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:56,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:47:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:56,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:47:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:56,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:47:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:56,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 01:47:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:56,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:47:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:56,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 01:47:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:56,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 01:47:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:56,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:47:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:56,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 01:47:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:56,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:47:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:56,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-29 01:47:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:56,079 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-11-29 01:47:56,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:47:56,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612927081] [2023-11-29 01:47:56,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612927081] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:47:56,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954244572] [2023-11-29 01:47:56,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:56,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:47:56,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:47:56,081 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:47:56,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 01:47:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:56,200 INFO L262 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:47:56,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:47:56,253 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 01:47:56,253 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:47:56,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954244572] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:47:56,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:47:56,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 01:47:56,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475751513] [2023-11-29 01:47:56,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:47:56,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:47:56,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:47:56,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:47:56,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:47:56,255 INFO L87 Difference]: Start difference. First operand 33896 states and 45630 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, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-29 01:47:58,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:47:58,555 INFO L93 Difference]: Finished difference Result 63166 states and 86524 transitions. [2023-11-29 01:47:58,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:47:58,555 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, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 145 [2023-11-29 01:47:58,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:47:58,625 INFO L225 Difference]: With dead ends: 63166 [2023-11-29 01:47:58,625 INFO L226 Difference]: Without dead ends: 31276 [2023-11-29 01:47:58,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:47:58,667 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 239 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:47:58,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 286 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:47:58,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31276 states. [2023-11-29 01:48:00,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31276 to 26748. [2023-11-29 01:48:00,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26748 states, 22356 states have (on average 1.247987117552335) internal successors, (27900), 22609 states have internal predecessors, (27900), 2371 states have call successors, (2371), 1775 states have call predecessors, (2371), 2019 states have return successors, (3989), 2371 states have call predecessors, (3989), 2370 states have call successors, (3989) [2023-11-29 01:48:00,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26748 states to 26748 states and 34260 transitions. [2023-11-29 01:48:00,810 INFO L78 Accepts]: Start accepts. Automaton has 26748 states and 34260 transitions. Word has length 145 [2023-11-29 01:48:00,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:48:00,811 INFO L495 AbstractCegarLoop]: Abstraction has 26748 states and 34260 transitions. [2023-11-29 01:48:00,811 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, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-29 01:48:00,811 INFO L276 IsEmpty]: Start isEmpty. Operand 26748 states and 34260 transitions. [2023-11-29 01:48:00,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-29 01:48:00,824 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:48:00,824 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:48:00,829 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-29 01:48:01,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-11-29 01:48:01,025 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:48:01,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:48:01,025 INFO L85 PathProgramCache]: Analyzing trace with hash -184280594, now seen corresponding path program 1 times [2023-11-29 01:48:01,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:48:01,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587343569] [2023-11-29 01:48:01,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:48:01,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:48:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:01,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:48:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:01,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:48:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:01,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:48:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:01,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 01:48:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:01,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:48:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:01,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 01:48:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:01,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 01:48:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:01,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:48:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:01,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 01:48:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:01,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:48:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:01,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 01:48:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:01,116 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-29 01:48:01,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:48:01,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587343569] [2023-11-29 01:48:01,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587343569] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:48:01,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072841503] [2023-11-29 01:48:01,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:48:01,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:48:01,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:48:01,118 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:48:01,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 01:48:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:01,222 INFO L262 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:48:01,225 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:48:01,275 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 01:48:01,276 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:48:01,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072841503] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:48:01,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:48:01,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 01:48:01,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797125102] [2023-11-29 01:48:01,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:48:01,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:48:01,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:48:01,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:48:01,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:48:01,278 INFO L87 Difference]: Start difference. First operand 26748 states and 34260 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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-29 01:48:03,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:48:03,886 INFO L93 Difference]: Finished difference Result 40922 states and 53988 transitions. [2023-11-29 01:48:03,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:48:03,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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 146 [2023-11-29 01:48:03,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:48:03,943 INFO L225 Difference]: With dead ends: 40922 [2023-11-29 01:48:03,943 INFO L226 Difference]: Without dead ends: 26428 [2023-11-29 01:48:03,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:48:03,970 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 98 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:48:03,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 594 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:48:03,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26428 states. [2023-11-29 01:48:05,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26428 to 26236. [2023-11-29 01:48:05,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26236 states, 21900 states have (on average 1.2292237442922374) internal successors, (26920), 22125 states have internal predecessors, (26920), 2371 states have call successors, (2371), 1775 states have call predecessors, (2371), 1963 states have return successors, (3887), 2343 states have call predecessors, (3887), 2370 states have call successors, (3887) [2023-11-29 01:48:06,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26236 states to 26236 states and 33178 transitions. [2023-11-29 01:48:06,048 INFO L78 Accepts]: Start accepts. Automaton has 26236 states and 33178 transitions. Word has length 146 [2023-11-29 01:48:06,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:48:06,048 INFO L495 AbstractCegarLoop]: Abstraction has 26236 states and 33178 transitions. [2023-11-29 01:48:06,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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-29 01:48:06,049 INFO L276 IsEmpty]: Start isEmpty. Operand 26236 states and 33178 transitions. [2023-11-29 01:48:06,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-29 01:48:06,060 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:48:06,060 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:48:06,065 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-29 01:48:06,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-11-29 01:48:06,261 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:48:06,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:48:06,261 INFO L85 PathProgramCache]: Analyzing trace with hash -685458390, now seen corresponding path program 1 times [2023-11-29 01:48:06,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:48:06,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354052725] [2023-11-29 01:48:06,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:48:06,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:48:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:06,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:48:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:06,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:48:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:06,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:48:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:06,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 01:48:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:06,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:48:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:06,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 01:48:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:06,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 01:48:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:06,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:48:06,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:06,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 01:48:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:06,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:48:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:06,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 01:48:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:06,337 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-29 01:48:06,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:48:06,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354052725] [2023-11-29 01:48:06,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354052725] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:48:06,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976580511] [2023-11-29 01:48:06,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:48:06,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:48:06,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:48:06,340 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:48:06,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-29 01:48:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:06,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 01:48:06,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:48:06,516 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-11-29 01:48:06,516 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:48:06,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976580511] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:48:06,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:48:06,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-11-29 01:48:06,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631490862] [2023-11-29 01:48:06,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:48:06,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:48:06,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:48:06,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:48:06,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:48:06,518 INFO L87 Difference]: Start difference. First operand 26236 states and 33178 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 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-29 01:48:08,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:48:08,725 INFO L93 Difference]: Finished difference Result 50474 states and 64600 transitions. [2023-11-29 01:48:08,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:48:08,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 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 147 [2023-11-29 01:48:08,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:48:08,782 INFO L225 Difference]: With dead ends: 50474 [2023-11-29 01:48:08,782 INFO L226 Difference]: Without dead ends: 26236 [2023-11-29 01:48:08,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:48:08,814 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 318 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:48:08,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 376 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:48:08,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26236 states. [2023-11-29 01:48:10,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26236 to 26236. [2023-11-29 01:48:10,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26236 states, 21900 states have (on average 1.1956164383561645) internal successors, (26184), 22125 states have internal predecessors, (26184), 2371 states have call successors, (2371), 1775 states have call predecessors, (2371), 1963 states have return successors, (3887), 2343 states have call predecessors, (3887), 2370 states have call successors, (3887) [2023-11-29 01:48:10,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26236 states to 26236 states and 32442 transitions. [2023-11-29 01:48:10,976 INFO L78 Accepts]: Start accepts. Automaton has 26236 states and 32442 transitions. Word has length 147 [2023-11-29 01:48:10,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:48:10,977 INFO L495 AbstractCegarLoop]: Abstraction has 26236 states and 32442 transitions. [2023-11-29 01:48:10,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 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-29 01:48:10,977 INFO L276 IsEmpty]: Start isEmpty. Operand 26236 states and 32442 transitions. [2023-11-29 01:48:10,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-29 01:48:10,988 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:48:10,988 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:48:10,993 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-29 01:48:11,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-11-29 01:48:11,189 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:48:11,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:48:11,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1467648428, now seen corresponding path program 1 times [2023-11-29 01:48:11,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:48:11,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517632246] [2023-11-29 01:48:11,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:48:11,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:48:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:11,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:48:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:11,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:48:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:11,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:48:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:11,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 01:48:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:11,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:48:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:11,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 01:48:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:11,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 01:48:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:11,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:48:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:11,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 01:48:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:11,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:48:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:11,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 01:48:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:11,275 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-29 01:48:11,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:48:11,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517632246] [2023-11-29 01:48:11,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517632246] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:48:11,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623519945] [2023-11-29 01:48:11,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:48:11,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:48:11,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:48:11,276 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:48:11,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-29 01:48:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:11,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 01:48:11,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:48:11,419 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-11-29 01:48:11,419 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:48:11,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623519945] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:48:11,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:48:11,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-11-29 01:48:11,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575084444] [2023-11-29 01:48:11,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:48:11,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:48:11,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:48:11,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:48:11,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:48:11,421 INFO L87 Difference]: Start difference. First operand 26236 states and 32442 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 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-29 01:48:13,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:48:13,396 INFO L93 Difference]: Finished difference Result 39382 states and 49287 transitions. [2023-11-29 01:48:13,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:48:13,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 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 147 [2023-11-29 01:48:13,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:48:13,437 INFO L225 Difference]: With dead ends: 39382 [2023-11-29 01:48:13,437 INFO L226 Difference]: Without dead ends: 21768 [2023-11-29 01:48:13,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:48:13,459 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 314 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:48:13,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 369 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:48:13,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21768 states. [2023-11-29 01:48:14,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21768 to 16284. [2023-11-29 01:48:14,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16284 states, 13610 states have (on average 1.1722997795738428) internal successors, (15955), 13733 states have internal predecessors, (15955), 1473 states have call successors, (1473), 1081 states have call predecessors, (1473), 1199 states have return successors, (2389), 1473 states have call predecessors, (2389), 1472 states have call successors, (2389) [2023-11-29 01:48:14,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16284 states to 16284 states and 19817 transitions. [2023-11-29 01:48:14,896 INFO L78 Accepts]: Start accepts. Automaton has 16284 states and 19817 transitions. Word has length 147 [2023-11-29 01:48:14,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:48:14,896 INFO L495 AbstractCegarLoop]: Abstraction has 16284 states and 19817 transitions. [2023-11-29 01:48:14,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 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-29 01:48:14,896 INFO L276 IsEmpty]: Start isEmpty. Operand 16284 states and 19817 transitions. [2023-11-29 01:48:14,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-29 01:48:14,902 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:48:14,902 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:48:14,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-29 01:48:15,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-11-29 01:48:15,103 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:48:15,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:48:15,103 INFO L85 PathProgramCache]: Analyzing trace with hash -505516950, now seen corresponding path program 1 times [2023-11-29 01:48:15,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:48:15,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160576085] [2023-11-29 01:48:15,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:48:15,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:48:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:15,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:48:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:15,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:48:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:15,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:48:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:15,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 01:48:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:15,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:48:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:15,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 01:48:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:15,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 01:48:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:15,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:48:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:15,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 01:48:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:15,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:48:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:15,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 01:48:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:15,194 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-29 01:48:15,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:48:15,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160576085] [2023-11-29 01:48:15,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160576085] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:48:15,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39439473] [2023-11-29 01:48:15,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:48:15,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:48:15,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:48:15,195 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:48:15,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-29 01:48:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:15,302 INFO L262 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 01:48:15,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:48:15,363 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-29 01:48:15,363 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:48:15,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39439473] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:48:15,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:48:15,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2023-11-29 01:48:15,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702320678] [2023-11-29 01:48:15,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:48:15,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:48:15,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:48:15,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:48:15,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:48:15,365 INFO L87 Difference]: Start difference. First operand 16284 states and 19817 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 01:48:17,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:48:17,032 INFO L93 Difference]: Finished difference Result 26768 states and 32749 transitions. [2023-11-29 01:48:17,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:48:17,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 147 [2023-11-29 01:48:17,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:48:17,062 INFO L225 Difference]: With dead ends: 26768 [2023-11-29 01:48:17,062 INFO L226 Difference]: Without dead ends: 16322 [2023-11-29 01:48:17,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:48:17,077 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 306 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:48:17,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 424 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:48:17,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16322 states. [2023-11-29 01:48:18,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16322 to 16320. [2023-11-29 01:48:18,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16320 states, 13628 states have (on average 1.1660551805107133) internal successors, (15891), 13760 states have internal predecessors, (15891), 1473 states have call successors, (1473), 1081 states have call predecessors, (1473), 1217 states have return successors, (2389), 1482 states have call predecessors, (2389), 1472 states have call successors, (2389) [2023-11-29 01:48:18,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16320 states to 16320 states and 19753 transitions. [2023-11-29 01:48:18,517 INFO L78 Accepts]: Start accepts. Automaton has 16320 states and 19753 transitions. Word has length 147 [2023-11-29 01:48:18,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:48:18,518 INFO L495 AbstractCegarLoop]: Abstraction has 16320 states and 19753 transitions. [2023-11-29 01:48:18,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 01:48:18,518 INFO L276 IsEmpty]: Start isEmpty. Operand 16320 states and 19753 transitions. [2023-11-29 01:48:18,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-29 01:48:18,524 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:48:18,524 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:48:18,529 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-29 01:48:18,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-11-29 01:48:18,724 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:48:18,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:48:18,725 INFO L85 PathProgramCache]: Analyzing trace with hash 2001580524, now seen corresponding path program 1 times [2023-11-29 01:48:18,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:48:18,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149544347] [2023-11-29 01:48:18,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:48:18,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:48:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:18,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:48:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:18,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:48:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:18,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:48:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:18,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 01:48:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:18,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:48:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:18,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 01:48:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:18,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 01:48:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:18,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:48:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:18,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 01:48:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:18,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:48:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:18,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 01:48:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:18,782 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-11-29 01:48:18,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:48:18,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149544347] [2023-11-29 01:48:18,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149544347] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:48:18,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:48:18,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:48:18,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555019740] [2023-11-29 01:48:18,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:48:18,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:48:18,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:48:18,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:48:18,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:48:18,784 INFO L87 Difference]: Start difference. First operand 16320 states and 19753 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 01:48:20,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:48:20,294 INFO L93 Difference]: Finished difference Result 18853 states and 22739 transitions. [2023-11-29 01:48:20,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 01:48:20,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 147 [2023-11-29 01:48:20,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:48:20,321 INFO L225 Difference]: With dead ends: 18853 [2023-11-29 01:48:20,321 INFO L226 Difference]: Without dead ends: 15011 [2023-11-29 01:48:20,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:48:20,331 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 357 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:48:20,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 400 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 01:48:20,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15011 states. [2023-11-29 01:48:21,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15011 to 14026. [2023-11-29 01:48:21,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14026 states, 11805 states have (on average 1.1689114781872088) internal successors, (13799), 12023 states have internal predecessors, (13799), 1111 states have call successors, (1111), 823 states have call predecessors, (1111), 1108 states have return successors, (2114), 1181 states have call predecessors, (2114), 1110 states have call successors, (2114) [2023-11-29 01:48:21,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14026 states to 14026 states and 17024 transitions. [2023-11-29 01:48:21,494 INFO L78 Accepts]: Start accepts. Automaton has 14026 states and 17024 transitions. Word has length 147 [2023-11-29 01:48:21,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:48:21,494 INFO L495 AbstractCegarLoop]: Abstraction has 14026 states and 17024 transitions. [2023-11-29 01:48:21,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 01:48:21,494 INFO L276 IsEmpty]: Start isEmpty. Operand 14026 states and 17024 transitions. [2023-11-29 01:48:21,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-29 01:48:21,498 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:48:21,499 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:48:21,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-11-29 01:48:21,499 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:48:21,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:48:21,499 INFO L85 PathProgramCache]: Analyzing trace with hash 141749920, now seen corresponding path program 1 times [2023-11-29 01:48:21,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:48:21,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66715903] [2023-11-29 01:48:21,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:48:21,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:48:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:21,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:48:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:21,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:48:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:21,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:48:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:21,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 01:48:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:21,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:48:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:21,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:48:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:21,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 01:48:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:21,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:48:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:21,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 01:48:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:21,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:48:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:21,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-29 01:48:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-11-29 01:48:21,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:48:21,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66715903] [2023-11-29 01:48:21,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66715903] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:48:21,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296844383] [2023-11-29 01:48:21,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:48:21,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:48:21,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:48:21,593 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:48:21,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-29 01:48:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:21,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 01:48:21,690 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:48:21,697 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-29 01:48:21,697 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:48:21,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296844383] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:48:21,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:48:21,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-11-29 01:48:21,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797151802] [2023-11-29 01:48:21,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:48:21,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:48:21,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:48:21,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:48:21,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:48:21,699 INFO L87 Difference]: Start difference. First operand 14026 states and 17024 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-29 01:48:22,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:48:22,809 INFO L93 Difference]: Finished difference Result 23026 states and 28294 transitions. [2023-11-29 01:48:22,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:48:22,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 151 [2023-11-29 01:48:22,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:48:22,822 INFO L225 Difference]: With dead ends: 23026 [2023-11-29 01:48:22,822 INFO L226 Difference]: Without dead ends: 8992 [2023-11-29 01:48:22,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:48:22,836 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 20 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:48:22,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 753 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:48:22,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8992 states. [2023-11-29 01:48:23,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8992 to 8878. [2023-11-29 01:48:23,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8878 states, 7399 states have (on average 1.1523178807947019) internal successors, (8526), 7511 states have internal predecessors, (8526), 747 states have call successors, (747), 559 states have call predecessors, (747), 730 states have return successors, (1146), 809 states have call predecessors, (1146), 746 states have call successors, (1146) [2023-11-29 01:48:23,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8878 states to 8878 states and 10419 transitions. [2023-11-29 01:48:23,603 INFO L78 Accepts]: Start accepts. Automaton has 8878 states and 10419 transitions. Word has length 151 [2023-11-29 01:48:23,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:48:23,603 INFO L495 AbstractCegarLoop]: Abstraction has 8878 states and 10419 transitions. [2023-11-29 01:48:23,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-29 01:48:23,603 INFO L276 IsEmpty]: Start isEmpty. Operand 8878 states and 10419 transitions. [2023-11-29 01:48:23,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-11-29 01:48:23,607 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:48:23,608 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:48:23,612 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-11-29 01:48:23,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-11-29 01:48:23,808 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:48:23,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:48:23,808 INFO L85 PathProgramCache]: Analyzing trace with hash 152028687, now seen corresponding path program 1 times [2023-11-29 01:48:23,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:48:23,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305527198] [2023-11-29 01:48:23,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:48:23,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:48:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:23,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:48:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:23,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:48:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:23,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:48:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:23,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 01:48:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:23,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:48:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:23,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 01:48:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:23,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 01:48:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:23,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:48:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:23,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:48:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:23,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:48:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:23,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 01:48:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:23,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:48:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:23,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-11-29 01:48:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:23,900 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-11-29 01:48:23,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:48:23,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305527198] [2023-11-29 01:48:23,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305527198] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:48:23,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152779060] [2023-11-29 01:48:23,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:48:23,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:48:23,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:48:23,901 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:48:23,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-29 01:48:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:24,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:48:24,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:48:24,037 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-29 01:48:24,038 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:48:24,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152779060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:48:24,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:48:24,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 01:48:24,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311835139] [2023-11-29 01:48:24,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:48:24,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:48:24,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:48:24,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:48:24,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:48:24,039 INFO L87 Difference]: Start difference. First operand 8878 states and 10419 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-29 01:48:24,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:48:24,888 INFO L93 Difference]: Finished difference Result 13686 states and 16472 transitions. [2023-11-29 01:48:24,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:48:24,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 181 [2023-11-29 01:48:24,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:48:24,901 INFO L225 Difference]: With dead ends: 13686 [2023-11-29 01:48:24,902 INFO L226 Difference]: Without dead ends: 8888 [2023-11-29 01:48:24,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:48:24,910 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 111 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:48:24,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 593 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:48:24,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8888 states. [2023-11-29 01:48:25,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8888 to 8878. [2023-11-29 01:48:25,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8878 states, 7399 states have (on average 1.131504257332072) internal successors, (8372), 7511 states have internal predecessors, (8372), 747 states have call successors, (747), 559 states have call predecessors, (747), 730 states have return successors, (1146), 809 states have call predecessors, (1146), 746 states have call successors, (1146) [2023-11-29 01:48:25,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8878 states to 8878 states and 10265 transitions. [2023-11-29 01:48:25,722 INFO L78 Accepts]: Start accepts. Automaton has 8878 states and 10265 transitions. Word has length 181 [2023-11-29 01:48:25,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:48:25,722 INFO L495 AbstractCegarLoop]: Abstraction has 8878 states and 10265 transitions. [2023-11-29 01:48:25,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-29 01:48:25,722 INFO L276 IsEmpty]: Start isEmpty. Operand 8878 states and 10265 transitions. [2023-11-29 01:48:25,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-11-29 01:48:25,727 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:48:25,727 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:48:25,731 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-11-29 01:48:25,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-11-29 01:48:25,927 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:48:25,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:48:25,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1901364559, now seen corresponding path program 1 times [2023-11-29 01:48:25,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:48:25,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518549933] [2023-11-29 01:48:25,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:48:25,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:48:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:25,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:48:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:25,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:48:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:25,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:48:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:25,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 01:48:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:25,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:48:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:25,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 01:48:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:25,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 01:48:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:26,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:48:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:26,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 01:48:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:26,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:48:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:26,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 01:48:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:26,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:48:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:26,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-11-29 01:48:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:26,016 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-11-29 01:48:26,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:48:26,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518549933] [2023-11-29 01:48:26,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518549933] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:48:26,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908072560] [2023-11-29 01:48:26,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:48:26,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:48:26,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:48:26,017 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:48:26,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-29 01:48:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:26,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 01:48:26,125 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:48:26,268 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 82 proven. 61 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 01:48:26,269 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:48:26,345 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-11-29 01:48:26,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908072560] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 01:48:26,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:48:26,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 9 [2023-11-29 01:48:26,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330054840] [2023-11-29 01:48:26,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:48:26,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:48:26,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:48:26,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:48:26,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:48:26,347 INFO L87 Difference]: Start difference. First operand 8878 states and 10265 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-29 01:48:28,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:48:28,312 INFO L93 Difference]: Finished difference Result 22084 states and 25362 transitions. [2023-11-29 01:48:28,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:48:28,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 183 [2023-11-29 01:48:28,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:48:28,341 INFO L225 Difference]: With dead ends: 22084 [2023-11-29 01:48:28,341 INFO L226 Difference]: Without dead ends: 18642 [2023-11-29 01:48:28,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:48:28,350 INFO L413 NwaCegarLoop]: 482 mSDtfsCounter, 490 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:48:28,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 1263 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:48:28,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18642 states. [2023-11-29 01:48:29,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18642 to 16495. [2023-11-29 01:48:29,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16495 states, 13816 states have (on average 1.1234800231615518) internal successors, (15522), 14018 states have internal predecessors, (15522), 1379 states have call successors, (1379), 1009 states have call predecessors, (1379), 1298 states have return successors, (2030), 1469 states have call predecessors, (2030), 1378 states have call successors, (2030) [2023-11-29 01:48:29,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16495 states to 16495 states and 18931 transitions. [2023-11-29 01:48:29,898 INFO L78 Accepts]: Start accepts. Automaton has 16495 states and 18931 transitions. Word has length 183 [2023-11-29 01:48:29,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:48:29,898 INFO L495 AbstractCegarLoop]: Abstraction has 16495 states and 18931 transitions. [2023-11-29 01:48:29,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-29 01:48:29,898 INFO L276 IsEmpty]: Start isEmpty. Operand 16495 states and 18931 transitions. [2023-11-29 01:48:29,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2023-11-29 01:48:29,906 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:48:29,906 INFO L195 NwaCegarLoop]: trace histogram [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, 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] [2023-11-29 01:48:29,911 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-11-29 01:48:30,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2023-11-29 01:48:30,107 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:48:30,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:48:30,107 INFO L85 PathProgramCache]: Analyzing trace with hash -294932154, now seen corresponding path program 1 times [2023-11-29 01:48:30,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:48:30,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56844485] [2023-11-29 01:48:30,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:48:30,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:48:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:30,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:48:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:30,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:48:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:30,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:48:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:30,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:48:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:30,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:48:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:30,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:48:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:30,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:48:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:30,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 01:48:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:30,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 01:48:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:30,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 01:48:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:30,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:48:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:30,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:48:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:30,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:48:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:30,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 01:48:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:30,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 01:48:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:30,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 01:48:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:30,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 01:48:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:30,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-11-29 01:48:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:30,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-11-29 01:48:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:30,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-29 01:48:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:30,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:48:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:30,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:48:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:30,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2023-11-29 01:48:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:30,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2023-11-29 01:48:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:30,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-11-29 01:48:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:30,212 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 72 proven. 15 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2023-11-29 01:48:30,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:48:30,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56844485] [2023-11-29 01:48:30,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56844485] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:48:30,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082473010] [2023-11-29 01:48:30,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:48:30,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:48:30,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:48:30,213 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:48:30,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-29 01:48:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:30,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:48:30,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:48:30,379 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-11-29 01:48:30,379 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:48:30,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082473010] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:48:30,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:48:30,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2023-11-29 01:48:30,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621716043] [2023-11-29 01:48:30,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:48:30,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:48:30,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:48:30,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:48:30,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:48:30,380 INFO L87 Difference]: Start difference. First operand 16495 states and 18931 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 3 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-29 01:48:32,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:48:32,291 INFO L93 Difference]: Finished difference Result 18821 states and 21710 transitions. [2023-11-29 01:48:32,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:48:32,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 3 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 230 [2023-11-29 01:48:32,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:48:32,314 INFO L225 Difference]: With dead ends: 18821 [2023-11-29 01:48:32,314 INFO L226 Difference]: Without dead ends: 16929 [2023-11-29 01:48:32,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:48:32,319 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 291 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:48:32,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 395 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:48:32,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16929 states. [2023-11-29 01:48:33,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16929 to 16919. [2023-11-29 01:48:33,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16919 states, 14135 states have (on average 1.1238061549345597) internal successors, (15885), 14352 states have internal predecessors, (15885), 1425 states have call successors, (1425), 1047 states have call predecessors, (1425), 1357 states have return successors, (2092), 1521 states have call predecessors, (2092), 1424 states have call successors, (2092) [2023-11-29 01:48:33,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16919 states to 16919 states and 19402 transitions. [2023-11-29 01:48:33,902 INFO L78 Accepts]: Start accepts. Automaton has 16919 states and 19402 transitions. Word has length 230 [2023-11-29 01:48:33,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:48:33,902 INFO L495 AbstractCegarLoop]: Abstraction has 16919 states and 19402 transitions. [2023-11-29 01:48:33,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 3 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-29 01:48:33,902 INFO L276 IsEmpty]: Start isEmpty. Operand 16919 states and 19402 transitions. [2023-11-29 01:48:33,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2023-11-29 01:48:33,910 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:48:33,911 INFO L195 NwaCegarLoop]: trace histogram [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, 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] [2023-11-29 01:48:33,915 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-11-29 01:48:34,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2023-11-29 01:48:34,111 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:48:34,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:48:34,111 INFO L85 PathProgramCache]: Analyzing trace with hash -240539256, now seen corresponding path program 1 times [2023-11-29 01:48:34,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:48:34,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044322438] [2023-11-29 01:48:34,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:48:34,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:48:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:34,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:48:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:34,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:48:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:34,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:48:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:34,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:48:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:34,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:48:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:34,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:48:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:34,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:48:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:34,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 01:48:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:34,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 01:48:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:34,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 01:48:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:34,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:48:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:34,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:48:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:34,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:48:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:34,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 01:48:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:34,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 01:48:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:34,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 01:48:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:34,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 01:48:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:34,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-11-29 01:48:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:34,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-11-29 01:48:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:34,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-29 01:48:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:34,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:48:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:34,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:48:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:34,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2023-11-29 01:48:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:34,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2023-11-29 01:48:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:34,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-11-29 01:48:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:34,212 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 72 proven. 15 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2023-11-29 01:48:34,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:48:34,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044322438] [2023-11-29 01:48:34,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044322438] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:48:34,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808173843] [2023-11-29 01:48:34,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:48:34,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:48:34,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:48:34,214 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:48:34,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-29 01:48:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:34,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 01:48:34,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:48:34,418 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 229 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-29 01:48:34,418 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:48:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 102 proven. 7 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2023-11-29 01:48:34,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808173843] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:48:34,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:48:34,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2023-11-29 01:48:34,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248091772] [2023-11-29 01:48:34,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:48:34,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 01:48:34,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:48:34,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 01:48:34,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-29 01:48:34,592 INFO L87 Difference]: Start difference. First operand 16919 states and 19402 transitions. Second operand has 11 states, 11 states have (on average 18.727272727272727) internal successors, (206), 8 states have internal predecessors, (206), 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-29 01:48:36,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:48:36,835 INFO L93 Difference]: Finished difference Result 17899 states and 20554 transitions. [2023-11-29 01:48:36,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 01:48:36,836 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 18.727272727272727) internal successors, (206), 8 states have internal predecessors, (206), 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 230 [2023-11-29 01:48:36,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:48:36,860 INFO L225 Difference]: With dead ends: 17899 [2023-11-29 01:48:36,860 INFO L226 Difference]: Without dead ends: 15565 [2023-11-29 01:48:36,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 508 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=429, Unknown=0, NotChecked=0, Total=600 [2023-11-29 01:48:36,867 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 644 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 1181 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:48:36,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 886 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1181 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 01:48:36,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15565 states. [2023-11-29 01:48:38,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15565 to 15412. [2023-11-29 01:48:38,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15412 states, 12926 states have (on average 1.1169735416989015) internal successors, (14438), 13121 states have internal predecessors, (14438), 1287 states have call successors, (1287), 943 states have call predecessors, (1287), 1197 states have return successors, (1891), 1349 states have call predecessors, (1891), 1286 states have call successors, (1891) [2023-11-29 01:48:38,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15412 states to 15412 states and 17616 transitions. [2023-11-29 01:48:38,308 INFO L78 Accepts]: Start accepts. Automaton has 15412 states and 17616 transitions. Word has length 230 [2023-11-29 01:48:38,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:48:38,309 INFO L495 AbstractCegarLoop]: Abstraction has 15412 states and 17616 transitions. [2023-11-29 01:48:38,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.727272727272727) internal successors, (206), 8 states have internal predecessors, (206), 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-29 01:48:38,309 INFO L276 IsEmpty]: Start isEmpty. Operand 15412 states and 17616 transitions. [2023-11-29 01:48:38,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2023-11-29 01:48:38,317 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:48:38,318 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:48:38,323 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-11-29 01:48:38,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:48:38,518 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:48:38,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:48:38,518 INFO L85 PathProgramCache]: Analyzing trace with hash 899077440, now seen corresponding path program 1 times [2023-11-29 01:48:38,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:48:38,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502240243] [2023-11-29 01:48:38,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:48:38,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:48:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:38,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:48:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:38,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:48:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:38,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:48:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:38,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:48:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:38,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:48:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:38,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:48:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:38,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:48:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:38,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 01:48:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:38,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 01:48:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:38,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 01:48:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:38,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 01:48:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:38,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:48:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:38,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:48:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:38,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:48:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:38,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-29 01:48:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:38,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 01:48:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:38,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-29 01:48:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:38,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-11-29 01:48:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:38,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-11-29 01:48:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:38,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-11-29 01:48:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:38,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2023-11-29 01:48:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:38,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:48:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:38,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:48:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:38,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2023-11-29 01:48:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:38,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2023-11-29 01:48:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:38,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-11-29 01:48:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:38,651 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 79 proven. 9 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2023-11-29 01:48:38,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:48:38,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502240243] [2023-11-29 01:48:38,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502240243] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:48:38,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925967622] [2023-11-29 01:48:38,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:48:38,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:48:38,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:48:38,653 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:48:38,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-11-29 01:48:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:38,771 INFO L262 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:48:38,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:48:38,806 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2023-11-29 01:48:38,806 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:48:38,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925967622] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:48:38,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:48:38,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2023-11-29 01:48:38,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438410976] [2023-11-29 01:48:38,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:48:38,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:48:38,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:48:38,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:48:38,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:48:38,808 INFO L87 Difference]: Start difference. First operand 15412 states and 17616 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-29 01:48:40,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:48:40,159 INFO L93 Difference]: Finished difference Result 16213 states and 18569 transitions. [2023-11-29 01:48:40,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:48:40,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 233 [2023-11-29 01:48:40,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:48:40,183 INFO L225 Difference]: With dead ends: 16213 [2023-11-29 01:48:40,184 INFO L226 Difference]: Without dead ends: 15404 [2023-11-29 01:48:40,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:48:40,190 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 71 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:48:40,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 494 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:48:40,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15404 states. [2023-11-29 01:48:41,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15404 to 15401. [2023-11-29 01:48:41,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15401 states, 12916 states have (on average 1.115980179622174) internal successors, (14414), 13111 states have internal predecessors, (14414), 1287 states have call successors, (1287), 943 states have call predecessors, (1287), 1196 states have return successors, (1890), 1348 states have call predecessors, (1890), 1286 states have call successors, (1890) [2023-11-29 01:48:41,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15401 states to 15401 states and 17591 transitions. [2023-11-29 01:48:41,680 INFO L78 Accepts]: Start accepts. Automaton has 15401 states and 17591 transitions. Word has length 233 [2023-11-29 01:48:41,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:48:41,680 INFO L495 AbstractCegarLoop]: Abstraction has 15401 states and 17591 transitions. [2023-11-29 01:48:41,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-29 01:48:41,680 INFO L276 IsEmpty]: Start isEmpty. Operand 15401 states and 17591 transitions. [2023-11-29 01:48:41,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2023-11-29 01:48:41,687 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:48:41,688 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:48:41,692 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-11-29 01:48:41,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:48:41,888 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:48:41,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:48:41,888 INFO L85 PathProgramCache]: Analyzing trace with hash -998633619, now seen corresponding path program 1 times [2023-11-29 01:48:41,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:48:41,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879683000] [2023-11-29 01:48:41,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:48:41,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:48:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:41,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:48:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:41,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:48:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:41,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:48:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:41,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:48:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:41,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:48:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:41,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:48:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:41,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:48:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:41,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 01:48:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:41,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 01:48:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:41,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 01:48:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:41,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 01:48:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:41,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:48:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:41,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:48:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:41,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:48:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:41,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 01:48:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:41,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 01:48:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:41,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 01:48:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:41,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-11-29 01:48:41,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:41,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 01:48:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:41,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-11-29 01:48:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:41,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2023-11-29 01:48:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:41,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:48:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:41,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:48:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:41,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-11-29 01:48:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:41,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-11-29 01:48:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:41,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-11-29 01:48:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:41,995 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 72 proven. 11 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2023-11-29 01:48:41,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:48:41,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879683000] [2023-11-29 01:48:41,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879683000] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:48:41,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006683863] [2023-11-29 01:48:41,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:48:41,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:48:41,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:48:41,996 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:48:41,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-11-29 01:48:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:42,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:48:42,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:48:42,159 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2023-11-29 01:48:42,159 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:48:42,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006683863] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:48:42,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:48:42,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2023-11-29 01:48:42,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761807950] [2023-11-29 01:48:42,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:48:42,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:48:42,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:48:42,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:48:42,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:48:42,161 INFO L87 Difference]: Start difference. First operand 15401 states and 17591 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 3 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-29 01:48:43,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:48:43,891 INFO L93 Difference]: Finished difference Result 16248 states and 18565 transitions. [2023-11-29 01:48:43,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:48:43,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 3 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 234 [2023-11-29 01:48:43,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:48:43,915 INFO L225 Difference]: With dead ends: 16248 [2023-11-29 01:48:43,916 INFO L226 Difference]: Without dead ends: 15452 [2023-11-29 01:48:43,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-11-29 01:48:43,921 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 302 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:48:43,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 398 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:48:43,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15452 states. [2023-11-29 01:48:45,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15452 to 15401. [2023-11-29 01:48:45,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15401 states, 12916 states have (on average 1.1156704862186435) internal successors, (14410), 13111 states have internal predecessors, (14410), 1287 states have call successors, (1287), 943 states have call predecessors, (1287), 1196 states have return successors, (1880), 1348 states have call predecessors, (1880), 1286 states have call successors, (1880) [2023-11-29 01:48:45,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15401 states to 15401 states and 17577 transitions. [2023-11-29 01:48:45,440 INFO L78 Accepts]: Start accepts. Automaton has 15401 states and 17577 transitions. Word has length 234 [2023-11-29 01:48:45,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:48:45,441 INFO L495 AbstractCegarLoop]: Abstraction has 15401 states and 17577 transitions. [2023-11-29 01:48:45,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 3 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-29 01:48:45,441 INFO L276 IsEmpty]: Start isEmpty. Operand 15401 states and 17577 transitions. [2023-11-29 01:48:45,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2023-11-29 01:48:45,448 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:48:45,448 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:48:45,453 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-11-29 01:48:45,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:48:45,649 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:48:45,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:48:45,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1559333397, now seen corresponding path program 1 times [2023-11-29 01:48:45,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:48:45,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353417316] [2023-11-29 01:48:45,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:48:45,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:48:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:45,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:48:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:45,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:48:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:45,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:48:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:45,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:48:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:45,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:48:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:45,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:48:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:45,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 01:48:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:45,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 01:48:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:45,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 01:48:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:45,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 01:48:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:45,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 01:48:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:45,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:48:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:45,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:48:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:45,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:48:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:45,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 01:48:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:45,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 01:48:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:45,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 01:48:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:45,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-11-29 01:48:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:45,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 01:48:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:45,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-11-29 01:48:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:45,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2023-11-29 01:48:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:45,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:48:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:45,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:48:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:45,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-11-29 01:48:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:45,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-11-29 01:48:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:45,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-11-29 01:48:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:45,762 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 72 proven. 11 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2023-11-29 01:48:45,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:48:45,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353417316] [2023-11-29 01:48:45,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353417316] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:48:45,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544011815] [2023-11-29 01:48:45,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:48:45,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:48:45,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:48:45,764 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:48:45,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-11-29 01:48:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:45,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 01:48:45,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:48:45,920 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-11-29 01:48:45,921 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:48:45,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544011815] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:48:45,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:48:45,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2023-11-29 01:48:45,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519733994] [2023-11-29 01:48:45,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:48:45,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:48:45,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:48:45,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:48:45,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:48:45,923 INFO L87 Difference]: Start difference. First operand 15401 states and 17577 transitions. Second operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 3 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-29 01:48:47,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:48:47,544 INFO L93 Difference]: Finished difference Result 15664 states and 17863 transitions. [2023-11-29 01:48:47,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:48:47,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 3 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 234 [2023-11-29 01:48:47,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:48:47,567 INFO L225 Difference]: With dead ends: 15664 [2023-11-29 01:48:47,567 INFO L226 Difference]: Without dead ends: 14513 [2023-11-29 01:48:47,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:48:47,573 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 104 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:48:47,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 432 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:48:47,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14513 states. [2023-11-29 01:48:48,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14513 to 14513. [2023-11-29 01:48:48,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14513 states, 12226 states have (on average 1.1149190250286276) internal successors, (13631), 12411 states have internal predecessors, (13631), 1191 states have call successors, (1191), 862 states have call predecessors, (1191), 1095 states have return successors, (1753), 1241 states have call predecessors, (1753), 1191 states have call successors, (1753) [2023-11-29 01:48:48,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14513 states to 14513 states and 16575 transitions. [2023-11-29 01:48:48,938 INFO L78 Accepts]: Start accepts. Automaton has 14513 states and 16575 transitions. Word has length 234 [2023-11-29 01:48:48,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:48:48,939 INFO L495 AbstractCegarLoop]: Abstraction has 14513 states and 16575 transitions. [2023-11-29 01:48:48,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 3 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-29 01:48:48,939 INFO L276 IsEmpty]: Start isEmpty. Operand 14513 states and 16575 transitions. [2023-11-29 01:48:48,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2023-11-29 01:48:48,946 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:48:48,946 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-29 01:48:48,951 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2023-11-29 01:48:49,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:48:49,147 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:48:49,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:48:49,147 INFO L85 PathProgramCache]: Analyzing trace with hash 459810019, now seen corresponding path program 1 times [2023-11-29 01:48:49,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:48:49,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403863004] [2023-11-29 01:48:49,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:48:49,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:48:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:49,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:48:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:49,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:48:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:49,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:48:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:49,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 01:48:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:49,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:48:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:49,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 01:48:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:49,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 01:48:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:49,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:48:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:49,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 01:48:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:49,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:48:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:49,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 01:48:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:49,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:48:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:49,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-11-29 01:48:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:49,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2023-11-29 01:48:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:49,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:48:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:49,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2023-11-29 01:48:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:49,241 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2023-11-29 01:48:49,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:48:49,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403863004] [2023-11-29 01:48:49,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403863004] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:48:49,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867641297] [2023-11-29 01:48:49,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:48:49,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:48:49,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:48:49,243 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:48:49,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-11-29 01:48:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:49,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:48:49,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:48:49,387 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2023-11-29 01:48:49,387 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:48:49,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867641297] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:48:49,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:48:49,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2023-11-29 01:48:49,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015239873] [2023-11-29 01:48:49,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:48:49,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:48:49,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:48:49,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:48:49,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:48:49,389 INFO L87 Difference]: Start difference. First operand 14513 states and 16575 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-29 01:48:50,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:48:50,679 INFO L93 Difference]: Finished difference Result 22657 states and 25994 transitions. [2023-11-29 01:48:50,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:48:50,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 226 [2023-11-29 01:48:50,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:48:50,706 INFO L225 Difference]: With dead ends: 22657 [2023-11-29 01:48:50,706 INFO L226 Difference]: Without dead ends: 14537 [2023-11-29 01:48:50,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 256 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-29 01:48:50,717 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 2 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:48:50,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 429 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:48:50,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14537 states. [2023-11-29 01:48:52,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14537 to 14513. [2023-11-29 01:48:52,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14513 states, 12226 states have (on average 1.1125470309177163) internal successors, (13602), 12411 states have internal predecessors, (13602), 1191 states have call successors, (1191), 862 states have call predecessors, (1191), 1095 states have return successors, (1753), 1241 states have call predecessors, (1753), 1191 states have call successors, (1753) [2023-11-29 01:48:52,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14513 states to 14513 states and 16546 transitions. [2023-11-29 01:48:52,080 INFO L78 Accepts]: Start accepts. Automaton has 14513 states and 16546 transitions. Word has length 226 [2023-11-29 01:48:52,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:48:52,081 INFO L495 AbstractCegarLoop]: Abstraction has 14513 states and 16546 transitions. [2023-11-29 01:48:52,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-29 01:48:52,081 INFO L276 IsEmpty]: Start isEmpty. Operand 14513 states and 16546 transitions. [2023-11-29 01:48:52,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2023-11-29 01:48:52,088 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:48:52,088 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 01:48:52,093 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-11-29 01:48:52,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:48:52,288 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:48:52,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:48:52,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1094532515, now seen corresponding path program 2 times [2023-11-29 01:48:52,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:48:52,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515783432] [2023-11-29 01:48:52,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:48:52,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:48:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:52,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:48:52,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:52,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 01:48:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:52,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 01:48:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:52,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 01:48:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:52,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 01:48:52,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:52,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 01:48:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:52,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 01:48:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:52,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:48:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:52,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 01:48:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:52,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:48:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:52,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 01:48:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:52,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:48:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:52,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-11-29 01:48:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:52,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2023-11-29 01:48:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:52,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:48:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:52,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-11-29 01:48:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:48:52,380 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2023-11-29 01:48:52,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:48:52,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515783432] [2023-11-29 01:48:52,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515783432] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:48:52,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879226804] [2023-11-29 01:48:52,380 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:48:52,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:48:52,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:48:52,381 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:48:52,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-11-29 01:48:52,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 01:48:52,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:48:52,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 01:48:52,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:48:52,468 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2023-11-29 01:48:52,468 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:48:52,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879226804] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:48:52,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:48:52,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-11-29 01:48:52,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106710225] [2023-11-29 01:48:52,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:48:52,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:48:52,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:48:52,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:48:52,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:48:52,470 INFO L87 Difference]: Start difference. First operand 14513 states and 16546 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-29 01:48:52,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:48:52,962 INFO L93 Difference]: Finished difference Result 17862 states and 20411 transitions. [2023-11-29 01:48:52,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:48:52,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 227 [2023-11-29 01:48:52,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:48:52,963 INFO L225 Difference]: With dead ends: 17862 [2023-11-29 01:48:52,963 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 01:48:52,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:48:52,975 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 11 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:48:52,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 416 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:48:52,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 01:48:52,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 01:48:52,976 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-29 01:48:52,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 01:48:52,977 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 227 [2023-11-29 01:48:52,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:48:52,977 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 01:48:52,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-29 01:48:52,977 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 01:48:52,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 01:48:52,979 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-11-29 01:48:52,980 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-11-29 01:48:52,984 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2023-11-29 01:48:53,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2023-11-29 01:48:53,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 01:50:37,209 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 926 936) no Hoare annotation was computed. [2023-11-29 01:50:37,209 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 926 936) no Hoare annotation was computed. [2023-11-29 01:50:37,211 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 926 936) the Hoare annotation is: (let ((.cse32 (= |old(~t1_st~0)| ~t1_st~0)) (.cse33 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse27 (and (<= 1 ~m_pc~0) (or (< ~m_pc~0 2) (< 1 ~t1_pc~0)))) (.cse17 (< |old(~m_st~0)| 2)) (.cse18 (< ~E_1~0 2)) (.cse28 (= ~E_2~0 0)) (.cse22 (not (= ~m_pc~0 ~t1_pc~0))) (.cse23 (< 0 ~t1_pc~0)) (.cse29 (not (= |old(~t2_st~0)| 0))) (.cse30 (< 0 ~t2_pc~0)) (.cse31 (and .cse32 .cse33 (= 0 ~t2_st~0))) (.cse0 (< ~T1_E~0 2)) (.cse1 (not (= ~q_req_up~0 0))) (.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~t2_i~0 1))) (.cse4 (< ~E_2~0 2)) (.cse5 (< 0 ~q_read_ev~0)) (.cse6 (and .cse32 .cse33 (= |old(~t2_st~0)| ~t2_st~0))) (.cse7 (not (= ~c_dr_pc~0 0))) (.cse8 (not (= ~m_i~0 1))) (.cse9 (< |old(~t1_st~0)| 2)) (.cse10 (not (= ~t1_pc~0 1))) (.cse24 (< ~E_M~0 2)) (.cse11 (not (= ~p_num_write~0 0))) (.cse25 (< |old(~t2_st~0)| 2)) (.cse12 (< 0 ~q_write_ev~0)) (.cse13 (not (= ~p_dw_pc~0 0))) (.cse14 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse15 (not (= ~c_num_read~0 0))) (.cse16 (not (= ~q_free~0 0))) (.cse19 (< ~T2_E~0 2)) (.cse20 (not (= ~t2_pc~0 1))) (.cse21 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse26 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~token~0 (+ 2 ~local~0))) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse22 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse24 .cse11 .cse25 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse20 .cse21 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse10 .cse24 .cse11 .cse25 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse28) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse29 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse31 .cse18 .cse19 .cse21 .cse28) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse29 .cse9 .cse10 .cse24 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse30 .cse31 .cse19 .cse21 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 (= ~m_pc~0 1) .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse7 .cse8 .cse29 .cse10 .cse24 .cse11 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse31 .cse18 .cse19 .cse21 .cse28) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse24 .cse11 .cse25 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (not (= (+ ~local~0 1) ~token~0)) .cse21 .cse28) (or .cse0 .cse1 .cse22 .cse2 .cse23 .cse3 .cse4 .cse5 .cse7 .cse8 .cse29 .cse24 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse30 .cse31 .cse19 .cse21 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse11 .cse25 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse20 .cse21 .cse26)))) [2023-11-29 01:50:37,211 INFO L899 garLoopResultBuilder]: For program point update_channels1EXIT(lines 226 240) no Hoare annotation was computed. [2023-11-29 01:50:37,211 INFO L899 garLoopResultBuilder]: For program point L48-1(lines 48 52) no Hoare annotation was computed. [2023-11-29 01:50:37,211 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 47) no Hoare annotation was computed. [2023-11-29 01:50:37,212 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 226 240) the Hoare annotation is: (let ((.cse40 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse37 (= ~c_dr_pc~0 1)) (.cse38 (= ~q_ev~0 |old(~q_ev~0)|)) (.cse39 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse41 (= ~q_read_ev~0 2)) (.cse14 (= ~p_dw_st~0 0))) (let ((.cse27 (not .cse14)) (.cse28 (not (= ~c_dr_pc~0 0))) (.cse29 (not (= ~p_num_write~0 0))) (.cse30 (not (= ~p_dw_pc~0 0))) (.cse31 (not (= ~c_num_read~0 0))) (.cse22 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse33 (and .cse38 (= ~q_req_up~0 0) .cse39 .cse41)) (.cse11 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse18 (not .cse37)) (.cse21 (not (= ~q_free~0 1))) (.cse25 (not (= |old(~q_req_up~0)| 0))) (.cse3 (< |old(~q_write_ev~0)| 2)) (.cse2 (< 0 ~t1_pc~0)) (.cse5 (< ~E_2~0 2)) (.cse6 (not (= |old(~q_req_up~0)| 1))) (.cse7 (and .cse38 .cse39 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse40)) (.cse10 (not (= ~p_dw_pc~0 1))) (.cse12 (< 0 ~t2_pc~0)) (.cse15 (not (= 0 ~t2_st~0))) (.cse17 (not (= ~m_st~0 0))) (.cse19 (< ~T2_E~0 2)) (.cse36 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse23 (not (= ~token~0 ~local~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse4 (not (= ~M_E~0 2))) (.cse34 (and .cse38 .cse39 .cse40 .cse41)) (.cse8 (not (= ~E_M~0 ~M_E~0))) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse24 (= ~m_pc~0 1)) (.cse35 (not (= ~q_free~0 0))) (.cse13 (not (= ~E_1~0 ~M_E~0))) (.cse16 (not (= ~T1_E~0 ~M_E~0))) (.cse32 (not (= |old(~q_read_ev~0)| 2))) (.cse20 (not (= ~p_dw_i~0 1))) (.cse26 (= ~E_2~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse24 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (< 0 |old(~q_read_ev~0)|) .cse21 .cse25 .cse26 .cse23) (or .cse1 .cse27 .cse2 .cse3 .cse4 .cse5 .cse28 .cse8 .cse29 .cse30 .cse9 .cse31 .cse12 .cse13 .cse15 .cse16 .cse17 .cse32 .cse19 .cse20 .cse21 .cse25 .cse22 .cse33 .cse23) (or .cse0 .cse1 .cse27 .cse4 .cse28 .cse8 .cse29 .cse30 .cse9 .cse24 .cse31 .cse13 .cse16 .cse32 .cse20 .cse21 .cse25 .cse22 .cse33 .cse26) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse34 .cse8 .cse9 .cse35 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse32 (< 0 |old(~q_write_ev~0)|) .cse19 .cse20 .cse25 .cse36 .cse23) (or (and (or .cse0 .cse1 .cse4 .cse8 .cse9 .cse35 .cse13 .cse14 .cse16 .cse32 .cse20 .cse25 .cse26) (or .cse0 .cse1 .cse4 .cse8 .cse9 .cse24 .cse11 .cse13 .cse14 .cse16 .cse32 .cse18 .cse20 .cse21 .cse25 .cse26)) .cse2 .cse3 .cse7 .cse12) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse35 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse32 .cse19 .cse20 .cse36 .cse23) (or .cse0 .cse1 .cse4 .cse34 .cse8 .cse37 .cse9 .cse24 .cse35 .cse13 .cse16 .cse32 .cse20 .cse26)))) [2023-11-29 01:50:37,212 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 42 57) no Hoare annotation was computed. [2023-11-29 01:50:37,212 INFO L899 garLoopResultBuilder]: For program point L230-1(lines 226 240) no Hoare annotation was computed. [2023-11-29 01:50:37,212 INFO L899 garLoopResultBuilder]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2023-11-29 01:50:37,212 INFO L899 garLoopResultBuilder]: For program point L680(lines 680 689) no Hoare annotation was computed. [2023-11-29 01:50:37,212 INFO L899 garLoopResultBuilder]: For program point L680-2(lines 680 689) no Hoare annotation was computed. [2023-11-29 01:50:37,212 INFO L899 garLoopResultBuilder]: For program point L643(lines 643 648) no Hoare annotation was computed. [2023-11-29 01:50:37,212 INFO L899 garLoopResultBuilder]: For program point L672(lines 660 674) no Hoare annotation was computed. [2023-11-29 01:50:37,212 INFO L899 garLoopResultBuilder]: For program point L681(lines 681 686) no Hoare annotation was computed. [2023-11-29 01:50:37,213 INFO L899 garLoopResultBuilder]: For program point L661(lines 661 670) no Hoare annotation was computed. [2023-11-29 01:50:37,213 INFO L899 garLoopResultBuilder]: For program point L917(lines 917 921) no Hoare annotation was computed. [2023-11-29 01:50:37,213 INFO L899 garLoopResultBuilder]: For program point L661-2(lines 661 670) no Hoare annotation was computed. [2023-11-29 01:50:37,213 INFO L899 garLoopResultBuilder]: For program point L917-2(lines 892 925) no Hoare annotation was computed. [2023-11-29 01:50:37,213 INFO L899 garLoopResultBuilder]: For program point L653(lines 641 655) no Hoare annotation was computed. [2023-11-29 01:50:37,213 INFO L899 garLoopResultBuilder]: For program point L909(lines 909 913) no Hoare annotation was computed. [2023-11-29 01:50:37,213 INFO L899 garLoopResultBuilder]: For program point L909-2(lines 909 913) no Hoare annotation was computed. [2023-11-29 01:50:37,214 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 892 925) the Hoare annotation is: (let ((.cse35 (= |old(~t2_st~0)| ~t2_st~0)) (.cse34 (= |old(~t1_st~0)| ~t1_st~0)) (.cse37 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse30 (not (= ~token~0 (+ 2 ~local~0)))) (.cse14 (= ~m_pc~0 1)) (.cse32 (and (<= 1 ~m_pc~0) (or (< ~m_pc~0 2) (< 1 ~t1_pc~0)))) (.cse33 (= ~E_2~0 0)) (.cse17 (< |old(~m_st~0)| 2)) (.cse18 (< ~E_1~0 2)) (.cse36 (not (= (+ ~local~0 1) ~token~0))) (.cse31 (not (= ~m_pc~0 ~t1_pc~0))) (.cse3 (< 0 ~t1_pc~0)) (.cse27 (not (= |old(~t2_st~0)| 0))) (.cse28 (< 0 ~t2_pc~0)) (.cse29 (and .cse34 .cse37 (= 0 ~t2_st~0))) (.cse0 (< ~T1_E~0 2)) (.cse1 (not (= ~q_req_up~0 0))) (.cse2 (not (= ~p_dw_st~0 0))) (.cse4 (not (= ~t2_i~0 1))) (.cse5 (< ~E_2~0 2)) (.cse21 (< 0 ~q_read_ev~0)) (.cse6 (and .cse34 .cse37 .cse35)) (.cse7 (not (= ~c_dr_pc~0 0))) (.cse8 (not (= ~m_i~0 1))) (.cse22 (< |old(~t1_st~0)| 2)) (.cse23 (not (= ~t1_pc~0 1))) (.cse9 (< ~E_M~0 2)) (.cse10 (not (= ~p_num_write~0 0))) (.cse11 (< |old(~t2_st~0)| 2)) (.cse24 (< 0 ~q_write_ev~0)) (.cse12 (not (= ~p_dw_pc~0 0))) (.cse13 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse15 (not (= ~c_num_read~0 0))) (.cse16 (not (= ~q_free~0 0))) (.cse19 (< ~T2_E~0 2)) (.cse25 (not (= ~t2_pc~0 1))) (.cse20 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse26 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse22 .cse23 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse25 .cse20) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse23 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 .cse8 .cse27 .cse9 .cse10 .cse24 .cse12 .cse13 .cse15 .cse16 .cse17 .cse28 .cse29 .cse18 .cse19 .cse20 .cse26) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse21 .cse6 .cse30 .cse7 .cse8 .cse22 .cse23 .cse10 .cse24 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse25 .cse20) (or .cse0 .cse1 .cse31 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse15 .cse16 .cse19 .cse25 .cse20 .cse26) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse23 .cse9 .cse10 .cse11 .cse32 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse33) (or .cse0 .cse1 .cse2 .cse4 .cse21 .cse7 .cse8 .cse27 .cse23 .cse9 .cse10 .cse24 .cse12 .cse13 .cse15 .cse16 .cse17 .cse28 .cse29 .cse18 .cse19 .cse20 .cse33) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse21 .cse7 .cse8 .cse27 .cse22 .cse23 .cse9 .cse10 .cse24 .cse32 .cse12 .cse13 .cse15 .cse16 .cse28 .cse29 .cse19 .cse20 .cse26) (or .cse0 .cse1 .cse2 .cse4 (and .cse34 (= ~m_st~0 0) .cse35) .cse5 .cse21 .cse30 .cse7 .cse8 .cse22 .cse23 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse15 .cse16 (not (= |old(~m_st~0)| 0)) .cse18 .cse19 .cse25 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse27 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse28 .cse29 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse23 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse4 .cse7 .cse8 .cse27 .cse23 .cse9 .cse10 .cse32 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse20 .cse33) (or .cse0 .cse1 .cse2 .cse4 .cse21 .cse6 .cse7 .cse8 .cse23 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse25 .cse36 .cse20 .cse33) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse21 .cse7 .cse8 .cse27 .cse22 .cse23 .cse9 .cse10 .cse24 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse25 .cse36 .cse20) (or .cse0 .cse1 .cse31 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 .cse8 .cse27 .cse9 .cse10 .cse24 .cse12 .cse13 .cse15 .cse16 .cse28 .cse29 .cse19 .cse20 .cse26) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse22 .cse23 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse15 .cse16 .cse19 .cse25 .cse20 .cse26)))) [2023-11-29 01:50:37,214 INFO L899 garLoopResultBuilder]: For program point L901(lines 901 905) no Hoare annotation was computed. [2023-11-29 01:50:37,214 INFO L899 garLoopResultBuilder]: For program point L901-2(lines 901 905) no Hoare annotation was computed. [2023-11-29 01:50:37,214 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 892 925) no Hoare annotation was computed. [2023-11-29 01:50:37,214 INFO L899 garLoopResultBuilder]: For program point L662(lines 662 667) no Hoare annotation was computed. [2023-11-29 01:50:37,214 INFO L899 garLoopResultBuilder]: For program point L691(lines 679 693) no Hoare annotation was computed. [2023-11-29 01:50:37,214 INFO L899 garLoopResultBuilder]: For program point L642(lines 642 651) no Hoare annotation was computed. [2023-11-29 01:50:37,215 INFO L895 garLoopResultBuilder]: At program point L321(line 321) the Hoare annotation is: (let ((.cse34 (= ~c_dr_pc~0 1)) (.cse22 (= |old(~p_dw_st~0)| 0)) (.cse35 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse3 (not (= ~c_dr_pc~0 0))) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~p_dw_pc~0 0))) (.cse9 (not (= ~c_num_read~0 0))) (.cse12 (and .cse35 (= ~p_dw_st~0 0))) (.cse16 (not .cse22)) (.cse18 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse24 (not (= ~q_free~0 0))) (.cse17 (not (= ~q_read_ev~0 2))) (.cse0 (not (= ~q_req_up~0 0))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse20 (< 0 ~t1_pc~0)) (.cse2 (not (= ~M_E~0 2))) (.cse21 (< ~E_2~0 2)) (.cse23 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse35)) (.cse4 (not (= ~E_M~0 ~M_E~0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (= ~m_pc~0 1)) (.cse25 (not (= ~p_dw_pc~0 1))) (.cse31 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse26 (< 0 ~t2_pc~0)) (.cse10 (not (= ~E_1~0 ~M_E~0))) (.cse27 (not (= 0 ~t2_st~0))) (.cse11 (not (= ~T1_E~0 ~M_E~0))) (.cse28 (not (= ~m_st~0 0))) (.cse32 (not .cse34)) (.cse29 (< ~T2_E~0 2)) (.cse13 (not (= ~p_dw_i~0 1))) (.cse14 (not (= ~q_free~0 1))) (.cse15 (= |old(~c_dr_st~0)| 0)) (.cse33 (< ~q_write_ev~0 2)) (.cse19 (= ~E_2~0 0)) (.cse30 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse20 .cse2 .cse21 .cse22 .cse23 .cse4 .cse7 .cse24 .cse25 .cse26 .cse10 .cse27 .cse11 .cse28 .cse29 .cse13 .cse15 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse17 .cse30) (or .cse0 .cse1 .cse20 (not (= ~q_read_ev~0 1)) .cse2 .cse21 .cse22 .cse23 .cse4 .cse7 .cse8 .cse25 .cse31 .cse26 .cse10 .cse27 .cse11 .cse28 .cse32 .cse29 .cse13 .cse14 .cse15 .cse33 .cse19 .cse30) (or .cse1 .cse2 .cse23 .cse4 .cse34 .cse7 .cse8 .cse24 .cse10 .cse11 .cse13 .cse15 .cse17 .cse19) (or .cse0 .cse1 .cse20 .cse2 .cse21 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse27 .cse11 .cse28 .cse12 .cse29 .cse13 .cse14 .cse16 .cse33 .cse17 .cse18 .cse30) (or .cse20 .cse23 .cse26 (and (or .cse0 .cse1 .cse2 .cse22 .cse4 .cse7 .cse8 .cse31 .cse10 .cse11 .cse32 .cse13 .cse14 .cse15 .cse17 .cse19) (or .cse0 .cse1 .cse2 .cse22 .cse4 .cse7 .cse24 .cse10 .cse11 .cse13 .cse15 .cse17 .cse19)) .cse33) (or .cse0 .cse1 .cse20 .cse2 .cse21 (< 0 ~q_read_ev~0) .cse22 .cse23 .cse4 .cse7 .cse8 .cse25 .cse31 .cse26 .cse10 .cse27 .cse11 .cse28 .cse32 .cse29 .cse13 .cse14 .cse15 .cse33 .cse19 .cse30)))) [2023-11-29 01:50:37,215 INFO L895 garLoopResultBuilder]: At program point L323-2(lines 323 327) the Hoare annotation is: (let ((.cse36 (= ~c_dr_pc~0 1)) (.cse37 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse23 (= |old(~p_dw_st~0)| 0)) (.cse38 (= activate_threads1_~tmp~1 0)) (.cse39 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse35 (= ~p_dw_st~0 0))) (let ((.cse3 (not (= ~c_dr_pc~0 0))) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (and .cse38 .cse39 .cse35)) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse10 (not (= ~c_num_read~0 0))) (.cse16 (not .cse23)) (.cse18 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (not (= ~q_req_up~0 0))) (.cse20 (< 0 ~t1_pc~0)) (.cse28 (< ~E_2~0 2)) (.cse34 (and .cse37 .cse39)) (.cse29 (not (= ~p_dw_pc~0 1))) (.cse24 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse21 (< 0 ~t2_pc~0)) (.cse30 (not (= 0 ~t2_st~0))) (.cse31 (not (= ~m_st~0 0))) (.cse25 (not .cse36)) (.cse32 (< ~T2_E~0 2)) (.cse14 (not (= ~q_free~0 1))) (.cse27 (< ~q_write_ev~0 2)) (.cse33 (not (= ~token~0 ~local~0))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (not (= ~M_E~0 2))) (.cse4 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (= ~m_pc~0 1)) (.cse26 (not (= ~q_free~0 0))) (.cse11 (not (= ~E_1~0 ~M_E~0))) (.cse12 (not (= ~T1_E~0 ~M_E~0))) (.cse22 (and .cse37 .cse38 .cse39)) (.cse13 (not (= ~p_dw_i~0 1))) (.cse15 (= |old(~c_dr_st~0)| 0)) (.cse17 (not (= ~q_read_ev~0 2))) (.cse19 (= ~E_2~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse20 .cse21 .cse22 (and (or .cse0 .cse1 .cse2 .cse23 .cse4 .cse8 .cse9 .cse24 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse17 .cse19) (or .cse0 .cse1 .cse2 .cse23 .cse4 .cse8 .cse26 .cse11 .cse12 .cse13 .cse15 .cse17 .cse19)) .cse27) (or .cse0 .cse1 .cse20 .cse2 .cse28 .cse23 .cse4 .cse8 .cse26 .cse29 .cse21 .cse11 .cse30 .cse12 .cse31 .cse22 .cse32 .cse13 .cse15 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse17 .cse33) (or .cse0 .cse1 .cse20 .cse2 .cse28 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse21 .cse11 .cse30 .cse12 .cse31 .cse32 .cse13 .cse14 .cse16 .cse27 .cse17 .cse18 .cse33) (or .cse0 .cse1 .cse20 .cse2 .cse28 (< 0 ~q_read_ev~0) .cse23 .cse34 .cse4 .cse8 .cse9 .cse29 .cse24 .cse21 .cse11 .cse30 .cse12 .cse31 .cse25 .cse32 .cse13 .cse14 .cse15 .cse27 .cse19 .cse33) (or .cse0 .cse1 .cse20 (not (= ~q_read_ev~0 1)) .cse2 .cse28 (and (not (= ~c_dr_st~0 0)) .cse35) .cse23 .cse34 .cse4 .cse8 .cse9 .cse29 .cse24 .cse21 .cse11 .cse30 .cse12 .cse31 .cse25 .cse32 .cse13 .cse14 .cse15 .cse27 .cse19 .cse33) (or .cse1 .cse2 .cse4 .cse36 .cse8 .cse9 .cse26 .cse11 .cse12 .cse22 .cse13 .cse15 .cse17 .cse19)))) [2023-11-29 01:50:37,215 INFO L899 garLoopResultBuilder]: For program point L321-1(line 321) no Hoare annotation was computed. [2023-11-29 01:50:37,215 INFO L899 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 315 339) no Hoare annotation was computed. [2023-11-29 01:50:37,215 INFO L899 garLoopResultBuilder]: For program point L331(lines 331 335) no Hoare annotation was computed. [2023-11-29 01:50:37,215 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 315 339) the Hoare annotation is: (let ((.cse34 (= ~c_dr_pc~0 1)) (.cse22 (= |old(~p_dw_st~0)| 0)) (.cse35 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse3 (not (= ~c_dr_pc~0 0))) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~p_dw_pc~0 0))) (.cse9 (not (= ~c_num_read~0 0))) (.cse12 (and .cse35 (= ~p_dw_st~0 0))) (.cse16 (not .cse22)) (.cse18 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse24 (not (= ~q_free~0 0))) (.cse17 (not (= ~q_read_ev~0 2))) (.cse0 (not (= ~q_req_up~0 0))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse20 (< 0 ~t1_pc~0)) (.cse2 (not (= ~M_E~0 2))) (.cse21 (< ~E_2~0 2)) (.cse23 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse35)) (.cse4 (not (= ~E_M~0 ~M_E~0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (= ~m_pc~0 1)) (.cse25 (not (= ~p_dw_pc~0 1))) (.cse31 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse26 (< 0 ~t2_pc~0)) (.cse10 (not (= ~E_1~0 ~M_E~0))) (.cse27 (not (= 0 ~t2_st~0))) (.cse11 (not (= ~T1_E~0 ~M_E~0))) (.cse28 (not (= ~m_st~0 0))) (.cse32 (not .cse34)) (.cse29 (< ~T2_E~0 2)) (.cse13 (not (= ~p_dw_i~0 1))) (.cse14 (not (= ~q_free~0 1))) (.cse15 (= |old(~c_dr_st~0)| 0)) (.cse33 (< ~q_write_ev~0 2)) (.cse19 (= ~E_2~0 0)) (.cse30 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse20 .cse2 .cse21 .cse22 .cse23 .cse4 .cse7 .cse24 .cse25 .cse26 .cse10 .cse27 .cse11 .cse28 .cse29 .cse13 .cse15 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse17 .cse30) (or .cse0 .cse1 .cse20 (not (= ~q_read_ev~0 1)) .cse2 .cse21 .cse22 .cse23 .cse4 .cse7 .cse8 .cse25 .cse31 .cse26 .cse10 .cse27 .cse11 .cse28 .cse32 .cse29 .cse13 .cse14 .cse15 .cse33 .cse19 .cse30) (or .cse1 .cse2 .cse23 .cse4 .cse34 .cse7 .cse8 .cse24 .cse10 .cse11 .cse13 .cse15 .cse17 .cse19) (or .cse0 .cse1 .cse20 .cse2 .cse21 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse27 .cse11 .cse28 .cse12 .cse29 .cse13 .cse14 .cse16 .cse33 .cse17 .cse18 .cse30) (or .cse20 .cse23 .cse26 (and (or .cse0 .cse1 .cse2 .cse22 .cse4 .cse7 .cse8 .cse31 .cse10 .cse11 .cse32 .cse13 .cse14 .cse15 .cse17 .cse19) (or .cse0 .cse1 .cse2 .cse22 .cse4 .cse7 .cse24 .cse10 .cse11 .cse13 .cse15 .cse17 .cse19)) .cse33) (or .cse0 .cse1 .cse20 .cse2 .cse21 (< 0 ~q_read_ev~0) .cse22 .cse23 .cse4 .cse7 .cse8 .cse25 .cse31 .cse26 .cse10 .cse27 .cse11 .cse28 .cse32 .cse29 .cse13 .cse14 .cse15 .cse33 .cse19 .cse30)))) [2023-11-29 01:50:37,216 INFO L899 garLoopResultBuilder]: For program point L329(line 329) no Hoare annotation was computed. [2023-11-29 01:50:37,216 INFO L899 garLoopResultBuilder]: For program point L331-2(lines 315 339) no Hoare annotation was computed. [2023-11-29 01:50:37,216 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2023-11-29 01:50:37,216 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 695 702) no Hoare annotation was computed. [2023-11-29 01:50:37,216 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 695 702) the Hoare annotation is: true [2023-11-29 01:50:37,216 INFO L899 garLoopResultBuilder]: For program point L830-1(lines 819 852) no Hoare annotation was computed. [2023-11-29 01:50:37,216 INFO L899 garLoopResultBuilder]: For program point L820-1(lines 819 852) no Hoare annotation was computed. [2023-11-29 01:50:37,216 INFO L899 garLoopResultBuilder]: For program point L845-1(lines 816 853) no Hoare annotation was computed. [2023-11-29 01:50:37,216 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 816 853) the Hoare annotation is: (let ((.cse31 (and (<= 1 ~m_pc~0) (< ~m_pc~0 2))) (.cse26 (< 0 ~t2_pc~0)) (.cse27 (not (= 0 ~t2_st~0))) (.cse1 (< ~t1_st~0 2)) (.cse30 (= ~m_pc~0 1)) (.cse7 (< ~m_st~0 2)) (.cse8 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~q_req_up~0 0))) (.cse24 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (not (= ~p_dw_st~0 0))) (.cse25 (< 0 ~t1_pc~0)) (.cse3 (not (= ~t2_i~0 1))) (.cse4 (< 0 ~q_read_ev~0)) (.cse5 (not (= ~c_dr_pc~0 0))) (.cse6 (not (= ~m_i~0 1))) (.cse9 (not (= ~p_num_write~0 0))) (.cse10 (< 0 ~q_write_ev~0)) (.cse11 (not (= ~p_dw_pc~0 0))) (.cse12 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse13 (not (= ~c_num_read~0 0))) (.cse14 (not (= ~q_free~0 0))) (.cse15 (< |old(~E_1~0)| 2)) (.cse16 (< |old(~E_M~0)| 2)) (.cse17 (< |old(~T2_E~0)| 2)) (.cse28 (not (= ~m_st~0 0))) (.cse18 (< |old(~E_2~0)| 2)) (.cse19 (not (= ~t2_pc~0 1))) (.cse20 (< ~t2_st~0 2)) (.cse21 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse22 (< |old(~T1_E~0)| 2)) (.cse23 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))) (.cse29 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse24 .cse2 .cse25 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse26 .cse27 .cse17 .cse28 .cse18 .cse21 .cse22 .cse23 .cse29) (or .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse30 .cse13 .cse14 .cse15 .cse16 .cse27 .cse17 .cse18 .cse21 .cse22 .cse23) (or .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse31 .cse23) (or .cse0 .cse2 .cse25 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse26 .cse27 .cse17 .cse18 .cse21 .cse22 .cse23 .cse29) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~token~0 (+ 2 ~local~0))) .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse28 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse17 .cse18 .cse19 (not (= (+ ~local~0 1) ~token~0)) .cse21 .cse22 .cse23) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse26 .cse27 .cse17 .cse18 .cse21 .cse22 .cse23 .cse29) (or .cse0 .cse2 .cse25 .cse3 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse30 .cse13 .cse14 .cse15 .cse16 .cse26 .cse27 .cse17 .cse18 .cse21 .cse22 .cse23) (or .cse0 .cse2 .cse25 .cse3 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse30 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse26 .cse27 .cse17 .cse28 .cse18 .cse21 .cse22 .cse31 .cse23 .cse29) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse26 .cse27 .cse17 .cse18 .cse21 .cse22 .cse23) (or .cse0 .cse2 .cse25 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse29) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse30 .cse13 .cse14 .cse15 .cse16 .cse17 .cse28 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse29) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse29) (or .cse0 .cse24 .cse2 .cse25 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse28 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse29))) [2023-11-29 01:50:37,217 INFO L899 garLoopResultBuilder]: For program point L835-1(lines 819 852) no Hoare annotation was computed. [2023-11-29 01:50:37,217 INFO L899 garLoopResultBuilder]: For program point L825-1(lines 819 852) no Hoare annotation was computed. [2023-11-29 01:50:37,217 INFO L899 garLoopResultBuilder]: For program point L840-1(lines 819 852) no Hoare annotation was computed. [2023-11-29 01:50:37,217 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 816 853) no Hoare annotation was computed. [2023-11-29 01:50:37,217 INFO L899 garLoopResultBuilder]: For program point L288-1(lines 279 296) no Hoare annotation was computed. [2023-11-29 01:50:37,217 INFO L899 garLoopResultBuilder]: For program point L283-1(lines 282 295) no Hoare annotation was computed. [2023-11-29 01:50:37,217 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 279 296) the Hoare annotation is: (let ((.cse33 (= ~c_dr_pc~0 1)) (.cse34 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse30 (= ~p_dw_st~0 0))) (let ((.cse3 (not .cse30)) (.cse5 (not (= ~c_dr_pc~0 0))) (.cse7 (not (= ~p_num_write~0 0))) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse11 (not (= ~c_num_read~0 0))) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse28 (not (= ~q_free~0 0))) (.cse14 (not (= |old(~q_read_ev~0)| 2))) (.cse18 (and .cse34 (= ~q_read_ev~0 2))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (= ~q_req_up~0 0))) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse20 (< 0 ~t1_pc~0)) (.cse21 (< |old(~q_write_ev~0)| 2)) (.cse4 (not (= ~M_E~0 2))) (.cse22 (< ~E_2~0 2)) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (= ~m_pc~0 1)) (.cse29 (not (= ~p_dw_pc~0 1))) (.cse31 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse23 (< 0 ~t2_pc~0)) (.cse12 (not (= ~E_1~0 ~M_E~0))) (.cse24 (not (= 0 ~t2_st~0))) (.cse13 (not (= ~T1_E~0 ~M_E~0))) (.cse25 (not (= ~m_st~0 0))) (.cse32 (not .cse33)) (.cse26 (< ~T2_E~0 2)) (.cse15 (not (= ~p_dw_i~0 1))) (.cse16 (not (= ~q_free~0 1))) (.cse19 (= ~E_2~0 0)) (.cse27 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse1 .cse2 .cse3 .cse20 .cse21 .cse4 .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse23 .cse12 .cse24 .cse13 .cse25 .cse14 .cse26 .cse15 .cse16 .cse17 .cse18 .cse27) (or .cse0 .cse1 .cse2 .cse20 .cse4 .cse22 .cse6 .cse9 .cse28 .cse29 .cse23 .cse12 .cse30 .cse24 .cse13 .cse25 .cse14 (< 0 |old(~q_write_ev~0)|) .cse26 .cse15 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse18 .cse27) (or .cse20 .cse21 .cse23 (and (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse9 .cse10 .cse31 .cse12 .cse30 .cse13 .cse14 .cse32 .cse15 .cse16 .cse19) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse9 .cse28 .cse12 .cse30 .cse13 .cse14 .cse15 .cse19)) .cse18) (or .cse0 .cse2 .cse4 .cse6 .cse33 .cse9 .cse10 .cse28 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse20 .cse21 .cse4 .cse22 .cse6 .cse9 .cse10 (and .cse34 (= |old(~q_read_ev~0)| ~q_read_ev~0)) .cse29 .cse31 .cse23 .cse12 .cse30 .cse24 .cse13 .cse25 .cse32 .cse26 .cse15 (< 0 |old(~q_read_ev~0)|) .cse16 .cse19 .cse27)))) [2023-11-29 01:50:37,218 INFO L899 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 279 296) no Hoare annotation was computed. [2023-11-29 01:50:37,218 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 98) no Hoare annotation was computed. [2023-11-29 01:50:37,218 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 101) no Hoare annotation was computed. [2023-11-29 01:50:37,218 INFO L899 garLoopResultBuilder]: For program point L92-2(lines 92 101) no Hoare annotation was computed. [2023-11-29 01:50:37,218 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 88 106) the Hoare annotation is: true [2023-11-29 01:50:37,218 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 88 106) no Hoare annotation was computed. [2023-11-29 01:50:37,218 INFO L899 garLoopResultBuilder]: For program point L103(lines 91 105) no Hoare annotation was computed. [2023-11-29 01:50:37,218 INFO L899 garLoopResultBuilder]: For program point L960-1(lines 949 982) no Hoare annotation was computed. [2023-11-29 01:50:37,218 INFO L899 garLoopResultBuilder]: For program point L762(lines 762 766) no Hoare annotation was computed. [2023-11-29 01:50:37,219 INFO L895 garLoopResultBuilder]: At program point L795-1(lines 757 809) the Hoare annotation is: (let ((.cse23 (= ~m_pc~0 ~t1_pc~0)) (.cse24 (= ~m_st~0 0)) (.cse29 (not (= ~m_pc~0 1))) (.cse25 (<= ~t1_pc~0 0)) (.cse21 (= 0 ~t2_st~0)) (.cse26 (= ~token~0 ~local~0)) (.cse22 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (<= 2 ~T2_E~0)) (.cse5 (= ~p_num_write~0 0)) (.cse6 (<= ~q_read_ev~0 0)) (.cse7 (= ~c_num_read~0 0)) (.cse8 (<= ~q_write_ev~0 0)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (<= 2 ~E_M~0)) (.cse11 (= ~q_free~0 0)) (.cse12 (<= 2 ~m_st~0)) (.cse13 (= ~q_req_up~0 0)) (.cse14 (<= 2 ~T1_E~0)) (.cse15 (<= 2 ~E_2~0)) (.cse27 (= ~t2_pc~0 1)) (.cse16 (= ~m_i~0 1)) (.cse17 (= ~p_dw_st~0 0)) (.cse18 (= ~t2_i~0 1)) (.cse19 (= ~c_dr_pc~0 0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse28 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse24 .cse11 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse11 .cse13 .cse14 .cse15 .cse27 .cse16 (= ~token~0 (+ 2 ~local~0)) .cse17 .cse18 .cse19 .cse20 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse29 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse24 .cse11 .cse25 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse29 .cse11 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (+ ~local~0 1) ~token~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28))) [2023-11-29 01:50:37,219 INFO L899 garLoopResultBuilder]: For program point L762-1(lines 757 809) no Hoare annotation was computed. [2023-11-29 01:50:37,219 INFO L899 garLoopResultBuilder]: For program point do_write_p_returnLabel#1(lines 132 171) no Hoare annotation was computed. [2023-11-29 01:50:37,219 INFO L895 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (let ((.cse24 (= ~p_dw_st~0 0))) (let ((.cse1 (= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~q_free~0 1)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse0 (<= 2 ~T2_E~0)) (.cse25 (not .cse24)) (.cse27 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse5 (= ~m_st~0 0)) (.cse10 (<= ~t1_pc~0 0)) (.cse11 (= ~q_req_up~0 0)) (.cse13 (<= 2 ~E_2~0)) (.cse14 (= ~p_dw_pc~0 1)) (.cse18 (= 0 ~t2_st~0)) (.cse19 (= ~token~0 ~local~0)) (.cse22 (<= ~t2_pc~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~T1_E~0 2)) (.cse7 (not (= ~m_pc~0 1))) (.cse9 (not (= ~c_dr_st~0 0))) (.cse26 (= ~q_free~0 0)) (.cse23 (not (= ~E_2~0 0))) (.cse15 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_pc~0 1)) (.cse16 (= ~p_dw_i~0 1)) (.cse17 (= ~E_M~0 2)) (.cse20 (= ~E_1~0 2)) (.cse21 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse11 .cse23 .cse24 .cse15 (= ~c_dr_pc~0 0) .cse16 (= ~c_last_read~0 ~p_last_write~0) .cse17 .cse20 .cse21) (and .cse8 (or (and .cse25 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse11 .cse23 .cse12 .cse15 .cse16 .cse17 .cse20 .cse21) (and .cse25 .cse2 .cse3 .cse4 .cse9 .cse26 .cse11 .cse23 .cse15 .cse16 .cse17 .cse20 .cse21)) .cse10 .cse22) (and .cse0 (<= ~q_read_ev~0 0) .cse25 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse25 .cse2 .cse27 .cse3 .cse4 .cse5 .cse8 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse25 (<= ~q_write_ev~0 0) .cse2 .cse27 .cse3 .cse4 .cse5 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse4 .cse7 .cse9 .cse26 .cse23 .cse15 (not .cse12) .cse16 .cse17 .cse20 .cse21)))) [2023-11-29 01:50:37,219 INFO L899 garLoopResultBuilder]: For program point L400-1(line 400) no Hoare annotation was computed. [2023-11-29 01:50:37,219 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 144) no Hoare annotation was computed. [2023-11-29 01:50:37,219 INFO L899 garLoopResultBuilder]: For program point L1061(lines 1061 1065) no Hoare annotation was computed. [2023-11-29 01:50:37,220 INFO L895 garLoopResultBuilder]: At program point L1029-1(lines 1029 1066) the Hoare annotation is: (let ((.cse23 (= ~m_pc~0 ~t1_pc~0)) (.cse24 (= ~m_st~0 0)) (.cse29 (not (= ~m_pc~0 1))) (.cse25 (<= ~t1_pc~0 0)) (.cse21 (= 0 ~t2_st~0)) (.cse26 (= ~token~0 ~local~0)) (.cse22 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (<= 2 ~T2_E~0)) (.cse5 (= ~p_num_write~0 0)) (.cse6 (<= ~q_read_ev~0 0)) (.cse7 (= ~c_num_read~0 0)) (.cse8 (<= ~q_write_ev~0 0)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (<= 2 ~E_M~0)) (.cse11 (= ~q_free~0 0)) (.cse12 (<= 2 ~m_st~0)) (.cse13 (= ~q_req_up~0 0)) (.cse14 (<= 2 ~T1_E~0)) (.cse15 (<= 2 ~E_2~0)) (.cse27 (= ~t2_pc~0 1)) (.cse16 (= ~m_i~0 1)) (.cse17 (= ~p_dw_st~0 0)) (.cse18 (= ~t2_i~0 1)) (.cse19 (= ~c_dr_pc~0 0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse28 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse24 .cse11 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse11 .cse13 .cse14 .cse15 .cse27 .cse16 (= ~token~0 (+ 2 ~local~0)) .cse17 .cse18 .cse19 .cse20 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse29 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse24 .cse11 .cse25 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse29 .cse11 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (+ ~local~0 1) ~token~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28))) [2023-11-29 01:50:37,220 INFO L899 garLoopResultBuilder]: For program point L798(lines 798 805) no Hoare annotation was computed. [2023-11-29 01:50:37,220 INFO L899 garLoopResultBuilder]: For program point L798-2(lines 798 805) no Hoare annotation was computed. [2023-11-29 01:50:37,220 INFO L895 garLoopResultBuilder]: At program point L435(line 435) the Hoare annotation is: (let ((.cse8 (= ~p_dw_st~0 0))) (let ((.cse15 (= ~q_req_up~0 1)) (.cse28 (= ~c_num_read~0 ~p_num_write~0)) (.cse3 (= ~q_free~0 1)) (.cse27 (<= 2 ~q_write_ev~0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse4 (not (= ~m_pc~0 1))) (.cse7 (not (= ~E_2~0 0))) (.cse29 (= ~c_dr_pc~0 1)) (.cse16 (<= 2 ~T2_E~0)) (.cse17 (not .cse8)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse18 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~T1_E~0 2)) (.cse19 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse20 (= ~q_free~0 0)) (.cse21 (<= ~t1_pc~0 0)) (.cse6 (= ~q_req_up~0 0)) (.cse22 (<= 2 ~E_2~0)) (.cse23 (= ~p_dw_pc~0 1)) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (= ~p_dw_i~0 1)) (.cse12 (= ~E_M~0 2)) (.cse24 (= 0 ~t2_st~0)) (.cse25 (= ~token~0 ~local~0)) (.cse13 (= ~E_1~0 2)) (.cse14 (= ~M_E~0 2)) (.cse26 (<= ~t2_pc~0 0))) (or (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~c_dr_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse0 .cse18 .cse1 .cse2 .cse19 .cse5 .cse20 .cse21 .cse22 .cse23 .cse9 .cse10 .cse12 .cse24 .cse25 .cse13 .cse14 .cse26) (and .cse27 (or (and .cse17 .cse28 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse29 .cse9 .cse10 .cse12 .cse13 .cse14) (and .cse17 .cse0 .cse1 .cse2 .cse5 .cse20 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14)) .cse21 .cse26) (and .cse16 (<= ~q_read_ev~0 0) .cse17 .cse28 .cse0 .cse1 .cse2 .cse19 .cse3 .cse27 .cse5 .cse21 .cse6 .cse29 .cse22 .cse23 .cse10 .cse12 .cse24 .cse25 .cse13 .cse14 .cse26) (and .cse15 .cse16 .cse17 .cse28 .cse0 .cse1 .cse2 .cse19 .cse3 .cse27 .cse5 .cse21 .cse29 .cse22 .cse23 .cse10 .cse11 .cse12 .cse24 .cse25 .cse13 .cse14 .cse26) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse20 .cse7 .cse9 (not .cse29) .cse10 .cse12 .cse13 .cse14) (and .cse16 .cse17 (<= ~q_write_ev~0 0) .cse0 .cse18 .cse1 .cse2 .cse19 .cse5 .cse20 .cse21 .cse6 .cse22 .cse23 .cse9 .cse10 .cse12 .cse24 .cse25 .cse13 .cse14 .cse26)))) [2023-11-29 01:50:37,220 INFO L899 garLoopResultBuilder]: For program point L435-1(line 435) no Hoare annotation was computed. [2023-11-29 01:50:37,220 INFO L899 garLoopResultBuilder]: For program point L402(lines 402 407) no Hoare annotation was computed. [2023-11-29 01:50:37,220 INFO L899 garLoopResultBuilder]: For program point transmit1_returnLabel#1(lines 566 601) no Hoare annotation was computed. [2023-11-29 01:50:37,220 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 143) no Hoare annotation was computed. [2023-11-29 01:50:37,220 INFO L899 garLoopResultBuilder]: For program point L965-1(lines 949 982) no Hoare annotation was computed. [2023-11-29 01:50:37,220 INFO L899 garLoopResultBuilder]: For program point L767-1(lines 757 809) no Hoare annotation was computed. [2023-11-29 01:50:37,220 INFO L899 garLoopResultBuilder]: For program point start_simulation2_returnLabel#1(lines 1014 1072) no Hoare annotation was computed. [2023-11-29 01:50:37,220 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 218) no Hoare annotation was computed. [2023-11-29 01:50:37,220 INFO L899 garLoopResultBuilder]: For program point master_returnLabel#1(lines 522 565) no Hoare annotation was computed. [2023-11-29 01:50:37,220 INFO L899 garLoopResultBuilder]: For program point L570(lines 570 578) no Hoare annotation was computed. [2023-11-29 01:50:37,221 INFO L895 garLoopResultBuilder]: At program point L372(lines 347 387) the Hoare annotation is: (let ((.cse12 (= ~c_dr_pc~0 1)) (.cse27 (= ~p_dw_st~0 0))) (let ((.cse24 (= ~p_num_write~0 0)) (.cse28 (= ~c_dr_pc~0 0)) (.cse25 (= ~c_num_read~0 0)) (.cse23 (= ~p_dw_pc~0 0)) (.cse32 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse11 (= ~q_req_up~0 0)) (.cse1 (= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~q_free~0 1)) (.cse29 (= ~c_last_read~0 ~p_last_write~0)) (.cse30 (= ~q_req_up~0 1)) (.cse0 (<= 2 ~T2_E~0)) (.cse31 (not .cse27)) (.cse35 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse5 (= ~m_st~0 0)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~E_2~0)) (.cse14 (= ~p_dw_pc~0 1)) (.cse18 (= 0 ~t2_st~0)) (.cse19 (= ~token~0 ~local~0)) (.cse22 (<= ~t2_pc~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~T1_E~0 2)) (.cse7 (not (= ~m_pc~0 1))) (.cse9 (not (= ~c_dr_st~0 0))) (.cse33 (= ~q_free~0 0)) (.cse26 (not (= ~E_2~0 0))) (.cse15 (= ~q_read_ev~0 2)) (.cse34 (not .cse12)) (.cse16 (= ~p_dw_i~0 1)) (.cse17 (= ~E_M~0 2)) (.cse20 (= ~E_1~0 2)) (.cse21 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse23 .cse24 .cse25 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse11 .cse26 .cse27 .cse15 .cse28 .cse16 .cse29 .cse17 .cse20 .cse21) (and .cse23 .cse0 .cse24 .cse25 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse13 .cse27 .cse15 .cse28 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse30 .cse0 .cse31 .cse25 .cse2 .cse3 .cse4 .cse32 .cse5 .cse8 .cse33 .cse10 .cse13 .cse14 .cse15 .cse34 .cse16 (= ~p_num_write~0 1) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse31 (<= ~q_write_ev~0 0) .cse2 .cse35 .cse3 .cse4 .cse5 .cse7 .cse9 .cse33 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse8 (or (and .cse31 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse11 .cse26 .cse12 .cse15 .cse16 .cse17 .cse20 .cse21) (and .cse31 .cse2 .cse3 .cse4 .cse9 .cse33 .cse11 .cse26 .cse15 .cse16 .cse17 .cse20 .cse21)) .cse10 .cse22) (and .cse0 (<= ~q_read_ev~0 0) .cse31 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse32 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse31 .cse2 .cse35 .cse3 .cse4 .cse5 .cse7 .cse8 .cse33 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse30 .cse0 .cse31 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse30 .cse0 .cse31 .cse2 .cse35 .cse3 .cse4 .cse5 .cse8 .cse9 .cse33 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse4 .cse7 .cse9 .cse33 .cse26 .cse15 .cse34 .cse16 .cse17 .cse20 .cse21)))) [2023-11-29 01:50:37,221 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 213) no Hoare annotation was computed. [2023-11-29 01:50:37,221 INFO L895 garLoopResultBuilder]: At program point L439(line 439) the Hoare annotation is: (let ((.cse8 (= ~p_dw_st~0 0))) (let ((.cse16 (= ~c_num_read~0 ~p_num_write~0)) (.cse3 (= ~q_free~0 1)) (.cse14 (<= 2 ~q_write_ev~0)) (.cse4 (not (= ~m_pc~0 1))) (.cse7 (not (= ~E_2~0 0))) (.cse17 (= ~c_dr_pc~0 1)) (.cse21 (<= 2 ~T2_E~0)) (.cse15 (not .cse8)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~T1_E~0 2)) (.cse22 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse18 (= ~q_free~0 0)) (.cse19 (<= ~t1_pc~0 0)) (.cse6 (= ~q_req_up~0 0)) (.cse23 (<= 2 ~E_2~0)) (.cse24 (= ~p_dw_pc~0 1)) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (= ~p_dw_i~0 1)) (.cse11 (= ~E_M~0 2)) (.cse25 (= 0 ~t2_st~0)) (.cse26 (= ~token~0 ~local~0)) (.cse12 (= ~E_1~0 2)) (.cse13 (= ~M_E~0 2)) (.cse20 (<= ~t2_pc~0 0))) (or (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~c_dr_pc~0 0) .cse10 (= ~c_last_read~0 ~p_last_write~0) .cse11 .cse12 .cse13) (and .cse14 (or (and .cse15 .cse16 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse15 .cse0 .cse1 .cse2 .cse5 .cse18 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13)) .cse19 .cse20) (and .cse21 (<= ~q_read_ev~0 0) .cse15 .cse16 .cse0 .cse1 .cse2 .cse22 .cse3 .cse14 .cse5 .cse19 .cse6 .cse17 .cse23 .cse24 .cse10 .cse11 .cse25 .cse26 .cse12 .cse13 .cse20) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse18 .cse7 .cse9 (not .cse17) .cse10 .cse11 .cse12 .cse13) (and .cse21 .cse15 (<= ~q_write_ev~0 0) .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse2 .cse22 .cse5 .cse18 .cse19 .cse6 .cse23 .cse24 .cse9 .cse10 .cse11 .cse25 .cse26 .cse12 .cse13 .cse20)))) [2023-11-29 01:50:37,221 INFO L895 garLoopResultBuilder]: At program point L439-1(line 439) the Hoare annotation is: (let ((.cse8 (= ~p_dw_st~0 0))) (let ((.cse16 (= ~c_num_read~0 ~p_num_write~0)) (.cse3 (= ~q_free~0 1)) (.cse18 (<= 2 ~q_write_ev~0)) (.cse14 (<= 2 ~T2_E~0)) (.cse15 (not .cse8)) (.cse17 (= ~m_st~0 0)) (.cse19 (<= ~t1_pc~0 0)) (.cse6 (= ~q_req_up~0 0)) (.cse21 (<= 2 ~E_2~0)) (.cse22 (= ~p_dw_pc~0 1)) (.cse23 (= 0 ~t2_st~0)) (.cse24 (= ~token~0 ~local~0)) (.cse25 (<= ~t2_pc~0 0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~T1_E~0 2)) (.cse4 (not (= ~m_pc~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse26 (= ~q_free~0 0)) (.cse7 (not (= ~E_2~0 0))) (.cse9 (= ~q_read_ev~0 2)) (.cse20 (= ~c_dr_pc~0 1)) (.cse10 (= ~p_dw_i~0 1)) (.cse11 (= ~E_M~0 2)) (.cse12 (= ~E_1~0 2)) (.cse13 (= ~M_E~0 2))) (or (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~c_dr_pc~0 0) .cse10 (= ~c_last_read~0 ~p_last_write~0) .cse11 .cse12 .cse13) (and .cse14 .cse15 .cse16 .cse0 .cse1 .cse2 .cse17 .cse3 (= ~q_read_ev~0 1) .cse4 .cse18 .cse5 .cse19 .cse6 .cse20 .cse21 .cse22 .cse10 .cse11 .cse23 .cse24 .cse12 .cse13 .cse25) (and .cse18 (or (and .cse15 .cse16 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse15 .cse0 .cse1 .cse2 .cse5 .cse26 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13)) .cse19 .cse25) (and .cse14 (<= ~q_read_ev~0 0) .cse15 .cse16 .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse18 .cse5 .cse19 .cse6 .cse20 .cse21 .cse22 .cse10 .cse11 .cse23 .cse24 .cse12 .cse13 .cse25) (and .cse14 .cse15 .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse2 .cse17 .cse5 .cse26 .cse19 .cse6 .cse21 .cse22 .cse9 .cse10 .cse11 .cse23 .cse24 .cse12 .cse13 .cse25) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse26 .cse7 .cse9 (not .cse20) .cse10 .cse11 .cse12 .cse13)))) [2023-11-29 01:50:37,222 INFO L899 garLoopResultBuilder]: For program point start_simulation1_returnLabel#1(lines 413 455) no Hoare annotation was computed. [2023-11-29 01:50:37,222 INFO L895 garLoopResultBuilder]: At program point L1001(line 1001) the Hoare annotation is: (let ((.cse23 (= ~m_pc~0 ~t1_pc~0)) (.cse24 (= ~m_st~0 0)) (.cse29 (not (= ~m_pc~0 1))) (.cse25 (<= ~t1_pc~0 0)) (.cse21 (= 0 ~t2_st~0)) (.cse26 (= ~token~0 ~local~0)) (.cse22 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (<= 2 ~T2_E~0)) (.cse5 (= ~p_num_write~0 0)) (.cse6 (<= ~q_read_ev~0 0)) (.cse7 (= ~c_num_read~0 0)) (.cse8 (<= ~q_write_ev~0 0)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (<= 2 ~E_M~0)) (.cse11 (= ~q_free~0 0)) (.cse12 (<= 2 ~m_st~0)) (.cse13 (= ~q_req_up~0 0)) (.cse14 (<= 2 ~T1_E~0)) (.cse15 (<= 2 ~E_2~0)) (.cse27 (= ~t2_pc~0 1)) (.cse16 (= ~m_i~0 1)) (.cse17 (= ~p_dw_st~0 0)) (.cse18 (= ~t2_i~0 1)) (.cse19 (= ~c_dr_pc~0 0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse28 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse24 .cse11 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse11 .cse13 .cse14 .cse15 .cse27 .cse16 (= ~token~0 (+ 2 ~local~0)) .cse17 .cse18 .cse19 .cse20 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse29 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse24 .cse11 .cse25 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse29 .cse11 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (+ ~local~0 1) ~token~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28))) [2023-11-29 01:50:37,222 INFO L899 garLoopResultBuilder]: For program point L1001-1(line 1001) no Hoare annotation was computed. [2023-11-29 01:50:37,222 INFO L899 garLoopResultBuilder]: For program point L770(lines 770 777) no Hoare annotation was computed. [2023-11-29 01:50:37,222 INFO L899 garLoopResultBuilder]: For program point L770-2(lines 770 777) no Hoare annotation was computed. [2023-11-29 01:50:37,222 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse8 (= ~p_dw_st~0 0))) (let ((.cse27 (= ~q_read_ev~0 1)) (.cse26 (= ~c_num_read~0 ~p_num_write~0)) (.cse3 (= ~q_free~0 1)) (.cse28 (<= 2 ~q_write_ev~0)) (.cse4 (not (= ~m_pc~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse7 (not (= ~E_2~0 0))) (.cse14 (<= 2 ~T2_E~0)) (.cse15 (not .cse8)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~T1_E~0 2)) (.cse17 (= ~m_st~0 0)) (.cse18 (= ~q_free~0 0)) (.cse19 (<= ~t1_pc~0 0)) (.cse6 (= ~q_req_up~0 0)) (.cse20 (= ~c_dr_pc~0 1)) (.cse21 (<= 2 ~E_2~0)) (.cse22 (= ~p_dw_pc~0 1)) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (= ~p_dw_i~0 1)) (.cse11 (= ~E_M~0 2)) (.cse23 (= 0 ~t2_st~0)) (.cse24 (= ~token~0 ~local~0)) (.cse12 (= ~E_1~0 2)) (.cse13 (= ~M_E~0 2)) (.cse25 (<= ~t2_pc~0 0))) (or (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~c_dr_pc~0 0) .cse10 (= ~c_last_read~0 ~p_last_write~0) .cse11 .cse12 .cse13) (and .cse14 .cse15 .cse0 .cse16 .cse1 .cse2 .cse17 .cse5 .cse18 .cse19 .cse6 .cse20 .cse21 .cse22 .cse9 .cse10 .cse11 .cse23 .cse24 .cse12 .cse13 .cse25) (and .cse14 .cse15 .cse26 .cse0 .cse1 .cse2 .cse17 .cse3 .cse27 .cse4 .cse28 .cse5 .cse19 .cse6 .cse20 .cse21 .cse10 .cse11 .cse23 .cse24 .cse12 .cse13 .cse25) (and .cse28 (or (and .cse15 .cse26 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse15 .cse0 .cse1 .cse2 .cse5 .cse18 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13)) .cse19 .cse25) (and .cse14 .cse26 .cse0 .cse1 .cse2 .cse17 .cse3 .cse27 .cse4 .cse28 .cse5 .cse19 .cse6 .cse20 .cse21 .cse22 .cse10 .cse11 .cse23 .cse24 .cse12 .cse13 .cse25) (and .cse14 (<= ~q_read_ev~0 0) .cse15 .cse26 .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse28 .cse5 .cse19 .cse6 .cse20 .cse21 .cse22 .cse10 .cse11 .cse23 .cse24 .cse12 .cse13 .cse25) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse18 .cse7 .cse9 (not .cse20) .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse15 .cse0 .cse16 .cse1 .cse2 .cse17 .cse18 .cse19 .cse6 .cse20 .cse21 .cse22 .cse9 .cse10 .cse11 .cse23 .cse24 .cse12 .cse13 .cse25 (= ~q_write_ev~0 1))))) [2023-11-29 01:50:37,222 INFO L899 garLoopResultBuilder]: For program point eval2_returnLabel#1(lines 751 815) no Hoare annotation was computed. [2023-11-29 01:50:37,222 INFO L899 garLoopResultBuilder]: For program point L606(lines 606 614) no Hoare annotation was computed. [2023-11-29 01:50:37,222 INFO L899 garLoopResultBuilder]: For program point L573(lines 573 577) no Hoare annotation was computed. [2023-11-29 01:50:37,222 INFO L899 garLoopResultBuilder]: For program point L441(line 441) no Hoare annotation was computed. [2023-11-29 01:50:37,222 INFO L899 garLoopResultBuilder]: For program point L177(lines 177 185) no Hoare annotation was computed. [2023-11-29 01:50:37,222 INFO L899 garLoopResultBuilder]: For program point L1003(lines 1003 1008) no Hoare annotation was computed. [2023-11-29 01:50:37,223 INFO L899 garLoopResultBuilder]: For program point L970-1(lines 949 982) no Hoare annotation was computed. [2023-11-29 01:50:37,223 INFO L899 garLoopResultBuilder]: For program point do_read_c_returnLabel#1(lines 173 225) no Hoare annotation was computed. [2023-11-29 01:50:37,223 INFO L899 garLoopResultBuilder]: For program point L409(lines 398 411) no Hoare annotation was computed. [2023-11-29 01:50:37,223 INFO L899 garLoopResultBuilder]: For program point L376(lines 376 383) no Hoare annotation was computed. [2023-11-29 01:50:37,223 INFO L895 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: false [2023-11-29 01:50:37,223 INFO L895 garLoopResultBuilder]: At program point L1037(line 1037) the Hoare annotation is: (let ((.cse23 (= ~m_pc~0 ~t1_pc~0)) (.cse24 (= ~m_st~0 0)) (.cse29 (not (= ~m_pc~0 1))) (.cse25 (<= ~t1_pc~0 0)) (.cse21 (= 0 ~t2_st~0)) (.cse26 (= ~token~0 ~local~0)) (.cse22 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (<= 2 ~T2_E~0)) (.cse5 (= ~p_num_write~0 0)) (.cse6 (<= ~q_read_ev~0 0)) (.cse7 (= ~c_num_read~0 0)) (.cse8 (<= ~q_write_ev~0 0)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (<= 2 ~E_M~0)) (.cse11 (= ~q_free~0 0)) (.cse12 (<= 2 ~m_st~0)) (.cse13 (= ~q_req_up~0 0)) (.cse14 (<= 2 ~T1_E~0)) (.cse15 (<= 2 ~E_2~0)) (.cse27 (= ~t2_pc~0 1)) (.cse16 (= ~m_i~0 1)) (.cse17 (= ~p_dw_st~0 0)) (.cse18 (= ~t2_i~0 1)) (.cse19 (= ~c_dr_pc~0 0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse28 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse24 .cse11 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse11 .cse13 .cse14 .cse15 .cse27 .cse16 (= ~token~0 (+ 2 ~local~0)) .cse17 .cse18 .cse19 .cse20 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse29 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse24 .cse11 .cse25 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse29 .cse11 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (+ ~local~0 1) ~token~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28))) [2023-11-29 01:50:37,223 INFO L899 garLoopResultBuilder]: For program point L1037-1(line 1037) no Hoare annotation was computed. [2023-11-29 01:50:37,223 INFO L899 garLoopResultBuilder]: For program point transmit2_returnLabel#1(lines 602 637) no Hoare annotation was computed. [2023-11-29 01:50:37,223 INFO L899 garLoopResultBuilder]: For program point L707(lines 707 711) no Hoare annotation was computed. [2023-11-29 01:50:37,223 INFO L899 garLoopResultBuilder]: For program point L707-2(lines 706 724) no Hoare annotation was computed. [2023-11-29 01:50:37,223 INFO L899 garLoopResultBuilder]: For program point L245(lines 245 249) no Hoare annotation was computed. [2023-11-29 01:50:37,223 INFO L899 garLoopResultBuilder]: For program point L245-2(lines 244 257) no Hoare annotation was computed. [2023-11-29 01:50:37,223 INFO L899 garLoopResultBuilder]: For program point eval1_returnLabel#1(lines 340 393) no Hoare annotation was computed. [2023-11-29 01:50:37,223 INFO L899 garLoopResultBuilder]: For program point L609(lines 609 613) no Hoare annotation was computed. [2023-11-29 01:50:37,224 INFO L895 garLoopResultBuilder]: At program point L543(line 543) the Hoare annotation is: (let ((.cse7 (= ~m_pc~0 ~t1_pc~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse24 (= 0 ~t2_st~0)) (.cse25 (<= ~t2_pc~0 0)) (.cse22 (= ~t1_pc~0 1)) (.cse23 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~T2_E~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (<= ~q_read_ev~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (<= ~q_write_ev~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (<= 2 ~E_M~0)) (.cse9 (= ~q_free~0 0)) (.cse11 (= ~q_req_up~0 0)) (.cse12 (<= 2 ~T1_E~0)) (.cse13 (<= 2 ~E_2~0)) (.cse14 (= ~t2_pc~0 1)) (.cse15 (= ~m_i~0 1)) (.cse16 (= ~p_dw_st~0 0)) (.cse17 (= ~t2_i~0 1)) (.cse18 (= ~c_dr_pc~0 0)) (.cse19 (= ~c_last_read~0 ~p_last_write~0)) (.cse20 (= ~token~0 ~local~0)) (.cse21 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse22 .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 (not (= ~m_pc~0 1)) .cse9 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse24 .cse20 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse24 .cse20 .cse25) (and .cse22 .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2023-11-29 01:50:37,224 INFO L899 garLoopResultBuilder]: For program point L543-1(line 543) no Hoare annotation was computed. [2023-11-29 01:50:37,224 INFO L899 garLoopResultBuilder]: For program point L444(lines 444 448) no Hoare annotation was computed. [2023-11-29 01:50:37,224 INFO L899 garLoopResultBuilder]: For program point L180(lines 180 184) no Hoare annotation was computed. [2023-11-29 01:50:37,224 INFO L895 garLoopResultBuilder]: At program point L147-1(lines 147 165) the Hoare annotation is: (let ((.cse26 (= ~c_dr_pc~0 1))) (let ((.cse27 (= ~q_req_up~0 1)) (.cse0 (<= 2 ~T2_E~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse7 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse8 (= ~m_st~0 0)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse11 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~E_2~0)) (.cse18 (= 0 ~t2_st~0)) (.cse19 (= ~token~0 ~local~0)) (.cse22 (<= ~t2_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse9 (= ~q_free~0 1)) (.cse12 (= ~q_req_up~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (= ~T1_E~0 2)) (.cse28 (not (= ~m_pc~0 1))) (.cse23 (not (= ~c_dr_st~0 0))) (.cse24 (= ~q_free~0 0)) (.cse25 (not (= ~E_2~0 0))) (.cse14 (= ~q_read_ev~0 2)) (.cse15 (not .cse26)) (.cse16 (= ~p_dw_i~0 1)) (.cse17 (= ~E_M~0 2)) (.cse20 (= ~E_1~0 2)) (.cse21 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse23 .cse24 .cse11 .cse12 .cse25 .cse14 .cse16 .cse17 .cse20 .cse21 .cse22) (and .cse0 .cse2 (= ~c_num_read~0 ~p_num_write~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse23 .cse11 .cse26 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse27 .cse0 .cse2 .cse4 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse5 .cse6 .cse7 .cse8 .cse10 .cse23 .cse24 .cse11 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse27 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse24 .cse11 .cse13 .cse14 .cse15 .cse16 (= ~p_num_write~0 1) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse1 .cse3 .cse4 .cse5 .cse6 .cse9 .cse28 .cse23 .cse12 .cse25 .cse14 .cse15 .cse16 .cse17 .cse20 .cse21) (and .cse4 .cse5 .cse6 .cse28 .cse23 .cse24 .cse25 .cse14 .cse15 .cse16 .cse17 .cse20 .cse21)))) [2023-11-29 01:50:37,224 INFO L899 garLoopResultBuilder]: For program point L148(lines 147 165) no Hoare annotation was computed. [2023-11-29 01:50:37,224 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 157) no Hoare annotation was computed. [2023-11-29 01:50:37,224 INFO L895 garLoopResultBuilder]: At program point L1041(line 1041) the Hoare annotation is: (let ((.cse23 (= ~m_pc~0 ~t1_pc~0)) (.cse24 (= ~m_st~0 0)) (.cse29 (not (= ~m_pc~0 1))) (.cse25 (<= ~t1_pc~0 0)) (.cse21 (= 0 ~t2_st~0)) (.cse26 (= ~token~0 ~local~0)) (.cse22 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (<= 2 ~T2_E~0)) (.cse5 (= ~p_num_write~0 0)) (.cse6 (<= ~q_read_ev~0 0)) (.cse7 (= ~c_num_read~0 0)) (.cse8 (<= ~q_write_ev~0 0)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (<= 2 ~E_M~0)) (.cse11 (= ~q_free~0 0)) (.cse12 (<= 2 ~m_st~0)) (.cse13 (= ~q_req_up~0 0)) (.cse14 (<= 2 ~T1_E~0)) (.cse15 (<= 2 ~E_2~0)) (.cse27 (= ~t2_pc~0 1)) (.cse16 (= ~m_i~0 1)) (.cse17 (= ~p_dw_st~0 0)) (.cse18 (= ~t2_i~0 1)) (.cse19 (= ~c_dr_pc~0 0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse28 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse24 .cse11 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse11 .cse13 .cse14 .cse15 .cse27 .cse16 (= ~token~0 (+ 2 ~local~0)) .cse17 .cse18 .cse19 .cse20 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse29 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse24 .cse11 .cse25 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse29 .cse11 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (+ ~local~0 1) ~token~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28))) [2023-11-29 01:50:37,225 INFO L895 garLoopResultBuilder]: At program point L1041-1(line 1041) the Hoare annotation is: (let ((.cse23 (= ~m_pc~0 ~t1_pc~0)) (.cse24 (= ~m_st~0 0)) (.cse29 (not (= ~m_pc~0 1))) (.cse25 (<= ~t1_pc~0 0)) (.cse21 (= 0 ~t2_st~0)) (.cse26 (= ~token~0 ~local~0)) (.cse22 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (<= 2 ~T2_E~0)) (.cse5 (= ~p_num_write~0 0)) (.cse6 (<= ~q_read_ev~0 0)) (.cse7 (= ~c_num_read~0 0)) (.cse8 (<= ~q_write_ev~0 0)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (<= 2 ~E_M~0)) (.cse11 (= ~q_free~0 0)) (.cse12 (<= 2 ~m_st~0)) (.cse13 (= ~q_req_up~0 0)) (.cse14 (<= 2 ~T1_E~0)) (.cse15 (<= 2 ~E_2~0)) (.cse27 (= ~t2_pc~0 1)) (.cse16 (= ~m_i~0 1)) (.cse17 (= ~p_dw_st~0 0)) (.cse18 (= ~t2_i~0 1)) (.cse19 (= ~c_dr_pc~0 0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse28 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse24 .cse11 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse11 .cse13 .cse14 .cse15 .cse27 .cse16 (= ~token~0 (+ 2 ~local~0)) .cse17 .cse18 .cse19 .cse20 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse29 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse24 .cse11 .cse25 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse29 .cse11 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (+ ~local~0 1) ~token~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28))) [2023-11-29 01:50:37,225 INFO L899 garLoopResultBuilder]: For program point L975-1(lines 946 983) no Hoare annotation was computed. [2023-11-29 01:50:37,225 INFO L895 garLoopResultBuilder]: At program point L348(line 348) the Hoare annotation is: (let ((.cse12 (= ~c_dr_pc~0 1)) (.cse27 (= ~p_dw_st~0 0))) (let ((.cse24 (= ~p_num_write~0 0)) (.cse28 (= ~c_dr_pc~0 0)) (.cse25 (= ~c_num_read~0 0)) (.cse23 (= ~p_dw_pc~0 0)) (.cse32 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse11 (= ~q_req_up~0 0)) (.cse1 (= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~q_free~0 1)) (.cse29 (= ~c_last_read~0 ~p_last_write~0)) (.cse30 (= ~q_req_up~0 1)) (.cse0 (<= 2 ~T2_E~0)) (.cse31 (not .cse27)) (.cse35 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse5 (= ~m_st~0 0)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~E_2~0)) (.cse14 (= ~p_dw_pc~0 1)) (.cse18 (= 0 ~t2_st~0)) (.cse19 (= ~token~0 ~local~0)) (.cse22 (<= ~t2_pc~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~T1_E~0 2)) (.cse7 (not (= ~m_pc~0 1))) (.cse9 (not (= ~c_dr_st~0 0))) (.cse33 (= ~q_free~0 0)) (.cse26 (not (= ~E_2~0 0))) (.cse15 (= ~q_read_ev~0 2)) (.cse34 (not .cse12)) (.cse16 (= ~p_dw_i~0 1)) (.cse17 (= ~E_M~0 2)) (.cse20 (= ~E_1~0 2)) (.cse21 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse23 .cse24 .cse25 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse11 .cse26 .cse27 .cse15 .cse28 .cse16 .cse29 .cse17 .cse20 .cse21) (and .cse23 .cse0 .cse24 .cse25 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse13 .cse27 .cse15 .cse28 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse30 .cse0 .cse31 .cse25 .cse2 .cse3 .cse4 .cse32 .cse5 .cse8 .cse33 .cse10 .cse13 .cse14 .cse15 .cse34 .cse16 (= ~p_num_write~0 1) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse31 (<= ~q_write_ev~0 0) .cse2 .cse35 .cse3 .cse4 .cse5 .cse7 .cse9 .cse33 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse8 (or (and .cse31 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse11 .cse26 .cse12 .cse15 .cse16 .cse17 .cse20 .cse21) (and .cse31 .cse2 .cse3 .cse4 .cse9 .cse33 .cse11 .cse26 .cse15 .cse16 .cse17 .cse20 .cse21)) .cse10 .cse22) (and .cse0 (<= ~q_read_ev~0 0) .cse31 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse32 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse31 .cse2 .cse35 .cse3 .cse4 .cse5 .cse7 .cse8 .cse33 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse30 .cse0 .cse31 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse30 .cse0 .cse31 .cse2 .cse35 .cse3 .cse4 .cse5 .cse8 .cse9 .cse33 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse4 .cse7 .cse9 .cse33 .cse26 .cse15 .cse34 .cse16 .cse17 .cse20 .cse21)))) [2023-11-29 01:50:37,225 INFO L895 garLoopResultBuilder]: At program point L216(line 216) the Hoare annotation is: false [2023-11-29 01:50:37,225 INFO L895 garLoopResultBuilder]: At program point L216-1(lines 188 219) the Hoare annotation is: (let ((.cse27 (= ~c_dr_pc~0 1)) (.cse12 (= ~p_dw_st~0 0))) (let ((.cse7 (= ~q_free~0 1)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse24 (= ~q_req_up~0 1)) (.cse0 (<= 2 ~T2_E~0)) (.cse25 (not .cse12)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~T1_E~0 2)) (.cse5 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse6 (= ~m_st~0 0)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse9 (not (= ~c_dr_st~0 0))) (.cse10 (<= ~t1_pc~0 0)) (.cse11 (<= 2 ~E_2~0)) (.cse23 (= ~p_dw_pc~0 1)) (.cse13 (= ~q_read_ev~0 2)) (.cse14 (not .cse27)) (.cse15 (= ~p_dw_i~0 1)) (.cse17 (= ~E_M~0 2)) (.cse18 (= 0 ~t2_st~0)) (.cse19 (= ~token~0 ~local~0)) (.cse20 (= ~E_1~0 2)) (.cse21 (= ~M_E~0 2)) (.cse22 (<= ~t2_pc~0 0))) (or (and (= ~p_dw_pc~0 0) .cse0 (= ~p_num_write~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~q_req_up~0 0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse6 .cse8 .cse11 .cse23 (let ((.cse26 (= ~c_num_read~0 ~p_num_write~0))) (or (and .cse24 .cse25 .cse26 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse27 .cse15 .cse16 .cse17 .cse20 .cse21 .cse22) (and .cse24 .cse25 .cse26 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse13 .cse15 .cse16 .cse17 .cse20 .cse21 .cse22))) .cse18 .cse19) (and .cse24 .cse0 .cse25 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 (= ~q_free~0 0) .cse10 .cse11 .cse23 .cse13 .cse14 .cse15 (= ~p_num_write~0 1) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22)))) [2023-11-29 01:50:37,225 INFO L895 garLoopResultBuilder]: At program point L1042(line 1042) the Hoare annotation is: (let ((.cse23 (= ~m_pc~0 ~t1_pc~0)) (.cse24 (= ~m_st~0 0)) (.cse29 (not (= ~m_pc~0 1))) (.cse25 (<= ~t1_pc~0 0)) (.cse21 (= 0 ~t2_st~0)) (.cse26 (= ~token~0 ~local~0)) (.cse22 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (<= 2 ~T2_E~0)) (.cse5 (= ~p_num_write~0 0)) (.cse6 (<= ~q_read_ev~0 0)) (.cse7 (= ~c_num_read~0 0)) (.cse8 (<= ~q_write_ev~0 0)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (<= 2 ~E_M~0)) (.cse11 (= ~q_free~0 0)) (.cse12 (<= 2 ~m_st~0)) (.cse13 (= ~q_req_up~0 0)) (.cse14 (<= 2 ~T1_E~0)) (.cse15 (<= 2 ~E_2~0)) (.cse27 (= ~t2_pc~0 1)) (.cse16 (= ~m_i~0 1)) (.cse17 (= ~p_dw_st~0 0)) (.cse18 (= ~t2_i~0 1)) (.cse19 (= ~c_dr_pc~0 0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse28 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse24 .cse11 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse11 .cse13 .cse14 .cse15 .cse27 .cse16 (= ~token~0 (+ 2 ~local~0)) .cse17 .cse18 .cse19 .cse20 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse29 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse24 .cse11 .cse25 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse29 .cse11 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (+ ~local~0 1) ~token~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28))) [2023-11-29 01:50:37,225 INFO L899 garLoopResultBuilder]: For program point L712-1(lines 706 724) no Hoare annotation was computed. [2023-11-29 01:50:37,225 INFO L899 garLoopResultBuilder]: For program point L250-1(lines 241 258) no Hoare annotation was computed. [2023-11-29 01:50:37,226 INFO L895 garLoopResultBuilder]: At program point L1043(line 1043) the Hoare annotation is: (let ((.cse23 (= ~m_pc~0 ~t1_pc~0)) (.cse24 (= ~m_st~0 0)) (.cse29 (not (= ~m_pc~0 1))) (.cse25 (<= ~t1_pc~0 0)) (.cse21 (= 0 ~t2_st~0)) (.cse26 (= ~token~0 ~local~0)) (.cse22 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (<= 2 ~T2_E~0)) (.cse5 (= ~p_num_write~0 0)) (.cse6 (<= ~q_read_ev~0 0)) (.cse7 (= ~c_num_read~0 0)) (.cse8 (<= ~q_write_ev~0 0)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (<= 2 ~E_M~0)) (.cse11 (= ~q_free~0 0)) (.cse12 (<= 2 ~m_st~0)) (.cse13 (= ~q_req_up~0 0)) (.cse14 (<= 2 ~T1_E~0)) (.cse15 (<= 2 ~E_2~0)) (.cse27 (= ~t2_pc~0 1)) (.cse16 (= ~m_i~0 1)) (.cse17 (= ~p_dw_st~0 0)) (.cse18 (= ~t2_i~0 1)) (.cse19 (= ~c_dr_pc~0 0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse28 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse24 .cse11 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse11 .cse13 .cse14 .cse15 .cse27 .cse16 (= ~token~0 (+ 2 ~local~0)) .cse17 .cse18 .cse19 .cse20 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse29 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse24 .cse11 .cse25 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse29 .cse11 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (+ ~local~0 1) ~token~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28))) [2023-11-29 01:50:37,226 INFO L899 garLoopResultBuilder]: For program point L1010(lines 999 1012) no Hoare annotation was computed. [2023-11-29 01:50:37,226 INFO L895 garLoopResultBuilder]: At program point L581-1(lines 581 594) the Hoare annotation is: (let ((.cse20 (<= 2 ~t2_st~0)) (.cse26 (= ~t1_pc~0 1)) (.cse10 (<= 2 ~m_st~0)) (.cse14 (= ~t2_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (<= ~q_read_ev~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (<= ~q_write_ev~0 0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (<= 2 ~E_M~0)) (.cse24 (= ~m_st~0 0)) (.cse21 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse11 (= ~q_req_up~0 0)) (.cse12 (<= 2 ~T1_E~0)) (.cse13 (<= 2 ~E_2~0)) (.cse15 (= ~m_i~0 1)) (.cse16 (= ~p_dw_st~0 0)) (.cse17 (= ~t2_i~0 1)) (.cse18 (= ~c_dr_pc~0 0)) (.cse19 (= ~c_last_read~0 ~p_last_write~0)) (.cse22 (= 0 ~t2_st~0)) (.cse25 (= ~token~0 ~local~0)) (.cse23 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse24 .cse21 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse25 .cse20) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (+ ~local~0 1) ~token~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse24 .cse21 .cse9 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22 .cse25 .cse23))) [2023-11-29 01:50:37,226 INFO L899 garLoopResultBuilder]: For program point L350(line 350) no Hoare annotation was computed. [2023-11-29 01:50:37,226 INFO L899 garLoopResultBuilder]: For program point L781-1(lines 757 809) no Hoare annotation was computed. [2023-11-29 01:50:37,226 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 356) no Hoare annotation was computed. [2023-11-29 01:50:37,226 INFO L899 garLoopResultBuilder]: For program point L352-1(lines 347 387) no Hoare annotation was computed. [2023-11-29 01:50:37,226 INFO L899 garLoopResultBuilder]: For program point L1046(line 1046) no Hoare annotation was computed. [2023-11-29 01:50:37,226 INFO L895 garLoopResultBuilder]: At program point L617-1(lines 617 630) the Hoare annotation is: (let ((.cse23 (<= 2 ~t1_st~0)) (.cse9 (= ~m_st~0 0)) (.cse4 (<= ~q_read_ev~0 0)) (.cse6 (<= ~q_write_ev~0 0)) (.cse20 (= ~token~0 ~local~0)) (.cse11 (<= ~t1_pc~0 0)) (.cse21 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (<= 2 ~E_M~0)) (.cse24 (not (= ~m_pc~0 1))) (.cse10 (= ~q_free~0 0)) (.cse22 (<= 2 ~m_st~0)) (.cse12 (= ~q_req_up~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse14 (<= 2 ~E_2~0)) (.cse15 (= ~m_i~0 1)) (.cse16 (= ~p_dw_st~0 0)) (.cse17 (= ~t2_i~0 1)) (.cse18 (= ~c_dr_pc~0 0)) (.cse19 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~m_pc~0 ~t1_pc~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse22 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 (= ~t2_pc~0 1) .cse15 (= ~token~0 (+ 2 ~local~0)) .cse16 .cse17 .cse18 .cse19) (and .cse21 .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse22 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse21 .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse24 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse21 .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse24 .cse10 .cse22 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) [2023-11-29 01:50:37,227 INFO L895 garLoopResultBuilder]: At program point L551-1(lines 537 558) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse11 (not (= ~m_pc~0 1))) (.cse16 (= ~t2_pc~0 1)) (.cse22 (<= 2 ~t2_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (<= 2 ~T2_E~0)) (.cse5 (= ~p_num_write~0 0)) (.cse6 (<= ~q_read_ev~0 0)) (.cse7 (= ~c_num_read~0 0)) (.cse8 (<= ~q_write_ev~0 0)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse25 (= ~m_pc~0 ~t1_pc~0)) (.cse10 (<= 2 ~E_M~0)) (.cse12 (= ~q_free~0 0)) (.cse26 (<= ~t1_pc~0 0)) (.cse13 (= ~q_req_up~0 0)) (.cse14 (<= 2 ~T1_E~0)) (.cse15 (<= 2 ~E_2~0)) (.cse17 (= ~m_i~0 1)) (.cse18 (= ~p_dw_st~0 0)) (.cse19 (= ~t2_i~0 1)) (.cse20 (= ~c_dr_pc~0 0)) (.cse21 (= ~c_last_read~0 ~p_last_write~0)) (.cse23 (= 0 ~t2_st~0)) (.cse27 (= ~token~0 ~local~0)) (.cse24 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~token~0 (+ 2 ~local~0)) .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse25 .cse10 .cse12 .cse26 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse27 .cse22) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse25 .cse10 .cse12 .cse26 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse27 .cse24))) [2023-11-29 01:50:37,227 INFO L899 garLoopResultBuilder]: For program point L717-1(lines 703 725) no Hoare annotation was computed. [2023-11-29 01:50:37,227 INFO L895 garLoopResultBuilder]: At program point L420(line 420) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (<= 2 ~T2_E~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) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 1) (<= 2 ~q_write_ev~0) (<= ~t1_pc~0 0) (= ~q_req_up~0 0) (<= 2 ~E_2~0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2) (= ~M_E~0 2) (<= ~t2_pc~0 0)) [2023-11-29 01:50:37,227 INFO L899 garLoopResultBuilder]: For program point L420-1(line 420) no Hoare annotation was computed. [2023-11-29 01:50:37,227 INFO L899 garLoopResultBuilder]: For program point L189(lines 188 219) no Hoare annotation was computed. [2023-11-29 01:50:37,227 INFO L899 garLoopResultBuilder]: For program point L1048(lines 1048 1057) no Hoare annotation was computed. [2023-11-29 01:50:37,227 INFO L899 garLoopResultBuilder]: For program point L1048-2(lines 1048 1057) no Hoare annotation was computed. [2023-11-29 01:50:37,227 INFO L899 garLoopResultBuilder]: For program point L784(lines 784 791) no Hoare annotation was computed. [2023-11-29 01:50:37,227 INFO L899 garLoopResultBuilder]: For program point L784-2(lines 784 791) no Hoare annotation was computed. [2023-11-29 01:50:37,227 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 01:50:37,227 INFO L899 garLoopResultBuilder]: For program point L190-1(lines 190 200) no Hoare annotation was computed. [2023-11-29 01:50:37,227 INFO L899 garLoopResultBuilder]: For program point L950(lines 950 954) no Hoare annotation was computed. [2023-11-29 01:50:37,227 INFO L899 garLoopResultBuilder]: For program point L950-2(lines 949 982) no Hoare annotation was computed. [2023-11-29 01:50:37,227 INFO L895 garLoopResultBuilder]: At program point L422(line 422) the Hoare annotation is: (let ((.cse0 (= ~p_dw_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)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~q_free~0 1)) (.cse7 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= ~E_M~0 2)) (.cse14 (= ~E_1~0 2)) (.cse15 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) (not (= ~c_dr_st~0 0)) .cse7 (not (= ~E_2~0 0)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 (<= 2 ~T2_E~0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_st~0 0) .cse6 (<= 2 ~q_write_ev~0) (<= ~t1_pc~0 0) .cse7 (<= 2 ~E_2~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ~t2_st~0) (= ~token~0 ~local~0) .cse14 .cse15 (<= ~t2_pc~0 0)))) [2023-11-29 01:50:37,228 INFO L895 garLoopResultBuilder]: At program point L422-1(line 422) the Hoare annotation is: (let ((.cse0 (= ~p_dw_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)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~q_free~0 1)) (.cse7 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= ~E_M~0 2)) (.cse14 (= ~E_1~0 2)) (.cse15 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) (not (= ~c_dr_st~0 0)) .cse7 (not (= ~E_2~0 0)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 (<= 2 ~T2_E~0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_st~0 0) .cse6 (<= 2 ~q_write_ev~0) (<= ~t1_pc~0 0) .cse7 (<= 2 ~E_2~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ~t2_st~0) (= ~token~0 ~local~0) .cse14 .cse15 (<= ~t2_pc~0 0)))) [2023-11-29 01:50:37,228 INFO L895 garLoopResultBuilder]: At program point L423(line 423) the Hoare annotation is: (let ((.cse0 (= ~p_dw_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)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~q_free~0 1)) (.cse7 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= ~E_M~0 2)) (.cse14 (= ~E_1~0 2)) (.cse15 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) (not (= ~c_dr_st~0 0)) .cse7 (not (= ~E_2~0 0)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 (<= 2 ~T2_E~0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_st~0 0) .cse6 (<= 2 ~q_write_ev~0) (<= ~t1_pc~0 0) .cse7 (<= 2 ~E_2~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ~t2_st~0) (= ~token~0 ~local~0) .cse14 .cse15 (<= ~t2_pc~0 0)))) [2023-11-29 01:50:37,228 INFO L899 garLoopResultBuilder]: For program point L357(lines 347 387) no Hoare annotation was computed. [2023-11-29 01:50:37,228 INFO L899 garLoopResultBuilder]: For program point L1085(lines 1085 1091) no Hoare annotation was computed. [2023-11-29 01:50:37,228 INFO L895 garLoopResultBuilder]: At program point L1052(line 1052) the Hoare annotation is: (let ((.cse23 (= ~m_pc~0 ~t1_pc~0)) (.cse24 (= ~m_st~0 0)) (.cse29 (not (= ~m_pc~0 1))) (.cse25 (<= ~t1_pc~0 0)) (.cse21 (= 0 ~t2_st~0)) (.cse26 (= ~token~0 ~local~0)) (.cse22 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (<= 2 ~T2_E~0)) (.cse5 (= ~p_num_write~0 0)) (.cse6 (<= ~q_read_ev~0 0)) (.cse7 (= ~c_num_read~0 0)) (.cse8 (<= ~q_write_ev~0 0)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (<= 2 ~E_M~0)) (.cse11 (= ~q_free~0 0)) (.cse12 (<= 2 ~m_st~0)) (.cse13 (= ~q_req_up~0 0)) (.cse14 (<= 2 ~T1_E~0)) (.cse15 (<= 2 ~E_2~0)) (.cse27 (= ~t2_pc~0 1)) (.cse16 (= ~m_i~0 1)) (.cse17 (= ~p_dw_st~0 0)) (.cse18 (= ~t2_i~0 1)) (.cse19 (= ~c_dr_pc~0 0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse28 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse24 .cse11 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse11 .cse13 .cse14 .cse15 .cse27 .cse16 (= ~token~0 (+ 2 ~local~0)) .cse17 .cse18 .cse19 .cse20 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse29 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse24 .cse11 .cse25 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse29 .cse11 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (+ ~local~0 1) ~token~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28))) [2023-11-29 01:50:37,228 INFO L899 garLoopResultBuilder]: For program point L1052-1(line 1052) no Hoare annotation was computed. [2023-11-29 01:50:37,228 INFO L895 garLoopResultBuilder]: At program point L591(line 591) the Hoare annotation is: (let ((.cse20 (= 0 ~t2_st~0)) (.cse21 (not (= ~m_pc~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (<= 2 ~T2_E~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (<= ~q_read_ev~0 0)) (.cse6 (= ~c_num_read~0 0)) (.cse7 (<= ~q_write_ev~0 0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 2 ~E_M~0)) (.cse10 (= ~q_free~0 0)) (.cse11 (<= 2 ~m_st~0)) (.cse12 (= ~q_req_up~0 0)) (.cse13 (not (= ~E_2~0 0))) (.cse14 (<= 2 ~T1_E~0)) (.cse15 (= ~m_i~0 1)) (.cse16 (= ~p_dw_st~0 0)) (.cse17 (= ~t2_i~0 1)) (.cse18 (= ~c_dr_pc~0 0)) (.cse19 (= ~c_last_read~0 ~p_last_write~0)) (.cse22 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= ~t2_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse21 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse21 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (+ ~local~0 1) ~token~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~t2_pc~0 1) .cse15 .cse16 .cse17 .cse18 .cse19 .cse22))) [2023-11-29 01:50:37,228 INFO L899 garLoopResultBuilder]: For program point L591-1(line 591) no Hoare annotation was computed. [2023-11-29 01:50:37,228 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 01:50:37,229 INFO L899 garLoopResultBuilder]: For program point L1087(lines 1087 1090) no Hoare annotation was computed. [2023-11-29 01:50:37,229 INFO L899 garLoopResultBuilder]: For program point L955-1(lines 949 982) no Hoare annotation was computed. [2023-11-29 01:50:37,229 INFO L899 garLoopResultBuilder]: For program point L526(lines 526 534) no Hoare annotation was computed. [2023-11-29 01:50:37,229 INFO L895 garLoopResultBuilder]: At program point L427-1(lines 427 449) the Hoare annotation is: (let ((.cse27 (= ~p_dw_st~0 0))) (let ((.cse23 (= ~p_dw_pc~0 0)) (.cse24 (= ~p_num_write~0 0)) (.cse25 (= ~c_num_read~0 0)) (.cse28 (= ~c_dr_pc~0 0)) (.cse29 (= ~c_last_read~0 ~p_last_write~0)) (.cse1 (= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~q_free~0 1)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse0 (<= 2 ~T2_E~0)) (.cse30 (not .cse27)) (.cse32 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse5 (= ~m_st~0 0)) (.cse10 (<= ~t1_pc~0 0)) (.cse11 (= ~q_req_up~0 0)) (.cse13 (<= 2 ~E_2~0)) (.cse14 (= ~p_dw_pc~0 1)) (.cse18 (= 0 ~t2_st~0)) (.cse19 (= ~token~0 ~local~0)) (.cse22 (<= ~t2_pc~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~T1_E~0 2)) (.cse7 (not (= ~m_pc~0 1))) (.cse9 (not (= ~c_dr_st~0 0))) (.cse31 (= ~q_free~0 0)) (.cse26 (not (= ~E_2~0 0))) (.cse15 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_pc~0 1)) (.cse16 (= ~p_dw_i~0 1)) (.cse17 (= ~E_M~0 2)) (.cse20 (= ~E_1~0 2)) (.cse21 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse23 .cse24 .cse25 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse11 .cse26 .cse27 .cse15 .cse28 .cse16 .cse29 .cse17 .cse20 .cse21) (and .cse23 .cse0 .cse24 .cse25 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse13 .cse27 .cse15 .cse28 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse8 (or (and .cse30 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse11 .cse26 .cse12 .cse15 .cse16 .cse17 .cse20 .cse21) (and .cse30 .cse2 .cse3 .cse4 .cse9 .cse31 .cse11 .cse26 .cse15 .cse16 .cse17 .cse20 .cse21)) .cse10 .cse22) (and .cse0 (<= ~q_read_ev~0 0) .cse30 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse30 .cse2 .cse32 .cse3 .cse4 .cse5 .cse8 .cse31 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse30 (<= ~q_write_ev~0 0) .cse2 .cse32 .cse3 .cse4 .cse5 .cse9 .cse31 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse4 .cse7 .cse9 .cse31 .cse26 .cse15 (not .cse12) .cse16 .cse17 .cse20 .cse21)))) [2023-11-29 01:50:37,229 INFO L899 garLoopResultBuilder]: For program point L361(lines 361 368) no Hoare annotation was computed. [2023-11-29 01:50:37,229 INFO L895 garLoopResultBuilder]: At program point L1022(line 1022) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (<= 2 ~T2_E~0) (= ~p_num_write~0 0) (<= ~q_read_ev~0 0) (= ~c_num_read~0 0) (<= ~q_write_ev~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 0) (<= ~t1_pc~0 0) (= ~q_req_up~0 0) (<= 2 ~E_2~0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2) (= ~M_E~0 2) (<= ~t2_pc~0 0)) [2023-11-29 01:50:37,229 INFO L899 garLoopResultBuilder]: For program point L1022-1(line 1022) no Hoare annotation was computed. [2023-11-29 01:50:37,229 INFO L895 garLoopResultBuilder]: At program point L758(line 758) the Hoare annotation is: (let ((.cse23 (= ~m_pc~0 ~t1_pc~0)) (.cse24 (= ~m_st~0 0)) (.cse29 (not (= ~m_pc~0 1))) (.cse25 (<= ~t1_pc~0 0)) (.cse21 (= 0 ~t2_st~0)) (.cse26 (= ~token~0 ~local~0)) (.cse22 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (<= 2 ~T2_E~0)) (.cse5 (= ~p_num_write~0 0)) (.cse6 (<= ~q_read_ev~0 0)) (.cse7 (= ~c_num_read~0 0)) (.cse8 (<= ~q_write_ev~0 0)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (<= 2 ~E_M~0)) (.cse11 (= ~q_free~0 0)) (.cse12 (<= 2 ~m_st~0)) (.cse13 (= ~q_req_up~0 0)) (.cse14 (<= 2 ~T1_E~0)) (.cse15 (<= 2 ~E_2~0)) (.cse27 (= ~t2_pc~0 1)) (.cse16 (= ~m_i~0 1)) (.cse17 (= ~p_dw_st~0 0)) (.cse18 (= ~t2_i~0 1)) (.cse19 (= ~c_dr_pc~0 0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse28 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse24 .cse11 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse11 .cse13 .cse14 .cse15 .cse27 .cse16 (= ~token~0 (+ 2 ~local~0)) .cse17 .cse18 .cse19 .cse20 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse29 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse24 .cse11 .cse25 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse29 .cse11 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (+ ~local~0 1) ~token~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse26 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28))) [2023-11-29 01:50:37,229 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 496) no Hoare annotation was computed. [2023-11-29 01:50:37,230 INFO L895 garLoopResultBuilder]: At program point L627(line 627) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (<= 2 ~T2_E~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (<= 2 ~m_st~0)) (.cse9 (= ~q_req_up~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (<= 2 ~E_2~0)) (.cse12 (= ~m_i~0 1)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~t2_i~0 1)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 (<= 2 ~t1_st~0) .cse1 .cse2 .cse3 .cse4 (<= ~q_read_ev~0 0) .cse5 (<= ~q_write_ev~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~t2_pc~0 1) .cse12 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15 .cse16))) [2023-11-29 01:50:37,230 INFO L899 garLoopResultBuilder]: For program point L627-1(line 627) no Hoare annotation was computed. [2023-11-29 01:50:37,230 INFO L899 garLoopResultBuilder]: For program point $Ultimate##104(lines 551 557) no Hoare annotation was computed. [2023-11-29 01:50:37,230 INFO L895 garLoopResultBuilder]: At program point L1024(line 1024) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (<= 2 ~T2_E~0) (= ~p_num_write~0 0) (<= ~q_read_ev~0 0) (= ~c_num_read~0 0) (<= ~q_write_ev~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 0) (<= ~t1_pc~0 0) (= ~q_req_up~0 0) (<= 2 ~E_2~0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2) (= ~M_E~0 2) (<= ~t2_pc~0 0)) [2023-11-29 01:50:37,230 INFO L895 garLoopResultBuilder]: At program point L1024-1(line 1024) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (<= 2 ~T2_E~0) (= ~p_num_write~0 0) (<= ~q_read_ev~0 0) (= ~c_num_read~0 0) (<= ~q_write_ev~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 0) (<= ~t1_pc~0 0) (= ~q_req_up~0 0) (<= 2 ~E_2~0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2) (= ~M_E~0 2) (<= ~t2_pc~0 0)) [2023-11-29 01:50:37,230 INFO L899 garLoopResultBuilder]: For program point L760(line 760) no Hoare annotation was computed. [2023-11-29 01:50:37,230 INFO L899 garLoopResultBuilder]: For program point L529(lines 529 533) no Hoare annotation was computed. [2023-11-29 01:50:37,230 INFO L899 garLoopResultBuilder]: For program point L496(line 496) no Hoare annotation was computed. [2023-11-29 01:50:37,230 INFO L895 garLoopResultBuilder]: At program point L1025(line 1025) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (<= 2 ~T2_E~0) (= ~p_num_write~0 0) (<= ~q_read_ev~0 0) (= ~c_num_read~0 0) (<= ~q_write_ev~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 0) (<= ~t1_pc~0 0) (= ~q_req_up~0 0) (<= 2 ~E_2~0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2) (= ~M_E~0 2) (<= ~t2_pc~0 0)) [2023-11-29 01:50:37,230 INFO L899 garLoopResultBuilder]: For program point L84(lines 72 86) no Hoare annotation was computed. [2023-11-29 01:50:37,230 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 69 87) no Hoare annotation was computed. [2023-11-29 01:50:37,230 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 79) no Hoare annotation was computed. [2023-11-29 01:50:37,230 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 69 87) the Hoare annotation is: true [2023-11-29 01:50:37,231 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 82) no Hoare annotation was computed. [2023-11-29 01:50:37,231 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 73 82) no Hoare annotation was computed. [2023-11-29 01:50:37,231 INFO L899 garLoopResultBuilder]: For program point L275(lines 262 277) no Hoare annotation was computed. [2023-11-29 01:50:37,231 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 272) no Hoare annotation was computed. [2023-11-29 01:50:37,231 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 259 278) the Hoare annotation is: true [2023-11-29 01:50:37,231 INFO L899 garLoopResultBuilder]: For program point L263(lines 263 273) no Hoare annotation was computed. [2023-11-29 01:50:37,231 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 259 278) no Hoare annotation was computed. [2023-11-29 01:50:37,231 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 24 31) the Hoare annotation is: true [2023-11-29 01:50:37,231 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 28) no Hoare annotation was computed. [2023-11-29 01:50:37,231 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 24 31) no Hoare annotation was computed. [2023-11-29 01:50:37,231 INFO L899 garLoopResultBuilder]: For program point L734(lines 734 744) no Hoare annotation was computed. [2023-11-29 01:50:37,231 INFO L899 garLoopResultBuilder]: For program point L730(lines 730 745) no Hoare annotation was computed. [2023-11-29 01:50:37,231 INFO L899 garLoopResultBuilder]: For program point L747(lines 729 749) no Hoare annotation was computed. [2023-11-29 01:50:37,231 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 726 750) the Hoare annotation is: true [2023-11-29 01:50:37,231 INFO L899 garLoopResultBuilder]: For program point L738(lines 738 743) no Hoare annotation was computed. [2023-11-29 01:50:37,231 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 726 750) no Hoare annotation was computed. [2023-11-29 01:50:37,231 INFO L899 garLoopResultBuilder]: For program point L306-1(lines 297 314) no Hoare annotation was computed. [2023-11-29 01:50:37,231 INFO L899 garLoopResultBuilder]: For program point L301-1(lines 300 313) no Hoare annotation was computed. [2023-11-29 01:50:37,232 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 297 314) the Hoare annotation is: (let ((.cse36 (= ~c_dr_pc~0 1)) (.cse37 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse38 (= ~q_read_ev~0 2)) (.cse25 (= ~p_dw_st~0 0))) (let ((.cse3 (not .cse25)) (.cse5 (not (= ~c_dr_pc~0 0))) (.cse7 (not (= ~p_num_write~0 0))) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse11 (not (= ~c_num_read~0 0))) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse18 (and .cse37 .cse38)) (.cse19 (= ~E_2~0 0)) (.cse10 (= ~m_pc~0 1)) (.cse22 (not (= ~q_free~0 0))) (.cse14 (not (= |old(~q_read_ev~0)| 2))) (.cse30 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (= ~q_req_up~0 0))) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse20 (< 0 ~t1_pc~0)) (.cse33 (and (= ~q_read_ev~0 1) .cse37)) (.cse32 (< |old(~q_write_ev~0)| 2)) (.cse4 (not (= ~M_E~0 2))) (.cse21 (< ~E_2~0 2)) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse23 (not (= ~p_dw_pc~0 1))) (.cse34 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse24 (< 0 ~t2_pc~0)) (.cse12 (not (= ~E_1~0 ~M_E~0))) (.cse26 (not (= 0 ~t2_st~0))) (.cse13 (not (= ~T1_E~0 ~M_E~0))) (.cse27 (not (= ~m_st~0 0))) (.cse35 (not (= |old(~q_read_ev~0)| 1))) (.cse28 (not .cse36)) (.cse29 (< ~T2_E~0 2)) (.cse15 (not (= ~p_dw_i~0 1))) (.cse16 (not (= ~q_free~0 1))) (.cse31 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse20 .cse4 .cse21 .cse6 .cse9 .cse10 .cse22 .cse23 .cse24 .cse12 .cse25 .cse26 .cse13 .cse27 .cse14 .cse28 .cse29 .cse15 .cse30 .cse18 .cse31) (or .cse1 .cse2 .cse3 .cse20 .cse32 .cse4 .cse21 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 .cse26 .cse13 .cse27 .cse14 .cse29 .cse15 .cse16 .cse17 .cse18 .cse31) (or .cse0 .cse1 .cse2 .cse20 .cse33 .cse32 .cse4 .cse21 .cse6 .cse9 .cse10 .cse34 .cse24 .cse12 .cse25 .cse26 .cse13 .cse27 .cse35 .cse28 .cse29 .cse15 .cse16 .cse19 .cse31) (or .cse20 .cse32 .cse24 (and (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse9 .cse10 .cse34 .cse12 .cse25 .cse13 .cse14 .cse28 .cse15 .cse16 .cse19) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse9 .cse22 .cse12 .cse25 .cse13 .cse14 .cse15 .cse19)) .cse18) (or .cse0 .cse2 .cse4 .cse6 .cse36 .cse9 .cse10 .cse22 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse20 .cse32 .cse4 .cse21 .cse6 .cse9 .cse10 (and .cse37 (= |old(~q_read_ev~0)| ~q_read_ev~0)) .cse23 .cse34 .cse24 .cse12 .cse25 .cse26 .cse13 .cse27 .cse28 .cse29 .cse15 (< 0 |old(~q_read_ev~0)|) .cse16 .cse19 .cse31) (or .cse1 .cse2 .cse20 .cse4 .cse21 .cse6 .cse9 .cse10 .cse22 .cse23 (not (= |old(~q_write_ev~0)| 1)) .cse24 .cse12 .cse25 .cse26 .cse13 .cse27 (and .cse38 (= ~q_write_ev~0 1)) .cse14 .cse28 .cse29 .cse15 .cse30 .cse31) (or .cse0 .cse1 .cse2 .cse20 .cse33 .cse32 .cse4 .cse21 .cse6 .cse9 .cse23 .cse34 .cse24 .cse12 .cse26 .cse13 .cse27 .cse35 .cse28 .cse29 .cse15 .cse16 .cse31)))) [2023-11-29 01:50:37,232 INFO L899 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 297 314) no Hoare annotation was computed. [2023-11-29 01:50:37,232 INFO L899 garLoopResultBuilder]: For program point L863-1(lines 857 890) no Hoare annotation was computed. [2023-11-29 01:50:37,232 INFO L899 garLoopResultBuilder]: For program point L878-1(lines 857 890) no Hoare annotation was computed. [2023-11-29 01:50:37,232 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 854 891) the Hoare annotation is: (let ((.cse31 (and (<= 1 ~m_pc~0) (< ~m_pc~0 2))) (.cse26 (< 0 ~t2_pc~0)) (.cse27 (not (= 0 ~t2_st~0))) (.cse1 (< ~t1_st~0 2)) (.cse30 (= ~m_pc~0 1)) (.cse7 (< ~m_st~0 2)) (.cse8 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~q_req_up~0 0))) (.cse24 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (not (= ~p_dw_st~0 0))) (.cse25 (< 0 ~t1_pc~0)) (.cse3 (not (= ~t2_i~0 1))) (.cse4 (< 0 ~q_read_ev~0)) (.cse5 (not (= ~c_dr_pc~0 0))) (.cse6 (not (= ~m_i~0 1))) (.cse9 (not (= ~p_num_write~0 0))) (.cse10 (< 0 ~q_write_ev~0)) (.cse11 (not (= ~p_dw_pc~0 0))) (.cse12 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse13 (not (= ~c_num_read~0 0))) (.cse14 (not (= ~q_free~0 0))) (.cse15 (< |old(~E_1~0)| 2)) (.cse16 (< |old(~E_M~0)| 2)) (.cse17 (< |old(~T2_E~0)| 2)) (.cse28 (not (= ~m_st~0 0))) (.cse18 (< |old(~E_2~0)| 2)) (.cse19 (not (= ~t2_pc~0 1))) (.cse20 (< ~t2_st~0 2)) (.cse21 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse22 (< |old(~T1_E~0)| 2)) (.cse23 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))) (.cse29 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse24 .cse2 .cse25 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse26 .cse27 .cse17 .cse28 .cse18 .cse21 .cse22 .cse23 .cse29) (or .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse30 .cse13 .cse14 .cse15 .cse16 .cse27 .cse17 .cse18 .cse21 .cse22 .cse23) (or .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse31 .cse23) (or .cse0 .cse2 .cse25 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse26 .cse27 .cse17 .cse18 .cse21 .cse22 .cse23 .cse29) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~token~0 (+ 2 ~local~0))) .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse28 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse17 .cse18 .cse19 (not (= (+ ~local~0 1) ~token~0)) .cse21 .cse22 .cse23) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse26 .cse27 .cse17 .cse18 .cse21 .cse22 .cse23 .cse29) (or .cse0 .cse2 .cse25 .cse3 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse30 .cse13 .cse14 .cse15 .cse16 .cse26 .cse27 .cse17 .cse18 .cse21 .cse22 .cse23) (or .cse0 .cse2 .cse25 .cse3 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse30 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse26 .cse27 .cse17 .cse28 .cse18 .cse21 .cse22 .cse31 .cse23 .cse29) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse26 .cse27 .cse17 .cse18 .cse21 .cse22 .cse23) (or .cse0 .cse2 .cse25 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse29) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse30 .cse13 .cse14 .cse15 .cse16 .cse17 .cse28 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse29) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse29) (or .cse0 .cse24 .cse2 .cse25 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse28 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse29))) [2023-11-29 01:50:37,232 INFO L899 garLoopResultBuilder]: For program point L868-1(lines 857 890) no Hoare annotation was computed. [2023-11-29 01:50:37,233 INFO L899 garLoopResultBuilder]: For program point L858-1(lines 857 890) no Hoare annotation was computed. [2023-11-29 01:50:37,233 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 854 891) no Hoare annotation was computed. [2023-11-29 01:50:37,233 INFO L899 garLoopResultBuilder]: For program point L883-1(lines 854 891) no Hoare annotation was computed. [2023-11-29 01:50:37,233 INFO L899 garLoopResultBuilder]: For program point L873-1(lines 857 890) no Hoare annotation was computed. [2023-11-29 01:50:37,236 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:50:37,237 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 01:50:37,276 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-11-29 01:50:37,278 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-11-29 01:50:37,278 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-11-29 01:50:37,279 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-11-29 01:50:37,296 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-11-29 01:50:37,297 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-11-29 01:50:37,297 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-11-29 01:50:37,298 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-11-29 01:50:37,299 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-11-29 01:50:37,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 01:50:37 BoogieIcfgContainer [2023-11-29 01:50:37,307 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 01:50:37,308 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 01:50:37,308 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 01:50:37,308 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 01:50:37,308 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:46:52" (3/4) ... [2023-11-29 01:50:37,310 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 01:50:37,313 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2023-11-29 01:50:37,313 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2023-11-29 01:50:37,313 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2023-11-29 01:50:37,313 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2023-11-29 01:50:37,313 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2023-11-29 01:50:37,313 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2023-11-29 01:50:37,313 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2023-11-29 01:50:37,313 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2023-11-29 01:50:37,314 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2023-11-29 01:50:37,314 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2023-11-29 01:50:37,314 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2023-11-29 01:50:37,314 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2023-11-29 01:50:37,314 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2023-11-29 01:50:37,314 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2023-11-29 01:50:37,328 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2023-11-29 01:50:37,329 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2023-11-29 01:50:37,331 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 01:50:37,332 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 01:50:37,525 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 01:50:37,526 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 01:50:37,526 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 01:50:37,527 INFO L158 Benchmark]: Toolchain (without parser) took 225866.11ms. Allocated memory was 136.3MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 106.0MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2023-11-29 01:50:37,527 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 136.3MB. Free memory is still 94.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:50:37,527 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.39ms. Allocated memory is still 136.3MB. Free memory was 105.8MB in the beginning and 88.1MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 01:50:37,527 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.84ms. Allocated memory is still 136.3MB. Free memory was 87.9MB in the beginning and 85.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 01:50:37,528 INFO L158 Benchmark]: Boogie Preprocessor took 61.90ms. Allocated memory is still 136.3MB. Free memory was 85.1MB in the beginning and 81.6MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:50:37,528 INFO L158 Benchmark]: RCFGBuilder took 681.09ms. Allocated memory is still 136.3MB. Free memory was 81.6MB in the beginning and 85.4MB in the end (delta: -3.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 01:50:37,528 INFO L158 Benchmark]: TraceAbstraction took 224493.89ms. Allocated memory was 136.3MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 84.8MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2023-11-29 01:50:37,528 INFO L158 Benchmark]: Witness Printer took 218.43ms. Allocated memory is still 4.1GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 01:50:37,530 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.19ms. Allocated memory is still 136.3MB. Free memory is still 94.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.39ms. Allocated memory is still 136.3MB. Free memory was 105.8MB in the beginning and 88.1MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.84ms. Allocated memory is still 136.3MB. Free memory was 87.9MB in the beginning and 85.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.90ms. Allocated memory is still 136.3MB. Free memory was 85.1MB in the beginning and 81.6MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 681.09ms. Allocated memory is still 136.3MB. Free memory was 81.6MB in the beginning and 85.4MB in the end (delta: -3.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 224493.89ms. Allocated memory was 136.3MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 84.8MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. * Witness Printer took 218.43ms. Allocated memory is still 4.1GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 * 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, 209 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 224.4s, OverallIterations: 48, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.3s, AutomataDifference: 63.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 104.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21187 SdHoareTripleChecker+Valid, 17.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20682 mSDsluCounter, 30175 SdHoareTripleChecker+Invalid, 14.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19471 mSDsCounter, 3786 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22617 IncrementalHoareTripleChecker+Invalid, 26403 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3786 mSolverCounterUnsat, 10704 mSDtfsCounter, 22617 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6411 GetRequests, 5903 SyntacticMatches, 4 SemanticMatches, 504 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1395 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33896occurred in iteration=32, InterpolantAutomatonStates: 430, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 40.8s AutomataMinimizationTime, 48 MinimizatonAttempts, 23983 StatesRemovedByMinimization, 45 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 52 LocationsWithAnnotation, 23968 PreInvPairs, 24850 NumberOfFragments, 29493 HoareAnnotationTreeSize, 23968 FomulaSimplifications, 235658 FormulaSimplificationTreeSizeReduction, 43.0s HoareSimplificationTime, 52 FomulaSimplificationsInter, 295537 FormulaSimplificationTreeSizeReductionInter, 60.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 10116 NumberOfCodeBlocks, 9950 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 10520 ConstructedInterpolants, 0 QuantifiedInterpolants, 17820 SizeOfPredicates, 4 NumberOfNonLiveVariables, 14433 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 77 InterpolantComputations, 46 PerfectInterpolantSequences, 7268/7906 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: 581]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st)) || (((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || ((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (t2_pc <= 0))) || (((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (t2_pc <= 0))) || (((((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) || ((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st))) || (((((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) - InvariantResult [Line: 757]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (t2_pc <= 0)) || ((((((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) || ((((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (token == (2 + local))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || (((((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) || ((((((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) || (((((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) || (((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (t2_pc <= 0))) || ((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) || ((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || (((((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) || ((((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st))) || ((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || (((((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) || (((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) - InvariantResult [Line: 537]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st)) || (((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (token == (2 + local))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || (((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (t2_pc <= 0))) || (((((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) || (((((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((p_dw_pc == 0) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= E_2)) && (p_dw_st == 0)) && (q_read_ev == 2)) && !((c_dr_pc == 1))) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0)) || ((((((((2 <= T2_E) && (m_st == 0)) && (2 <= q_write_ev)) && (2 <= E_2)) && (p_dw_pc == 1)) && (((((((((((((((((q_req_up == 1) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0)) || ((((((((((((((((q_req_up == 1) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0)))) && (0 == t2_st)) && (token == local))) || ((((((((((((((((((((((((q_req_up == 1) && (2 <= T2_E)) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= E_2)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && !((c_dr_pc == 1))) && (p_dw_i == 1)) && (p_num_write == 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) - InvariantResult [Line: 1029]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (t2_pc <= 0)) || ((((((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) || ((((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (token == (2 + local))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || (((((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) || ((((((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) || (((((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) || (((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (t2_pc <= 0))) || ((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) || ((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || (((((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 <= t2_st))) || ((((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st))) || ((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) || (((((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) || (((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= t2_st))) - InvariantResult [Line: 617]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) || (((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) || (((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (m_i == 1)) && (token == (2 + local))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) || (((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (q_read_ev <= 0)) && (c_num_read == 0)) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) || (((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (m_i == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((2 <= T2_E) && (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)) && (m_st == 0)) && (q_free == 1)) && (2 <= q_write_ev)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= E_2)) && (q_read_ev == 2)) && !((c_dr_pc == 1))) && (p_dw_i == 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0)) || (((((((((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && !((E_2 == 0))) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) || (((((((((((((((((((((2 <= T2_E) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (2 <= E_2)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) || (((((((((((((((((((((q_req_up == 1) && (2 <= T2_E)) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= E_2)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) || ((((((((((((((((((((((q_req_up == 1) && (2 <= T2_E)) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (2 <= q_write_ev)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= E_2)) && (q_read_ev == 2)) && !((c_dr_pc == 1))) && (p_dw_i == 1)) && (p_num_write == 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) || ((((((((((((((((p_num_write == 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))) && (q_req_up == 0)) && !((E_2 == 0))) && (q_read_ev == 2)) && !((c_dr_pc == 1))) && (p_dw_i == 1)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) || (((((((((((((p_last_write == q_buf_0) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (q_free == 0)) && !((E_2 == 0))) && (q_read_ev == 2)) && !((c_dr_pc == 1))) && (p_dw_i == 1)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) - InvariantResult [Line: 427]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((2 <= T2_E) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && !((m_pc == 1))) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (2 <= E_2)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0)) || (((((((((((((((((((p_dw_pc == 0) && (p_num_write == 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))) && (q_req_up == 0)) && !((E_2 == 0))) && (p_dw_st == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((((((((((((((((p_dw_pc == 0) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (2 <= q_write_ev)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= E_2)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) || ((((2 <= q_write_ev) && (((((((((((((((!((p_dw_st == 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((c_dr_st == 0))) && (q_req_up == 0)) && !((E_2 == 0))) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2)) || ((((((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && !((c_dr_st == 0))) && (q_free == 0)) && (q_req_up == 0)) && !((E_2 == 0))) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2)))) && (t1_pc <= 0)) && (t2_pc <= 0))) || ((((((((((((((((((((((((2 <= T2_E) && (q_read_ev <= 0)) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && !((m_pc == 1))) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (2 <= E_2)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) || ((((((((((((((((((((((2 <= T2_E) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (2 <= q_write_ev)) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (2 <= E_2)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) || (((((((((((((((((((((((2 <= T2_E) && !((p_dw_st == 0))) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (2 <= E_2)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) || (((((((((((((p_last_write == q_buf_0) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (q_free == 0)) && !((E_2 == 0))) && (q_read_ev == 2)) && !((c_dr_pc == 1))) && (p_dw_i == 1)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((2 <= T2_E) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && !((m_pc == 1))) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (2 <= E_2)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0)) || (((((((((((((((((((p_dw_pc == 0) && (p_num_write == 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))) && (q_req_up == 0)) && !((E_2 == 0))) && (p_dw_st == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((((((((((((((((p_dw_pc == 0) && (2 <= T2_E)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (2 <= q_write_ev)) && (t1_pc <= 0)) && (q_req_up == 0)) && (2 <= E_2)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) || ((((((((((((((((((((((((q_req_up == 1) && (2 <= T2_E)) && !((p_dw_st == 0))) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (1 <= tmp___1)) && (m_st == 0)) && (2 <= q_write_ev)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= E_2)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && !((c_dr_pc == 1))) && (p_dw_i == 1)) && (p_num_write == 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) || ((((((((((((((((((((((((2 <= T2_E) && !((p_dw_st == 0))) && (q_write_ev <= 0)) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (2 <= E_2)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) || ((((2 <= q_write_ev) && (((((((((((((((!((p_dw_st == 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((c_dr_st == 0))) && (q_req_up == 0)) && !((E_2 == 0))) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2)) || ((((((((((((!((p_dw_st == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && !((c_dr_st == 0))) && (q_free == 0)) && (q_req_up == 0)) && !((E_2 == 0))) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2)))) && (t1_pc <= 0)) && (t2_pc <= 0))) || ((((((((((((((((((((((((2 <= T2_E) && (q_read_ev <= 0)) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && !((m_pc == 1))) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (2 <= E_2)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) || ((((((((((((((((((((((((p_dw_pc == 0) && (2 <= T2_E)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (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)) && (c_dr_pc == 1)) && (2 <= E_2)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) || (((((((((((((((((((((((2 <= T2_E) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && !((m_pc == 1))) && (2 <= q_write_ev)) && (q_free == 0)) && (t1_pc <= 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (2 <= E_2)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) || (((((((((((((((((((((((q_req_up == 1) && (2 <= T2_E)) && !((p_dw_st == 0))) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (t1_pc <= 0)) && (c_dr_pc == 1)) && (2 <= E_2)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) || ((((((((((((((((((((((q_req_up == 1) && (2 <= T2_E)) && !((p_dw_st == 0))) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (2 <= q_write_ev)) && !((c_dr_st == 0))) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= E_2)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t2_pc <= 0))) || (((((((((((((p_last_write == q_buf_0) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && !((c_dr_st == 0))) && (q_free == 0)) && !((E_2 == 0))) && (q_read_ev == 2)) && !((c_dr_pc == 1))) && (p_dw_i == 1)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) RESULT: Ultimate proved your program to be correct! [2023-11-29 01:50:37,547 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a2acaed-24c9-4971-8447-a42e1ad8b255/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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