./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+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_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/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_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/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_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/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 4ebb73aa3b2fe06c298821e537034d0c16e316e18b31a7db411eb85fc916df11 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:15:46,668 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:15:46,736 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 05:15:46,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:15:46,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:15:46,768 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:15:46,768 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:15:46,769 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:15:46,769 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:15:46,770 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:15:46,771 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:15:46,771 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:15:46,772 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:15:46,772 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:15:46,773 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:15:46,773 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:15:46,774 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:15:46,774 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:15:46,775 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:15:46,775 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:15:46,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:15:46,777 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:15:46,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:15:46,777 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:15:46,778 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:15:46,778 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:15:46,779 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:15:46,779 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:15:46,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:15:46,780 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:15:46,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:15:46,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:15:46,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:15:46,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:15:46,781 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:15:46,781 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:15:46,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:15:46,782 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:15:46,782 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:15:46,782 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:15:46,782 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:15:46,783 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:15:46,783 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_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/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_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/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 -> 4ebb73aa3b2fe06c298821e537034d0c16e316e18b31a7db411eb85fc916df11 [2023-11-29 05:15:47,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:15:47,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:15:47,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:15:47,041 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:15:47,042 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:15:47,043 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c [2023-11-29 05:15:49,901 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:15:50,089 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:15:50,089 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c [2023-11-29 05:15:50,104 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/data/1d5525570/a42c0dbb14744efd9d7183abc210c458/FLAG47c3705c4 [2023-11-29 05:15:50,116 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/data/1d5525570/a42c0dbb14744efd9d7183abc210c458 [2023-11-29 05:15:50,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:15:50,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:15:50,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:15:50,120 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:15:50,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:15:50,126 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:15:50" (1/1) ... [2023-11-29 05:15:50,127 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2071c173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:15:50, skipping insertion in model container [2023-11-29 05:15:50,127 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:15:50" (1/1) ... [2023-11-29 05:15:50,177 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:15:50,309 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_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[911,924] [2023-11-29 05:15:50,374 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_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[8416,8429] [2023-11-29 05:15:50,410 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:15:50,422 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:15:50,431 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_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[911,924] [2023-11-29 05:15:50,456 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_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[8416,8429] [2023-11-29 05:15:50,478 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:15:50,496 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:15:50,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:15:50 WrapperNode [2023-11-29 05:15:50,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:15:50,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:15:50,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:15:50,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:15:50,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:15:50" (1/1) ... [2023-11-29 05:15:50,516 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:15:50" (1/1) ... [2023-11-29 05:15:50,547 INFO L138 Inliner]: procedures = 59, calls = 67, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 508 [2023-11-29 05:15:50,547 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:15:50,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:15:50,548 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:15:50,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:15:50,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:15:50" (1/1) ... [2023-11-29 05:15:50,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:15:50" (1/1) ... [2023-11-29 05:15:50,565 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:15:50" (1/1) ... [2023-11-29 05:15:50,582 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 05:15:50,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:15:50" (1/1) ... [2023-11-29 05:15:50,583 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:15:50" (1/1) ... [2023-11-29 05:15:50,593 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:15:50" (1/1) ... [2023-11-29 05:15:50,602 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:15:50" (1/1) ... [2023-11-29 05:15:50,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:15:50" (1/1) ... [2023-11-29 05:15:50,608 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:15:50" (1/1) ... [2023-11-29 05:15:50,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:15:50,613 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:15:50,613 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:15:50,613 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:15:50,614 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:15:50" (1/1) ... [2023-11-29 05:15:50,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:15:50,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:15:50,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:15:50,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:15:50,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:15:50,685 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-11-29 05:15:50,685 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-11-29 05:15:50,685 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-11-29 05:15:50,685 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-11-29 05:15:50,685 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-11-29 05:15:50,685 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-11-29 05:15:50,685 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-11-29 05:15:50,685 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-11-29 05:15:50,686 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2023-11-29 05:15:50,686 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2023-11-29 05:15:50,686 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-11-29 05:15:50,686 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-11-29 05:15:50,686 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-11-29 05:15:50,686 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-11-29 05:15:50,686 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2023-11-29 05:15:50,687 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2023-11-29 05:15:50,687 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-11-29 05:15:50,687 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-11-29 05:15:50,688 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2023-11-29 05:15:50,688 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2023-11-29 05:15:50,688 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-11-29 05:15:50,688 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-11-29 05:15:50,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:15:50,688 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-11-29 05:15:50,688 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-11-29 05:15:50,688 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2023-11-29 05:15:50,689 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2023-11-29 05:15:50,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:15:50,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:15:50,689 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-11-29 05:15:50,689 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-11-29 05:15:50,785 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:15:50,787 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:15:51,194 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2023-11-29 05:15:51,194 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2023-11-29 05:15:51,244 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:15:51,301 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:15:51,301 INFO L309 CfgBuilder]: Removed 9 assume(true) statements. [2023-11-29 05:15:51,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:15:51 BoogieIcfgContainer [2023-11-29 05:15:51,302 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:15:51,304 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:15:51,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:15:51,308 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:15:51,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:15:50" (1/3) ... [2023-11-29 05:15:51,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71df921a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:15:51, skipping insertion in model container [2023-11-29 05:15:51,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:15:50" (2/3) ... [2023-11-29 05:15:51,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71df921a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:15:51, skipping insertion in model container [2023-11-29 05:15:51,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:15:51" (3/3) ... [2023-11-29 05:15:51,311 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.02.cil-1.c [2023-11-29 05:15:51,326 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:15:51,326 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-29 05:15:51,381 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:15:51,387 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;@37b03134, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:15:51,388 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-29 05:15:51,392 INFO L276 IsEmpty]: Start isEmpty. Operand has 222 states, 173 states have (on average 1.6416184971098267) internal successors, (284), 179 states have internal predecessors, (284), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 05:15:51,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-29 05:15:51,405 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:15:51,406 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:15:51,406 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:15:51,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:15:51,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1924252270, now seen corresponding path program 1 times [2023-11-29 05:15:51,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:15:51,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648005705] [2023-11-29 05:15:51,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:15:51,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:15:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:51,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:15:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:51,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:15:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:51,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:15:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:51,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:15:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:51,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 05:15:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:51,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:15:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:51,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:15:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:51,953 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 05:15:51,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:15:51,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648005705] [2023-11-29 05:15:51,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648005705] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:15:51,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:15:51,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:15:51,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246893835] [2023-11-29 05:15:51,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:15:51,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:15:51,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:15:51,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:15:51,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:15:51,995 INFO L87 Difference]: Start difference. First operand has 222 states, 173 states have (on average 1.6416184971098267) internal successors, (284), 179 states have internal predecessors, (284), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 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 05:15:53,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:15:53,054 INFO L93 Difference]: Finished difference Result 567 states and 893 transitions. [2023-11-29 05:15:53,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 05:15:53,057 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 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 57 [2023-11-29 05:15:53,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:15:53,072 INFO L225 Difference]: With dead ends: 567 [2023-11-29 05:15:53,072 INFO L226 Difference]: Without dead ends: 355 [2023-11-29 05:15:53,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2023-11-29 05:15:53,081 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 482 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:15:53,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 833 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 05:15:53,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2023-11-29 05:15:53,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 318. [2023-11-29 05:15:53,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 249 states have (on average 1.5060240963855422) internal successors, (375), 255 states have internal predecessors, (375), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2023-11-29 05:15:53,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 468 transitions. [2023-11-29 05:15:53,162 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 468 transitions. Word has length 57 [2023-11-29 05:15:53,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:15:53,162 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 468 transitions. [2023-11-29 05:15:53,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 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 05:15:53,162 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 468 transitions. [2023-11-29 05:15:53,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-29 05:15:53,167 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:15:53,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:15:53,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:15:53,168 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:15:53,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:15:53,168 INFO L85 PathProgramCache]: Analyzing trace with hash 426722258, now seen corresponding path program 1 times [2023-11-29 05:15:53,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:15:53,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285483002] [2023-11-29 05:15:53,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:15:53,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:15:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:53,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:15:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:53,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:15:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:53,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:15:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:53,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:15:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:53,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 05:15:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:53,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:15:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:53,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:15:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:53,312 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 05:15:53,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:15:53,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285483002] [2023-11-29 05:15:53,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285483002] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:15:53,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:15:53,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:15:53,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232792021] [2023-11-29 05:15:53,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:15:53,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:15:53,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:15:53,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:15:53,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:15:53,317 INFO L87 Difference]: Start difference. First operand 318 states and 468 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 05:15:54,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:15:54,191 INFO L93 Difference]: Finished difference Result 740 states and 1074 transitions. [2023-11-29 05:15:54,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:15:54,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 57 [2023-11-29 05:15:54,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:15:54,199 INFO L225 Difference]: With dead ends: 740 [2023-11-29 05:15:54,199 INFO L226 Difference]: Without dead ends: 552 [2023-11-29 05:15:54,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-11-29 05:15:54,203 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 883 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:15:54,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 693 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 05:15:54,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2023-11-29 05:15:54,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 484. [2023-11-29 05:15:54,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 379 states have (on average 1.4775725593667546) internal successors, (560), 387 states have internal predecessors, (560), 65 states have call successors, (65), 35 states have call predecessors, (65), 38 states have return successors, (71), 64 states have call predecessors, (71), 63 states have call successors, (71) [2023-11-29 05:15:54,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 696 transitions. [2023-11-29 05:15:54,263 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 696 transitions. Word has length 57 [2023-11-29 05:15:54,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:15:54,263 INFO L495 AbstractCegarLoop]: Abstraction has 484 states and 696 transitions. [2023-11-29 05:15:54,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 05:15:54,264 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 696 transitions. [2023-11-29 05:15:54,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 05:15:54,267 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:15:54,267 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 05:15:54,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:15:54,267 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:15:54,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:15:54,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1208441665, now seen corresponding path program 1 times [2023-11-29 05:15:54,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:15:54,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678369505] [2023-11-29 05:15:54,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:15:54,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:15:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:54,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:15:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:54,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:15:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:54,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:15:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:54,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:15:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:54,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:15:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:54,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 05:15:54,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:54,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 05:15:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:54,423 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 05:15:54,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:15:54,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678369505] [2023-11-29 05:15:54,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678369505] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:15:54,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:15:54,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:15:54,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451823657] [2023-11-29 05:15:54,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:15:54,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:15:54,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:15:54,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:15:54,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:15:54,426 INFO L87 Difference]: Start difference. First operand 484 states and 696 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 05:15:55,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:15:55,304 INFO L93 Difference]: Finished difference Result 906 states and 1297 transitions. [2023-11-29 05:15:55,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:15:55,305 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 05:15:55,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:15:55,310 INFO L225 Difference]: With dead ends: 906 [2023-11-29 05:15:55,310 INFO L226 Difference]: Without dead ends: 552 [2023-11-29 05:15:55,312 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 05:15:55,313 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 254 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:15:55,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 1159 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1061 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 05:15:55,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2023-11-29 05:15:55,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 492. [2023-11-29 05:15:55,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 385 states have (on average 1.464935064935065) internal successors, (564), 393 states have internal predecessors, (564), 65 states have call successors, (65), 35 states have call predecessors, (65), 40 states have return successors, (73), 66 states have call predecessors, (73), 63 states have call successors, (73) [2023-11-29 05:15:55,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 702 transitions. [2023-11-29 05:15:55,359 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 702 transitions. Word has length 58 [2023-11-29 05:15:55,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:15:55,359 INFO L495 AbstractCegarLoop]: Abstraction has 492 states and 702 transitions. [2023-11-29 05:15:55,360 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 05:15:55,360 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 702 transitions. [2023-11-29 05:15:55,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 05:15:55,362 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:15:55,362 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 05:15:55,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:15:55,362 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:15:55,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:15:55,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1280828223, now seen corresponding path program 1 times [2023-11-29 05:15:55,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:15:55,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665257678] [2023-11-29 05:15:55,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:15:55,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:15:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:55,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:15:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:55,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:15:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:55,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:15:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:55,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:15:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:55,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:15:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:55,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 05:15:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:55,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 05:15:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:55,533 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 05:15:55,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:15:55,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665257678] [2023-11-29 05:15:55,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665257678] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:15:55,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:15:55,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:15:55,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214538034] [2023-11-29 05:15:55,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:15:55,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:15:55,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:15:55,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:15:55,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:15:55,536 INFO L87 Difference]: Start difference. First operand 492 states and 702 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 05:15:57,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:15:57,487 INFO L93 Difference]: Finished difference Result 1887 states and 2721 transitions. [2023-11-29 05:15:57,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-29 05:15:57,488 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 58 [2023-11-29 05:15:57,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:15:57,493 INFO L225 Difference]: With dead ends: 1887 [2023-11-29 05:15:57,493 INFO L226 Difference]: Without dead ends: 746 [2023-11-29 05:15:57,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2023-11-29 05:15:57,499 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 1271 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 1876 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 2191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 1876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:15:57,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1290 Valid, 1434 Invalid, 2191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 1876 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 05:15:57,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2023-11-29 05:15:57,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 628. [2023-11-29 05:15:57,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 484 states have (on average 1.4173553719008265) internal successors, (686), 494 states have internal predecessors, (686), 85 states have call successors, (85), 49 states have call predecessors, (85), 57 states have return successors, (104), 87 states have call predecessors, (104), 83 states have call successors, (104) [2023-11-29 05:15:57,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 875 transitions. [2023-11-29 05:15:57,573 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 875 transitions. Word has length 58 [2023-11-29 05:15:57,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:15:57,573 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 875 transitions. [2023-11-29 05:15:57,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 05:15:57,574 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 875 transitions. [2023-11-29 05:15:57,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 05:15:57,575 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:15:57,575 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 05:15:57,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:15:57,576 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:15:57,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:15:57,576 INFO L85 PathProgramCache]: Analyzing trace with hash 360418206, now seen corresponding path program 1 times [2023-11-29 05:15:57,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:15:57,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816607863] [2023-11-29 05:15:57,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:15:57,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:15:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:57,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:15:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:57,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:15:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:57,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:15:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:57,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:15:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:57,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:15:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:57,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:15:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:57,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:15:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:57,727 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 05:15:57,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:15:57,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816607863] [2023-11-29 05:15:57,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816607863] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:15:57,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:15:57,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:15:57,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363822904] [2023-11-29 05:15:57,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:15:57,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:15:57,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:15:57,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:15:57,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:15:57,730 INFO L87 Difference]: Start difference. First operand 628 states and 875 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 05:15:58,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:15:58,527 INFO L93 Difference]: Finished difference Result 1474 states and 2056 transitions. [2023-11-29 05:15:58,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 05:15:58,527 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), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2023-11-29 05:15:58,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:15:58,529 INFO L225 Difference]: With dead ends: 1474 [2023-11-29 05:15:58,529 INFO L226 Difference]: Without dead ends: 117 [2023-11-29 05:15:58,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-11-29 05:15:58,533 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 851 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:15:58,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 833 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 05:15:58,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-29 05:15:58,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2023-11-29 05:15:58,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 94 states have (on average 1.5212765957446808) internal successors, (143), 95 states have internal predecessors, (143), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 05:15:58,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 175 transitions. [2023-11-29 05:15:58,543 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 175 transitions. Word has length 59 [2023-11-29 05:15:58,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:15:58,543 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 175 transitions. [2023-11-29 05:15:58,544 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), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 05:15:58,544 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 175 transitions. [2023-11-29 05:15:58,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-29 05:15:58,545 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:15:58,545 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 05:15:58,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:15:58,545 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:15:58,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:15:58,546 INFO L85 PathProgramCache]: Analyzing trace with hash 751681765, now seen corresponding path program 1 times [2023-11-29 05:15:58,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:15:58,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128549124] [2023-11-29 05:15:58,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:15:58,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:15:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:58,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:15:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:58,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:15:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:58,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:15:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:58,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:15:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:58,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:15:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:58,662 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 05:15:58,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:15:58,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128549124] [2023-11-29 05:15:58,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128549124] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:15:58,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:15:58,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:15:58,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398608337] [2023-11-29 05:15:58,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:15:58,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:15:58,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:15:58,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:15:58,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:15:58,665 INFO L87 Difference]: Start difference. First operand 117 states and 175 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 05:15:59,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:15:59,307 INFO L93 Difference]: Finished difference Result 392 states and 601 transitions. [2023-11-29 05:15:59,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:15:59,308 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 05:15:59,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:15:59,310 INFO L225 Difference]: With dead ends: 392 [2023-11-29 05:15:59,310 INFO L226 Difference]: Without dead ends: 284 [2023-11-29 05:15:59,311 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 05:15:59,312 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 388 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:15:59,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 354 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:15:59,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2023-11-29 05:15:59,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 225. [2023-11-29 05:15:59,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 184 states have (on average 1.5271739130434783) internal successors, (281), 186 states have internal predecessors, (281), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2023-11-29 05:15:59,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 338 transitions. [2023-11-29 05:15:59,328 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 338 transitions. Word has length 61 [2023-11-29 05:15:59,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:15:59,328 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 338 transitions. [2023-11-29 05:15:59,328 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 05:15:59,329 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 338 transitions. [2023-11-29 05:15:59,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-29 05:15:59,329 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:15:59,329 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 05:15:59,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:15:59,330 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:15:59,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:15:59,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1534836827, now seen corresponding path program 1 times [2023-11-29 05:15:59,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:15:59,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227032519] [2023-11-29 05:15:59,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:15:59,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:15:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:59,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:15:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:59,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:15:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:59,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:15:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:59,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:15:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:59,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:15:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:59,436 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 05:15:59,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:15:59,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227032519] [2023-11-29 05:15:59,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227032519] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:15:59,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:15:59,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:15:59,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363012440] [2023-11-29 05:15:59,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:15:59,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:15:59,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:15:59,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:15:59,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:15:59,438 INFO L87 Difference]: Start difference. First operand 225 states and 338 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 05:16:00,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:16:00,335 INFO L93 Difference]: Finished difference Result 637 states and 967 transitions. [2023-11-29 05:16:00,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 05:16:00,336 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 05:16:00,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:16:00,339 INFO L225 Difference]: With dead ends: 637 [2023-11-29 05:16:00,339 INFO L226 Difference]: Without dead ends: 421 [2023-11-29 05:16:00,340 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 05:16:00,340 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 395 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:16:00,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 650 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 05:16:00,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2023-11-29 05:16:00,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 326. [2023-11-29 05:16:00,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 267 states have (on average 1.5168539325842696) internal successors, (405), 270 states have internal predecessors, (405), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2023-11-29 05:16:00,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 486 transitions. [2023-11-29 05:16:00,362 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 486 transitions. Word has length 61 [2023-11-29 05:16:00,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:16:00,362 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 486 transitions. [2023-11-29 05:16:00,362 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 05:16:00,362 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 486 transitions. [2023-11-29 05:16:00,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-29 05:16:00,363 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:16:00,363 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 05:16:00,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 05:16:00,363 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:16:00,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:16:00,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1550355545, now seen corresponding path program 1 times [2023-11-29 05:16:00,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:16:00,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499193882] [2023-11-29 05:16:00,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:00,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:16:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:00,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:16:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:00,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:16:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:00,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:16:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:00,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:16:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:00,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:16:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:00,469 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 05:16:00,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:16:00,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499193882] [2023-11-29 05:16:00,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499193882] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:16:00,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:16:00,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:16:00,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385354984] [2023-11-29 05:16:00,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:16:00,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:16:00,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:16:00,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:16:00,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:16:00,471 INFO L87 Difference]: Start difference. First operand 326 states and 486 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 05:16:01,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:16:01,431 INFO L93 Difference]: Finished difference Result 1058 states and 1599 transitions. [2023-11-29 05:16:01,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 05:16:01,431 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 05:16:01,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:16:01,436 INFO L225 Difference]: With dead ends: 1058 [2023-11-29 05:16:01,437 INFO L226 Difference]: Without dead ends: 741 [2023-11-29 05:16:01,438 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 05:16:01,439 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 407 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:16:01,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 641 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1130 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 05:16:01,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2023-11-29 05:16:01,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 528. [2023-11-29 05:16:01,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 435 states have (on average 1.5126436781609196) internal successors, (658), 440 states have internal predecessors, (658), 58 states have call successors, (58), 30 states have call predecessors, (58), 34 states have return successors, (71), 61 states have call predecessors, (71), 58 states have call successors, (71) [2023-11-29 05:16:01,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 787 transitions. [2023-11-29 05:16:01,489 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 787 transitions. Word has length 61 [2023-11-29 05:16:01,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:16:01,489 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 787 transitions. [2023-11-29 05:16:01,489 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 05:16:01,489 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 787 transitions. [2023-11-29 05:16:01,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-29 05:16:01,490 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:16:01,490 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 05:16:01,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 05:16:01,491 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:16:01,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:16:01,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1903443927, now seen corresponding path program 1 times [2023-11-29 05:16:01,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:16:01,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674344850] [2023-11-29 05:16:01,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:01,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:16:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:01,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:16:01,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:01,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:16:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:01,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:16:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:01,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:16:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:01,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:16:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:01,631 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 05:16:01,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:16:01,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674344850] [2023-11-29 05:16:01,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674344850] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:16:01,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:16:01,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:16:01,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389705630] [2023-11-29 05:16:01,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:16:01,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:16:01,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:16:01,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:16:01,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:16:01,634 INFO L87 Difference]: Start difference. First operand 528 states and 787 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 05:16:02,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:16:02,569 INFO L93 Difference]: Finished difference Result 1762 states and 2650 transitions. [2023-11-29 05:16:02,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 05:16:02,570 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 05:16:02,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:16:02,579 INFO L225 Difference]: With dead ends: 1762 [2023-11-29 05:16:02,579 INFO L226 Difference]: Without dead ends: 1243 [2023-11-29 05:16:02,581 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 05:16:02,582 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 434 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:16:02,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 637 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 05:16:02,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2023-11-29 05:16:02,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 909. [2023-11-29 05:16:02,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 750 states have (on average 1.5066666666666666) internal successors, (1130), 759 states have internal predecessors, (1130), 96 states have call successors, (96), 54 states have call predecessors, (96), 62 states have return successors, (131), 103 states have call predecessors, (131), 96 states have call successors, (131) [2023-11-29 05:16:02,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1357 transitions. [2023-11-29 05:16:02,695 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1357 transitions. Word has length 61 [2023-11-29 05:16:02,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:16:02,695 INFO L495 AbstractCegarLoop]: Abstraction has 909 states and 1357 transitions. [2023-11-29 05:16:02,695 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 05:16:02,695 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1357 transitions. [2023-11-29 05:16:02,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-29 05:16:02,697 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:16:02,697 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 05:16:02,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 05:16:02,697 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:16:02,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:16:02,697 INFO L85 PathProgramCache]: Analyzing trace with hash 24828775, now seen corresponding path program 1 times [2023-11-29 05:16:02,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:16:02,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099027877] [2023-11-29 05:16:02,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:02,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:16:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:02,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:16:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:02,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:16:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:02,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:16:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:02,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:16:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:02,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:16:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:02,820 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 05:16:02,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:16:02,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099027877] [2023-11-29 05:16:02,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099027877] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:16:02,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:16:02,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:16:02,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607234019] [2023-11-29 05:16:02,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:16:02,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:16:02,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:16:02,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:16:02,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:16:02,822 INFO L87 Difference]: Start difference. First operand 909 states and 1357 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 05:16:03,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:16:03,776 INFO L93 Difference]: Finished difference Result 3035 states and 4556 transitions. [2023-11-29 05:16:03,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 05:16:03,776 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 05:16:03,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:16:03,786 INFO L225 Difference]: With dead ends: 3035 [2023-11-29 05:16:03,786 INFO L226 Difference]: Without dead ends: 2135 [2023-11-29 05:16:03,789 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 05:16:03,790 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 384 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:16:03,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 619 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 05:16:03,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135 states. [2023-11-29 05:16:03,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2135 to 1684. [2023-11-29 05:16:03,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1401 states have (on average 1.5060670949321913) internal successors, (2110), 1418 states have internal predecessors, (2110), 166 states have call successors, (166), 100 states have call predecessors, (166), 116 states have return successors, (263), 181 states have call predecessors, (263), 166 states have call successors, (263) [2023-11-29 05:16:03,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2539 transitions. [2023-11-29 05:16:03,909 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2539 transitions. Word has length 61 [2023-11-29 05:16:03,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:16:03,910 INFO L495 AbstractCegarLoop]: Abstraction has 1684 states and 2539 transitions. [2023-11-29 05:16:03,910 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 05:16:03,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2539 transitions. [2023-11-29 05:16:03,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-29 05:16:03,912 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:16:03,912 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 05:16:03,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:16:03,912 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:16:03,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:16:03,913 INFO L85 PathProgramCache]: Analyzing trace with hash 918315113, now seen corresponding path program 1 times [2023-11-29 05:16:03,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:16:03,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161212247] [2023-11-29 05:16:03,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:03,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:16:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:03,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:16:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:03,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:16:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:03,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:16:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:04,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:16:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:04,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:16:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:04,023 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 05:16:04,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:16:04,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161212247] [2023-11-29 05:16:04,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161212247] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:16:04,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:16:04,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:16:04,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176637563] [2023-11-29 05:16:04,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:16:04,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:16:04,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:16:04,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:16:04,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:16:04,025 INFO L87 Difference]: Start difference. First operand 1684 states and 2539 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 05:16:05,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:16:05,400 INFO L93 Difference]: Finished difference Result 7707 states and 11871 transitions. [2023-11-29 05:16:05,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 05:16:05,401 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 05:16:05,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:16:05,428 INFO L225 Difference]: With dead ends: 7707 [2023-11-29 05:16:05,428 INFO L226 Difference]: Without dead ends: 6033 [2023-11-29 05:16:05,435 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 05:16:05,435 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 1035 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:16:05,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 518 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 05:16:05,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6033 states. [2023-11-29 05:16:05,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6033 to 4943. [2023-11-29 05:16:05,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4943 states, 4092 states have (on average 1.4850928641251222) internal successors, (6077), 4168 states have internal predecessors, (6077), 496 states have call successors, (496), 306 states have call predecessors, (496), 354 states have return successors, (840), 484 states have call predecessors, (840), 496 states have call successors, (840) [2023-11-29 05:16:05,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4943 states to 4943 states and 7413 transitions. [2023-11-29 05:16:05,886 INFO L78 Accepts]: Start accepts. Automaton has 4943 states and 7413 transitions. Word has length 61 [2023-11-29 05:16:05,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:16:05,886 INFO L495 AbstractCegarLoop]: Abstraction has 4943 states and 7413 transitions. [2023-11-29 05:16:05,886 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 05:16:05,886 INFO L276 IsEmpty]: Start isEmpty. Operand 4943 states and 7413 transitions. [2023-11-29 05:16:05,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-29 05:16:05,929 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:16:05,929 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 05:16:05,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 05:16:05,929 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:16:05,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:16:05,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1954181422, now seen corresponding path program 1 times [2023-11-29 05:16:05,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:16:05,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863322311] [2023-11-29 05:16:05,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:05,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:16:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:05,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:16:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:05,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:16:05,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:06,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:16:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:06,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:16:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:06,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:16:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:06,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:16:06,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:06,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:16:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:06,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:16:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:06,050 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 05:16:06,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:16:06,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863322311] [2023-11-29 05:16:06,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863322311] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:16:06,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966574132] [2023-11-29 05:16:06,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:06,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:16:06,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:16:06,054 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:16:06,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:16:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:06,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:16:06,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:16:06,204 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 05:16:06,204 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:16:06,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966574132] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:16:06,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:16:06,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 05:16:06,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014111712] [2023-11-29 05:16:06,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:16:06,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:16:06,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:16:06,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:16:06,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:16:06,207 INFO L87 Difference]: Start difference. First operand 4943 states and 7413 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 05:16:06,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:16:06,837 INFO L93 Difference]: Finished difference Result 14513 states and 22084 transitions. [2023-11-29 05:16:06,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:16:06,838 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 05:16:06,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:16:06,905 INFO L225 Difference]: With dead ends: 14513 [2023-11-29 05:16:06,905 INFO L226 Difference]: Without dead ends: 9581 [2023-11-29 05:16:06,923 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 05:16:06,924 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 145 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:16:06,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 455 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:16:06,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9581 states. [2023-11-29 05:16:07,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9581 to 9581. [2023-11-29 05:16:07,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9581 states, 7939 states have (on average 1.4734853256077591) internal successors, (11698), 8064 states have internal predecessors, (11698), 943 states have call successors, (943), 600 states have call predecessors, (943), 698 states have return successors, (1803), 948 states have call predecessors, (1803), 943 states have call successors, (1803) [2023-11-29 05:16:07,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9581 states to 9581 states and 14444 transitions. [2023-11-29 05:16:07,899 INFO L78 Accepts]: Start accepts. Automaton has 9581 states and 14444 transitions. Word has length 99 [2023-11-29 05:16:07,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:16:07,899 INFO L495 AbstractCegarLoop]: Abstraction has 9581 states and 14444 transitions. [2023-11-29 05:16:07,899 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 05:16:07,900 INFO L276 IsEmpty]: Start isEmpty. Operand 9581 states and 14444 transitions. [2023-11-29 05:16:07,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-29 05:16:07,932 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:16:07,932 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 05:16:07,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:16:08,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 05:16:08,133 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:16:08,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:16:08,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1921924436, now seen corresponding path program 1 times [2023-11-29 05:16:08,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:16:08,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185968630] [2023-11-29 05:16:08,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:08,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:16:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:08,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:16:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:08,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:16:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:08,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:16:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:08,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:16:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:08,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:16:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:08,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:16:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:08,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:16:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:08,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 05:16:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:08,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:16:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:08,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 05:16:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:08,271 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 05:16:08,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:16:08,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185968630] [2023-11-29 05:16:08,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185968630] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:16:08,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051761708] [2023-11-29 05:16:08,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:08,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:16:08,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:16:08,273 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:16:08,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 05:16:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:08,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:16:08,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:16:08,524 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 05:16:08,524 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:16:08,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051761708] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:16:08,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:16:08,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-11-29 05:16:08,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048415652] [2023-11-29 05:16:08,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:16:08,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:16:08,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:16:08,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:16:08,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:16:08,527 INFO L87 Difference]: Start difference. First operand 9581 states and 14444 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 05:16:09,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:16:09,518 INFO L93 Difference]: Finished difference Result 18033 states and 27484 transitions. [2023-11-29 05:16:09,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:16:09,518 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 05:16:09,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:16:09,577 INFO L225 Difference]: With dead ends: 18033 [2023-11-29 05:16:09,577 INFO L226 Difference]: Without dead ends: 12949 [2023-11-29 05:16:09,591 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 05:16:09,592 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 91 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:16:09,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 298 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:16:09,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12949 states. [2023-11-29 05:16:10,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12949 to 12859. [2023-11-29 05:16:10,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12859 states, 10655 states have (on average 1.4736743312998593) internal successors, (15702), 10821 states have internal predecessors, (15702), 1265 states have call successors, (1265), 808 states have call predecessors, (1265), 938 states have return successors, (2350), 1261 states have call predecessors, (2350), 1265 states have call successors, (2350) [2023-11-29 05:16:10,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12859 states to 12859 states and 19317 transitions. [2023-11-29 05:16:10,284 INFO L78 Accepts]: Start accepts. Automaton has 12859 states and 19317 transitions. Word has length 127 [2023-11-29 05:16:10,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:16:10,284 INFO L495 AbstractCegarLoop]: Abstraction has 12859 states and 19317 transitions. [2023-11-29 05:16:10,284 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 05:16:10,285 INFO L276 IsEmpty]: Start isEmpty. Operand 12859 states and 19317 transitions. [2023-11-29 05:16:10,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-29 05:16:10,304 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:16:10,304 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 05:16:10,309 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 05:16:10,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-29 05:16:10,505 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:16:10,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:16:10,505 INFO L85 PathProgramCache]: Analyzing trace with hash 150453461, now seen corresponding path program 1 times [2023-11-29 05:16:10,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:16:10,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310230413] [2023-11-29 05:16:10,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:10,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:16:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:10,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:16:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:10,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:16:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:10,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:16:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:10,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:16:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:10,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:16:10,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:10,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:16:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:10,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:16:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:10,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 05:16:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:10,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:16:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:10,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 05:16:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:10,638 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 05:16:10,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:16:10,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310230413] [2023-11-29 05:16:10,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310230413] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:16:10,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94324441] [2023-11-29 05:16:10,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:10,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:16:10,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:16:10,640 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:16:10,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 05:16:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:10,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:16:10,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:16:10,890 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 05:16:10,891 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:16:10,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94324441] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:16:10,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:16:10,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-11-29 05:16:10,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389027445] [2023-11-29 05:16:10,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:16:10,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:16:10,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:16:10,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:16:10,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:16:10,893 INFO L87 Difference]: Start difference. First operand 12859 states and 19317 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 05:16:12,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:16:12,599 INFO L93 Difference]: Finished difference Result 38011 states and 57611 transitions. [2023-11-29 05:16:12,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:16:12,600 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 05:16:12,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:16:12,682 INFO L225 Difference]: With dead ends: 38011 [2023-11-29 05:16:12,682 INFO L226 Difference]: Without dead ends: 25167 [2023-11-29 05:16:12,724 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 05:16:12,725 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 95 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:16:12,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 301 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:16:12,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25167 states. [2023-11-29 05:16:14,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25167 to 25025. [2023-11-29 05:16:14,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25025 states, 20770 states have (on average 1.4655272026961965) internal successors, (30439), 21100 states have internal predecessors, (30439), 2411 states have call successors, (2411), 1580 states have call predecessors, (2411), 1843 states have return successors, (4394), 2376 states have call predecessors, (4394), 2411 states have call successors, (4394) [2023-11-29 05:16:14,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25025 states to 25025 states and 37244 transitions. [2023-11-29 05:16:14,223 INFO L78 Accepts]: Start accepts. Automaton has 25025 states and 37244 transitions. Word has length 127 [2023-11-29 05:16:14,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:16:14,224 INFO L495 AbstractCegarLoop]: Abstraction has 25025 states and 37244 transitions. [2023-11-29 05:16:14,224 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 05:16:14,224 INFO L276 IsEmpty]: Start isEmpty. Operand 25025 states and 37244 transitions. [2023-11-29 05:16:14,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-11-29 05:16:14,263 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:16:14,263 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 05:16:14,268 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 05:16:14,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:16:14,464 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:16:14,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:16:14,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1421012609, now seen corresponding path program 1 times [2023-11-29 05:16:14,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:16:14,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336820071] [2023-11-29 05:16:14,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:14,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:16:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:14,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:16:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:14,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:16:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:14,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:16:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:14,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:16:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:14,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:16:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:14,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 05:16:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:14,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 05:16:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:14,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:16:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:14,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:16:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:14,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:16:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:14,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 05:16:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:14,596 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 05:16:14,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:16:14,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336820071] [2023-11-29 05:16:14,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336820071] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:16:14,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342152388] [2023-11-29 05:16:14,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:14,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:16:14,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:16:14,598 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:16:14,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 05:16:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:14,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:16:14,839 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:16:14,886 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 05:16:14,886 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:16:14,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342152388] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:16:14,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:16:14,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 05:16:14,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854423117] [2023-11-29 05:16:14,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:16:14,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:16:14,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:16:14,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:16:14,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:16:14,889 INFO L87 Difference]: Start difference. First operand 25025 states and 37244 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 05:16:16,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:16:16,727 INFO L93 Difference]: Finished difference Result 47799 states and 71180 transitions. [2023-11-29 05:16:16,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:16:16,727 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 05:16:16,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:16:16,802 INFO L225 Difference]: With dead ends: 47799 [2023-11-29 05:16:16,803 INFO L226 Difference]: Without dead ends: 27003 [2023-11-29 05:16:16,839 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 05:16:16,840 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 125 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:16:16,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 339 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:16:16,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27003 states. [2023-11-29 05:16:18,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27003 to 26853. [2023-11-29 05:16:18,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26853 states, 22395 states have (on average 1.4332663540968966) internal successors, (32098), 22725 states have internal predecessors, (32098), 2455 states have call successors, (2455), 1732 states have call predecessors, (2455), 2002 states have return successors, (4744), 2427 states have call predecessors, (4744), 2455 states have call successors, (4744) [2023-11-29 05:16:18,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26853 states to 26853 states and 39297 transitions. [2023-11-29 05:16:18,714 INFO L78 Accepts]: Start accepts. Automaton has 26853 states and 39297 transitions. Word has length 143 [2023-11-29 05:16:18,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:16:18,714 INFO L495 AbstractCegarLoop]: Abstraction has 26853 states and 39297 transitions. [2023-11-29 05:16:18,714 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 05:16:18,714 INFO L276 IsEmpty]: Start isEmpty. Operand 26853 states and 39297 transitions. [2023-11-29 05:16:18,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-29 05:16:18,754 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:16:18,754 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 05:16:18,759 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 05:16:18,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 05:16:18,955 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:16:18,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:16:18,955 INFO L85 PathProgramCache]: Analyzing trace with hash -631768685, now seen corresponding path program 1 times [2023-11-29 05:16:18,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:16:18,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966737057] [2023-11-29 05:16:18,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:18,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:16:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:19,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:16:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:19,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:16:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:19,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:16:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:19,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:16:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:19,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:16:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:19,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:16:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:19,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:16:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:19,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 05:16:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:19,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 05:16:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:19,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:16:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:19,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 05:16:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:19,084 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 05:16:19,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:16:19,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966737057] [2023-11-29 05:16:19,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966737057] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:16:19,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290214475] [2023-11-29 05:16:19,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:19,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:16:19,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:16:19,086 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:16:19,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 05:16:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:19,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:16:19,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:16:19,245 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 05:16:19,246 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:16:19,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290214475] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:16:19,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:16:19,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 05:16:19,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986068836] [2023-11-29 05:16:19,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:16:19,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:16:19,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:16:19,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:16:19,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:16:19,248 INFO L87 Difference]: Start difference. First operand 26853 states and 39297 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 05:16:21,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:16:21,668 INFO L93 Difference]: Finished difference Result 78995 states and 117344 transitions. [2023-11-29 05:16:21,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:16:21,669 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 05:16:21,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:16:21,796 INFO L225 Difference]: With dead ends: 78995 [2023-11-29 05:16:21,796 INFO L226 Difference]: Without dead ends: 52159 [2023-11-29 05:16:21,834 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 05:16:21,834 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 138 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:16:21,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 460 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:16:21,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52159 states. [2023-11-29 05:16:25,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52159 to 52115. [2023-11-29 05:16:25,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52115 states, 43391 states have (on average 1.421308566292549) internal successors, (61672), 44051 states have internal predecessors, (61672), 4773 states have call successors, (4773), 3404 states have call predecessors, (4773), 3950 states have return successors, (10768), 4723 states have call predecessors, (10768), 4773 states have call successors, (10768) [2023-11-29 05:16:25,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52115 states to 52115 states and 77213 transitions. [2023-11-29 05:16:25,942 INFO L78 Accepts]: Start accepts. Automaton has 52115 states and 77213 transitions. Word has length 144 [2023-11-29 05:16:25,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:16:25,942 INFO L495 AbstractCegarLoop]: Abstraction has 52115 states and 77213 transitions. [2023-11-29 05:16:25,942 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 05:16:25,942 INFO L276 IsEmpty]: Start isEmpty. Operand 52115 states and 77213 transitions. [2023-11-29 05:16:26,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-29 05:16:26,004 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:16:26,005 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 05:16:26,010 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 05:16:26,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-29 05:16:26,205 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:16:26,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:16:26,206 INFO L85 PathProgramCache]: Analyzing trace with hash -347641467, now seen corresponding path program 1 times [2023-11-29 05:16:26,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:16:26,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998489279] [2023-11-29 05:16:26,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:26,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:16:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:26,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:16:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:26,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:16:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:26,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:16:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:26,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:16:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:26,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:16:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:26,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:16:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:26,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:16:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:26,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 05:16:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:26,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:16:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:26,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:16:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:26,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 05:16:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:26,309 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-11-29 05:16:26,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:16:26,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998489279] [2023-11-29 05:16:26,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998489279] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:16:26,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350437866] [2023-11-29 05:16:26,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:26,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:16:26,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:16:26,311 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:16:26,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 05:16:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:26,439 INFO L262 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:16:26,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:16:26,522 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 05:16:26,522 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:16:26,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350437866] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:16:26,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:16:26,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 05:16:26,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444275047] [2023-11-29 05:16:26,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:16:26,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:16:26,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:16:26,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:16:26,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:16:26,524 INFO L87 Difference]: Start difference. First operand 52115 states and 77213 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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 05:16:29,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:16:29,124 INFO L93 Difference]: Finished difference Result 88339 states and 132458 transitions. [2023-11-29 05:16:29,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:16:29,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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 144 [2023-11-29 05:16:29,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:16:29,226 INFO L225 Difference]: With dead ends: 88339 [2023-11-29 05:16:29,226 INFO L226 Difference]: Without dead ends: 44313 [2023-11-29 05:16:29,284 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 05:16:29,285 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 111 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:16:29,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 182 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:16:29,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44313 states. [2023-11-29 05:16:31,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44313 to 32071. [2023-11-29 05:16:31,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32071 states, 26741 states have (on average 1.3718260349276392) internal successors, (36684), 27089 states have internal predecessors, (36684), 2917 states have call successors, (2917), 2128 states have call predecessors, (2917), 2412 states have return successors, (6088), 2885 states have call predecessors, (6088), 2917 states have call successors, (6088) [2023-11-29 05:16:31,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32071 states to 32071 states and 45689 transitions. [2023-11-29 05:16:31,987 INFO L78 Accepts]: Start accepts. Automaton has 32071 states and 45689 transitions. Word has length 144 [2023-11-29 05:16:31,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:16:31,987 INFO L495 AbstractCegarLoop]: Abstraction has 32071 states and 45689 transitions. [2023-11-29 05:16:31,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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 05:16:31,988 INFO L276 IsEmpty]: Start isEmpty. Operand 32071 states and 45689 transitions. [2023-11-29 05:16:32,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-29 05:16:32,024 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:16:32,025 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, 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] [2023-11-29 05:16:32,029 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 05:16:32,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-29 05:16:32,226 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:16:32,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:16:32,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1836703662, now seen corresponding path program 1 times [2023-11-29 05:16:32,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:16:32,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991986550] [2023-11-29 05:16:32,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:32,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:16:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:32,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:16:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:32,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:16:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:32,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:16:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:32,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:16:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:32,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:16:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:32,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 05:16:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:32,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 05:16:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:32,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:16:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:32,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 05:16:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:32,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:16:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:32,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-29 05:16:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:32,357 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-11-29 05:16:32,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:16:32,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991986550] [2023-11-29 05:16:32,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991986550] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:16:32,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920571013] [2023-11-29 05:16:32,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:32,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:16:32,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:16:32,359 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:16:32,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 05:16:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:32,501 INFO L262 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:16:32,505 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:16:32,557 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-29 05:16:32,557 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:16:32,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920571013] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:16:32,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:16:32,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 05:16:32,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45747423] [2023-11-29 05:16:32,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:16:32,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:16:32,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:16:32,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:16:32,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:16:32,560 INFO L87 Difference]: Start difference. First operand 32071 states and 45689 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 05:16:36,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:16:36,787 INFO L93 Difference]: Finished difference Result 94689 states and 138489 transitions. [2023-11-29 05:16:36,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:16:36,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 145 [2023-11-29 05:16:36,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:16:36,924 INFO L225 Difference]: With dead ends: 94689 [2023-11-29 05:16:36,924 INFO L226 Difference]: Without dead ends: 62643 [2023-11-29 05:16:36,963 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 05:16:36,963 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 132 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:16:36,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 324 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:16:37,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62643 states. [2023-11-29 05:16:40,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62643 to 62381. [2023-11-29 05:16:40,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62381 states, 51925 states have (on average 1.358613384689456) internal successors, (70546), 52621 states have internal predecessors, (70546), 5689 states have call successors, (5689), 4184 states have call predecessors, (5689), 4766 states have return successors, (15334), 5639 states have call predecessors, (15334), 5689 states have call successors, (15334) [2023-11-29 05:16:40,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62381 states to 62381 states and 91569 transitions. [2023-11-29 05:16:40,980 INFO L78 Accepts]: Start accepts. Automaton has 62381 states and 91569 transitions. Word has length 145 [2023-11-29 05:16:40,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:16:40,980 INFO L495 AbstractCegarLoop]: Abstraction has 62381 states and 91569 transitions. [2023-11-29 05:16:40,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 05:16:40,980 INFO L276 IsEmpty]: Start isEmpty. Operand 62381 states and 91569 transitions. [2023-11-29 05:16:41,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-29 05:16:41,056 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:16:41,056 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 05:16:41,060 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 05:16:41,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 05:16:41,257 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:16:41,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:16:41,257 INFO L85 PathProgramCache]: Analyzing trace with hash -433075375, now seen corresponding path program 1 times [2023-11-29 05:16:41,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:16:41,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75748449] [2023-11-29 05:16:41,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:41,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:16:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:41,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:16:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:41,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:16:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:41,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:16:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:41,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:16:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:41,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:16:41,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:41,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:16:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:41,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:16:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:41,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 05:16:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:41,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:16:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:41,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:16:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:41,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-29 05:16:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:41,377 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 05:16:41,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:16:41,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75748449] [2023-11-29 05:16:41,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75748449] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:16:41,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456799636] [2023-11-29 05:16:41,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:41,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:16:41,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:16:41,379 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:16:41,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 05:16:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:41,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:16:41,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:16:41,559 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 05:16:41,559 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:16:41,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456799636] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:16:41,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:16:41,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 05:16:41,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675870611] [2023-11-29 05:16:41,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:16:41,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:16:41,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:16:41,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:16:41,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:16:41,561 INFO L87 Difference]: Start difference. First operand 62381 states and 91569 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 05:16:44,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:16:44,792 INFO L93 Difference]: Finished difference Result 118533 states and 178073 transitions. [2023-11-29 05:16:44,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:16:44,792 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 05:16:44,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:16:44,953 INFO L225 Difference]: With dead ends: 118533 [2023-11-29 05:16:44,954 INFO L226 Difference]: Without dead ends: 61443 [2023-11-29 05:16:45,049 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 05:16:45,049 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 132 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:16:45,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 186 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:16:45,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61443 states. [2023-11-29 05:16:49,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61443 to 56451. [2023-11-29 05:16:49,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56451 states, 47013 states have (on average 1.3137855486780252) internal successors, (61765), 47585 states have internal predecessors, (61765), 5185 states have call successors, (5185), 3792 states have call predecessors, (5185), 4252 states have return successors, (12103), 5105 states have call predecessors, (12103), 5185 states have call successors, (12103) [2023-11-29 05:16:49,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56451 states to 56451 states and 79053 transitions. [2023-11-29 05:16:49,279 INFO L78 Accepts]: Start accepts. Automaton has 56451 states and 79053 transitions. Word has length 145 [2023-11-29 05:16:49,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:16:49,280 INFO L495 AbstractCegarLoop]: Abstraction has 56451 states and 79053 transitions. [2023-11-29 05:16:49,280 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 05:16:49,280 INFO L276 IsEmpty]: Start isEmpty. Operand 56451 states and 79053 transitions. [2023-11-29 05:16:49,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-29 05:16:49,328 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:16:49,328 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 05:16:49,332 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 05:16:49,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:16:49,529 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:16:49,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:16:49,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1547494798, now seen corresponding path program 1 times [2023-11-29 05:16:49,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:16:49,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520511345] [2023-11-29 05:16:49,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:49,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:16:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:49,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:16:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:49,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:16:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:49,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:16:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:49,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:16:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:49,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:16:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:49,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:16:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:49,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:16:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:49,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 05:16:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:49,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:16:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:49,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:16:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:49,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-29 05:16:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:49,621 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 05:16:49,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:16:49,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520511345] [2023-11-29 05:16:49,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520511345] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:16:49,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647440978] [2023-11-29 05:16:49,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:49,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:16:49,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:16:49,623 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:16:49,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 05:16:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:49,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:16:49,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:16:49,762 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 05:16:49,762 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:16:49,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647440978] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:16:49,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:16:49,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 05:16:49,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324152806] [2023-11-29 05:16:49,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:16:49,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:16:49,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:16:49,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:16:49,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:16:49,764 INFO L87 Difference]: Start difference. First operand 56451 states and 79053 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 05:16:52,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:16:52,989 INFO L93 Difference]: Finished difference Result 101903 states and 142153 transitions. [2023-11-29 05:16:52,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:16:52,989 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 05:16:52,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:16:53,281 INFO L225 Difference]: With dead ends: 101903 [2023-11-29 05:16:53,281 INFO L226 Difference]: Without dead ends: 58241 [2023-11-29 05:16:53,333 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 05:16:53,333 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 140 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:16:53,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 423 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:16:53,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58241 states. [2023-11-29 05:16:56,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58241 to 58239. [2023-11-29 05:16:56,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58239 states, 48701 states have (on average 1.3042647994907701) internal successors, (63519), 49301 states have internal predecessors, (63519), 5185 states have call successors, (5185), 3864 states have call predecessors, (5185), 4352 states have return successors, (11653), 5105 states have call predecessors, (11653), 5185 states have call successors, (11653) [2023-11-29 05:16:56,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58239 states to 58239 states and 80357 transitions. [2023-11-29 05:16:56,977 INFO L78 Accepts]: Start accepts. Automaton has 58239 states and 80357 transitions. Word has length 145 [2023-11-29 05:16:56,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:16:56,977 INFO L495 AbstractCegarLoop]: Abstraction has 58239 states and 80357 transitions. [2023-11-29 05:16:56,977 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 05:16:56,978 INFO L276 IsEmpty]: Start isEmpty. Operand 58239 states and 80357 transitions. [2023-11-29 05:16:57,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-29 05:16:57,014 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:16:57,014 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] [2023-11-29 05:16:57,019 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 05:16:57,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:16:57,215 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:16:57,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:16:57,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1404299474, now seen corresponding path program 1 times [2023-11-29 05:16:57,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:16:57,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455705715] [2023-11-29 05:16:57,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:57,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:16:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:57,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:16:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:57,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:16:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:57,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:16:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:57,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:16:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:57,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:16:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:57,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 05:16:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:57,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 05:16:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:57,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:16:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:57,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 05:16:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:57,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:16:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:57,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-29 05:16:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:57,289 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-11-29 05:16:57,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:16:57,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455705715] [2023-11-29 05:16:57,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455705715] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:16:57,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:16:57,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:16:57,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913219522] [2023-11-29 05:16:57,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:16:57,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:16:57,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:16:57,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:16:57,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:16:57,291 INFO L87 Difference]: Start difference. First operand 58239 states and 80357 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 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 05:17:00,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:17:00,472 INFO L93 Difference]: Finished difference Result 115569 states and 158767 transitions. [2023-11-29 05:17:00,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:17:00,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 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 145 [2023-11-29 05:17:00,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:17:00,594 INFO L225 Difference]: With dead ends: 115569 [2023-11-29 05:17:00,594 INFO L226 Difference]: Without dead ends: 57351 [2023-11-29 05:17:00,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:17:00,652 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 276 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:17:00,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 206 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:17:00,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57351 states. [2023-11-29 05:17:04,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57351 to 52818. [2023-11-29 05:17:04,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52818 states, 44553 states have (on average 1.3078356115188652) internal successors, (58268), 45645 states have internal predecessors, (58268), 4001 states have call successors, (4001), 2988 states have call predecessors, (4001), 4263 states have return successors, (10337), 4200 states have call predecessors, (10337), 4001 states have call successors, (10337) [2023-11-29 05:17:04,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52818 states to 52818 states and 72606 transitions. [2023-11-29 05:17:04,483 INFO L78 Accepts]: Start accepts. Automaton has 52818 states and 72606 transitions. Word has length 145 [2023-11-29 05:17:04,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:17:04,483 INFO L495 AbstractCegarLoop]: Abstraction has 52818 states and 72606 transitions. [2023-11-29 05:17:04,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 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 05:17:04,483 INFO L276 IsEmpty]: Start isEmpty. Operand 52818 states and 72606 transitions. [2023-11-29 05:17:04,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-29 05:17:04,512 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:17:04,513 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 05:17:04,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 05:17:04,513 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:17:04,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:17:04,513 INFO L85 PathProgramCache]: Analyzing trace with hash 158361844, now seen corresponding path program 1 times [2023-11-29 05:17:04,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:17:04,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750330884] [2023-11-29 05:17:04,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:04,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:17:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:04,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:17:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:04,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:17:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:04,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:17:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:04,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:17:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:04,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:17:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:04,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 05:17:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:04,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 05:17:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:04,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:17:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:04,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 05:17:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:04,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:17:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:04,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 05:17:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:04,607 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 05:17:04,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:17:04,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750330884] [2023-11-29 05:17:04,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750330884] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:17:04,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305895660] [2023-11-29 05:17:04,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:04,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:17:04,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:17:04,609 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:17:04,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 05:17:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:04,730 INFO L262 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:17:04,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:17:04,773 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-29 05:17:04,773 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:17:04,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305895660] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:17:04,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:17:04,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 05:17:04,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445070433] [2023-11-29 05:17:04,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:17:04,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:17:04,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:17:04,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:17:04,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:17:04,776 INFO L87 Difference]: Start difference. First operand 52818 states and 72606 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 05:17:07,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:17:07,460 INFO L93 Difference]: Finished difference Result 93915 states and 129447 transitions. [2023-11-29 05:17:07,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:17:07,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 146 [2023-11-29 05:17:07,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:17:07,594 INFO L225 Difference]: With dead ends: 93915 [2023-11-29 05:17:07,594 INFO L226 Difference]: Without dead ends: 53468 [2023-11-29 05:17:07,644 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 05:17:07,645 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 128 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:17:07,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 305 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:17:07,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53468 states. [2023-11-29 05:17:10,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53468 to 52818. [2023-11-29 05:17:11,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52818 states, 44553 states have (on average 1.3017080780194374) internal successors, (57995), 45645 states have internal predecessors, (57995), 4001 states have call successors, (4001), 2988 states have call predecessors, (4001), 4263 states have return successors, (10337), 4200 states have call predecessors, (10337), 4001 states have call successors, (10337) [2023-11-29 05:17:11,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52818 states to 52818 states and 72333 transitions. [2023-11-29 05:17:11,153 INFO L78 Accepts]: Start accepts. Automaton has 52818 states and 72333 transitions. Word has length 146 [2023-11-29 05:17:11,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:17:11,153 INFO L495 AbstractCegarLoop]: Abstraction has 52818 states and 72333 transitions. [2023-11-29 05:17:11,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 05:17:11,153 INFO L276 IsEmpty]: Start isEmpty. Operand 52818 states and 72333 transitions. [2023-11-29 05:17:11,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-29 05:17:11,187 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:17:11,187 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 05:17:11,192 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 05:17:11,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-29 05:17:11,388 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:17:11,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:17:11,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1196277840, now seen corresponding path program 1 times [2023-11-29 05:17:11,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:17:11,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858935461] [2023-11-29 05:17:11,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:11,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:17:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:11,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:17:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:11,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:17:11,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:11,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:17:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:11,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:17:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:11,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:17:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:11,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 05:17:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:11,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 05:17:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:11,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:17:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:11,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 05:17:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:11,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:17:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:11,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 05:17:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:11,469 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-11-29 05:17:11,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:17:11,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858935461] [2023-11-29 05:17:11,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858935461] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:17:11,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:17:11,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:17:11,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117666470] [2023-11-29 05:17:11,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:17:11,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:17:11,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:17:11,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:17:11,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:17:11,472 INFO L87 Difference]: Start difference. First operand 52818 states and 72333 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 3 states have internal predecessors, (72), 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 05:17:14,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:17:14,273 INFO L93 Difference]: Finished difference Result 96324 states and 131588 transitions. [2023-11-29 05:17:14,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:17:14,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 3 states have internal predecessors, (72), 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 146 [2023-11-29 05:17:14,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:17:14,366 INFO L225 Difference]: With dead ends: 96324 [2023-11-29 05:17:14,366 INFO L226 Difference]: Without dead ends: 43521 [2023-11-29 05:17:14,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:17:14,432 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 274 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:17:14,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 204 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:17:14,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43521 states. [2023-11-29 05:17:17,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43521 to 39806. [2023-11-29 05:17:17,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39806 states, 33665 states have (on average 1.3123124907173622) internal successors, (44179), 34445 states have internal predecessors, (44179), 2985 states have call successors, (2985), 2244 states have call predecessors, (2985), 3155 states have return successors, (7317), 3124 states have call predecessors, (7317), 2985 states have call successors, (7317) [2023-11-29 05:17:17,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39806 states to 39806 states and 54481 transitions. [2023-11-29 05:17:17,406 INFO L78 Accepts]: Start accepts. Automaton has 39806 states and 54481 transitions. Word has length 146 [2023-11-29 05:17:17,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:17:17,406 INFO L495 AbstractCegarLoop]: Abstraction has 39806 states and 54481 transitions. [2023-11-29 05:17:17,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 3 states have internal predecessors, (72), 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 05:17:17,406 INFO L276 IsEmpty]: Start isEmpty. Operand 39806 states and 54481 transitions. [2023-11-29 05:17:17,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-11-29 05:17:17,433 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:17:17,433 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, 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] [2023-11-29 05:17:17,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 05:17:17,433 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:17:17,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:17:17,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1213259920, now seen corresponding path program 1 times [2023-11-29 05:17:17,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:17:17,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582942661] [2023-11-29 05:17:17,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:17,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:17:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:17,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:17:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:17,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:17:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:17,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:17:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:17,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:17:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:17,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:17:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:17,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:17:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:17,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:17:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:17,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:17:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:17,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:17:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:17,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:17:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:17,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-29 05:17:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:17,597 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-29 05:17:17,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:17:17,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582942661] [2023-11-29 05:17:17,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582942661] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:17:17,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608766133] [2023-11-29 05:17:17,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:17,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:17:17,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:17:17,599 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:17:17,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 05:17:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:17,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:17:17,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:17:17,763 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 05:17:17,763 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:17:17,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608766133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:17:17,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:17:17,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 05:17:17,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487910894] [2023-11-29 05:17:17,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:17:17,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:17:17,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:17:17,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:17:17,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:17:17,766 INFO L87 Difference]: Start difference. First operand 39806 states and 54481 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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 05:17:20,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:17:20,429 INFO L93 Difference]: Finished difference Result 66895 states and 95786 transitions. [2023-11-29 05:17:20,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:17:20,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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 149 [2023-11-29 05:17:20,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:17:20,522 INFO L225 Difference]: With dead ends: 66895 [2023-11-29 05:17:20,522 INFO L226 Difference]: Without dead ends: 39916 [2023-11-29 05:17:20,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 170 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 05:17:20,555 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 120 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:17:20,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 412 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:17:20,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39916 states. [2023-11-29 05:17:23,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39916 to 39806. [2023-11-29 05:17:23,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39806 states, 33665 states have (on average 1.2839150452992723) internal successors, (43223), 34445 states have internal predecessors, (43223), 2985 states have call successors, (2985), 2244 states have call predecessors, (2985), 3155 states have return successors, (7317), 3124 states have call predecessors, (7317), 2985 states have call successors, (7317) [2023-11-29 05:17:23,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39806 states to 39806 states and 53525 transitions. [2023-11-29 05:17:23,265 INFO L78 Accepts]: Start accepts. Automaton has 39806 states and 53525 transitions. Word has length 149 [2023-11-29 05:17:23,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:17:23,266 INFO L495 AbstractCegarLoop]: Abstraction has 39806 states and 53525 transitions. [2023-11-29 05:17:23,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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 05:17:23,266 INFO L276 IsEmpty]: Start isEmpty. Operand 39806 states and 53525 transitions. [2023-11-29 05:17:23,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-11-29 05:17:23,295 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:17:23,296 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, 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 05:17:23,300 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 05:17:23,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:17:23,496 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:17:23,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:17:23,497 INFO L85 PathProgramCache]: Analyzing trace with hash 334208112, now seen corresponding path program 1 times [2023-11-29 05:17:23,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:17:23,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986753866] [2023-11-29 05:17:23,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:23,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:17:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:17:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:17:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:17:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:17:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:17:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:17:23,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:17:23,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:17:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:17:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:17:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-29 05:17:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,617 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-29 05:17:23,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:17:23,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986753866] [2023-11-29 05:17:23,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986753866] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:17:23,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350902460] [2023-11-29 05:17:23,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:23,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:17:23,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:17:23,619 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:17:23,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 05:17:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:23,746 INFO L262 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:17:23,748 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:17:23,811 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 05:17:23,811 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:17:23,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350902460] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:17:23,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:17:23,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 05:17:23,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546010134] [2023-11-29 05:17:23,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:17:23,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:17:23,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:17:23,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:17:23,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:17:23,813 INFO L87 Difference]: Start difference. First operand 39806 states and 53525 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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 05:17:26,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:17:26,595 INFO L93 Difference]: Finished difference Result 72964 states and 101831 transitions. [2023-11-29 05:17:26,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:17:26,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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 149 [2023-11-29 05:17:26,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:17:26,684 INFO L225 Difference]: With dead ends: 72964 [2023-11-29 05:17:26,684 INFO L226 Difference]: Without dead ends: 37381 [2023-11-29 05:17:26,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 170 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 05:17:26,737 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 118 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:17:26,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 174 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:17:26,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37381 states. [2023-11-29 05:17:28,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37381 to 22245. [2023-11-29 05:17:28,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22245 states, 18835 states have (on average 1.2415184496947174) internal successors, (23384), 19252 states have internal predecessors, (23384), 1649 states have call successors, (1649), 1248 states have call predecessors, (1649), 1760 states have return successors, (3561), 1748 states have call predecessors, (3561), 1649 states have call successors, (3561) [2023-11-29 05:17:28,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22245 states to 22245 states and 28594 transitions. [2023-11-29 05:17:28,685 INFO L78 Accepts]: Start accepts. Automaton has 22245 states and 28594 transitions. Word has length 149 [2023-11-29 05:17:28,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:17:28,685 INFO L495 AbstractCegarLoop]: Abstraction has 22245 states and 28594 transitions. [2023-11-29 05:17:28,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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 05:17:28,685 INFO L276 IsEmpty]: Start isEmpty. Operand 22245 states and 28594 transitions. [2023-11-29 05:17:28,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-29 05:17:28,697 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:17:28,697 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] [2023-11-29 05:17:28,702 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 05:17:28,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-29 05:17:28,898 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:17:28,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:17:28,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1245110550, now seen corresponding path program 1 times [2023-11-29 05:17:28,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:17:28,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338575008] [2023-11-29 05:17:28,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:28,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:17:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:28,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:17:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:28,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:17:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:28,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:17:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:28,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:17:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:28,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:17:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:28,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:17:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:28,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:17:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:29,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:17:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:29,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 05:17:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:29,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:17:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:29,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 05:17:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:29,014 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-29 05:17:29,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:17:29,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338575008] [2023-11-29 05:17:29,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338575008] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:17:29,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161555855] [2023-11-29 05:17:29,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:29,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:17:29,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:17:29,015 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:17:29,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 05:17:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:29,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:17:29,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:17:29,208 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 05:17:29,209 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:17:29,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161555855] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:17:29,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:17:29,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 05:17:29,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167205848] [2023-11-29 05:17:29,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:17:29,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:17:29,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:17:29,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:17:29,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:17:29,211 INFO L87 Difference]: Start difference. First operand 22245 states and 28594 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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 05:17:30,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:17:30,660 INFO L93 Difference]: Finished difference Result 36039 states and 48214 transitions. [2023-11-29 05:17:30,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:17:30,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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 150 [2023-11-29 05:17:30,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:17:30,707 INFO L225 Difference]: With dead ends: 36039 [2023-11-29 05:17:30,707 INFO L226 Difference]: Without dead ends: 21891 [2023-11-29 05:17:30,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 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 05:17:30,733 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 96 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:17:30,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 372 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:17:30,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21891 states. [2023-11-29 05:17:32,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21891 to 21717. [2023-11-29 05:17:32,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21717 states, 18373 states have (on average 1.2156969466064333) internal successors, (22336), 18757 states have internal predecessors, (22336), 1649 states have call successors, (1649), 1248 states have call predecessors, (1649), 1694 states have return successors, (3457), 1715 states have call predecessors, (3457), 1649 states have call successors, (3457) [2023-11-29 05:17:32,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21717 states to 21717 states and 27442 transitions. [2023-11-29 05:17:32,353 INFO L78 Accepts]: Start accepts. Automaton has 21717 states and 27442 transitions. Word has length 150 [2023-11-29 05:17:32,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:17:32,353 INFO L495 AbstractCegarLoop]: Abstraction has 21717 states and 27442 transitions. [2023-11-29 05:17:32,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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 05:17:32,354 INFO L276 IsEmpty]: Start isEmpty. Operand 21717 states and 27442 transitions. [2023-11-29 05:17:32,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-29 05:17:32,364 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:17:32,364 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 05:17:32,369 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-29 05:17:32,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-29 05:17:32,565 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:17:32,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:17:32,565 INFO L85 PathProgramCache]: Analyzing trace with hash -95076906, now seen corresponding path program 1 times [2023-11-29 05:17:32,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:17:32,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421719083] [2023-11-29 05:17:32,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:32,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:17:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:32,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:17:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:32,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:17:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:32,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:17:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:32,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:17:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:32,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:17:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:32,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:17:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:32,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:17:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:32,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:17:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:32,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 05:17:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:32,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:17:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:32,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-29 05:17:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:32,670 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 05:17:32,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:17:32,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421719083] [2023-11-29 05:17:32,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421719083] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:17:32,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428655641] [2023-11-29 05:17:32,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:32,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:17:32,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:17:32,673 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:17:32,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-29 05:17:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:32,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:17:32,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:17:32,900 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-11-29 05:17:32,900 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:17:32,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428655641] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:17:32,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:17:32,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-11-29 05:17:32,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121868896] [2023-11-29 05:17:32,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:17:32,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:17:32,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:17:32,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:17:32,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:17:32,903 INFO L87 Difference]: Start difference. First operand 21717 states and 27442 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 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 05:17:34,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:17:34,272 INFO L93 Difference]: Finished difference Result 32739 states and 41823 transitions. [2023-11-29 05:17:34,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:17:34,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 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 151 [2023-11-29 05:17:34,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:17:34,309 INFO L225 Difference]: With dead ends: 32739 [2023-11-29 05:17:34,309 INFO L226 Difference]: Without dead ends: 17374 [2023-11-29 05:17:34,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:17:34,330 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 166 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:17:34,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 233 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:17:34,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17374 states. [2023-11-29 05:17:35,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17374 to 12812. [2023-11-29 05:17:35,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12812 states, 10866 states have (on average 1.1957482054113748) internal successors, (12993), 11076 states have internal predecessors, (12993), 975 states have call successors, (975), 722 states have call predecessors, (975), 970 states have return successors, (2067), 1015 states have call predecessors, (2067), 975 states have call successors, (2067) [2023-11-29 05:17:35,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12812 states to 12812 states and 16035 transitions. [2023-11-29 05:17:35,283 INFO L78 Accepts]: Start accepts. Automaton has 12812 states and 16035 transitions. Word has length 151 [2023-11-29 05:17:35,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:17:35,283 INFO L495 AbstractCegarLoop]: Abstraction has 12812 states and 16035 transitions. [2023-11-29 05:17:35,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 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 05:17:35,283 INFO L276 IsEmpty]: Start isEmpty. Operand 12812 states and 16035 transitions. [2023-11-29 05:17:35,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-29 05:17:35,288 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:17:35,288 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 05:17:35,292 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-29 05:17:35,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-29 05:17:35,489 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:17:35,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:17:35,489 INFO L85 PathProgramCache]: Analyzing trace with hash 376279444, now seen corresponding path program 1 times [2023-11-29 05:17:35,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:17:35,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560235866] [2023-11-29 05:17:35,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:35,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:17:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:35,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:17:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:35,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:17:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:35,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:17:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:35,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:17:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:35,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:17:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:35,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:17:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:35,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:17:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:35,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:17:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:35,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 05:17:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:35,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:17:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:35,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-29 05:17:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:35,576 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 05:17:35,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:17:35,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560235866] [2023-11-29 05:17:35,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560235866] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:17:35,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854598000] [2023-11-29 05:17:35,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:35,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:17:35,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:17:35,578 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:17:35,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-29 05:17:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:35,695 INFO L262 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 05:17:35,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:17:35,706 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 05:17:35,707 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:17:35,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854598000] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:17:35,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:17:35,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-11-29 05:17:35,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703901061] [2023-11-29 05:17:35,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:17:35,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:17:35,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:17:35,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:17:35,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:17:35,709 INFO L87 Difference]: Start difference. First operand 12812 states and 16035 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 05:17:36,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:17:36,572 INFO L93 Difference]: Finished difference Result 22576 states and 28754 transitions. [2023-11-29 05:17:36,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:17:36,573 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 05:17:36,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:17:36,585 INFO L225 Difference]: With dead ends: 22576 [2023-11-29 05:17:36,585 INFO L226 Difference]: Without dead ends: 7890 [2023-11-29 05:17:36,598 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 05:17:36,598 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 20 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 430 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 05:17:36,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 430 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:17:36,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7890 states. [2023-11-29 05:17:37,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7890 to 7668. [2023-11-29 05:17:37,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7668 states, 6458 states have (on average 1.1735831526788478) internal successors, (7579), 6580 states have internal predecessors, (7579), 609 states have call successors, (609), 457 states have call predecessors, (609), 600 states have return successors, (1087), 631 states have call predecessors, (1087), 609 states have call successors, (1087) [2023-11-29 05:17:37,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7668 states to 7668 states and 9275 transitions. [2023-11-29 05:17:37,167 INFO L78 Accepts]: Start accepts. Automaton has 7668 states and 9275 transitions. Word has length 151 [2023-11-29 05:17:37,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:17:37,167 INFO L495 AbstractCegarLoop]: Abstraction has 7668 states and 9275 transitions. [2023-11-29 05:17:37,167 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 05:17:37,167 INFO L276 IsEmpty]: Start isEmpty. Operand 7668 states and 9275 transitions. [2023-11-29 05:17:37,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-29 05:17:37,169 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:17:37,170 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, 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 05:17:37,174 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-29 05:17:37,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-29 05:17:37,370 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:17:37,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:17:37,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1491663802, now seen corresponding path program 1 times [2023-11-29 05:17:37,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:17:37,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221698139] [2023-11-29 05:17:37,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:37,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:17:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:37,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:17:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:37,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:17:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:37,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:17:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:37,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:17:37,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:37,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:17:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:37,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:17:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:37,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:17:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:37,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:17:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:37,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 05:17:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:37,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:17:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:37,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-29 05:17:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:37,472 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-11-29 05:17:37,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:17:37,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221698139] [2023-11-29 05:17:37,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221698139] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:17:37,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020584471] [2023-11-29 05:17:37,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:37,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:17:37,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:17:37,473 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:17:37,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-29 05:17:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:37,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 05:17:37,573 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:17:37,583 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-29 05:17:37,583 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:17:37,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020584471] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:17:37,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:17:37,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-11-29 05:17:37,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417273677] [2023-11-29 05:17:37,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:17:37,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:17:37,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:17:37,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:17:37,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:17:37,585 INFO L87 Difference]: Start difference. First operand 7668 states and 9275 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 05:17:38,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:17:38,167 INFO L93 Difference]: Finished difference Result 14466 states and 17866 transitions. [2023-11-29 05:17:38,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:17:38,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 05:17:38,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:17:38,176 INFO L225 Difference]: With dead ends: 14466 [2023-11-29 05:17:38,177 INFO L226 Difference]: Without dead ends: 6808 [2023-11-29 05:17:38,184 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 05:17:38,184 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 11 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 429 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 05:17:38,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 429 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:17:38,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6808 states. [2023-11-29 05:17:38,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6808 to 6788. [2023-11-29 05:17:38,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6788 states, 5693 states have (on average 1.1531705603372562) internal successors, (6565), 5797 states have internal predecessors, (6565), 557 states have call successors, (557), 416 states have call predecessors, (557), 537 states have return successors, (932), 575 states have call predecessors, (932), 557 states have call successors, (932) [2023-11-29 05:17:38,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6788 states to 6788 states and 8054 transitions. [2023-11-29 05:17:38,744 INFO L78 Accepts]: Start accepts. Automaton has 6788 states and 8054 transitions. Word has length 151 [2023-11-29 05:17:38,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:17:38,744 INFO L495 AbstractCegarLoop]: Abstraction has 6788 states and 8054 transitions. [2023-11-29 05:17:38,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 05:17:38,744 INFO L276 IsEmpty]: Start isEmpty. Operand 6788 states and 8054 transitions. [2023-11-29 05:17:38,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-29 05:17:38,746 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:17:38,746 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, 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 05:17:38,751 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-11-29 05:17:38,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-29 05:17:38,947 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:17:38,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:17:38,947 INFO L85 PathProgramCache]: Analyzing trace with hash -194294648, now seen corresponding path program 1 times [2023-11-29 05:17:38,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:17:38,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128744535] [2023-11-29 05:17:38,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:38,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:17:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:38,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:17:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:38,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:17:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:39,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:17:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:39,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:17:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:39,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:17:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:39,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:17:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:39,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:17:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:39,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:17:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:39,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 05:17:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:39,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:17:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:39,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-29 05:17:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:39,037 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-11-29 05:17:39,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:17:39,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128744535] [2023-11-29 05:17:39,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128744535] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:17:39,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047458961] [2023-11-29 05:17:39,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:39,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:17:39,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:17:39,038 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:17:39,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-29 05:17:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:39,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 05:17:39,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:17:39,140 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-29 05:17:39,141 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:17:39,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047458961] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:17:39,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:17:39,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-11-29 05:17:39,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613384609] [2023-11-29 05:17:39,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:17:39,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:17:39,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:17:39,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:17:39,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:17:39,143 INFO L87 Difference]: Start difference. First operand 6788 states and 8054 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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 05:17:39,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:17:39,481 INFO L93 Difference]: Finished difference Result 9641 states and 11452 transitions. [2023-11-29 05:17:39,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:17:39,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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 05:17:39,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:17:39,485 INFO L225 Difference]: With dead ends: 9641 [2023-11-29 05:17:39,485 INFO L226 Difference]: Without dead ends: 1889 [2023-11-29 05:17:39,491 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 05:17:39,492 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 2 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 430 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 05:17:39,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 430 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:17:39,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2023-11-29 05:17:39,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1889. [2023-11-29 05:17:39,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1889 states, 1588 states have (on average 1.1272040302267003) internal successors, (1790), 1599 states have internal predecessors, (1790), 172 states have call successors, (172), 120 states have call predecessors, (172), 128 states have return successors, (187), 170 states have call predecessors, (187), 172 states have call successors, (187) [2023-11-29 05:17:39,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 2149 transitions. [2023-11-29 05:17:39,658 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 2149 transitions. Word has length 151 [2023-11-29 05:17:39,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:17:39,659 INFO L495 AbstractCegarLoop]: Abstraction has 1889 states and 2149 transitions. [2023-11-29 05:17:39,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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 05:17:39,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2149 transitions. [2023-11-29 05:17:39,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-11-29 05:17:39,661 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:17:39,661 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 1] [2023-11-29 05:17:39,666 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-11-29 05:17:39,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:17:39,862 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:17:39,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:17:39,862 INFO L85 PathProgramCache]: Analyzing trace with hash 861655127, now seen corresponding path program 1 times [2023-11-29 05:17:39,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:17:39,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354113791] [2023-11-29 05:17:39,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:39,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:17:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:39,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:17:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:39,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:17:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:39,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:17:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:39,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:17:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:39,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:17:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:39,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 05:17:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:39,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 05:17:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:39,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:17:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:40,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 05:17:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:40,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:17:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:40,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:17:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:40,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:17:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:40,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-11-29 05:17:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:40,020 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 05:17:40,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:17:40,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354113791] [2023-11-29 05:17:40,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354113791] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:17:40,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:17:40,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:17:40,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760025974] [2023-11-29 05:17:40,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:17:40,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:17:40,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:17:40,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:17:40,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:17:40,022 INFO L87 Difference]: Start difference. First operand 1889 states and 2149 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2023-11-29 05:17:41,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:17:41,064 INFO L93 Difference]: Finished difference Result 2287 states and 2583 transitions. [2023-11-29 05:17:41,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 05:17:41,064 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 183 [2023-11-29 05:17:41,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:17:41,065 INFO L225 Difference]: With dead ends: 2287 [2023-11-29 05:17:41,065 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 05:17:41,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:17:41,067 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 645 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:17:41,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 639 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 05:17:41,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 05:17:41,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 05:17:41,068 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 05:17:41,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 05:17:41,068 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 183 [2023-11-29 05:17:41,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:17:41,069 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 05:17:41,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2023-11-29 05:17:41,069 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 05:17:41,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 05:17:41,071 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-11-29 05:17:41,071 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-11-29 05:17:41,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-29 05:17:41,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 05:18:50,676 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 1029 1039) no Hoare annotation was computed. [2023-11-29 05:18:50,676 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 1029 1039) no Hoare annotation was computed. [2023-11-29 05:18:50,677 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1029 1039) the Hoare annotation is: (let ((.cse28 (= |old(~t2_st~0)| ~t2_st~0)) (.cse25 (= ~t1_st~0 0)) (.cse27 (= |old(~t1_st~0)| ~t1_st~0)) (.cse24 (= ~m_st~0 |old(~m_st~0)|)) (.cse26 (= 0 ~t2_st~0))) (let ((.cse23 (and (<= 1 ~m_pc~0) (or (< ~m_pc~0 2) (< 1 ~t1_pc~0)))) (.cse11 (and .cse27 .cse24 .cse26)) (.cse22 (and .cse24 .cse28 .cse25)) (.cse9 (= ~m_pc~0 1)) (.cse15 (< |old(~m_st~0)| 2)) (.cse16 (< ~E_1~0 2)) (.cse18 (not (= |old(~t1_st~0)| 0))) (.cse19 (not (= ~m_pc~0 ~t1_pc~0))) (.cse20 (< 0 ~t1_pc~0)) (.cse3 (not (= |old(~t2_st~0)| 0))) (.cse10 (< 0 ~t2_pc~0)) (.cse0 (< ~T1_E~0 2)) (.cse1 (not (= ~t2_i~0 1))) (.cse2 (< ~E_2~0 2)) (.cse14 (and .cse27 .cse24 .cse28)) (.cse4 (< |old(~t1_st~0)| 2)) (.cse5 (not (= ~t1_pc~0 1))) (.cse6 (< ~E_M~0 2)) (.cse21 (< |old(~t2_st~0)| 2)) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse12 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse17 (not (= ~t2_pc~0 1))) (.cse13 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse14 .cse4 .cse5 .cse7 .cse8 .cse9 .cse15 .cse12 .cse16 .cse17) (or .cse0 .cse18 .cse19 .cse20 .cse1 .cse2 .cse6 .cse21 .cse22 .cse7 .cse8 .cse12 .cse17) (or .cse0 .cse1 .cse14 .cse5 .cse6 .cse21 .cse7 .cse23 .cse8 .cse15 .cse12 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse14 (not (= ~token~0 (+ 2 ~local~0))) .cse4 .cse5 .cse7 .cse8 .cse15 .cse12 .cse16 .cse17) (or .cse0 .cse1 .cse14 .cse5 .cse6 .cse21 .cse7 .cse8 .cse15 .cse12 .cse16 .cse17 (not (= (+ ~local~0 1) ~token~0))) (or .cse0 .cse18 .cse20 .cse1 .cse2 .cse22 .cse7 .cse8 .cse9 .cse15 .cse12 .cse16 .cse17) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse23 .cse8 .cse15 .cse11 .cse12 .cse16 .cse17) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse15 .cse10 .cse11 .cse12 .cse16) (or .cse0 .cse18 .cse1 .cse2 .cse5 .cse22 .cse7 .cse8 .cse9 .cse15 .cse12 .cse16 .cse17) (or .cse0 .cse18 .cse19 .cse20 .cse1 .cse2 .cse3 (and .cse24 .cse25 .cse26) .cse6 .cse7 .cse8 .cse10 .cse12) (or .cse0 .cse1 .cse2 .cse14 .cse4 .cse5 .cse6 .cse21 .cse7 .cse8 .cse12 .cse17 .cse13)))) [2023-11-29 05:18:50,677 INFO L899 garLoopResultBuilder]: For program point update_channels1EXIT(lines 262 276) no Hoare annotation was computed. [2023-11-29 05:18:50,677 INFO L899 garLoopResultBuilder]: For program point L49-1(lines 49 53) no Hoare annotation was computed. [2023-11-29 05:18:50,677 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 48) no Hoare annotation was computed. [2023-11-29 05:18:50,678 INFO L899 garLoopResultBuilder]: For program point L44-2(lines 43 58) no Hoare annotation was computed. [2023-11-29 05:18:50,678 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 262 276) the Hoare annotation is: (let ((.cse1 (not (= ~p_dw_pc~0 0))) (.cse0 (and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|)))) (and (or .cse0 .cse1 (not (= ~c_dr_pc~0 1))) (or .cse0 .cse1 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (or .cse0 (= ~c_dr_pc~0 2) (< ~p_dw_pc~0 1)))) [2023-11-29 05:18:50,678 INFO L899 garLoopResultBuilder]: For program point L266-1(lines 262 276) no Hoare annotation was computed. [2023-11-29 05:18:50,678 INFO L899 garLoopResultBuilder]: For program point L783(lines 783 792) no Hoare annotation was computed. [2023-11-29 05:18:50,678 INFO L899 garLoopResultBuilder]: For program point L783-2(lines 783 792) no Hoare annotation was computed. [2023-11-29 05:18:50,678 INFO L899 garLoopResultBuilder]: For program point L746(lines 746 751) no Hoare annotation was computed. [2023-11-29 05:18:50,678 INFO L899 garLoopResultBuilder]: For program point L775(lines 763 777) no Hoare annotation was computed. [2023-11-29 05:18:50,678 INFO L899 garLoopResultBuilder]: For program point L784(lines 784 789) no Hoare annotation was computed. [2023-11-29 05:18:50,678 INFO L899 garLoopResultBuilder]: For program point L764(lines 764 773) no Hoare annotation was computed. [2023-11-29 05:18:50,678 INFO L899 garLoopResultBuilder]: For program point L1020(lines 1020 1024) no Hoare annotation was computed. [2023-11-29 05:18:50,679 INFO L899 garLoopResultBuilder]: For program point L764-2(lines 764 773) no Hoare annotation was computed. [2023-11-29 05:18:50,679 INFO L899 garLoopResultBuilder]: For program point L1020-2(lines 995 1028) no Hoare annotation was computed. [2023-11-29 05:18:50,679 INFO L899 garLoopResultBuilder]: For program point L756(lines 744 758) no Hoare annotation was computed. [2023-11-29 05:18:50,679 INFO L899 garLoopResultBuilder]: For program point L1012(lines 1012 1016) no Hoare annotation was computed. [2023-11-29 05:18:50,679 INFO L899 garLoopResultBuilder]: For program point L1012-2(lines 1012 1016) no Hoare annotation was computed. [2023-11-29 05:18:50,679 INFO L899 garLoopResultBuilder]: For program point L1004(lines 1004 1008) no Hoare annotation was computed. [2023-11-29 05:18:50,679 INFO L899 garLoopResultBuilder]: For program point L1004-2(lines 1004 1008) no Hoare annotation was computed. [2023-11-29 05:18:50,680 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 995 1028) the Hoare annotation is: (let ((.cse27 (= |old(~t2_st~0)| ~t2_st~0)) (.cse30 (= ~t1_st~0 0)) (.cse26 (= |old(~t1_st~0)| ~t1_st~0)) (.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse31 (= 0 ~t2_st~0))) (let ((.cse25 (not (= (+ ~local~0 1) ~token~0))) (.cse23 (and (<= 1 ~m_pc~0) (or (< ~m_pc~0 2) (< 1 ~t1_pc~0)))) (.cse11 (and .cse26 .cse29 .cse31)) (.cse24 (not (= ~token~0 (+ 2 ~local~0)))) (.cse17 (and .cse29 .cse27 .cse30)) (.cse9 (= ~m_pc~0 1)) (.cse22 (not (= ~m_pc~0 ~t1_pc~0))) (.cse14 (not (= |old(~t1_st~0)| 0))) (.cse15 (< 0 ~t1_pc~0)) (.cse3 (not (= |old(~t2_st~0)| 0))) (.cse28 (and .cse29 .cse30 .cse31)) (.cse18 (< |old(~m_st~0)| 2)) (.cse10 (< 0 ~t2_pc~0)) (.cse19 (< ~E_1~0 2)) (.cse0 (< ~T1_E~0 2)) (.cse1 (not (= ~t2_i~0 1))) (.cse2 (< ~E_2~0 2)) (.cse21 (and .cse26 .cse29 .cse27)) (.cse4 (< |old(~t1_st~0)| 2)) (.cse5 (not (= ~t1_pc~0 1))) (.cse6 (< ~E_M~0 2)) (.cse16 (< |old(~t2_st~0)| 2)) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse12 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse20 (not (= ~t2_pc~0 1))) (.cse13 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse14 .cse15 .cse1 .cse2 .cse6 .cse16 .cse17 .cse7 .cse8 .cse18 .cse12 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse21 .cse4 .cse5 .cse7 .cse8 .cse9 .cse18 .cse12 .cse19 .cse20) (or .cse0 .cse14 .cse22 .cse15 .cse1 .cse2 .cse6 .cse16 .cse17 .cse7 .cse8 .cse12 .cse20) (or .cse0 .cse1 .cse21 .cse5 .cse6 .cse16 .cse7 .cse23 .cse8 .cse18 .cse12 .cse19 .cse20) (or .cse0 .cse14 .cse1 .cse2 .cse5 .cse6 .cse16 .cse17 .cse7 .cse8 .cse18 .cse12 .cse19 .cse20 .cse13) (or .cse0 .cse1 .cse2 .cse21 .cse24 .cse4 .cse5 .cse7 .cse8 .cse18 .cse12 .cse19 .cse20) (or .cse0 .cse1 .cse21 .cse5 .cse6 .cse16 .cse7 .cse8 .cse18 .cse12 .cse19 .cse20 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse11 .cse12 .cse19 .cse20 .cse25) (or .cse0 .cse14 .cse15 .cse1 .cse2 .cse17 .cse7 .cse8 .cse9 .cse18 .cse12 .cse19 .cse20) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse23 .cse8 .cse18 .cse11 .cse12 .cse19 .cse20) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse18 .cse10 .cse11 .cse12 .cse19) (or .cse0 .cse1 (and .cse26 (= ~m_st~0 0) .cse27) .cse2 .cse24 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse12 (not (= |old(~m_st~0)| 0)) .cse19 .cse20) (or .cse0 .cse14 .cse1 .cse2 .cse5 .cse17 .cse7 .cse8 .cse9 .cse18 .cse12 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse21 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse18 .cse12 .cse19 .cse20) (or .cse0 .cse14 .cse22 .cse15 .cse1 .cse2 .cse3 .cse28 .cse6 .cse7 .cse8 .cse10 .cse12) (or .cse0 .cse14 .cse15 .cse1 .cse2 .cse3 .cse28 .cse6 .cse7 .cse8 .cse18 .cse10 .cse12 .cse19) (or .cse0 .cse1 .cse2 .cse21 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse12 .cse20 .cse13)))) [2023-11-29 05:18:50,680 INFO L899 garLoopResultBuilder]: For program point L765(lines 765 770) no Hoare annotation was computed. [2023-11-29 05:18:50,680 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 995 1028) no Hoare annotation was computed. [2023-11-29 05:18:50,680 INFO L899 garLoopResultBuilder]: For program point L794(lines 782 796) no Hoare annotation was computed. [2023-11-29 05:18:50,680 INFO L899 garLoopResultBuilder]: For program point L745(lines 745 754) no Hoare annotation was computed. [2023-11-29 05:18:50,680 INFO L899 garLoopResultBuilder]: For program point L745-2(lines 745 754) no Hoare annotation was computed. [2023-11-29 05:18:50,680 INFO L899 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 387 411) no Hoare annotation was computed. [2023-11-29 05:18:50,680 INFO L899 garLoopResultBuilder]: For program point L403(lines 403 407) no Hoare annotation was computed. [2023-11-29 05:18:50,680 INFO L899 garLoopResultBuilder]: For program point L401(line 401) no Hoare annotation was computed. [2023-11-29 05:18:50,680 INFO L899 garLoopResultBuilder]: For program point L403-2(lines 387 411) no Hoare annotation was computed. [2023-11-29 05:18:50,680 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2023-11-29 05:18:50,681 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 387 411) the Hoare annotation is: (let ((.cse0 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse1 (not (= ~p_dw_pc~0 0)))) (and (or .cse0 .cse1 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (or (= ~c_dr_pc~0 2) .cse0 (< ~p_dw_pc~0 1)) (or .cse0 .cse1 (not (= ~c_dr_pc~0 1))))) [2023-11-29 05:18:50,681 INFO L895 garLoopResultBuilder]: At program point L393(line 393) the Hoare annotation is: (let ((.cse0 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse1 (not (= ~p_dw_pc~0 0)))) (and (or .cse0 .cse1 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (or (= ~c_dr_pc~0 2) .cse0 (< ~p_dw_pc~0 1)) (or .cse0 .cse1 (not (= ~c_dr_pc~0 1))))) [2023-11-29 05:18:50,681 INFO L895 garLoopResultBuilder]: At program point L395-2(lines 395 399) the Hoare annotation is: (let ((.cse0 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse1 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse2 (not (= ~p_dw_pc~0 0))) (.cse3 (and .cse0 (= activate_threads1_~tmp~1 0) .cse1))) (and (or (= ~c_dr_pc~0 2) (and .cse0 .cse1) (= ~p_dw_pc~0 1) (< ~p_dw_pc~0 1) (not (= ~q_read_ev~0 2))) (or .cse2 (not (= ~c_dr_pc~0 1)) .cse3) (or .cse2 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse3)))) [2023-11-29 05:18:50,681 INFO L899 garLoopResultBuilder]: For program point L393-1(line 393) no Hoare annotation was computed. [2023-11-29 05:18:50,681 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 798 805) no Hoare annotation was computed. [2023-11-29 05:18:50,681 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 798 805) the Hoare annotation is: true [2023-11-29 05:18:50,681 INFO L899 garLoopResultBuilder]: For program point L923-1(lines 922 955) no Hoare annotation was computed. [2023-11-29 05:18:50,681 INFO L899 garLoopResultBuilder]: For program point L948-1(lines 919 956) no Hoare annotation was computed. [2023-11-29 05:18:50,682 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 919 956) the Hoare annotation is: (let ((.cse11 (< ~t2_st~0 2)) (.cse17 (= ~m_pc~0 1)) (.cse21 (and (<= 1 ~m_pc~0) (or (< ~m_pc~0 2) (< 1 ~t1_pc~0)))) (.cse22 (not (= ~m_pc~0 ~t1_pc~0))) (.cse16 (not (= ~m_st~0 0))) (.cse19 (not (= ~token~0 ~local~0))) (.cse0 (< 0 ~t1_pc~0)) (.cse20 (< 0 ~t2_pc~0)) (.cse9 (not (= ~t1_st~0 0))) (.cse14 (< ~t1_st~0 2)) (.cse1 (not (= ~t2_i~0 1))) (.cse2 (< ~m_st~0 2)) (.cse15 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~t1_i~0 1))) (.cse4 (not (= ~p_dw_pc~0 0))) (.cse5 (< |old(~E_1~0)| 2)) (.cse6 (< |old(~E_M~0)| 2)) (.cse18 (not (= 0 ~t2_st~0))) (.cse7 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse8 (< |old(~E_2~0)| 2)) (.cse10 (not (= ~t2_pc~0 1))) (.cse12 (< |old(~T1_E~0)| 2)) (.cse13 (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)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse14 .cse1 (not (= ~token~0 (+ 2 ~local~0))) .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13) (or .cse1 .cse2 .cse15 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13) (or .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse19) (or .cse14 .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13) (or .cse14 .cse1 .cse15 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse19) (or .cse14 .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse20 .cse18 .cse7 .cse8 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13) (or .cse1 .cse2 .cse15 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse14 .cse1 .cse15 .cse3 .cse21 .cse4 .cse5 .cse6 .cse20 .cse18 .cse7 .cse16 .cse8 .cse12 .cse13 .cse19) (or .cse22 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse19) (or .cse14 .cse1 .cse2 .cse15 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse7 .cse8 .cse10 .cse12 .cse13) (or .cse1 .cse2 .cse15 .cse3 .cse21 .cse4 .cse5 .cse6 .cse20 .cse18 .cse7 .cse8 .cse9 .cse12 .cse13) (or .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse20 .cse18 .cse7 .cse8 .cse9 .cse12 .cse13 .cse19) (or .cse22 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse20 .cse18 .cse7 .cse16 .cse8 .cse9 .cse12 .cse13 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse18 .cse7 .cse8 .cse9 .cse12 .cse13) (or .cse14 .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse10 (not (= (+ ~local~0 1) ~token~0)) .cse12 .cse13))) [2023-11-29 05:18:50,682 INFO L899 garLoopResultBuilder]: For program point L938-1(lines 922 955) no Hoare annotation was computed. [2023-11-29 05:18:50,682 INFO L899 garLoopResultBuilder]: For program point L928-1(lines 922 955) no Hoare annotation was computed. [2023-11-29 05:18:50,682 INFO L899 garLoopResultBuilder]: For program point L943-1(lines 922 955) no Hoare annotation was computed. [2023-11-29 05:18:50,682 INFO L899 garLoopResultBuilder]: For program point L933-1(lines 922 955) no Hoare annotation was computed. [2023-11-29 05:18:50,682 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 919 956) no Hoare annotation was computed. [2023-11-29 05:18:50,682 INFO L899 garLoopResultBuilder]: For program point L319-1(lines 318 331) no Hoare annotation was computed. [2023-11-29 05:18:50,683 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 315 332) the Hoare annotation is: (let ((.cse0 (not (= ~p_dw_pc~0 0))) (.cse1 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)))) (and (or .cse0 .cse1 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (or (= ~c_dr_pc~0 2) .cse1 (< ~p_dw_pc~0 1)) (or .cse0 .cse1 (not (= ~c_dr_pc~0 1))))) [2023-11-29 05:18:50,683 INFO L899 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 315 332) no Hoare annotation was computed. [2023-11-29 05:18:50,683 INFO L899 garLoopResultBuilder]: For program point L324-1(lines 315 332) no Hoare annotation was computed. [2023-11-29 05:18:50,683 INFO L899 garLoopResultBuilder]: For program point L124(lines 102 126) no Hoare annotation was computed. [2023-11-29 05:18:50,683 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 119) no Hoare annotation was computed. [2023-11-29 05:18:50,683 INFO L899 garLoopResultBuilder]: For program point L113-1(lines 113 122) no Hoare annotation was computed. [2023-11-29 05:18:50,683 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 99 127) the Hoare annotation is: true [2023-11-29 05:18:50,683 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 109) no Hoare annotation was computed. [2023-11-29 05:18:50,683 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 99 127) no Hoare annotation was computed. [2023-11-29 05:18:50,683 INFO L899 garLoopResultBuilder]: For program point L103(lines 103 112) no Hoare annotation was computed. [2023-11-29 05:18:50,683 INFO L899 garLoopResultBuilder]: For program point L103-2(lines 102 126) no Hoare annotation was computed. [2023-11-29 05:18:50,684 INFO L895 garLoopResultBuilder]: At program point L861(line 861) the Hoare annotation is: (let ((.cse7 (not (= ~m_pc~0 1))) (.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse13 (= ~token~0 ~local~0)) (.cse15 (<= 2 ~m_st~0)) (.cse12 (= 0 ~t2_st~0)) (.cse14 (<= ~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 (= ~t1_i~0 1)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse11 (= ~c_dr_pc~0 0)) (.cse20 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 (= ~token~0 (+ 2 ~local~0)) .cse10 .cse11 .cse20))) [2023-11-29 05:18:50,684 INFO L899 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2023-11-29 05:18:50,684 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 439) no Hoare annotation was computed. [2023-11-29 05:18:50,684 INFO L895 garLoopResultBuilder]: At program point L730(line 730) the Hoare annotation is: (let ((.cse12 (= ~t1_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~t1_i~0 1)) (.cse11 (not (= ~m_pc~0 1))) (.cse5 (<= 2 ~m_st~0)) (.cse6 (<= 2 ~T1_E~0)) (.cse7 (<= 2 ~E_2~0)) (.cse8 (= ~t2_pc~0 1)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~token~0 (+ 2 ~local~0)) .cse9 .cse10) (and .cse0 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse12 .cse7 .cse8 .cse9 .cse10) (and .cse2 .cse3 .cse4 .cse11 .cse5 (<= ~t1_pc~0 0) .cse6 .cse12 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2023-11-29 05:18:50,684 INFO L899 garLoopResultBuilder]: For program point L730-1(line 730) no Hoare annotation was computed. [2023-11-29 05:18:50,684 INFO L899 garLoopResultBuilder]: For program point do_write_p_returnLabel#1(lines 153 201) no Hoare annotation was computed. [2023-11-29 05:18:50,684 INFO L895 garLoopResultBuilder]: At program point L499-1(lines 499 536) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (and .cse0 (= ~c_dr_pc~0 0)) (and .cse0 (= ~c_dr_pc~0 1)) (and (not (= ~c_dr_pc~0 2)) (<= 1 ~p_dw_pc~0)))) [2023-11-29 05:18:50,685 INFO L895 garLoopResultBuilder]: At program point L1127(line 1127) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~T1_E~0 2)) (.cse4 (<= ~t1_pc~0 0)) (.cse5 (= ~t1_st~0 0)) (.cse6 (= ~E_2~0 2)) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~c_dr_pc~0 0)) (.cse9 (= ~E_M~0 2)) (.cse10 (= 0 ~t2_st~0)) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~M_E~0 2)) (.cse13 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~token~0 ~local~0) .cse11 .cse12 .cse13))) [2023-11-29 05:18:50,685 INFO L895 garLoopResultBuilder]: At program point L1127-1(line 1127) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~T1_E~0 2)) (.cse4 (<= ~t1_pc~0 0)) (.cse5 (= ~t1_st~0 0)) (.cse6 (= ~E_2~0 2)) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~c_dr_pc~0 0)) (.cse9 (= ~E_M~0 2)) (.cse10 (= 0 ~t2_st~0)) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~M_E~0 2)) (.cse13 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~token~0 ~local~0) .cse11 .cse12 .cse13))) [2023-11-29 05:18:50,685 INFO L899 garLoopResultBuilder]: For program point L863(line 863) no Hoare annotation was computed. [2023-11-29 05:18:50,685 INFO L899 garLoopResultBuilder]: For program point L632(lines 632 636) no Hoare annotation was computed. [2023-11-29 05:18:50,685 INFO L899 garLoopResultBuilder]: For program point L599(line 599) no Hoare annotation was computed. [2023-11-29 05:18:50,685 INFO L895 garLoopResultBuilder]: At program point L1128(line 1128) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~T1_E~0 2)) (.cse4 (<= ~t1_pc~0 0)) (.cse5 (= ~t1_st~0 0)) (.cse6 (= ~E_2~0 2)) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~c_dr_pc~0 0)) (.cse9 (= ~E_M~0 2)) (.cse10 (= 0 ~t2_st~0)) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~M_E~0 2)) (.cse13 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~token~0 ~local~0) .cse11 .cse12 .cse13))) [2023-11-29 05:18:50,685 INFO L899 garLoopResultBuilder]: For program point L1063-1(lines 1052 1085) no Hoare annotation was computed. [2023-11-29 05:18:50,685 INFO L899 garLoopResultBuilder]: For program point transmit1_returnLabel#1(lines 669 704) no Hoare annotation was computed. [2023-11-29 05:18:50,685 INFO L899 garLoopResultBuilder]: For program point L865(lines 865 869) no Hoare annotation was computed. [2023-11-29 05:18:50,686 INFO L895 garLoopResultBuilder]: At program point L898-1(lines 860 912) the Hoare annotation is: (let ((.cse7 (not (= ~m_pc~0 1))) (.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse13 (= ~token~0 ~local~0)) (.cse15 (<= 2 ~m_st~0)) (.cse12 (= 0 ~t2_st~0)) (.cse14 (<= ~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 (= ~t1_i~0 1)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse11 (= ~c_dr_pc~0 0)) (.cse20 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 (= ~token~0 (+ 2 ~local~0)) .cse10 .cse11 .cse20))) [2023-11-29 05:18:50,686 INFO L899 garLoopResultBuilder]: For program point L865-1(lines 860 912) no Hoare annotation was computed. [2023-11-29 05:18:50,686 INFO L895 garLoopResultBuilder]: At program point L172-1(lines 172 195) the Hoare annotation is: (and (not (= ~c_dr_pc~0 2)) (or (= ~p_dw_pc~0 0) (< 0 ~p_dw_pc~0))) [2023-11-29 05:18:50,686 INFO L899 garLoopResultBuilder]: For program point start_simulation2_returnLabel#1(lines 1117 1175) no Hoare annotation was computed. [2023-11-29 05:18:50,686 INFO L899 garLoopResultBuilder]: For program point L1164(lines 1164 1168) no Hoare annotation was computed. [2023-11-29 05:18:50,686 INFO L899 garLoopResultBuilder]: For program point master_returnLabel#1(lines 625 668) no Hoare annotation was computed. [2023-11-29 05:18:50,686 INFO L895 garLoopResultBuilder]: At program point L471(line 471) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (and .cse0 (= ~c_dr_pc~0 0)) (and .cse0 (= ~c_dr_pc~0 1)) (and (not (= ~c_dr_pc~0 2)) (<= 1 ~p_dw_pc~0)))) [2023-11-29 05:18:50,686 INFO L899 garLoopResultBuilder]: For program point L471-1(line 471) no Hoare annotation was computed. [2023-11-29 05:18:50,686 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 215) no Hoare annotation was computed. [2023-11-29 05:18:50,686 INFO L895 garLoopResultBuilder]: At program point L1132-1(lines 1132 1169) the Hoare annotation is: (let ((.cse7 (not (= ~m_pc~0 1))) (.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse13 (= ~token~0 ~local~0)) (.cse15 (<= 2 ~m_st~0)) (.cse12 (= 0 ~t2_st~0)) (.cse14 (<= ~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 (= ~t1_i~0 1)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse11 (= ~c_dr_pc~0 0)) (.cse20 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 (= ~token~0 (+ 2 ~local~0)) .cse10 .cse11 .cse20))) [2023-11-29 05:18:50,686 INFO L899 garLoopResultBuilder]: For program point L901(lines 901 908) no Hoare annotation was computed. [2023-11-29 05:18:50,687 INFO L899 garLoopResultBuilder]: For program point L901-2(lines 901 908) no Hoare annotation was computed. [2023-11-29 05:18:50,687 INFO L899 garLoopResultBuilder]: For program point start_simulation1_returnLabel#1(lines 484 542) no Hoare annotation was computed. [2023-11-29 05:18:50,687 INFO L899 garLoopResultBuilder]: For program point L373(lines 373 377) no Hoare annotation was computed. [2023-11-29 05:18:50,687 INFO L899 garLoopResultBuilder]: For program point L373-2(lines 372 385) no Hoare annotation was computed. [2023-11-29 05:18:50,687 INFO L899 garLoopResultBuilder]: For program point L473(lines 473 478) no Hoare annotation was computed. [2023-11-29 05:18:50,687 INFO L899 garLoopResultBuilder]: For program point L242(lines 242 254) no Hoare annotation was computed. [2023-11-29 05:18:50,687 INFO L899 garLoopResultBuilder]: For program point L1068-1(lines 1052 1085) no Hoare annotation was computed. [2023-11-29 05:18:50,687 INFO L899 garLoopResultBuilder]: For program point L870-1(lines 860 912) no Hoare annotation was computed. [2023-11-29 05:18:50,687 INFO L899 garLoopResultBuilder]: For program point eval2_returnLabel#1(lines 854 918) no Hoare annotation was computed. [2023-11-29 05:18:50,687 INFO L895 garLoopResultBuilder]: At program point L507(line 507) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (and .cse0 (= ~c_dr_pc~0 0)) (and .cse0 (= ~c_dr_pc~0 1)) (and (not (= ~c_dr_pc~0 2)) (<= 1 ~p_dw_pc~0)))) [2023-11-29 05:18:50,687 INFO L899 garLoopResultBuilder]: For program point L507-1(line 507) no Hoare annotation was computed. [2023-11-29 05:18:50,687 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 249) no Hoare annotation was computed. [2023-11-29 05:18:50,687 INFO L899 garLoopResultBuilder]: For program point L210(lines 210 214) no Hoare annotation was computed. [2023-11-29 05:18:50,687 INFO L899 garLoopResultBuilder]: For program point L673(lines 673 681) no Hoare annotation was computed. [2023-11-29 05:18:50,687 INFO L899 garLoopResultBuilder]: For program point do_read_c_returnLabel#1(lines 203 261) no Hoare annotation was computed. [2023-11-29 05:18:50,687 INFO L899 garLoopResultBuilder]: For program point transmit2_returnLabel#1(lines 705 740) no Hoare annotation was computed. [2023-11-29 05:18:50,687 INFO L895 garLoopResultBuilder]: At program point L443(lines 418 458) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (and .cse0 (= ~c_dr_pc~0 0)) (and .cse0 (= ~c_dr_pc~0 1)) (and (not (= ~c_dr_pc~0 2)) (<= 1 ~p_dw_pc~0)))) [2023-11-29 05:18:50,687 INFO L899 garLoopResultBuilder]: For program point L179(lines 179 187) no Hoare annotation was computed. [2023-11-29 05:18:50,688 INFO L895 garLoopResultBuilder]: At program point L1104(line 1104) the Hoare annotation is: (let ((.cse7 (not (= ~m_pc~0 1))) (.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse13 (= ~token~0 ~local~0)) (.cse15 (<= 2 ~m_st~0)) (.cse12 (= 0 ~t2_st~0)) (.cse14 (<= ~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 (= ~t1_i~0 1)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse11 (= ~c_dr_pc~0 0)) (.cse20 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 (= ~token~0 (+ 2 ~local~0)) .cse10 .cse11 .cse20))) [2023-11-29 05:18:50,688 INFO L899 garLoopResultBuilder]: For program point L1104-1(line 1104) no Hoare annotation was computed. [2023-11-29 05:18:50,688 INFO L899 garLoopResultBuilder]: For program point L873(lines 873 880) no Hoare annotation was computed. [2023-11-29 05:18:50,688 INFO L899 garLoopResultBuilder]: For program point L873-2(lines 873 880) no Hoare annotation was computed. [2023-11-29 05:18:50,688 INFO L899 garLoopResultBuilder]: For program point eval1_returnLabel#1(lines 412 464) no Hoare annotation was computed. [2023-11-29 05:18:50,688 INFO L899 garLoopResultBuilder]: For program point L378-1(lines 369 386) no Hoare annotation was computed. [2023-11-29 05:18:50,688 INFO L899 garLoopResultBuilder]: For program point L709(lines 709 717) no Hoare annotation was computed. [2023-11-29 05:18:50,688 INFO L899 garLoopResultBuilder]: For program point L676(lines 676 680) no Hoare annotation was computed. [2023-11-29 05:18:50,688 INFO L895 garLoopResultBuilder]: At program point L511(line 511) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (and .cse0 (= ~c_dr_pc~0 0)) (and .cse0 (= ~c_dr_pc~0 1)) (and (not (= ~c_dr_pc~0 2)) (<= 1 ~p_dw_pc~0)))) [2023-11-29 05:18:50,688 INFO L895 garLoopResultBuilder]: At program point L511-1(line 511) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (and .cse0 (= ~c_dr_pc~0 0)) (and .cse0 (= ~c_dr_pc~0 1)) (and (not (= ~c_dr_pc~0 2)) (<= 1 ~p_dw_pc~0)))) [2023-11-29 05:18:50,688 INFO L895 garLoopResultBuilder]: At program point L247(line 247) the Hoare annotation is: false [2023-11-29 05:18:50,688 INFO L899 garLoopResultBuilder]: For program point L1106(lines 1106 1111) no Hoare annotation was computed. [2023-11-29 05:18:50,688 INFO L899 garLoopResultBuilder]: For program point L1073-1(lines 1052 1085) no Hoare annotation was computed. [2023-11-29 05:18:50,688 INFO L895 garLoopResultBuilder]: At program point L512(line 512) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (and .cse0 (= ~c_dr_pc~0 0)) (and .cse0 (= ~c_dr_pc~0 1)) (and (not (= ~c_dr_pc~0 2)) (<= 1 ~p_dw_pc~0)))) [2023-11-29 05:18:50,688 INFO L899 garLoopResultBuilder]: For program point L281(lines 281 285) no Hoare annotation was computed. [2023-11-29 05:18:50,688 INFO L899 garLoopResultBuilder]: For program point L281-2(lines 280 293) no Hoare annotation was computed. [2023-11-29 05:18:50,689 INFO L895 garLoopResultBuilder]: At program point L1140(line 1140) the Hoare annotation is: (let ((.cse7 (not (= ~m_pc~0 1))) (.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse13 (= ~token~0 ~local~0)) (.cse15 (<= 2 ~m_st~0)) (.cse12 (= 0 ~t2_st~0)) (.cse14 (<= ~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 (= ~t1_i~0 1)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse11 (= ~c_dr_pc~0 0)) (.cse20 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 (= ~token~0 (+ 2 ~local~0)) .cse10 .cse11 .cse20))) [2023-11-29 05:18:50,689 INFO L899 garLoopResultBuilder]: For program point L1140-1(line 1140) no Hoare annotation was computed. [2023-11-29 05:18:50,689 INFO L899 garLoopResultBuilder]: For program point L810(lines 810 814) no Hoare annotation was computed. [2023-11-29 05:18:50,689 INFO L899 garLoopResultBuilder]: For program point L810-2(lines 809 827) no Hoare annotation was computed. [2023-11-29 05:18:50,689 INFO L895 garLoopResultBuilder]: At program point L513(line 513) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (and .cse0 (= ~c_dr_pc~0 0)) (and .cse0 (= ~c_dr_pc~0 1)) (and (not (= ~c_dr_pc~0 2)) (<= 1 ~p_dw_pc~0)))) [2023-11-29 05:18:50,689 INFO L899 garLoopResultBuilder]: For program point L480(lines 469 482) no Hoare annotation was computed. [2023-11-29 05:18:50,689 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 454) no Hoare annotation was computed. [2023-11-29 05:18:50,689 INFO L899 garLoopResultBuilder]: For program point L712(lines 712 716) no Hoare annotation was computed. [2023-11-29 05:18:50,689 INFO L895 garLoopResultBuilder]: At program point L646(line 646) the Hoare annotation is: (let ((.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= ~t1_pc~0 0)) (.cse6 (= ~t1_st~0 0)) (.cse12 (= ~t2_pc~0 1)) (.cse13 (<= 2 ~t2_st~0)) (.cse14 (= ~t1_pc~0 1)) (.cse15 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~t1_i~0 1)) (.cse3 (<= 2 ~E_M~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse7 (<= 2 ~E_2~0)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= 0 ~t2_st~0)) (.cse16 (= ~token~0 ~local~0)) (.cse11 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse12 .cse8 .cse9 .cse13) (and .cse14 .cse15 .cse0 .cse1 .cse3 .cse5 .cse7 .cse12 .cse8 .cse9 .cse16 .cse13) (and .cse14 .cse15 .cse0 .cse1 .cse3 (not (= ~m_pc~0 1)) .cse5 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11))) [2023-11-29 05:18:50,689 INFO L899 garLoopResultBuilder]: For program point L646-1(line 646) no Hoare annotation was computed. [2023-11-29 05:18:50,689 INFO L899 garLoopResultBuilder]: For program point L516(line 516) no Hoare annotation was computed. [2023-11-29 05:18:50,689 INFO L895 garLoopResultBuilder]: At program point L252(line 252) the Hoare annotation is: false [2023-11-29 05:18:50,690 INFO L895 garLoopResultBuilder]: At program point L252-1(lines 218 255) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (< 0 ~p_dw_pc~0) (and .cse0 (= ~c_dr_pc~0 0)) (and .cse0 (= ~c_dr_pc~0 1)))) [2023-11-29 05:18:50,690 INFO L895 garLoopResultBuilder]: At program point L1144(line 1144) the Hoare annotation is: (let ((.cse7 (not (= ~m_pc~0 1))) (.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse13 (= ~token~0 ~local~0)) (.cse15 (<= 2 ~m_st~0)) (.cse12 (= 0 ~t2_st~0)) (.cse14 (<= ~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 (= ~t1_i~0 1)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse11 (= ~c_dr_pc~0 0)) (.cse20 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 (= ~token~0 (+ 2 ~local~0)) .cse10 .cse11 .cse20))) [2023-11-29 05:18:50,690 INFO L895 garLoopResultBuilder]: At program point L1144-1(line 1144) the Hoare annotation is: (let ((.cse7 (not (= ~m_pc~0 1))) (.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse13 (= ~token~0 ~local~0)) (.cse15 (<= 2 ~m_st~0)) (.cse12 (= 0 ~t2_st~0)) (.cse14 (<= ~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 (= ~t1_i~0 1)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse11 (= ~c_dr_pc~0 0)) (.cse20 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 (= ~token~0 (+ 2 ~local~0)) .cse10 .cse11 .cse20))) [2023-11-29 05:18:50,690 INFO L899 garLoopResultBuilder]: For program point L1078-1(lines 1049 1086) no Hoare annotation was computed. [2023-11-29 05:18:50,690 INFO L899 garLoopResultBuilder]: For program point L286-1(lines 277 294) no Hoare annotation was computed. [2023-11-29 05:18:50,690 INFO L895 garLoopResultBuilder]: At program point L1145(line 1145) the Hoare annotation is: (let ((.cse7 (not (= ~m_pc~0 1))) (.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse13 (= ~token~0 ~local~0)) (.cse15 (<= 2 ~m_st~0)) (.cse12 (= 0 ~t2_st~0)) (.cse14 (<= ~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 (= ~t1_i~0 1)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse11 (= ~c_dr_pc~0 0)) (.cse20 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 (= ~token~0 (+ 2 ~local~0)) .cse10 .cse11 .cse20))) [2023-11-29 05:18:50,690 INFO L899 garLoopResultBuilder]: For program point L815-1(lines 809 827) no Hoare annotation was computed. [2023-11-29 05:18:50,690 INFO L899 garLoopResultBuilder]: For program point L518(lines 518 527) no Hoare annotation was computed. [2023-11-29 05:18:50,690 INFO L899 garLoopResultBuilder]: For program point L518-2(lines 518 527) no Hoare annotation was computed. [2023-11-29 05:18:50,690 INFO L895 garLoopResultBuilder]: At program point L419(line 419) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (and .cse0 (= ~c_dr_pc~0 0)) (and .cse0 (= ~c_dr_pc~0 1)) (and (not (= ~c_dr_pc~0 2)) (<= 1 ~p_dw_pc~0)))) [2023-11-29 05:18:50,691 INFO L895 garLoopResultBuilder]: At program point L1146(line 1146) the Hoare annotation is: (let ((.cse7 (not (= ~m_pc~0 1))) (.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse13 (= ~token~0 ~local~0)) (.cse15 (<= 2 ~m_st~0)) (.cse12 (= 0 ~t2_st~0)) (.cse14 (<= ~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 (= ~t1_i~0 1)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse11 (= ~c_dr_pc~0 0)) (.cse20 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 (= ~token~0 (+ 2 ~local~0)) .cse10 .cse11 .cse20))) [2023-11-29 05:18:50,691 INFO L899 garLoopResultBuilder]: For program point L1113(lines 1102 1115) no Hoare annotation was computed. [2023-11-29 05:18:50,691 INFO L895 garLoopResultBuilder]: At program point L684-1(lines 684 697) the Hoare annotation is: (let ((.cse4 (= ~m_st~0 0)) (.cse11 (= ~token~0 ~local~0)) (.cse15 (<= ~t2_pc~0 0)) (.cse5 (not (= ~m_pc~0 1))) (.cse14 (= 0 ~t2_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (<= 2 ~E_M~0)) (.cse13 (<= 2 ~m_st~0)) (.cse6 (<= 2 ~T1_E~0)) (.cse7 (<= 2 ~E_2~0)) (.cse8 (= ~t2_pc~0 1)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse6 .cse7 .cse9 .cse10 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse13 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14) (and .cse0 .cse1 .cse2 (= (+ ~local~0 1) ~token~0) .cse3 .cse13 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12))) [2023-11-29 05:18:50,691 INFO L899 garLoopResultBuilder]: For program point L421(line 421) no Hoare annotation was computed. [2023-11-29 05:18:50,691 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 05:18:50,691 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 169) no Hoare annotation was computed. [2023-11-29 05:18:50,691 INFO L899 garLoopResultBuilder]: For program point L884-1(lines 860 912) no Hoare annotation was computed. [2023-11-29 05:18:50,691 INFO L899 garLoopResultBuilder]: For program point L1149(line 1149) no Hoare annotation was computed. [2023-11-29 05:18:50,691 INFO L895 garLoopResultBuilder]: At program point L720-1(lines 720 733) the Hoare annotation is: (let ((.cse13 (<= ~t1_pc~0 0)) (.cse11 (= ~token~0 ~local~0)) (.cse15 (not (= ~m_pc~0 1))) (.cse5 (<= 2 ~m_st~0)) (.cse7 (= ~t1_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse12 (<= 2 ~t1_st~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse14 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse8 (<= 2 ~E_2~0)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse4 .cse14 .cse15 .cse6 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse3 (= ~m_pc~0 ~t1_pc~0) .cse4 .cse14 .cse13 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse4 .cse14 .cse6 .cse8 (= ~token~0 (+ 2 ~local~0)) .cse9 .cse10))) [2023-11-29 05:18:50,691 INFO L895 garLoopResultBuilder]: At program point L654-1(lines 640 661) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (<= ~t1_pc~0 0)) (.cse7 (= ~t1_st~0 0)) (.cse15 (= ~t2_pc~0 1)) (.cse16 (<= 2 ~t2_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse17 (not (= ~m_pc~0 1))) (.cse6 (<= 2 ~T1_E~0)) (.cse8 (<= 2 ~E_2~0)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= 0 ~t2_st~0)) (.cse18 (= ~token~0 ~local~0)) (.cse12 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse0 .cse1 .cse2 .cse4 .cse6 .cse8 .cse15 (= ~token~0 (+ 2 ~local~0)) .cse9 .cse10 .cse16) (and .cse13 .cse14 .cse0 .cse1 .cse2 .cse4 .cse17 .cse6 .cse8 .cse15 .cse9 .cse10 .cse18 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse10 .cse16) (and .cse13 .cse14 .cse0 .cse1 .cse2 .cse4 .cse17 .cse6 .cse8 .cse9 .cse10 .cse11 .cse18 .cse12))) [2023-11-29 05:18:50,691 INFO L895 garLoopResultBuilder]: At program point L522(line 522) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (and .cse0 (= ~c_dr_pc~0 0)) (and .cse0 (= ~c_dr_pc~0 1)) (and (not (= ~c_dr_pc~0 2)) (<= 1 ~p_dw_pc~0)))) [2023-11-29 05:18:50,691 INFO L899 garLoopResultBuilder]: For program point L522-1(line 522) no Hoare annotation was computed. [2023-11-29 05:18:50,691 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2023-11-29 05:18:50,691 INFO L899 garLoopResultBuilder]: For program point L423-1(lines 418 458) no Hoare annotation was computed. [2023-11-29 05:18:50,692 INFO L899 garLoopResultBuilder]: For program point L357(lines 357 364) no Hoare annotation was computed. [2023-11-29 05:18:50,692 INFO L899 garLoopResultBuilder]: For program point L357-2(lines 353 368) no Hoare annotation was computed. [2023-11-29 05:18:50,692 INFO L899 garLoopResultBuilder]: For program point L820-1(lines 806 828) no Hoare annotation was computed. [2023-11-29 05:18:50,692 INFO L899 garLoopResultBuilder]: For program point $Ultimate##38(lines 179 187) no Hoare annotation was computed. [2023-11-29 05:18:50,692 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 168) no Hoare annotation was computed. [2023-11-29 05:18:50,692 INFO L899 garLoopResultBuilder]: For program point L1151(lines 1151 1160) no Hoare annotation was computed. [2023-11-29 05:18:50,692 INFO L899 garLoopResultBuilder]: For program point L1151-2(lines 1151 1160) no Hoare annotation was computed. [2023-11-29 05:18:50,692 INFO L899 garLoopResultBuilder]: For program point L887(lines 887 894) no Hoare annotation was computed. [2023-11-29 05:18:50,692 INFO L899 garLoopResultBuilder]: For program point L887-2(lines 887 894) no Hoare annotation was computed. [2023-11-29 05:18:50,692 INFO L899 garLoopResultBuilder]: For program point L1053(lines 1053 1057) no Hoare annotation was computed. [2023-11-29 05:18:50,692 INFO L899 garLoopResultBuilder]: For program point L1053-2(lines 1052 1085) no Hoare annotation was computed. [2023-11-29 05:18:50,692 INFO L895 garLoopResultBuilder]: At program point L492(line 492) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0)) [2023-11-29 05:18:50,692 INFO L899 garLoopResultBuilder]: For program point L492-1(line 492) no Hoare annotation was computed. [2023-11-29 05:18:50,692 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 05:18:50,692 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 167) no Hoare annotation was computed. [2023-11-29 05:18:50,692 INFO L895 garLoopResultBuilder]: At program point L494(line 494) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~c_dr_pc~0 0)) [2023-11-29 05:18:50,692 INFO L895 garLoopResultBuilder]: At program point L494-1(line 494) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~c_dr_pc~0 0)) [2023-11-29 05:18:50,692 INFO L899 garLoopResultBuilder]: For program point L428(lines 418 458) no Hoare annotation was computed. [2023-11-29 05:18:50,692 INFO L899 garLoopResultBuilder]: For program point L1188(lines 1188 1194) no Hoare annotation was computed. [2023-11-29 05:18:50,693 INFO L895 garLoopResultBuilder]: At program point L1155(line 1155) the Hoare annotation is: (let ((.cse7 (not (= ~m_pc~0 1))) (.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse13 (= ~token~0 ~local~0)) (.cse15 (<= 2 ~m_st~0)) (.cse12 (= 0 ~t2_st~0)) (.cse14 (<= ~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 (= ~t1_i~0 1)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse11 (= ~c_dr_pc~0 0)) (.cse20 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse18 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse8 .cse19 .cse9 .cse16 .cse10 .cse11 .cse13 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 (= ~token~0 (+ 2 ~local~0)) .cse10 .cse11 .cse20))) [2023-11-29 05:18:50,693 INFO L899 garLoopResultBuilder]: For program point L1155-1(line 1155) no Hoare annotation was computed. [2023-11-29 05:18:50,693 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 599) no Hoare annotation was computed. [2023-11-29 05:18:50,693 INFO L895 garLoopResultBuilder]: At program point L495(line 495) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~c_dr_pc~0 0)) [2023-11-29 05:18:50,693 INFO L895 garLoopResultBuilder]: At program point L694(line 694) the Hoare annotation is: (let ((.cse10 (<= 2 ~t2_st~0)) (.cse11 (not (= ~m_pc~0 1))) (.cse7 (= ~t2_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (<= 2 ~T1_E~0)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse12 (= 0 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= (+ ~local~0 1) ~token~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse12 (<= ~t2_pc~0 0)))) [2023-11-29 05:18:50,693 INFO L899 garLoopResultBuilder]: For program point L694-1(line 694) no Hoare annotation was computed. [2023-11-29 05:18:50,693 INFO L899 garLoopResultBuilder]: For program point L1190(lines 1190 1193) no Hoare annotation was computed. [2023-11-29 05:18:50,693 INFO L899 garLoopResultBuilder]: For program point L1058-1(lines 1052 1085) no Hoare annotation was computed. [2023-11-29 05:18:50,693 INFO L899 garLoopResultBuilder]: For program point $Ultimate##118(lines 654 660) no Hoare annotation was computed. [2023-11-29 05:18:50,693 INFO L899 garLoopResultBuilder]: For program point L629(lines 629 637) no Hoare annotation was computed. [2023-11-29 05:18:50,693 INFO L895 garLoopResultBuilder]: At program point L1125(line 1125) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~t1_i~0 1) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~m_st~0 0) (<= ~t1_pc~0 0) (= ~t1_st~0 0) (= ~E_2~0 2) (= ~t2_i~0 1) (= ~c_dr_pc~0 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 05:18:50,693 INFO L899 garLoopResultBuilder]: For program point L1125-1(line 1125) no Hoare annotation was computed. [2023-11-29 05:18:50,693 INFO L899 garLoopResultBuilder]: For program point L95(lines 73 97) no Hoare annotation was computed. [2023-11-29 05:18:50,693 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2023-11-29 05:18:50,693 INFO L899 garLoopResultBuilder]: For program point L84-1(lines 84 93) no Hoare annotation was computed. [2023-11-29 05:18:50,693 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 70 98) no Hoare annotation was computed. [2023-11-29 05:18:50,693 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 80) no Hoare annotation was computed. [2023-11-29 05:18:50,694 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 83) no Hoare annotation was computed. [2023-11-29 05:18:50,694 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 70 98) the Hoare annotation is: true [2023-11-29 05:18:50,694 INFO L899 garLoopResultBuilder]: For program point L74-2(lines 73 97) no Hoare annotation was computed. [2023-11-29 05:18:50,694 INFO L899 garLoopResultBuilder]: For program point L311(lines 298 313) no Hoare annotation was computed. [2023-11-29 05:18:50,694 INFO L899 garLoopResultBuilder]: For program point L303(lines 303 308) no Hoare annotation was computed. [2023-11-29 05:18:50,694 INFO L899 garLoopResultBuilder]: For program point L299(lines 299 309) no Hoare annotation was computed. [2023-11-29 05:18:50,694 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 295 314) the Hoare annotation is: true [2023-11-29 05:18:50,694 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 295 314) no Hoare annotation was computed. [2023-11-29 05:18:50,694 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 23 30) the Hoare annotation is: true [2023-11-29 05:18:50,694 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2023-11-29 05:18:50,694 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2023-11-29 05:18:50,694 INFO L899 garLoopResultBuilder]: For program point L833(lines 833 848) no Hoare annotation was computed. [2023-11-29 05:18:50,694 INFO L899 garLoopResultBuilder]: For program point L850(lines 832 852) no Hoare annotation was computed. [2023-11-29 05:18:50,694 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 829 853) the Hoare annotation is: true [2023-11-29 05:18:50,694 INFO L899 garLoopResultBuilder]: For program point L841(lines 841 846) no Hoare annotation was computed. [2023-11-29 05:18:50,694 INFO L899 garLoopResultBuilder]: For program point L837(lines 837 847) no Hoare annotation was computed. [2023-11-29 05:18:50,695 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 829 853) no Hoare annotation was computed. [2023-11-29 05:18:50,695 INFO L899 garLoopResultBuilder]: For program point L337-1(lines 336 349) no Hoare annotation was computed. [2023-11-29 05:18:50,695 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 333 350) the Hoare annotation is: (let ((.cse0 (not (= ~p_dw_pc~0 0))) (.cse1 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)))) (and (or .cse0 .cse1 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (or (= ~c_dr_pc~0 2) .cse1 (< ~p_dw_pc~0 1)) (or .cse0 .cse1 (not (= ~c_dr_pc~0 1))))) [2023-11-29 05:18:50,695 INFO L899 garLoopResultBuilder]: For program point L342-1(lines 333 350) no Hoare annotation was computed. [2023-11-29 05:18:50,695 INFO L899 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 333 350) no Hoare annotation was computed. [2023-11-29 05:18:50,695 INFO L899 garLoopResultBuilder]: For program point L981-1(lines 960 993) no Hoare annotation was computed. [2023-11-29 05:18:50,695 INFO L899 garLoopResultBuilder]: For program point L971-1(lines 960 993) no Hoare annotation was computed. [2023-11-29 05:18:50,696 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 957 994) the Hoare annotation is: (let ((.cse11 (< ~t2_st~0 2)) (.cse17 (= ~m_pc~0 1)) (.cse21 (and (<= 1 ~m_pc~0) (or (< ~m_pc~0 2) (< 1 ~t1_pc~0)))) (.cse22 (not (= ~m_pc~0 ~t1_pc~0))) (.cse16 (not (= ~m_st~0 0))) (.cse19 (not (= ~token~0 ~local~0))) (.cse0 (< 0 ~t1_pc~0)) (.cse20 (< 0 ~t2_pc~0)) (.cse9 (not (= ~t1_st~0 0))) (.cse14 (< ~t1_st~0 2)) (.cse1 (not (= ~t2_i~0 1))) (.cse2 (< ~m_st~0 2)) (.cse15 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~t1_i~0 1))) (.cse4 (not (= ~p_dw_pc~0 0))) (.cse5 (< |old(~E_1~0)| 2)) (.cse6 (< |old(~E_M~0)| 2)) (.cse18 (not (= 0 ~t2_st~0))) (.cse7 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse8 (< |old(~E_2~0)| 2)) (.cse10 (not (= ~t2_pc~0 1))) (.cse12 (< |old(~T1_E~0)| 2)) (.cse13 (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)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse14 .cse1 (not (= ~token~0 (+ 2 ~local~0))) .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13) (or .cse1 .cse2 .cse15 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13) (or .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse19) (or .cse14 .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13) (or .cse14 .cse1 .cse15 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse19) (or .cse14 .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse20 .cse18 .cse7 .cse8 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13) (or .cse1 .cse2 .cse15 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse14 .cse1 .cse15 .cse3 .cse21 .cse4 .cse5 .cse6 .cse20 .cse18 .cse7 .cse16 .cse8 .cse12 .cse13 .cse19) (or .cse22 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse19) (or .cse14 .cse1 .cse2 .cse15 .cse3 .cse4 .cse17 .cse5 .cse6 .cse18 .cse7 .cse8 .cse10 .cse12 .cse13) (or .cse1 .cse2 .cse15 .cse3 .cse21 .cse4 .cse5 .cse6 .cse20 .cse18 .cse7 .cse8 .cse9 .cse12 .cse13) (or .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse20 .cse18 .cse7 .cse8 .cse9 .cse12 .cse13 .cse19) (or .cse22 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse20 .cse18 .cse7 .cse16 .cse8 .cse9 .cse12 .cse13 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse18 .cse7 .cse8 .cse9 .cse12 .cse13) (or .cse14 .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse10 (not (= (+ ~local~0 1) ~token~0)) .cse12 .cse13))) [2023-11-29 05:18:50,696 INFO L899 garLoopResultBuilder]: For program point L961-1(lines 960 993) no Hoare annotation was computed. [2023-11-29 05:18:50,696 INFO L899 garLoopResultBuilder]: For program point L986-1(lines 957 994) no Hoare annotation was computed. [2023-11-29 05:18:50,696 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 957 994) no Hoare annotation was computed. [2023-11-29 05:18:50,696 INFO L899 garLoopResultBuilder]: For program point L976-1(lines 960 993) no Hoare annotation was computed. [2023-11-29 05:18:50,696 INFO L899 garLoopResultBuilder]: For program point L966-1(lines 960 993) no Hoare annotation was computed. [2023-11-29 05:18:50,699 INFO L445 BasicCegarLoop]: Path program 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] [2023-11-29 05:18:50,700 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:18:50,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:18:50 BoogieIcfgContainer [2023-11-29 05:18:50,741 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:18:50,742 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:18:50,742 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:18:50,742 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:18:50,743 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:15:51" (3/4) ... [2023-11-29 05:18:50,745 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 05:18:50,749 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2023-11-29 05:18:50,749 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2023-11-29 05:18:50,749 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2023-11-29 05:18:50,749 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2023-11-29 05:18:50,750 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2023-11-29 05:18:50,750 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2023-11-29 05:18:50,750 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2023-11-29 05:18:50,750 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2023-11-29 05:18:50,750 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2023-11-29 05:18:50,751 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2023-11-29 05:18:50,751 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2023-11-29 05:18:50,751 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2023-11-29 05:18:50,751 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2023-11-29 05:18:50,751 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2023-11-29 05:18:50,766 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2023-11-29 05:18:50,767 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2023-11-29 05:18:50,768 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 05:18:50,770 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 05:18:50,962 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 05:18:50,962 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 05:18:50,962 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:18:50,963 INFO L158 Benchmark]: Toolchain (without parser) took 180844.13ms. Allocated memory was 151.0MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 111.2MB in the beginning and 3.5GB in the end (delta: -3.3GB). Peak memory consumption was 3.7GB. Max. memory is 16.1GB. [2023-11-29 05:18:50,963 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 79.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:18:50,964 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.14ms. Allocated memory is still 151.0MB. Free memory was 111.2MB in the beginning and 115.8MB in the end (delta: -4.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 05:18:50,964 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.75ms. Allocated memory is still 151.0MB. Free memory was 115.8MB in the beginning and 112.3MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:18:50,964 INFO L158 Benchmark]: Boogie Preprocessor took 64.37ms. Allocated memory is still 151.0MB. Free memory was 112.3MB in the beginning and 108.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:18:50,964 INFO L158 Benchmark]: RCFGBuilder took 688.84ms. Allocated memory is still 151.0MB. Free memory was 108.8MB in the beginning and 71.0MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2023-11-29 05:18:50,965 INFO L158 Benchmark]: TraceAbstraction took 179437.17ms. Allocated memory was 151.0MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 70.4MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 6.2GB. Max. memory is 16.1GB. [2023-11-29 05:18:50,965 INFO L158 Benchmark]: Witness Printer took 220.82ms. Allocated memory is still 7.2GB. Free memory was 3.5GB in the beginning and 3.5GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 05:18:50,967 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.17ms. Allocated memory is still 109.1MB. Free memory is still 79.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 377.14ms. Allocated memory is still 151.0MB. Free memory was 111.2MB in the beginning and 115.8MB in the end (delta: -4.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.75ms. Allocated memory is still 151.0MB. Free memory was 115.8MB in the beginning and 112.3MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.37ms. Allocated memory is still 151.0MB. Free memory was 112.3MB in the beginning and 108.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 688.84ms. Allocated memory is still 151.0MB. Free memory was 108.8MB in the beginning and 71.0MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 179437.17ms. Allocated memory was 151.0MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 70.4MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 6.2GB. Max. memory is 16.1GB. * Witness Printer took 220.82ms. Allocated memory is still 7.2GB. Free memory was 3.5GB in the beginning and 3.5GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 599]: 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: 27]: 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, 222 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 179.3s, OverallIterations: 31, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.6s, AutomataDifference: 54.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 69.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9989 SdHoareTripleChecker+Valid, 10.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9749 mSDsluCounter, 15173 SdHoareTripleChecker+Invalid, 8.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9518 mSDsCounter, 1490 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13120 IncrementalHoareTripleChecker+Invalid, 14610 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1490 mSolverCounterUnsat, 5655 mSDtfsCounter, 13120 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3323 GetRequests, 3038 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62381occurred in iteration=18, InterpolantAutomatonStates: 248, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 43.5s AutomataMinimizationTime, 31 MinimizatonAttempts, 49571 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 54 LocationsWithAnnotation, 45231 PreInvPairs, 46187 NumberOfFragments, 13642 HoareAnnotationTreeSize, 45231 FomulaSimplifications, 231057 FormulaSimplificationTreeSizeReduction, 35.0s HoareSimplificationTime, 54 FomulaSimplificationsInter, 232471 FormulaSimplificationTreeSizeReductionInter, 34.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 5963 NumberOfCodeBlocks, 5963 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 5915 ConstructedInterpolants, 0 QuantifiedInterpolants, 10002 SizeOfPredicates, 3 NumberOfNonLiveVariables, 8896 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 48 InterpolantComputations, 31 PerfectInterpolantSequences, 2766/3189 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: 640]: Loop Invariant Derived loop invariant: (((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 <= E_M)) && (t1_pc <= 0)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (t2_pc <= 0)) || (((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (token == (2 + local))) && (t2_i == 1)) && (c_dr_pc == 0)) && (2 <= t2_st))) || ((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && !((m_pc == 1))) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (2 <= t2_st))) || (((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 <= E_M)) && (t1_pc <= 0)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (2 <= t2_st))) || ((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && !((m_pc == 1))) && (2 <= T1_E)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) - InvariantResult [Line: 499]: Loop Invariant Derived loop invariant: ((((p_dw_pc == 0) && (c_dr_pc == 0)) || ((p_dw_pc == 0) && (c_dr_pc == 1))) || (!((c_dr_pc == 2)) && (1 <= p_dw_pc))) - InvariantResult [Line: 720]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) || (((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0))) || (((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0))) || (((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (2 <= T1_E)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local))) || (((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && !((m_pc == 1))) && (2 <= m_st)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0))) || ((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (m_st == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (token == (2 + local))) && (t2_i == 1)) && (c_dr_pc == 0))) - InvariantResult [Line: 1132]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (2 <= T1_E)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0)) || ((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && !((m_pc == 1))) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st))) || (((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) || ((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && ((local + 1) == token)) && (2 <= E_M)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st))) || (((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (2 <= t2_st))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (2 <= t2_st))) || ((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && !((m_pc == 1))) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st))) || (((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (2 <= t2_st))) || (((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (2 <= t2_st))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && !((m_pc == 1))) && (2 <= m_st)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (2 <= t2_st))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) || (((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (t2_pc <= 0))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && !((m_pc == 1))) && (2 <= m_st)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && !((m_pc == 1))) && (2 <= m_st)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (t2_pc <= 0))) || (((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (2 <= t2_st))) || (((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (t2_pc <= 0))) || ((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (m_st == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (token == (2 + local))) && (t2_i == 1)) && (c_dr_pc == 0)) && (2 <= t2_st))) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (!((c_dr_pc == 2)) && ((p_dw_pc == 0) || (0 < p_dw_pc))) - InvariantResult [Line: 860]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (2 <= T1_E)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0)) || ((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && !((m_pc == 1))) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st))) || (((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) || ((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && ((local + 1) == token)) && (2 <= E_M)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st))) || (((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (2 <= t2_st))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (2 <= t2_st))) || ((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && !((m_pc == 1))) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st))) || (((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (2 <= t2_st))) || (((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (2 <= t2_st))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && !((m_pc == 1))) && (2 <= m_st)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (2 <= t2_st))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) || (((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (t2_pc <= 0))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && !((m_pc == 1))) && (2 <= m_st)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && !((m_pc == 1))) && (2 <= m_st)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (t2_pc <= 0))) || (((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (2 <= t2_st))) || (((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (t2_pc <= 0))) || ((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (m_st == 0)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (token == (2 + local))) && (t2_i == 1)) && (c_dr_pc == 0)) && (2 <= t2_st))) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: ((((p_dw_pc == 0) && (c_dr_pc == 0)) || ((p_dw_pc == 0) && (c_dr_pc == 1))) || (!((c_dr_pc == 2)) && (1 <= p_dw_pc))) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: (((0 < p_dw_pc) || ((p_dw_pc == 0) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 1))) - InvariantResult [Line: 684]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (2 <= t2_st)) || (((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (t2_pc <= 0))) || (((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (2 <= T1_E)) && (2 <= E_2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)) && (token == local)) && (t2_pc <= 0))) || ((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && !((m_pc == 1))) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st))) || ((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && ((local + 1) == token)) && (2 <= E_M)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st))) || (((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= m_st)) && (2 <= T1_E)) && (2 <= E_2)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (2 <= t2_st))) RESULT: Ultimate proved your program to be correct! [2023-11-29 05:18:50,985 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fd4a731-a6d0-4d44-a407-9c9a1ef1a63e/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