./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/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_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/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_b63b3f13-3e29-481d-bd95-7415e0b8018f/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 4ea93d7c6d06d46004840cc5fcb436c7c307334e6ee754b8ee507b78f644445d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:56:03,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:56:03,249 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 05:56:03,253 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:56:03,254 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:56:03,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:56:03,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:56:03,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:56:03,278 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:56:03,279 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:56:03,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:56:03,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:56:03,281 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:56:03,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:56:03,282 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:56:03,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:56:03,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:56:03,283 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:56:03,284 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:56:03,284 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:56:03,285 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:56:03,288 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:56:03,288 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:56:03,289 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:56:03,289 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:56:03,290 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:56:03,290 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:56:03,290 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:56:03,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:56:03,291 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:56:03,291 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:56:03,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:56:03,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:56:03,292 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:56:03,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:56:03,293 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:56:03,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:56:03,293 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:56:03,293 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:56:03,293 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:56:03,294 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:56:03,294 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:56:03,294 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_b63b3f13-3e29-481d-bd95-7415e0b8018f/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_b63b3f13-3e29-481d-bd95-7415e0b8018f/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 -> 4ea93d7c6d06d46004840cc5fcb436c7c307334e6ee754b8ee507b78f644445d [2023-11-29 05:56:03,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:56:03,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:56:03,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:56:03,534 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:56:03,534 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:56:03,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c [2023-11-29 05:56:06,251 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:56:06,458 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:56:06,459 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c [2023-11-29 05:56:06,473 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/data/0fe85f3bd/eb792792b9594c139a520bcd372eb1cf/FLAG93ed4645f [2023-11-29 05:56:06,486 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/data/0fe85f3bd/eb792792b9594c139a520bcd372eb1cf [2023-11-29 05:56:06,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:56:06,491 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:56:06,492 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:56:06,492 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:56:06,497 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:56:06,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:56:06" (1/1) ... [2023-11-29 05:56:06,499 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46000dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:56:06, skipping insertion in model container [2023-11-29 05:56:06,499 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:56:06" (1/1) ... [2023-11-29 05:56:06,545 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:56:06,692 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_b63b3f13-3e29-481d-bd95-7415e0b8018f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[914,927] [2023-11-29 05:56:06,745 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_b63b3f13-3e29-481d-bd95-7415e0b8018f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[7115,7128] [2023-11-29 05:56:06,782 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:56:06,794 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:56:06,806 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_b63b3f13-3e29-481d-bd95-7415e0b8018f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[914,927] [2023-11-29 05:56:06,828 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_b63b3f13-3e29-481d-bd95-7415e0b8018f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[7115,7128] [2023-11-29 05:56:06,851 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:56:06,873 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:56:06,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:56:06 WrapperNode [2023-11-29 05:56:06,874 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:56:06,875 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:56:06,875 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:56:06,875 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:56:06,883 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:56:06" (1/1) ... [2023-11-29 05:56:06,894 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:56:06" (1/1) ... [2023-11-29 05:56:06,934 INFO L138 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 476 [2023-11-29 05:56:06,934 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:56:06,935 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:56:06,935 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:56:06,935 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:56:06,945 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:56:06" (1/1) ... [2023-11-29 05:56:06,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:56:06" (1/1) ... [2023-11-29 05:56:06,949 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:56:06" (1/1) ... [2023-11-29 05:56:06,966 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:56:06,966 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:56:06" (1/1) ... [2023-11-29 05:56:06,966 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:56:06" (1/1) ... [2023-11-29 05:56:06,977 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:56:06" (1/1) ... [2023-11-29 05:56:06,984 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:56:06" (1/1) ... [2023-11-29 05:56:06,986 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:56:06" (1/1) ... [2023-11-29 05:56:06,989 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:56:06" (1/1) ... [2023-11-29 05:56:06,992 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:56:06,992 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:56:06,993 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:56:06,993 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:56:06,994 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:56:06" (1/1) ... [2023-11-29 05:56:07,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:56:07,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:07,025 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/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:56:07,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/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:56:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:56:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-11-29 05:56:07,053 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-11-29 05:56:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-11-29 05:56:07,053 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-11-29 05:56:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-11-29 05:56:07,053 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-11-29 05:56:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-11-29 05:56:07,053 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-11-29 05:56:07,054 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2023-11-29 05:56:07,054 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2023-11-29 05:56:07,054 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-11-29 05:56:07,054 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-11-29 05:56:07,054 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-11-29 05:56:07,054 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-11-29 05:56:07,054 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2023-11-29 05:56:07,055 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2023-11-29 05:56:07,055 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-11-29 05:56:07,055 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-11-29 05:56:07,055 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2023-11-29 05:56:07,055 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2023-11-29 05:56:07,055 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-11-29 05:56:07,055 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-11-29 05:56:07,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:56:07,056 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-11-29 05:56:07,056 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-11-29 05:56:07,056 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2023-11-29 05:56:07,056 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2023-11-29 05:56:07,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:56:07,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:56:07,056 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-11-29 05:56:07,057 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-11-29 05:56:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2023-11-29 05:56:07,057 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2023-11-29 05:56:07,140 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:56:07,142 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:56:07,564 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:56:07,611 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:56:07,612 INFO L309 CfgBuilder]: Removed 9 assume(true) statements. [2023-11-29 05:56:07,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:56:07 BoogieIcfgContainer [2023-11-29 05:56:07,612 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:56:07,614 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:56:07,615 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:56:07,618 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:56:07,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:56:06" (1/3) ... [2023-11-29 05:56:07,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@817319c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:56:07, skipping insertion in model container [2023-11-29 05:56:07,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:56:06" (2/3) ... [2023-11-29 05:56:07,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@817319c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:56:07, skipping insertion in model container [2023-11-29 05:56:07,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:56:07" (3/3) ... [2023-11-29 05:56:07,621 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.02.cil-2.c [2023-11-29 05:56:07,641 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:56:07,641 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-29 05:56:07,701 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:56:07,708 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;@5eba22cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:56:07,708 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-29 05:56:07,713 INFO L276 IsEmpty]: Start isEmpty. Operand has 217 states, 167 states have (on average 1.6467065868263473) internal successors, (275), 175 states have internal predecessors, (275), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 05:56:07,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 05:56:07,727 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:56:07,727 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:56:07,728 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:56:07,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:07,733 INFO L85 PathProgramCache]: Analyzing trace with hash 2083918704, now seen corresponding path program 1 times [2023-11-29 05:56:07,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:07,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500469384] [2023-11-29 05:56:07,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:07,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:08,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:56:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:08,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:56:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:08,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:56:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:08,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:56:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:08,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 05:56:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:08,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:56:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:08,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:56:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:08,173 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:56:08,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:08,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500469384] [2023-11-29 05:56:08,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500469384] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:56:08,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:56:08,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:56:08,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419150387] [2023-11-29 05:56:08,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:56:08,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:56:08,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:08,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:56:08,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:56:08,232 INFO L87 Difference]: Start difference. First operand has 217 states, 167 states have (on average 1.6467065868263473) internal successors, (275), 175 states have internal predecessors, (275), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 05:56:09,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:09,101 INFO L93 Difference]: Finished difference Result 437 states and 682 transitions. [2023-11-29 05:56:09,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:56:09,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2023-11-29 05:56:09,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:56:09,118 INFO L225 Difference]: With dead ends: 437 [2023-11-29 05:56:09,118 INFO L226 Difference]: Without dead ends: 228 [2023-11-29 05:56:09,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:56:09,126 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 328 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:56:09,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 640 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 05:56:09,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-11-29 05:56:09,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 211. [2023-11-29 05:56:09,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 164 states have (on average 1.5182926829268293) internal successors, (249), 169 states have internal predecessors, (249), 32 states have call successors, (32), 15 states have call predecessors, (32), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-29 05:56:09,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 309 transitions. [2023-11-29 05:56:09,200 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 309 transitions. Word has length 58 [2023-11-29 05:56:09,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:56:09,200 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 309 transitions. [2023-11-29 05:56:09,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 05:56:09,201 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 309 transitions. [2023-11-29 05:56:09,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 05:56:09,205 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:56:09,205 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:56:09,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:56:09,206 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:56:09,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:09,206 INFO L85 PathProgramCache]: Analyzing trace with hash -182462482, now seen corresponding path program 1 times [2023-11-29 05:56:09,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:09,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573202861] [2023-11-29 05:56:09,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:09,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:09,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:56:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:09,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:56:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:09,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:56:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:09,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:56:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:09,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 05:56:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:09,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:56:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:09,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:56:09,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:09,457 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:56:09,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:09,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573202861] [2023-11-29 05:56:09,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573202861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:56:09,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:56:09,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:56:09,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031881680] [2023-11-29 05:56:09,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:56:09,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:56:09,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:09,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:56:09,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:56:09,463 INFO L87 Difference]: Start difference. First operand 211 states and 309 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 05:56:10,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:10,506 INFO L93 Difference]: Finished difference Result 417 states and 606 transitions. [2023-11-29 05:56:10,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 05:56:10,507 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2023-11-29 05:56:10,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:56:10,513 INFO L225 Difference]: With dead ends: 417 [2023-11-29 05:56:10,513 INFO L226 Difference]: Without dead ends: 336 [2023-11-29 05:56:10,515 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:56:10,516 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 433 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:56:10,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 938 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 05:56:10,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2023-11-29 05:56:10,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 299. [2023-11-29 05:56:10,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 232 states have (on average 1.4870689655172413) internal successors, (345), 239 states have internal predecessors, (345), 43 states have call successors, (43), 22 states have call predecessors, (43), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2023-11-29 05:56:10,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 432 transitions. [2023-11-29 05:56:10,569 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 432 transitions. Word has length 58 [2023-11-29 05:56:10,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:56:10,570 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 432 transitions. [2023-11-29 05:56:10,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 05:56:10,570 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 432 transitions. [2023-11-29 05:56:10,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 05:56:10,573 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:56:10,574 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:56:10,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:56:10,574 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:56:10,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:10,575 INFO L85 PathProgramCache]: Analyzing trace with hash -316696146, now seen corresponding path program 1 times [2023-11-29 05:56:10,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:10,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575257376] [2023-11-29 05:56:10,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:10,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:10,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:56:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:10,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:56:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:10,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:56:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:10,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:56:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:10,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 05:56:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:10,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:56:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:10,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:56:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:10,752 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:56:10,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:10,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575257376] [2023-11-29 05:56:10,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575257376] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:56:10,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:56:10,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:56:10,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633931231] [2023-11-29 05:56:10,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:56:10,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:56:10,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:10,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:56:10,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:56:10,755 INFO L87 Difference]: Start difference. First operand 299 states and 432 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:56:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:11,617 INFO L93 Difference]: Finished difference Result 495 states and 708 transitions. [2023-11-29 05:56:11,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:56:11,618 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:56:11,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:56:11,621 INFO L225 Difference]: With dead ends: 495 [2023-11-29 05:56:11,621 INFO L226 Difference]: Without dead ends: 333 [2023-11-29 05:56:11,623 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:56:11,624 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 240 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:56:11,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 1147 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 05:56:11,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2023-11-29 05:56:11,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 303. [2023-11-29 05:56:11,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 235 states have (on average 1.476595744680851) internal successors, (347), 242 states have internal predecessors, (347), 43 states have call successors, (43), 22 states have call predecessors, (43), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2023-11-29 05:56:11,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 435 transitions. [2023-11-29 05:56:11,659 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 435 transitions. Word has length 58 [2023-11-29 05:56:11,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:56:11,660 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 435 transitions. [2023-11-29 05:56:11,660 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:56:11,660 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 435 transitions. [2023-11-29 05:56:11,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 05:56:11,662 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:56:11,662 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:56:11,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:56:11,663 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:56:11,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:11,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1734287852, now seen corresponding path program 1 times [2023-11-29 05:56:11,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:11,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823423731] [2023-11-29 05:56:11,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:11,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:11,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:56:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:11,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:56:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:11,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:56:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:11,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:56:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:11,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 05:56:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:11,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:56:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:11,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:56:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:11,828 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:56:11,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:11,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823423731] [2023-11-29 05:56:11,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823423731] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:56:11,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:56:11,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 05:56:11,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486970463] [2023-11-29 05:56:11,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:56:11,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:56:11,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:11,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:56:11,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:56:11,831 INFO L87 Difference]: Start difference. First operand 303 states and 435 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 05:56:13,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:13,564 INFO L93 Difference]: Finished difference Result 1136 states and 1586 transitions. [2023-11-29 05:56:13,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-29 05:56:13,565 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 58 [2023-11-29 05:56:13,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:56:13,572 INFO L225 Difference]: With dead ends: 1136 [2023-11-29 05:56:13,572 INFO L226 Difference]: Without dead ends: 958 [2023-11-29 05:56:13,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2023-11-29 05:56:13,575 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 2012 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 521 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2028 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 1886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 521 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:56:13,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2028 Valid, 1154 Invalid, 1886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [521 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 05:56:13,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2023-11-29 05:56:13,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 841. [2023-11-29 05:56:13,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 654 states have (on average 1.4051987767584098) internal successors, (919), 669 states have internal predecessors, (919), 100 states have call successors, (100), 75 states have call predecessors, (100), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) [2023-11-29 05:56:13,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1133 transitions. [2023-11-29 05:56:13,643 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1133 transitions. Word has length 58 [2023-11-29 05:56:13,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:56:13,644 INFO L495 AbstractCegarLoop]: Abstraction has 841 states and 1133 transitions. [2023-11-29 05:56:13,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 05:56:13,644 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1133 transitions. [2023-11-29 05:56:13,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 05:56:13,645 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:56:13,646 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:56:13,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:56:13,646 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:56:13,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:13,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1696915276, now seen corresponding path program 1 times [2023-11-29 05:56:13,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:13,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115695256] [2023-11-29 05:56:13,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:13,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:13,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:56:13,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:13,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:56:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:13,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:56:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:13,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:56:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:13,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 05:56:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:13,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:56:13,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:13,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:56:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:13,788 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:56:13,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:13,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115695256] [2023-11-29 05:56:13,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115695256] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:56:13,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:56:13,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:56:13,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44398612] [2023-11-29 05:56:13,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:56:13,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:56:13,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:13,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:56:13,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:56:13,791 INFO L87 Difference]: Start difference. First operand 841 states and 1133 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 05:56:14,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:14,493 INFO L93 Difference]: Finished difference Result 1655 states and 2209 transitions. [2023-11-29 05:56:14,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:56:14,494 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2023-11-29 05:56:14,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:56:14,500 INFO L225 Difference]: With dead ends: 1655 [2023-11-29 05:56:14,501 INFO L226 Difference]: Without dead ends: 945 [2023-11-29 05:56:14,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-11-29 05:56:14,504 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 241 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:56:14,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 1144 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:56:14,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2023-11-29 05:56:14,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 857. [2023-11-29 05:56:14,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 666 states have (on average 1.3903903903903905) internal successors, (926), 681 states have internal predecessors, (926), 100 states have call successors, (100), 75 states have call predecessors, (100), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) [2023-11-29 05:56:14,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1144 transitions. [2023-11-29 05:56:14,577 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1144 transitions. Word has length 59 [2023-11-29 05:56:14,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:56:14,577 INFO L495 AbstractCegarLoop]: Abstraction has 857 states and 1144 transitions. [2023-11-29 05:56:14,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 05:56:14,577 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1144 transitions. [2023-11-29 05:56:14,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 05:56:14,578 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:56:14,579 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:14,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:56:14,579 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:56:14,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:14,579 INFO L85 PathProgramCache]: Analyzing trace with hash 226312758, now seen corresponding path program 1 times [2023-11-29 05:56:14,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:14,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457834443] [2023-11-29 05:56:14,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:14,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:14,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:56:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:14,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:56:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:14,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:56:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:14,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:56:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:14,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 05:56:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:14,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:56:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:14,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:56:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:14,785 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:56:14,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:14,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457834443] [2023-11-29 05:56:14,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457834443] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:56:14,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:56:14,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:56:14,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054230698] [2023-11-29 05:56:14,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:56:14,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:56:14,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:14,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:56:14,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:56:14,788 INFO L87 Difference]: Start difference. First operand 857 states and 1144 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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:56:15,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:15,710 INFO L93 Difference]: Finished difference Result 2297 states and 2963 transitions. [2023-11-29 05:56:15,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 05:56:15,710 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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 59 [2023-11-29 05:56:15,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:56:15,721 INFO L225 Difference]: With dead ends: 2297 [2023-11-29 05:56:15,721 INFO L226 Difference]: Without dead ends: 1572 [2023-11-29 05:56:15,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2023-11-29 05:56:15,725 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 611 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:56:15,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 844 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 05:56:15,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2023-11-29 05:56:15,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1270. [2023-11-29 05:56:15,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 984 states have (on average 1.3617886178861789) internal successors, (1340), 1008 states have internal predecessors, (1340), 146 states have call successors, (146), 114 states have call predecessors, (146), 138 states have return successors, (190), 150 states have call predecessors, (190), 142 states have call successors, (190) [2023-11-29 05:56:15,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1676 transitions. [2023-11-29 05:56:15,865 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1676 transitions. Word has length 59 [2023-11-29 05:56:15,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:56:15,866 INFO L495 AbstractCegarLoop]: Abstraction has 1270 states and 1676 transitions. [2023-11-29 05:56:15,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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:56:15,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1676 transitions. [2023-11-29 05:56:15,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 05:56:15,867 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:56:15,868 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:56:15,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:56:15,868 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:56:15,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:15,869 INFO L85 PathProgramCache]: Analyzing trace with hash 445167476, now seen corresponding path program 1 times [2023-11-29 05:56:15,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:15,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508530087] [2023-11-29 05:56:15,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:15,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:15,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:56:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:15,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:56:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:15,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:56:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:15,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:56:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:15,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 05:56:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:15,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:56:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:15,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:56:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:15,980 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:56:15,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:15,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508530087] [2023-11-29 05:56:15,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508530087] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:56:15,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:56:15,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:56:15,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42926995] [2023-11-29 05:56:15,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:56:15,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:56:15,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:15,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:56:15,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:56:15,983 INFO L87 Difference]: Start difference. First operand 1270 states and 1676 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 05:56:16,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:16,734 INFO L93 Difference]: Finished difference Result 3541 states and 4615 transitions. [2023-11-29 05:56:16,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:56:16,735 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2023-11-29 05:56:16,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:56:16,752 INFO L225 Difference]: With dead ends: 3541 [2023-11-29 05:56:16,752 INFO L226 Difference]: Without dead ends: 2405 [2023-11-29 05:56:16,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2023-11-29 05:56:16,757 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 733 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:56:16,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 563 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:56:16,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2023-11-29 05:56:16,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2301. [2023-11-29 05:56:16,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2301 states, 1755 states have (on average 1.3071225071225072) internal successors, (2294), 1800 states have internal predecessors, (2294), 270 states have call successors, (270), 220 states have call predecessors, (270), 274 states have return successors, (398), 283 states have call predecessors, (398), 266 states have call successors, (398) [2023-11-29 05:56:17,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2301 states to 2301 states and 2962 transitions. [2023-11-29 05:56:17,006 INFO L78 Accepts]: Start accepts. Automaton has 2301 states and 2962 transitions. Word has length 59 [2023-11-29 05:56:17,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:56:17,007 INFO L495 AbstractCegarLoop]: Abstraction has 2301 states and 2962 transitions. [2023-11-29 05:56:17,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 05:56:17,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2301 states and 2962 transitions. [2023-11-29 05:56:17,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 05:56:17,008 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:56:17,009 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:17,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 05:56:17,009 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:56:17,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:17,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1598525080, now seen corresponding path program 1 times [2023-11-29 05:56:17,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:17,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185995121] [2023-11-29 05:56:17,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:17,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:17,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:56:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:17,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:56:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:17,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:56:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:17,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:56:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:17,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 05:56:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:17,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:56:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:17,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:56:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:17,097 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:56:17,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:17,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185995121] [2023-11-29 05:56:17,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185995121] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:56:17,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:56:17,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:56:17,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736275284] [2023-11-29 05:56:17,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:56:17,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:56:17,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:17,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:56:17,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:56:17,100 INFO L87 Difference]: Start difference. First operand 2301 states and 2962 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 05:56:17,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:17,882 INFO L93 Difference]: Finished difference Result 5359 states and 6872 transitions. [2023-11-29 05:56:17,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:56:17,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2023-11-29 05:56:17,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:56:17,900 INFO L225 Difference]: With dead ends: 5359 [2023-11-29 05:56:17,900 INFO L226 Difference]: Without dead ends: 3192 [2023-11-29 05:56:17,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:56:17,905 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 405 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:56:17,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 671 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:56:17,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3192 states. [2023-11-29 05:56:18,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3192 to 2948. [2023-11-29 05:56:18,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2948 states, 2245 states have (on average 1.2966592427616928) internal successors, (2911), 2296 states have internal predecessors, (2911), 346 states have call successors, (346), 286 states have call predecessors, (346), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2023-11-29 05:56:18,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 3751 transitions. [2023-11-29 05:56:18,146 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 3751 transitions. Word has length 60 [2023-11-29 05:56:18,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:56:18,146 INFO L495 AbstractCegarLoop]: Abstraction has 2948 states and 3751 transitions. [2023-11-29 05:56:18,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 05:56:18,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 3751 transitions. [2023-11-29 05:56:18,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-29 05:56:18,148 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:56:18,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:18,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 05:56:18,149 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:56:18,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:18,149 INFO L85 PathProgramCache]: Analyzing trace with hash -713989047, now seen corresponding path program 1 times [2023-11-29 05:56:18,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:18,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253342258] [2023-11-29 05:56:18,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:18,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:18,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:56:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:18,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:56:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:18,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:56:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:18,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:56:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:18,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:56:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:18,221 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:56:18,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:18,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253342258] [2023-11-29 05:56:18,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253342258] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:56:18,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:56:18,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:56:18,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542209218] [2023-11-29 05:56:18,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:56:18,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:56:18,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:18,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:56:18,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:56:18,224 INFO L87 Difference]: Start difference. First operand 2948 states and 3751 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:56:18,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:18,981 INFO L93 Difference]: Finished difference Result 3097 states and 3984 transitions. [2023-11-29 05:56:18,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:56:18,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2023-11-29 05:56:18,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:56:19,000 INFO L225 Difference]: With dead ends: 3097 [2023-11-29 05:56:19,000 INFO L226 Difference]: Without dead ends: 2978 [2023-11-29 05:56:19,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:56:19,002 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 379 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:56:19,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 455 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:56:19,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2023-11-29 05:56:19,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2948. [2023-11-29 05:56:19,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2948 states, 2245 states have (on average 1.2962138084632517) internal successors, (2910), 2296 states have internal predecessors, (2910), 346 states have call successors, (346), 286 states have call predecessors, (346), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2023-11-29 05:56:19,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 3750 transitions. [2023-11-29 05:56:19,363 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 3750 transitions. Word has length 62 [2023-11-29 05:56:19,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:56:19,363 INFO L495 AbstractCegarLoop]: Abstraction has 2948 states and 3750 transitions. [2023-11-29 05:56:19,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:56:19,364 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 3750 transitions. [2023-11-29 05:56:19,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-29 05:56:19,365 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:56:19,365 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:19,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 05:56:19,366 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:56:19,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:19,366 INFO L85 PathProgramCache]: Analyzing trace with hash -754663797, now seen corresponding path program 1 times [2023-11-29 05:56:19,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:19,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411214517] [2023-11-29 05:56:19,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:19,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:19,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:56:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:19,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:56:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:19,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:56:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:19,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:56:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:19,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:56:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:19,468 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:56:19,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:19,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411214517] [2023-11-29 05:56:19,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411214517] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:56:19,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:56:19,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:56:19,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344048600] [2023-11-29 05:56:19,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:56:19,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:56:19,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:19,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:56:19,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:56:19,471 INFO L87 Difference]: Start difference. First operand 2948 states and 3750 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:56:20,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:20,560 INFO L93 Difference]: Finished difference Result 3237 states and 4200 transitions. [2023-11-29 05:56:20,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:56:20,561 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2023-11-29 05:56:20,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:56:20,575 INFO L225 Difference]: With dead ends: 3237 [2023-11-29 05:56:20,575 INFO L226 Difference]: Without dead ends: 3122 [2023-11-29 05:56:20,577 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:56:20,578 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 605 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:56:20,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 592 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 05:56:20,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3122 states. [2023-11-29 05:56:20,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3122 to 3061. [2023-11-29 05:56:20,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3061 states, 2340 states have (on average 1.3068376068376069) internal successors, (3058), 2392 states have internal predecessors, (3058), 357 states have call successors, (357), 292 states have call predecessors, (357), 362 states have return successors, (508), 379 states have call predecessors, (508), 353 states have call successors, (508) [2023-11-29 05:56:20,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 3061 states and 3923 transitions. [2023-11-29 05:56:20,915 INFO L78 Accepts]: Start accepts. Automaton has 3061 states and 3923 transitions. Word has length 62 [2023-11-29 05:56:20,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:56:20,915 INFO L495 AbstractCegarLoop]: Abstraction has 3061 states and 3923 transitions. [2023-11-29 05:56:20,915 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:56:20,915 INFO L276 IsEmpty]: Start isEmpty. Operand 3061 states and 3923 transitions. [2023-11-29 05:56:20,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-29 05:56:20,917 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:56:20,917 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:20,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:56:20,918 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:56:20,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:20,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1511717389, now seen corresponding path program 1 times [2023-11-29 05:56:20,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:20,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440861597] [2023-11-29 05:56:20,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:20,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:20,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:56:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:20,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:56:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:21,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:56:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:21,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:56:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:21,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:56:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:21,048 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:56:21,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:21,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440861597] [2023-11-29 05:56:21,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440861597] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:56:21,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:56:21,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:56:21,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400743140] [2023-11-29 05:56:21,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:56:21,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:56:21,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:21,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:56:21,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:56:21,051 INFO L87 Difference]: Start difference. First operand 3061 states and 3923 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:56:22,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:22,272 INFO L93 Difference]: Finished difference Result 3492 states and 4586 transitions. [2023-11-29 05:56:22,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 05:56:22,273 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2023-11-29 05:56:22,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:56:22,288 INFO L225 Difference]: With dead ends: 3492 [2023-11-29 05:56:22,289 INFO L226 Difference]: Without dead ends: 3264 [2023-11-29 05:56:22,291 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:56:22,291 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 608 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:56:22,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 988 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 05:56:22,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3264 states. [2023-11-29 05:56:22,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3264 to 3167. [2023-11-29 05:56:22,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3167 states, 2428 states have (on average 1.314662273476112) internal successors, (3192), 2481 states have internal predecessors, (3192), 368 states have call successors, (368), 298 states have call predecessors, (368), 369 states have return successors, (521), 391 states have call predecessors, (521), 364 states have call successors, (521) [2023-11-29 05:56:22,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3167 states to 3167 states and 4081 transitions. [2023-11-29 05:56:22,614 INFO L78 Accepts]: Start accepts. Automaton has 3167 states and 4081 transitions. Word has length 62 [2023-11-29 05:56:22,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:56:22,614 INFO L495 AbstractCegarLoop]: Abstraction has 3167 states and 4081 transitions. [2023-11-29 05:56:22,614 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:56:22,615 INFO L276 IsEmpty]: Start isEmpty. Operand 3167 states and 4081 transitions. [2023-11-29 05:56:22,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-29 05:56:22,616 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:56:22,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:22,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 05:56:22,617 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:56:22,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:22,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1030637131, now seen corresponding path program 1 times [2023-11-29 05:56:22,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:22,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6913530] [2023-11-29 05:56:22,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:22,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:22,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:56:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:22,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:56:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:22,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:56:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:22,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:56:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:22,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:56:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:22,735 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:56:22,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:22,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6913530] [2023-11-29 05:56:22,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6913530] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:56:22,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:56:22,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:56:22,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604831645] [2023-11-29 05:56:22,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:56:22,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:56:22,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:22,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:56:22,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:56:22,738 INFO L87 Difference]: Start difference. First operand 3167 states and 4081 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:56:24,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:24,019 INFO L93 Difference]: Finished difference Result 3928 states and 5248 transitions. [2023-11-29 05:56:24,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 05:56:24,020 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2023-11-29 05:56:24,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:56:24,037 INFO L225 Difference]: With dead ends: 3928 [2023-11-29 05:56:24,037 INFO L226 Difference]: Without dead ends: 3594 [2023-11-29 05:56:24,040 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:56:24,041 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 622 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:56:24,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 979 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 05:56:24,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2023-11-29 05:56:24,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3379. [2023-11-29 05:56:24,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3379 states, 2606 states have (on average 1.329623944742901) internal successors, (3465), 2661 states have internal predecessors, (3465), 388 states have call successors, (388), 310 states have call predecessors, (388), 383 states have return successors, (549), 413 states have call predecessors, (549), 384 states have call successors, (549) [2023-11-29 05:56:24,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3379 states to 3379 states and 4402 transitions. [2023-11-29 05:56:24,536 INFO L78 Accepts]: Start accepts. Automaton has 3379 states and 4402 transitions. Word has length 62 [2023-11-29 05:56:24,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:56:24,536 INFO L495 AbstractCegarLoop]: Abstraction has 3379 states and 4402 transitions. [2023-11-29 05:56:24,537 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:56:24,537 INFO L276 IsEmpty]: Start isEmpty. Operand 3379 states and 4402 transitions. [2023-11-29 05:56:24,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-29 05:56:24,539 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:56:24,539 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:24,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 05:56:24,539 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:56:24,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:24,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1325168119, now seen corresponding path program 1 times [2023-11-29 05:56:24,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:24,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805927595] [2023-11-29 05:56:24,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:24,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:24,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:56:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:24,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:56:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:24,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:56:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:24,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:56:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:24,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:56:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:24,659 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:56:24,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:24,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805927595] [2023-11-29 05:56:24,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805927595] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:56:24,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:56:24,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:56:24,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733205520] [2023-11-29 05:56:24,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:56:24,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:56:24,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:24,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:56:24,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:56:24,662 INFO L87 Difference]: Start difference. First operand 3379 states and 4402 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:56:26,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:26,128 INFO L93 Difference]: Finished difference Result 4662 states and 6359 transitions. [2023-11-29 05:56:26,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 05:56:26,129 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2023-11-29 05:56:26,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:56:26,154 INFO L225 Difference]: With dead ends: 4662 [2023-11-29 05:56:26,154 INFO L226 Difference]: Without dead ends: 4116 [2023-11-29 05:56:26,158 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:56:26,159 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 649 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:56:26,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 975 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 05:56:26,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4116 states. [2023-11-29 05:56:26,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4116 to 3760. [2023-11-29 05:56:26,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3760 states, 2921 states have (on average 1.3478260869565217) internal successors, (3937), 2980 states have internal predecessors, (3937), 426 states have call successors, (426), 334 states have call predecessors, (426), 411 states have return successors, (609), 455 states have call predecessors, (609), 422 states have call successors, (609) [2023-11-29 05:56:26,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3760 states to 3760 states and 4972 transitions. [2023-11-29 05:56:26,612 INFO L78 Accepts]: Start accepts. Automaton has 3760 states and 4972 transitions. Word has length 62 [2023-11-29 05:56:26,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:56:26,612 INFO L495 AbstractCegarLoop]: Abstraction has 3760 states and 4972 transitions. [2023-11-29 05:56:26,612 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:56:26,612 INFO L276 IsEmpty]: Start isEmpty. Operand 3760 states and 4972 transitions. [2023-11-29 05:56:26,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-29 05:56:26,615 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:56:26,615 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:26,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 05:56:26,615 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:56:26,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:26,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1678256501, now seen corresponding path program 1 times [2023-11-29 05:56:26,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:26,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607697543] [2023-11-29 05:56:26,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:26,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:26,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:56:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:26,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:56:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:26,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:56:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:26,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:56:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:26,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:56:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:26,721 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:56:26,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:26,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607697543] [2023-11-29 05:56:26,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607697543] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:56:26,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:56:26,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:56:26,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077175198] [2023-11-29 05:56:26,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:56:26,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:56:26,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:26,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:56:26,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:56:26,723 INFO L87 Difference]: Start difference. First operand 3760 states and 4972 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:56:27,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:27,659 INFO L93 Difference]: Finished difference Result 4900 states and 6722 transitions. [2023-11-29 05:56:27,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:56:27,659 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2023-11-29 05:56:27,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:56:27,681 INFO L225 Difference]: With dead ends: 4900 [2023-11-29 05:56:27,681 INFO L226 Difference]: Without dead ends: 3973 [2023-11-29 05:56:27,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:56:27,686 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 604 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:56:27,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 494 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:56:27,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3973 states. [2023-11-29 05:56:28,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3973 to 3760. [2023-11-29 05:56:28,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3760 states, 2921 states have (on average 1.344744950359466) internal successors, (3928), 2980 states have internal predecessors, (3928), 426 states have call successors, (426), 334 states have call predecessors, (426), 411 states have return successors, (609), 455 states have call predecessors, (609), 422 states have call successors, (609) [2023-11-29 05:56:28,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3760 states to 3760 states and 4963 transitions. [2023-11-29 05:56:28,158 INFO L78 Accepts]: Start accepts. Automaton has 3760 states and 4963 transitions. Word has length 62 [2023-11-29 05:56:28,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:56:28,158 INFO L495 AbstractCegarLoop]: Abstraction has 3760 states and 4963 transitions. [2023-11-29 05:56:28,160 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:56:28,160 INFO L276 IsEmpty]: Start isEmpty. Operand 3760 states and 4963 transitions. [2023-11-29 05:56:28,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-29 05:56:28,162 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:56:28,162 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:28,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 05:56:28,163 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:56:28,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:28,163 INFO L85 PathProgramCache]: Analyzing trace with hash 250016201, now seen corresponding path program 1 times [2023-11-29 05:56:28,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:28,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605822862] [2023-11-29 05:56:28,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:28,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:28,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:56:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:28,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:56:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:28,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:56:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:28,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:56:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:28,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:56:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:28,307 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:56:28,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:28,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605822862] [2023-11-29 05:56:28,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605822862] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:56:28,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:56:28,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:56:28,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726236347] [2023-11-29 05:56:28,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:56:28,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:56:28,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:28,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:56:28,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:56:28,310 INFO L87 Difference]: Start difference. First operand 3760 states and 4963 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:56:30,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:30,271 INFO L93 Difference]: Finished difference Result 7106 states and 10121 transitions. [2023-11-29 05:56:30,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 05:56:30,271 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2023-11-29 05:56:30,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:56:30,301 INFO L225 Difference]: With dead ends: 7106 [2023-11-29 05:56:30,301 INFO L226 Difference]: Without dead ends: 6180 [2023-11-29 05:56:30,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2023-11-29 05:56:30,308 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 1300 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1319 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:56:30,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1319 Valid, 779 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 05:56:30,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6180 states. [2023-11-29 05:56:30,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6180 to 5534. [2023-11-29 05:56:30,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5534 states, 4383 states have (on average 1.3853524982888432) internal successors, (6072), 4473 states have internal predecessors, (6072), 610 states have call successors, (610), 446 states have call predecessors, (610), 539 states have return successors, (908), 624 states have call predecessors, (908), 606 states have call successors, (908) [2023-11-29 05:56:30,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5534 states to 5534 states and 7590 transitions. [2023-11-29 05:56:30,887 INFO L78 Accepts]: Start accepts. Automaton has 5534 states and 7590 transitions. Word has length 62 [2023-11-29 05:56:30,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:56:30,888 INFO L495 AbstractCegarLoop]: Abstraction has 5534 states and 7590 transitions. [2023-11-29 05:56:30,888 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:56:30,888 INFO L276 IsEmpty]: Start isEmpty. Operand 5534 states and 7590 transitions. [2023-11-29 05:56:30,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-29 05:56:30,890 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:56:30,890 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:30,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 05:56:30,891 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:56:30,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:30,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1532828887, now seen corresponding path program 1 times [2023-11-29 05:56:30,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:30,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126641989] [2023-11-29 05:56:30,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:30,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:30,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:56:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:30,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:56:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:30,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:56:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:30,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:56:30,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:30,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 05:56:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:30,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:56:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:30,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:56:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:30,987 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:56:30,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:30,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126641989] [2023-11-29 05:56:30,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126641989] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:56:30,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:56:30,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:56:30,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330806389] [2023-11-29 05:56:30,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:56:30,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:56:30,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:30,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:56:30,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:56:30,990 INFO L87 Difference]: Start difference. First operand 5534 states and 7590 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 05:56:32,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:32,248 INFO L93 Difference]: Finished difference Result 8837 states and 11737 transitions. [2023-11-29 05:56:32,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:56:32,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2023-11-29 05:56:32,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:56:32,276 INFO L225 Difference]: With dead ends: 8837 [2023-11-29 05:56:32,276 INFO L226 Difference]: Without dead ends: 6021 [2023-11-29 05:56:32,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:56:32,285 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 682 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:56:32,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 483 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:56:32,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6021 states. [2023-11-29 05:56:33,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6021 to 5792. [2023-11-29 05:56:33,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5792 states, 4583 states have (on average 1.3779183940650228) internal successors, (6315), 4676 states have internal predecessors, (6315), 638 states have call successors, (638), 471 states have call predecessors, (638), 569 states have return successors, (942), 654 states have call predecessors, (942), 634 states have call successors, (942) [2023-11-29 05:56:33,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5792 states to 5792 states and 7895 transitions. [2023-11-29 05:56:33,080 INFO L78 Accepts]: Start accepts. Automaton has 5792 states and 7895 transitions. Word has length 66 [2023-11-29 05:56:33,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:56:33,080 INFO L495 AbstractCegarLoop]: Abstraction has 5792 states and 7895 transitions. [2023-11-29 05:56:33,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 05:56:33,080 INFO L276 IsEmpty]: Start isEmpty. Operand 5792 states and 7895 transitions. [2023-11-29 05:56:33,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-29 05:56:33,083 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:56:33,084 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:33,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 05:56:33,084 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:56:33,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:33,085 INFO L85 PathProgramCache]: Analyzing trace with hash -243171438, now seen corresponding path program 1 times [2023-11-29 05:56:33,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:33,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413044652] [2023-11-29 05:56:33,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:33,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:33,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:56:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:33,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:56:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:33,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:56:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:33,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:56:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:33,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 05:56:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:33,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:56:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:33,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:56:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:33,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:56:33,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:33,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413044652] [2023-11-29 05:56:33,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413044652] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:56:33,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:56:33,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:56:33,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344336462] [2023-11-29 05:56:33,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:56:33,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:56:33,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:33,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:56:33,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:56:33,197 INFO L87 Difference]: Start difference. First operand 5792 states and 7895 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 05:56:34,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:34,796 INFO L93 Difference]: Finished difference Result 6768 states and 9084 transitions. [2023-11-29 05:56:34,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:56:34,797 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 67 [2023-11-29 05:56:34,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:56:34,822 INFO L225 Difference]: With dead ends: 6768 [2023-11-29 05:56:34,822 INFO L226 Difference]: Without dead ends: 6765 [2023-11-29 05:56:34,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2023-11-29 05:56:34,827 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 841 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:56:34,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 588 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 05:56:34,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6765 states. [2023-11-29 05:56:35,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6765 to 6481. [2023-11-29 05:56:35,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6481 states, 5093 states have (on average 1.363832711564893) internal successors, (6946), 5193 states have internal predecessors, (6946), 721 states have call successors, (721), 543 states have call predecessors, (721), 665 states have return successors, (1070), 754 states have call predecessors, (1070), 718 states have call successors, (1070) [2023-11-29 05:56:35,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6481 states to 6481 states and 8737 transitions. [2023-11-29 05:56:35,604 INFO L78 Accepts]: Start accepts. Automaton has 6481 states and 8737 transitions. Word has length 67 [2023-11-29 05:56:35,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:56:35,605 INFO L495 AbstractCegarLoop]: Abstraction has 6481 states and 8737 transitions. [2023-11-29 05:56:35,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 05:56:35,605 INFO L276 IsEmpty]: Start isEmpty. Operand 6481 states and 8737 transitions. [2023-11-29 05:56:35,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-29 05:56:35,607 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:56:35,607 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:35,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 05:56:35,607 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:56:35,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:35,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1050889345, now seen corresponding path program 1 times [2023-11-29 05:56:35,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:35,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176511378] [2023-11-29 05:56:35,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:35,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:35,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:56:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:35,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:56:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:35,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:56:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:35,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:56:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:35,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 05:56:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:35,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:56:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:35,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:56:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:35,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:56:35,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:35,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176511378] [2023-11-29 05:56:35,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176511378] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:56:35,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753344177] [2023-11-29 05:56:35,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:35,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:56:35,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:35,786 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:56:35,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:56:35,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:35,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 05:56:35,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:56:36,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:56:36,229 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:56:36,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:56:36,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753344177] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:56:36,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:56:36,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2023-11-29 05:56:36,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457024920] [2023-11-29 05:56:36,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:56:36,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:56:36,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:36,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:56:36,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:56:36,344 INFO L87 Difference]: Start difference. First operand 6481 states and 8737 transitions. Second operand has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 05:56:39,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:39,429 INFO L93 Difference]: Finished difference Result 10546 states and 13757 transitions. [2023-11-29 05:56:39,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 05:56:39,430 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 68 [2023-11-29 05:56:39,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:56:39,466 INFO L225 Difference]: With dead ends: 10546 [2023-11-29 05:56:39,466 INFO L226 Difference]: Without dead ends: 10543 [2023-11-29 05:56:39,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2023-11-29 05:56:39,471 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 1016 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:56:39,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 1181 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1346 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 05:56:39,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10543 states. [2023-11-29 05:56:40,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10543 to 9732. [2023-11-29 05:56:40,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9732 states, 7570 states have (on average 1.3303830911492736) internal successors, (10071), 7721 states have internal predecessors, (10071), 1091 states have call successors, (1091), 868 states have call predecessors, (1091), 1069 states have return successors, (1616), 1152 states have call predecessors, (1616), 1088 states have call successors, (1616) [2023-11-29 05:56:40,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9732 states to 9732 states and 12778 transitions. [2023-11-29 05:56:40,622 INFO L78 Accepts]: Start accepts. Automaton has 9732 states and 12778 transitions. Word has length 68 [2023-11-29 05:56:40,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:56:40,622 INFO L495 AbstractCegarLoop]: Abstraction has 9732 states and 12778 transitions. [2023-11-29 05:56:40,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 05:56:40,622 INFO L276 IsEmpty]: Start isEmpty. Operand 9732 states and 12778 transitions. [2023-11-29 05:56:40,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-29 05:56:40,625 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:56:40,626 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:40,632 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:56:40,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 05:56:40,826 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:56:40,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:40,827 INFO L85 PathProgramCache]: Analyzing trace with hash 104005074, now seen corresponding path program 2 times [2023-11-29 05:56:40,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:40,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937507465] [2023-11-29 05:56:40,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:40,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:40,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:56:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:40,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:56:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:40,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:56:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:40,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:56:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:40,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 05:56:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:40,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:56:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:40,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:56:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:40,882 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:56:40,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:40,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937507465] [2023-11-29 05:56:40,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937507465] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:56:40,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:56:40,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:56:40,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871097203] [2023-11-29 05:56:40,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:56:40,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:56:40,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:40,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:56:40,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:56:40,884 INFO L87 Difference]: Start difference. First operand 9732 states and 12778 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 05:56:41,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:41,969 INFO L93 Difference]: Finished difference Result 12501 states and 16262 transitions. [2023-11-29 05:56:41,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:56:41,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2023-11-29 05:56:41,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:56:41,987 INFO L225 Difference]: With dead ends: 12501 [2023-11-29 05:56:41,987 INFO L226 Difference]: Without dead ends: 6289 [2023-11-29 05:56:42,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:56:42,002 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 612 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:56:42,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 511 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:56:42,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6289 states. [2023-11-29 05:56:42,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6289 to 5335. [2023-11-29 05:56:42,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5335 states, 4239 states have (on average 1.3706062750648738) internal successors, (5810), 4312 states have internal predecessors, (5810), 591 states have call successors, (591), 433 states have call predecessors, (591), 503 states have return successors, (842), 599 states have call predecessors, (842), 588 states have call successors, (842) [2023-11-29 05:56:42,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5335 states to 5335 states and 7243 transitions. [2023-11-29 05:56:42,803 INFO L78 Accepts]: Start accepts. Automaton has 5335 states and 7243 transitions. Word has length 71 [2023-11-29 05:56:42,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:56:42,804 INFO L495 AbstractCegarLoop]: Abstraction has 5335 states and 7243 transitions. [2023-11-29 05:56:42,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 05:56:42,804 INFO L276 IsEmpty]: Start isEmpty. Operand 5335 states and 7243 transitions. [2023-11-29 05:56:42,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-29 05:56:42,806 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:56:42,807 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:42,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 05:56:42,807 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:56:42,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:42,807 INFO L85 PathProgramCache]: Analyzing trace with hash 178274904, now seen corresponding path program 1 times [2023-11-29 05:56:42,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:42,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300054475] [2023-11-29 05:56:42,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:42,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:42,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:56:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:42,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:56:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:42,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:56:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:42,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:56:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:42,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 05:56:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:42,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:56:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:42,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:56:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:42,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 05:56:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:42,912 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 05:56:42,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:42,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300054475] [2023-11-29 05:56:42,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300054475] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:56:42,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:56:42,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:56:42,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037996526] [2023-11-29 05:56:42,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:56:42,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:56:42,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:42,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:56:42,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:56:42,915 INFO L87 Difference]: Start difference. First operand 5335 states and 7243 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 05:56:44,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:44,466 INFO L93 Difference]: Finished difference Result 10602 states and 13710 transitions. [2023-11-29 05:56:44,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 05:56:44,467 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2023-11-29 05:56:44,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:56:44,488 INFO L225 Difference]: With dead ends: 10602 [2023-11-29 05:56:44,488 INFO L226 Difference]: Without dead ends: 7117 [2023-11-29 05:56:44,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2023-11-29 05:56:44,499 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 676 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:56:44,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 898 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 05:56:44,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7117 states. [2023-11-29 05:56:45,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7117 to 6886. [2023-11-29 05:56:45,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6886 states, 5387 states have (on average 1.3304250974568406) internal successors, (7167), 5497 states have internal predecessors, (7167), 775 states have call successors, (775), 591 states have call predecessors, (775), 722 states have return successors, (1163), 807 states have call predecessors, (1163), 772 states have call successors, (1163) [2023-11-29 05:56:45,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6886 states to 6886 states and 9105 transitions. [2023-11-29 05:56:45,279 INFO L78 Accepts]: Start accepts. Automaton has 6886 states and 9105 transitions. Word has length 76 [2023-11-29 05:56:45,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:56:45,280 INFO L495 AbstractCegarLoop]: Abstraction has 6886 states and 9105 transitions. [2023-11-29 05:56:45,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 05:56:45,280 INFO L276 IsEmpty]: Start isEmpty. Operand 6886 states and 9105 transitions. [2023-11-29 05:56:45,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 05:56:45,284 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:56:45,284 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:45,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 05:56:45,284 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:56:45,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:45,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1670249923, now seen corresponding path program 1 times [2023-11-29 05:56:45,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:45,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701105452] [2023-11-29 05:56:45,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:45,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:45,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:56:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:45,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:56:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:45,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:56:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:45,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:56:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:45,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 05:56:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:45,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:56:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:45,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:56:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:45,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 05:56:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:45,412 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 05:56:45,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:45,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701105452] [2023-11-29 05:56:45,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701105452] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:56:45,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:56:45,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:56:45,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313388671] [2023-11-29 05:56:45,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:56:45,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:56:45,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:45,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:56:45,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:56:45,415 INFO L87 Difference]: Start difference. First operand 6886 states and 9105 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 05:56:47,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:47,078 INFO L93 Difference]: Finished difference Result 9536 states and 12360 transitions. [2023-11-29 05:56:47,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 05:56:47,079 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 86 [2023-11-29 05:56:47,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:56:47,092 INFO L225 Difference]: With dead ends: 9536 [2023-11-29 05:56:47,092 INFO L226 Difference]: Without dead ends: 6042 [2023-11-29 05:56:47,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2023-11-29 05:56:47,101 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 1300 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:56:47,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1329 Valid, 754 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 05:56:47,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2023-11-29 05:56:47,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 5680. [2023-11-29 05:56:47,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5680 states, 4465 states have (on average 1.342889137737962) internal successors, (5996), 4558 states have internal predecessors, (5996), 633 states have call successors, (633), 467 states have call predecessors, (633), 580 states have return successors, (928), 664 states have call predecessors, (928), 630 states have call successors, (928) [2023-11-29 05:56:47,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5680 states to 5680 states and 7557 transitions. [2023-11-29 05:56:47,944 INFO L78 Accepts]: Start accepts. Automaton has 5680 states and 7557 transitions. Word has length 86 [2023-11-29 05:56:47,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:56:47,944 INFO L495 AbstractCegarLoop]: Abstraction has 5680 states and 7557 transitions. [2023-11-29 05:56:47,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 05:56:47,944 INFO L276 IsEmpty]: Start isEmpty. Operand 5680 states and 7557 transitions. [2023-11-29 05:56:47,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-29 05:56:47,949 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:56:47,950 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, 1] [2023-11-29 05:56:47,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 05:56:47,950 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:56:47,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:47,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1026383218, now seen corresponding path program 1 times [2023-11-29 05:56:47,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:47,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107201119] [2023-11-29 05:56:47,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:47,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:47,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:48,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:56:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:48,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:56:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:48,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:56:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:48,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:56:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:48,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:56:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:48,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:56:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:48,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:56:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:48,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:56:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:48,087 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:56:48,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:48,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107201119] [2023-11-29 05:56:48,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107201119] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:56:48,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692518936] [2023-11-29 05:56:48,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:48,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:56:48,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:48,091 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:56:48,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 05:56:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:48,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:56:48,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:56:48,246 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:56:48,246 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:56:48,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692518936] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:56:48,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:56:48,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 05:56:48,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934113704] [2023-11-29 05:56:48,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:56:48,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:56:48,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:48,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:56:48,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:56:48,248 INFO L87 Difference]: Start difference. First operand 5680 states and 7557 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 05:56:49,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:49,056 INFO L93 Difference]: Finished difference Result 8563 states and 12031 transitions. [2023-11-29 05:56:49,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:56:49,056 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), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 100 [2023-11-29 05:56:49,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:56:49,075 INFO L225 Difference]: With dead ends: 8563 [2023-11-29 05:56:49,076 INFO L226 Difference]: Without dead ends: 7056 [2023-11-29 05:56:49,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 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:56:49,083 INFO L413 NwaCegarLoop]: 411 mSDtfsCounter, 133 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:56:49,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 689 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:56:49,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7056 states. [2023-11-29 05:56:49,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7056 to 7051. [2023-11-29 05:56:49,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7051 states, 5594 states have (on average 1.3671791204862354) internal successors, (7648), 5699 states have internal predecessors, (7648), 773 states have call successors, (773), 555 states have call predecessors, (773), 682 states have return successors, (1248), 806 states have call predecessors, (1248), 770 states have call successors, (1248) [2023-11-29 05:56:50,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7051 states to 7051 states and 9669 transitions. [2023-11-29 05:56:50,008 INFO L78 Accepts]: Start accepts. Automaton has 7051 states and 9669 transitions. Word has length 100 [2023-11-29 05:56:50,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:56:50,009 INFO L495 AbstractCegarLoop]: Abstraction has 7051 states and 9669 transitions. [2023-11-29 05:56:50,009 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), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 05:56:50,009 INFO L276 IsEmpty]: Start isEmpty. Operand 7051 states and 9669 transitions. [2023-11-29 05:56:50,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-29 05:56:50,015 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:56:50,016 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:50,020 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 05:56:50,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-29 05:56:50,216 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:56:50,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:50,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1644455643, now seen corresponding path program 1 times [2023-11-29 05:56:50,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:50,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139252001] [2023-11-29 05:56:50,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:50,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:50,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:56:50,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:50,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:56:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:50,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:56:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:50,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:56:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:50,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 05:56:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:50,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:56:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:50,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:56:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:50,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 05:56:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:50,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 05:56:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:50,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 05:56:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:50,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 05:56:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:50,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:56:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:50,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 05:56:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:50,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 05:56:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:50,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-29 05:56:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:50,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 05:56:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:50,379 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-11-29 05:56:50,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:50,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139252001] [2023-11-29 05:56:50,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139252001] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:56:50,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414725478] [2023-11-29 05:56:50,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:50,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:56:50,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:50,381 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:56:50,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 05:56:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:50,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:56:50,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:56:50,537 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 05:56:50,537 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:56:50,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414725478] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:56:50,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:56:50,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2023-11-29 05:56:50,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320228165] [2023-11-29 05:56:50,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:56:50,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:56:50,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:50,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:56:50,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:56:50,539 INFO L87 Difference]: Start difference. First operand 7051 states and 9669 transitions. Second operand has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 05:56:51,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:51,056 INFO L93 Difference]: Finished difference Result 8587 states and 11539 transitions. [2023-11-29 05:56:51,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:56:51,057 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2023-11-29 05:56:51,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:56:51,067 INFO L225 Difference]: With dead ends: 8587 [2023-11-29 05:56:51,067 INFO L226 Difference]: Without dead ends: 5627 [2023-11-29 05:56:51,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:56:51,073 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 32 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:56:51,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1379 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:56:51,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5627 states. [2023-11-29 05:56:51,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5627 to 5505. [2023-11-29 05:56:51,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5505 states, 4490 states have (on average 1.4060133630289533) internal successors, (6313), 4556 states have internal predecessors, (6313), 565 states have call successors, (565), 372 states have call predecessors, (565), 448 states have return successors, (954), 584 states have call predecessors, (954), 562 states have call successors, (954) [2023-11-29 05:56:51,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5505 states to 5505 states and 7832 transitions. [2023-11-29 05:56:51,518 INFO L78 Accepts]: Start accepts. Automaton has 5505 states and 7832 transitions. Word has length 131 [2023-11-29 05:56:51,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:56:51,519 INFO L495 AbstractCegarLoop]: Abstraction has 5505 states and 7832 transitions. [2023-11-29 05:56:51,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 05:56:51,519 INFO L276 IsEmpty]: Start isEmpty. Operand 5505 states and 7832 transitions. [2023-11-29 05:56:51,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-29 05:56:51,525 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:56:51,525 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, 1] [2023-11-29 05:56:51,529 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 05:56:51,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-29 05:56:51,726 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:56:51,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:51,726 INFO L85 PathProgramCache]: Analyzing trace with hash 205850875, now seen corresponding path program 1 times [2023-11-29 05:56:51,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:51,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756281427] [2023-11-29 05:56:51,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:51,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:51,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:56:51,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:51,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:56:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:51,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:56:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:51,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:56:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:51,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:56:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:51,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:56:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:51,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:56:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:51,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 05:56:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:51,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:56:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:51,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 05:56:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:51,842 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:56:51,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:51,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756281427] [2023-11-29 05:56:51,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756281427] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:56:51,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243192331] [2023-11-29 05:56:51,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:51,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:56:51,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:51,844 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:56:51,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 05:56:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:51,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:56:51,961 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:56:52,105 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:56:52,105 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:56:52,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243192331] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:56:52,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:56:52,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-11-29 05:56:52,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567809442] [2023-11-29 05:56:52,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:56:52,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:56:52,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:52,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:56:52,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:56:52,107 INFO L87 Difference]: Start difference. First operand 5505 states and 7832 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 05:56:52,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:52,749 INFO L93 Difference]: Finished difference Result 10278 states and 15182 transitions. [2023-11-29 05:56:52,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:56:52,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 128 [2023-11-29 05:56:52,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:56:52,768 INFO L225 Difference]: With dead ends: 10278 [2023-11-29 05:56:52,768 INFO L226 Difference]: Without dead ends: 7400 [2023-11-29 05:56:52,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 147 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:56:52,780 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 220 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:56:52,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 430 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:56:52,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7400 states. [2023-11-29 05:56:53,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7400 to 7362. [2023-11-29 05:56:53,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7362 states, 6033 states have (on average 1.4238355710260235) internal successors, (8590), 6120 states have internal predecessors, (8590), 747 states have call successors, (747), 488 states have call predecessors, (747), 580 states have return successors, (1243), 761 states have call predecessors, (1243), 744 states have call successors, (1243) [2023-11-29 05:56:53,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7362 states to 7362 states and 10580 transitions. [2023-11-29 05:56:53,414 INFO L78 Accepts]: Start accepts. Automaton has 7362 states and 10580 transitions. Word has length 128 [2023-11-29 05:56:53,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:56:53,414 INFO L495 AbstractCegarLoop]: Abstraction has 7362 states and 10580 transitions. [2023-11-29 05:56:53,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 05:56:53,414 INFO L276 IsEmpty]: Start isEmpty. Operand 7362 states and 10580 transitions. [2023-11-29 05:56:53,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-29 05:56:53,421 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:56:53,421 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, 1] [2023-11-29 05:56:53,425 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 05:56:53,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-29 05:56:53,621 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:56:53,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:53,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1124825498, now seen corresponding path program 1 times [2023-11-29 05:56:53,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:53,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49788848] [2023-11-29 05:56:53,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:53,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:53,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:56:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:53,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:56:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:53,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:56:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:53,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:56:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:53,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:56:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:53,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:56:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:53,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:56:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:53,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 05:56:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:53,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:56:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:53,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 05:56:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:53,722 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:56:53,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:53,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49788848] [2023-11-29 05:56:53,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49788848] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:56:53,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647000719] [2023-11-29 05:56:53,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:53,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:56:53,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:53,724 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:56:53,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 05:56:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:53,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:56:53,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:56:53,939 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:56:53,939 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:56:53,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647000719] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:56:53,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:56:53,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-11-29 05:56:53,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431393502] [2023-11-29 05:56:53,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:56:53,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:56:53,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:53,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:56:53,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:56:53,941 INFO L87 Difference]: Start difference. First operand 7362 states and 10580 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 05:56:55,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:55,029 INFO L93 Difference]: Finished difference Result 18990 states and 28296 transitions. [2023-11-29 05:56:55,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:56:55,030 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 128 [2023-11-29 05:56:55,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:56:55,056 INFO L225 Difference]: With dead ends: 18990 [2023-11-29 05:56:55,056 INFO L226 Difference]: Without dead ends: 13062 [2023-11-29 05:56:55,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 147 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:56:55,072 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 224 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:56:55,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 429 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:56:55,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13062 states. [2023-11-29 05:56:55,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13062 to 12995. [2023-11-29 05:56:55,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12995 states, 10700 states have (on average 1.439252336448598) internal successors, (15400), 10859 states have internal predecessors, (15400), 1297 states have call successors, (1297), 847 states have call predecessors, (1297), 996 states have return successors, (2151), 1296 states have call predecessors, (2151), 1294 states have call successors, (2151) [2023-11-29 05:56:56,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12995 states to 12995 states and 18848 transitions. [2023-11-29 05:56:56,014 INFO L78 Accepts]: Start accepts. Automaton has 12995 states and 18848 transitions. Word has length 128 [2023-11-29 05:56:56,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:56:56,014 INFO L495 AbstractCegarLoop]: Abstraction has 12995 states and 18848 transitions. [2023-11-29 05:56:56,014 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 05:56:56,014 INFO L276 IsEmpty]: Start isEmpty. Operand 12995 states and 18848 transitions. [2023-11-29 05:56:56,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-29 05:56:56,027 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:56:56,027 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:56:56,032 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 05:56:56,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-29 05:56:56,228 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:56:56,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:56,228 INFO L85 PathProgramCache]: Analyzing trace with hash -2069395970, now seen corresponding path program 1 times [2023-11-29 05:56:56,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:56,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983604406] [2023-11-29 05:56:56,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:56,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:56,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:56:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:56,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:56:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:56,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:56:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:56,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:56:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:56,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 05:56:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:56,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:56:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:56,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:56:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:56,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 05:56:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:56,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:56:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:56,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 05:56:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:56,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:56:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:56,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:56:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:56,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 05:56:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:56,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 05:56:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:56,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 05:56:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:56,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 05:56:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:56,340 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-29 05:56:56,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:56,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983604406] [2023-11-29 05:56:56,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983604406] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:56:56,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:56:56,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:56:56,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710492993] [2023-11-29 05:56:56,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:56:56,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:56:56,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:56,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:56:56,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:56:56,343 INFO L87 Difference]: Start difference. First operand 12995 states and 18848 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-29 05:56:57,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:56:57,669 INFO L93 Difference]: Finished difference Result 14162 states and 20252 transitions. [2023-11-29 05:56:57,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:56:57,669 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 145 [2023-11-29 05:56:57,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:56:57,694 INFO L225 Difference]: With dead ends: 14162 [2023-11-29 05:56:57,694 INFO L226 Difference]: Without dead ends: 12903 [2023-11-29 05:56:57,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:56:57,701 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 378 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:56:57,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 746 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:56:57,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12903 states. [2023-11-29 05:56:58,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12903 to 12764. [2023-11-29 05:56:58,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12764 states, 10520 states have (on average 1.444106463878327) internal successors, (15192), 10679 states have internal predecessors, (15192), 1272 states have call successors, (1272), 826 states have call predecessors, (1272), 970 states have return successors, (2113), 1266 states have call predecessors, (2113), 1269 states have call successors, (2113) [2023-11-29 05:56:58,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12764 states to 12764 states and 18577 transitions. [2023-11-29 05:56:58,636 INFO L78 Accepts]: Start accepts. Automaton has 12764 states and 18577 transitions. Word has length 145 [2023-11-29 05:56:58,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:56:58,637 INFO L495 AbstractCegarLoop]: Abstraction has 12764 states and 18577 transitions. [2023-11-29 05:56:58,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-29 05:56:58,637 INFO L276 IsEmpty]: Start isEmpty. Operand 12764 states and 18577 transitions. [2023-11-29 05:56:58,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-29 05:56:58,654 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:56:58,654 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:58,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 05:56:58,654 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:56:58,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:56:58,654 INFO L85 PathProgramCache]: Analyzing trace with hash -2105371629, now seen corresponding path program 1 times [2023-11-29 05:56:58,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:56:58,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102482455] [2023-11-29 05:56:58,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:58,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:56:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:58,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:56:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:58,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:56:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:58,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:56:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:58,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:56:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:58,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 05:56:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:58,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:56:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:58,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:56:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:58,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 05:56:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:58,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:56:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:58,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 05:56:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:58,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:56:58,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:58,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:56:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:58,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 05:56:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:58,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 05:56:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:58,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-29 05:56:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:58,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-29 05:56:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:58,925 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-11-29 05:56:58,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:56:58,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102482455] [2023-11-29 05:56:58,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102482455] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:56:58,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723610574] [2023-11-29 05:56:58,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:58,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:56:58,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:56:58,927 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:56:58,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 05:56:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:59,038 INFO L262 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 05:56:59,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:56:59,201 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-29 05:56:59,201 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:56:59,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723610574] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:56:59,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:56:59,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2023-11-29 05:56:59,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840068217] [2023-11-29 05:56:59,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:56:59,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:56:59,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:56:59,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:56:59,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:56:59,204 INFO L87 Difference]: Start difference. First operand 12764 states and 18577 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 05:57:00,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:57:00,640 INFO L93 Difference]: Finished difference Result 14874 states and 21169 transitions. [2023-11-29 05:57:00,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:57:00,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 147 [2023-11-29 05:57:00,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:57:00,670 INFO L225 Difference]: With dead ends: 14874 [2023-11-29 05:57:00,670 INFO L226 Difference]: Without dead ends: 13592 [2023-11-29 05:57:00,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:57:00,677 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 167 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:57:00,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 449 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:57:00,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13592 states. [2023-11-29 05:57:01,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13592 to 13553. [2023-11-29 05:57:01,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13553 states, 11166 states have (on average 1.4279061436503673) internal successors, (15944), 11329 states have internal predecessors, (15944), 1342 states have call successors, (1342), 877 states have call predecessors, (1342), 1043 states have return successors, (2224), 1354 states have call predecessors, (2224), 1339 states have call successors, (2224) [2023-11-29 05:57:01,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13553 states to 13553 states and 19510 transitions. [2023-11-29 05:57:01,675 INFO L78 Accepts]: Start accepts. Automaton has 13553 states and 19510 transitions. Word has length 147 [2023-11-29 05:57:01,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:57:01,675 INFO L495 AbstractCegarLoop]: Abstraction has 13553 states and 19510 transitions. [2023-11-29 05:57:01,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 05:57:01,675 INFO L276 IsEmpty]: Start isEmpty. Operand 13553 states and 19510 transitions. [2023-11-29 05:57:01,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-29 05:57:01,690 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:57:01,690 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] [2023-11-29 05:57:01,694 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 05:57:01,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-29 05:57:01,890 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:57:01,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:01,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1177006764, now seen corresponding path program 1 times [2023-11-29 05:57:01,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:57:01,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973385135] [2023-11-29 05:57:01,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:01,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:57:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:01,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:57:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:01,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:57:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:01,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:57:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:01,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:57:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:01,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:57:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:01,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 05:57:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:01,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 05:57:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:01,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:57:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:02,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 05:57:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:02,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:57:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:02,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 05:57:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 05:57:02,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:57:02,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973385135] [2023-11-29 05:57:02,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973385135] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:57:02,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438856636] [2023-11-29 05:57:02,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:02,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:57:02,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:02,017 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:57:02,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 05:57:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:02,145 INFO L262 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:57:02,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:02,226 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:57:02,226 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:57:02,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438856636] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:57:02,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:57:02,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 05:57:02,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277079247] [2023-11-29 05:57:02,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:57:02,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:57:02,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:57:02,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:57:02,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:57:02,229 INFO L87 Difference]: Start difference. First operand 13553 states and 19510 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (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:57:03,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:57:03,240 INFO L93 Difference]: Finished difference Result 23548 states and 34581 transitions. [2023-11-29 05:57:03,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:57:03,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (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 144 [2023-11-29 05:57:03,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:57:03,264 INFO L225 Difference]: With dead ends: 23548 [2023-11-29 05:57:03,264 INFO L226 Difference]: Without dead ends: 13018 [2023-11-29 05:57:03,285 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:57:03,286 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 242 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:57:03,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 303 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:57:03,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13018 states. [2023-11-29 05:57:04,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13018 to 10497. [2023-11-29 05:57:04,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10497 states, 8655 states have (on average 1.3734257654534952) internal successors, (11887), 8754 states have internal predecessors, (11887), 1019 states have call successors, (1019), 707 states have call predecessors, (1019), 821 states have return successors, (1608), 1039 states have call predecessors, (1608), 1016 states have call successors, (1608) [2023-11-29 05:57:04,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10497 states to 10497 states and 14514 transitions. [2023-11-29 05:57:04,215 INFO L78 Accepts]: Start accepts. Automaton has 10497 states and 14514 transitions. Word has length 144 [2023-11-29 05:57:04,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:57:04,215 INFO L495 AbstractCegarLoop]: Abstraction has 10497 states and 14514 transitions. [2023-11-29 05:57:04,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (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:57:04,215 INFO L276 IsEmpty]: Start isEmpty. Operand 10497 states and 14514 transitions. [2023-11-29 05:57:04,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-29 05:57:04,223 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:57:04,223 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] [2023-11-29 05:57:04,227 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 05:57:04,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-29 05:57:04,424 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:57:04,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:04,424 INFO L85 PathProgramCache]: Analyzing trace with hash 815270839, now seen corresponding path program 1 times [2023-11-29 05:57:04,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:57:04,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810555174] [2023-11-29 05:57:04,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:04,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:57:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:04,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:57:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:04,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:57:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:04,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:57:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:04,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:57:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:04,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:57:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:04,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 05:57:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:04,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 05:57:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:04,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:57:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:04,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:57:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:04,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:57:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:04,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 05:57:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:04,544 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:57:04,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:57:04,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810555174] [2023-11-29 05:57:04,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810555174] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:57:04,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684245320] [2023-11-29 05:57:04,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:04,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:57:04,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:04,546 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:57:04,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 05:57:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:04,676 INFO L262 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:57:04,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:04,723 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:57:04,724 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:57:04,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684245320] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:57:04,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:57:04,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 05:57:04,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848765357] [2023-11-29 05:57:04,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:57:04,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:57:04,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:57:04,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:57:04,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:57:04,726 INFO L87 Difference]: Start difference. First operand 10497 states and 14514 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, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 05:57:05,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:57:05,732 INFO L93 Difference]: Finished difference Result 19773 states and 27769 transitions. [2023-11-29 05:57:05,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:57:05,732 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, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 144 [2023-11-29 05:57:05,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:57:05,751 INFO L225 Difference]: With dead ends: 19773 [2023-11-29 05:57:05,751 INFO L226 Difference]: Without dead ends: 11269 [2023-11-29 05:57:05,764 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:57:05,765 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 242 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:57:05,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 428 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:57:05,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11269 states. [2023-11-29 05:57:06,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11269 to 11213. [2023-11-29 05:57:06,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11213 states, 9294 states have (on average 1.3489347966429954) internal successors, (12537), 9393 states have internal predecessors, (12537), 1033 states have call successors, (1033), 763 states have call predecessors, (1033), 884 states have return successors, (1748), 1060 states have call predecessors, (1748), 1030 states have call successors, (1748) [2023-11-29 05:57:06,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11213 states to 11213 states and 15318 transitions. [2023-11-29 05:57:06,888 INFO L78 Accepts]: Start accepts. Automaton has 11213 states and 15318 transitions. Word has length 144 [2023-11-29 05:57:06,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:57:06,888 INFO L495 AbstractCegarLoop]: Abstraction has 11213 states and 15318 transitions. [2023-11-29 05:57:06,888 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, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 05:57:06,889 INFO L276 IsEmpty]: Start isEmpty. Operand 11213 states and 15318 transitions. [2023-11-29 05:57:06,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-29 05:57:06,894 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:57:06,894 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, 1] [2023-11-29 05:57:06,898 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 05:57:07,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-29 05:57:07,095 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:57:07,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:07,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1899172420, now seen corresponding path program 1 times [2023-11-29 05:57:07,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:57:07,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544125274] [2023-11-29 05:57:07,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:07,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:57:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:07,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:57:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:07,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:57:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:07,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:57:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:07,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:57:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:07,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:57:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:07,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:57:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:07,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:57:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:07,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 05:57:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:07,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 05:57:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:07,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:57:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:07,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 05:57:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:07,209 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:57:07,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:57:07,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544125274] [2023-11-29 05:57:07,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544125274] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:57:07,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552632348] [2023-11-29 05:57:07,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:07,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:57:07,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:07,212 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:57:07,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 05:57:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:07,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:57:07,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:07,360 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:57:07,360 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:57:07,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552632348] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:57:07,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:57:07,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 05:57:07,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185747058] [2023-11-29 05:57:07,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:57:07,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:57:07,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:57:07,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:57:07,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:57:07,362 INFO L87 Difference]: Start difference. First operand 11213 states and 15318 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, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 05:57:08,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:57:08,811 INFO L93 Difference]: Finished difference Result 28425 states and 40233 transitions. [2023-11-29 05:57:08,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:57:08,812 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, (12), 3 states have call predecessors, (12), 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:57:08,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:57:08,850 INFO L225 Difference]: With dead ends: 28425 [2023-11-29 05:57:08,851 INFO L226 Difference]: Without dead ends: 19205 [2023-11-29 05:57:08,867 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:57:08,867 INFO L413 NwaCegarLoop]: 427 mSDtfsCounter, 145 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:57:08,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 702 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:57:08,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19205 states. [2023-11-29 05:57:10,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19205 to 19201. [2023-11-29 05:57:10,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19201 states, 15907 states have (on average 1.3535550386622242) internal successors, (21531), 16087 states have internal predecessors, (21531), 1801 states have call successors, (1801), 1304 states have call predecessors, (1801), 1491 states have return successors, (3731), 1817 states have call predecessors, (3731), 1798 states have call successors, (3731) [2023-11-29 05:57:10,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19201 states to 19201 states and 27063 transitions. [2023-11-29 05:57:10,345 INFO L78 Accepts]: Start accepts. Automaton has 19201 states and 27063 transitions. Word has length 145 [2023-11-29 05:57:10,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:57:10,345 INFO L495 AbstractCegarLoop]: Abstraction has 19201 states and 27063 transitions. [2023-11-29 05:57:10,345 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, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 05:57:10,345 INFO L276 IsEmpty]: Start isEmpty. Operand 19201 states and 27063 transitions. [2023-11-29 05:57:10,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-29 05:57:10,357 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:57:10,357 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, 1] [2023-11-29 05:57:10,362 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-29 05:57:10,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:57:10,557 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:57:10,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:10,558 INFO L85 PathProgramCache]: Analyzing trace with hash 24988096, now seen corresponding path program 1 times [2023-11-29 05:57:10,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:57:10,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770782026] [2023-11-29 05:57:10,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:10,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:57:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:10,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:57:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:10,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:57:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:10,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:57:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:10,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:57:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:10,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:57:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:10,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:57:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:10,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:57:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:10,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 05:57:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:10,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:57:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:10,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:57:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:10,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-29 05:57:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:10,649 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:57:10,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:57:10,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770782026] [2023-11-29 05:57:10,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770782026] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:57:10,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085165272] [2023-11-29 05:57:10,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:10,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:57:10,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:10,651 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:57:10,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 05:57:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:10,768 INFO L262 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:57:10,771 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:10,812 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:57:10,813 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:57:10,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085165272] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:57:10,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:57:10,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 05:57:10,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446310731] [2023-11-29 05:57:10,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:57:10,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:57:10,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:57:10,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:57:10,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:57:10,815 INFO L87 Difference]: Start difference. First operand 19201 states and 27063 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, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 05:57:12,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:57:12,256 INFO L93 Difference]: Finished difference Result 36435 states and 52788 transitions. [2023-11-29 05:57:12,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:57:12,257 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, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 146 [2023-11-29 05:57:12,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:57:12,312 INFO L225 Difference]: With dead ends: 36435 [2023-11-29 05:57:12,312 INFO L226 Difference]: Without dead ends: 19891 [2023-11-29 05:57:12,338 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:57:12,338 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 261 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:57:12,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 307 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:57:12,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19891 states. [2023-11-29 05:57:14,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19891 to 18321. [2023-11-29 05:57:14,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18321 states, 15171 states have (on average 1.3170522707797772) internal successors, (19981), 15325 states have internal predecessors, (19981), 1729 states have call successors, (1729), 1244 states have call predecessors, (1729), 1419 states have return successors, (3178), 1755 states have call predecessors, (3178), 1726 states have call successors, (3178) [2023-11-29 05:57:14,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18321 states to 18321 states and 24888 transitions. [2023-11-29 05:57:14,135 INFO L78 Accepts]: Start accepts. Automaton has 18321 states and 24888 transitions. Word has length 146 [2023-11-29 05:57:14,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:57:14,135 INFO L495 AbstractCegarLoop]: Abstraction has 18321 states and 24888 transitions. [2023-11-29 05:57:14,135 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, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 05:57:14,135 INFO L276 IsEmpty]: Start isEmpty. Operand 18321 states and 24888 transitions. [2023-11-29 05:57:14,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-29 05:57:14,145 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:57:14,145 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, 1] [2023-11-29 05:57:14,150 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 05:57:14,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:57:14,346 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:57:14,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:14,346 INFO L85 PathProgramCache]: Analyzing trace with hash -162275649, now seen corresponding path program 1 times [2023-11-29 05:57:14,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:57:14,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954540069] [2023-11-29 05:57:14,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:14,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:57:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:14,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:57:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:14,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:57:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:14,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:57:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:14,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:57:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:14,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:57:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:14,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:57:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:14,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:57:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:14,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 05:57:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:14,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:57:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:14,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:57:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:14,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-29 05:57:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:14,458 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:57:14,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:57:14,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954540069] [2023-11-29 05:57:14,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954540069] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:57:14,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340569850] [2023-11-29 05:57:14,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:14,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:57:14,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:14,460 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:57:14,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 05:57:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:14,574 INFO L262 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:57:14,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:14,592 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:57:14,592 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:57:14,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340569850] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:57:14,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:57:14,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 05:57:14,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100183205] [2023-11-29 05:57:14,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:57:14,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:57:14,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:57:14,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:57:14,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:57:14,594 INFO L87 Difference]: Start difference. First operand 18321 states and 24888 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, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 05:57:17,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:57:17,109 INFO L93 Difference]: Finished difference Result 49954 states and 69553 transitions. [2023-11-29 05:57:17,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:57:17,110 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, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 146 [2023-11-29 05:57:17,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:57:17,195 INFO L225 Difference]: With dead ends: 49954 [2023-11-29 05:57:17,196 INFO L226 Difference]: Without dead ends: 33630 [2023-11-29 05:57:17,218 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:57:17,218 INFO L413 NwaCegarLoop]: 421 mSDtfsCounter, 151 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:57:17,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 691 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:57:17,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33630 states. [2023-11-29 05:57:19,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33630 to 33626. [2023-11-29 05:57:19,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33626 states, 27942 states have (on average 1.3123613198768878) internal successors, (36670), 28232 states have internal predecessors, (36670), 3139 states have call successors, (3139), 2276 states have call predecessors, (3139), 2543 states have return successors, (6792), 3125 states have call predecessors, (6792), 3136 states have call successors, (6792) [2023-11-29 05:57:20,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33626 states to 33626 states and 46601 transitions. [2023-11-29 05:57:20,039 INFO L78 Accepts]: Start accepts. Automaton has 33626 states and 46601 transitions. Word has length 146 [2023-11-29 05:57:20,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:57:20,040 INFO L495 AbstractCegarLoop]: Abstraction has 33626 states and 46601 transitions. [2023-11-29 05:57:20,040 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, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 05:57:20,040 INFO L276 IsEmpty]: Start isEmpty. Operand 33626 states and 46601 transitions. [2023-11-29 05:57:20,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-29 05:57:20,058 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:57:20,059 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, 1] [2023-11-29 05:57:20,064 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 05:57:20,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:57:20,259 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:57:20,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:20,260 INFO L85 PathProgramCache]: Analyzing trace with hash -610348148, now seen corresponding path program 1 times [2023-11-29 05:57:20,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:57:20,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137160589] [2023-11-29 05:57:20,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:20,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:57:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:20,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:57:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:20,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:57:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:20,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:57:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:20,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:57:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:20,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:57:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:20,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 05:57:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:20,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 05:57:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:20,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:57:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:20,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 05:57:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:20,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:57:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:20,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-29 05:57:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:20,369 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:57:20,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:57:20,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137160589] [2023-11-29 05:57:20,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137160589] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:57:20,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886473614] [2023-11-29 05:57:20,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:20,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:57:20,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:20,371 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:57:20,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 05:57:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:20,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:57:20,503 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:20,551 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:57:20,552 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:57:20,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886473614] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:57:20,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:57:20,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 05:57:20,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453046984] [2023-11-29 05:57:20,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:57:20,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:57:20,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:57:20,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:57:20,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:57:20,554 INFO L87 Difference]: Start difference. First operand 33626 states and 46601 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, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 05:57:23,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:57:23,839 INFO L93 Difference]: Finished difference Result 60180 states and 84013 transitions. [2023-11-29 05:57:23,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:57:23,840 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, (10), 3 states have call predecessors, (10), 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:57:23,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:57:23,941 INFO L225 Difference]: With dead ends: 60180 [2023-11-29 05:57:23,942 INFO L226 Difference]: Without dead ends: 35512 [2023-11-29 05:57:23,986 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:57:23,987 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 256 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:57:23,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 449 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:57:24,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35512 states. [2023-11-29 05:57:27,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35512 to 35196. [2023-11-29 05:57:27,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35196 states, 29420 states have (on average 1.303704962610469) internal successors, (38355), 29738 states have internal predecessors, (38355), 3139 states have call successors, (3139), 2340 states have call predecessors, (3139), 2635 states have return successors, (7056), 3125 states have call predecessors, (7056), 3136 states have call successors, (7056) [2023-11-29 05:57:27,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35196 states to 35196 states and 48550 transitions. [2023-11-29 05:57:27,377 INFO L78 Accepts]: Start accepts. Automaton has 35196 states and 48550 transitions. Word has length 146 [2023-11-29 05:57:27,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:57:27,377 INFO L495 AbstractCegarLoop]: Abstraction has 35196 states and 48550 transitions. [2023-11-29 05:57:27,377 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, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 05:57:27,378 INFO L276 IsEmpty]: Start isEmpty. Operand 35196 states and 48550 transitions. [2023-11-29 05:57:27,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-29 05:57:27,398 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:57:27,398 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:57:27,405 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 05:57:27,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:57:27,599 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:57:27,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:27,599 INFO L85 PathProgramCache]: Analyzing trace with hash 608475726, now seen corresponding path program 1 times [2023-11-29 05:57:27,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:57:27,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859925248] [2023-11-29 05:57:27,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:27,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:57:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:27,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:57:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:27,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:57:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:27,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:57:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:27,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:57:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:27,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:57:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:27,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 05:57:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:27,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 05:57:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:27,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:57:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:27,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 05:57:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:27,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:57:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:27,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-29 05:57:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:27,680 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:57:27,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:57:27,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859925248] [2023-11-29 05:57:27,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859925248] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:57:27,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:57:27,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:57:27,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483244183] [2023-11-29 05:57:27,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:57:27,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:57:27,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:57:27,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:57:27,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:57:27,682 INFO L87 Difference]: Start difference. First operand 35196 states and 48550 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, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 05:57:30,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:57:30,824 INFO L93 Difference]: Finished difference Result 69430 states and 95500 transitions. [2023-11-29 05:57:30,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:57:30,825 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, (9), 4 states have call predecessors, (9), 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:57:30,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:57:30,919 INFO L225 Difference]: With dead ends: 69430 [2023-11-29 05:57:30,919 INFO L226 Difference]: Without dead ends: 36229 [2023-11-29 05:57:30,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:57:30,965 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 381 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:57:30,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 437 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:57:30,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36229 states. [2023-11-29 05:57:33,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36229 to 32628. [2023-11-29 05:57:33,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32628 states, 27475 states have (on average 1.3048589626933575) internal successors, (35851), 28097 states have internal predecessors, (35851), 2493 states have call successors, (2493), 1864 states have call predecessors, (2493), 2658 states have return successors, (6516), 2670 states have call predecessors, (6516), 2490 states have call successors, (6516) [2023-11-29 05:57:33,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32628 states to 32628 states and 44860 transitions. [2023-11-29 05:57:33,960 INFO L78 Accepts]: Start accepts. Automaton has 32628 states and 44860 transitions. Word has length 146 [2023-11-29 05:57:33,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:57:33,960 INFO L495 AbstractCegarLoop]: Abstraction has 32628 states and 44860 transitions. [2023-11-29 05:57:33,960 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, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 05:57:33,960 INFO L276 IsEmpty]: Start isEmpty. Operand 32628 states and 44860 transitions. [2023-11-29 05:57:33,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-29 05:57:33,975 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:57:33,975 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:57:33,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-29 05:57:33,975 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:57:33,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:33,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1159576366, now seen corresponding path program 1 times [2023-11-29 05:57:33,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:57:33,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427524445] [2023-11-29 05:57:33,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:33,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:57:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:34,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:57:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:34,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:57:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:34,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:57:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:34,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:57:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:34,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:57:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:34,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 05:57:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:34,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 05:57:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:34,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:57:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:34,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 05:57:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:34,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:57:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:34,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 05:57:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:34,108 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:57:34,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:57:34,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427524445] [2023-11-29 05:57:34,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427524445] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:57:34,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150189286] [2023-11-29 05:57:34,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:34,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:57:34,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:34,111 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:57:34,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 05:57:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:34,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:57:34,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:34,309 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:57:34,309 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:57:34,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150189286] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:57:34,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:57:34,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 05:57:34,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407589600] [2023-11-29 05:57:34,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:57:34,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:57:34,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:57:34,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:57:34,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:57:34,311 INFO L87 Difference]: Start difference. First operand 32628 states and 44860 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, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 05:57:37,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:57:37,530 INFO L93 Difference]: Finished difference Result 56073 states and 77522 transitions. [2023-11-29 05:57:37,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:57:37,531 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, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 147 [2023-11-29 05:57:37,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:57:37,614 INFO L225 Difference]: With dead ends: 56073 [2023-11-29 05:57:37,614 INFO L226 Difference]: Without dead ends: 32968 [2023-11-29 05:57:37,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 168 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:57:37,654 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 257 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:57:37,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 452 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:57:37,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32968 states. [2023-11-29 05:57:40,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32968 to 32628. [2023-11-29 05:57:40,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32628 states, 27475 states have (on average 1.2994358507734305) internal successors, (35702), 28097 states have internal predecessors, (35702), 2493 states have call successors, (2493), 1864 states have call predecessors, (2493), 2658 states have return successors, (6516), 2670 states have call predecessors, (6516), 2490 states have call successors, (6516) [2023-11-29 05:57:40,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32628 states to 32628 states and 44711 transitions. [2023-11-29 05:57:40,625 INFO L78 Accepts]: Start accepts. Automaton has 32628 states and 44711 transitions. Word has length 147 [2023-11-29 05:57:40,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:57:40,626 INFO L495 AbstractCegarLoop]: Abstraction has 32628 states and 44711 transitions. [2023-11-29 05:57:40,626 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, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 05:57:40,626 INFO L276 IsEmpty]: Start isEmpty. Operand 32628 states and 44711 transitions. [2023-11-29 05:57:40,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-29 05:57:40,641 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:57:40,641 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:57:40,646 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-29 05:57:40,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:57:40,841 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:57:40,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:40,842 INFO L85 PathProgramCache]: Analyzing trace with hash -203733610, now seen corresponding path program 1 times [2023-11-29 05:57:40,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:57:40,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132480170] [2023-11-29 05:57:40,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:40,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:57:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:40,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:57:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:40,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:57:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:40,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:57:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:40,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:57:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:40,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:57:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:40,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 05:57:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:40,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 05:57:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:40,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:57:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:40,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 05:57:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:40,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:57:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:40,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 05:57:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:40,929 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:57:40,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:57:40,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132480170] [2023-11-29 05:57:40,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132480170] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:57:40,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:57:40,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:57:40,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470761586] [2023-11-29 05:57:40,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:57:40,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:57:40,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:57:40,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:57:40,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:57:40,932 INFO L87 Difference]: Start difference. First operand 32628 states and 44711 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, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 05:57:43,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:57:43,670 INFO L93 Difference]: Finished difference Result 58134 states and 79532 transitions. [2023-11-29 05:57:43,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:57:43,670 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, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 147 [2023-11-29 05:57:43,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:57:43,735 INFO L225 Difference]: With dead ends: 58134 [2023-11-29 05:57:43,735 INFO L226 Difference]: Without dead ends: 27498 [2023-11-29 05:57:43,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:57:43,778 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 379 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:57:43,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 435 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:57:43,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27498 states. [2023-11-29 05:57:46,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27498 to 24578. [2023-11-29 05:57:46,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24578 states, 20725 states have (on average 1.3080820265379975) internal successors, (27110), 21160 states have internal predecessors, (27110), 1877 states have call successors, (1877), 1412 states have call predecessors, (1877), 1974 states have return successors, (4556), 2007 states have call predecessors, (4556), 1874 states have call successors, (4556) [2023-11-29 05:57:46,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24578 states to 24578 states and 33543 transitions. [2023-11-29 05:57:46,192 INFO L78 Accepts]: Start accepts. Automaton has 24578 states and 33543 transitions. Word has length 147 [2023-11-29 05:57:46,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:57:46,193 INFO L495 AbstractCegarLoop]: Abstraction has 24578 states and 33543 transitions. [2023-11-29 05:57:46,193 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, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 05:57:46,193 INFO L276 IsEmpty]: Start isEmpty. Operand 24578 states and 33543 transitions. [2023-11-29 05:57:46,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-29 05:57:46,205 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:57:46,205 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, 1] [2023-11-29 05:57:46,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-11-29 05:57:46,205 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:57:46,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:46,206 INFO L85 PathProgramCache]: Analyzing trace with hash -2013377300, now seen corresponding path program 1 times [2023-11-29 05:57:46,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:57:46,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230673432] [2023-11-29 05:57:46,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:46,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:57:46,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:46,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:57:46,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:46,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:57:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:46,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:57:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:46,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:57:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:46,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:57:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:46,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:57:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:46,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:57:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:46,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:57:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:46,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:57:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:46,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:57:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:46,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-29 05:57:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:46,333 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:57:46,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:57:46,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230673432] [2023-11-29 05:57:46,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230673432] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:57:46,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874101246] [2023-11-29 05:57:46,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:46,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:57:46,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:46,335 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:57:46,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-29 05:57:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:46,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:57:46,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:46,515 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:57:46,516 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:57:46,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874101246] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:57:46,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:57:46,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 05:57:46,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892523568] [2023-11-29 05:57:46,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:57:46,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:57:46,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:57:46,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:57:46,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:57:46,518 INFO L87 Difference]: Start difference. First operand 24578 states and 33543 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, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 05:57:48,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:57:48,663 INFO L93 Difference]: Finished difference Result 39441 states and 56728 transitions. [2023-11-29 05:57:48,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:57:48,664 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, (12), 3 states have call predecessors, (12), 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:57:48,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:57:48,842 INFO L225 Difference]: With dead ends: 39441 [2023-11-29 05:57:48,842 INFO L226 Difference]: Without dead ends: 24638 [2023-11-29 05:57:48,862 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:57:48,863 INFO L413 NwaCegarLoop]: 393 mSDtfsCounter, 131 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:57:48,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 653 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:57:48,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24638 states. [2023-11-29 05:57:50,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24638 to 24578. [2023-11-29 05:57:51,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24578 states, 20725 states have (on average 1.2827020506634499) internal successors, (26584), 21160 states have internal predecessors, (26584), 1877 states have call successors, (1877), 1412 states have call predecessors, (1877), 1974 states have return successors, (4556), 2007 states have call predecessors, (4556), 1874 states have call successors, (4556) [2023-11-29 05:57:51,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24578 states to 24578 states and 33017 transitions. [2023-11-29 05:57:51,087 INFO L78 Accepts]: Start accepts. Automaton has 24578 states and 33017 transitions. Word has length 150 [2023-11-29 05:57:51,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:57:51,088 INFO L495 AbstractCegarLoop]: Abstraction has 24578 states and 33017 transitions. [2023-11-29 05:57:51,088 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, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 05:57:51,088 INFO L276 IsEmpty]: Start isEmpty. Operand 24578 states and 33017 transitions. [2023-11-29 05:57:51,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-29 05:57:51,100 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:57:51,100 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, 1] [2023-11-29 05:57:51,106 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-29 05:57:51,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:57:51,301 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:57:51,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:51,301 INFO L85 PathProgramCache]: Analyzing trace with hash 800787724, now seen corresponding path program 1 times [2023-11-29 05:57:51,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:57:51,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377067639] [2023-11-29 05:57:51,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:51,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:57:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:51,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:57:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:51,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:57:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:51,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:57:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:51,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:57:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:51,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:57:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:51,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:57:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:51,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:57:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:51,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:57:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:51,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:57:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:51,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:57:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:51,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-29 05:57:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:51,418 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:57:51,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:57:51,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377067639] [2023-11-29 05:57:51,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377067639] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:57:51,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157239403] [2023-11-29 05:57:51,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:51,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:57:51,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:51,421 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:57:51,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-29 05:57:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:51,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:57:51,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:51,623 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:57:51,624 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:57:51,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157239403] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:57:51,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:57:51,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 05:57:51,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789712988] [2023-11-29 05:57:51,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:57:51,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:57:51,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:57:51,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:57:51,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:57:51,626 INFO L87 Difference]: Start difference. First operand 24578 states and 33017 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, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-29 05:57:53,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:57:53,602 INFO L93 Difference]: Finished difference Result 47665 states and 66342 transitions. [2023-11-29 05:57:53,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:57:53,602 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, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 150 [2023-11-29 05:57:53,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:57:53,657 INFO L225 Difference]: With dead ends: 47665 [2023-11-29 05:57:53,657 INFO L226 Difference]: Without dead ends: 25080 [2023-11-29 05:57:53,692 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:57:53,693 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 248 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:57:53,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 296 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:57:53,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25080 states. [2023-11-29 05:57:55,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25080 to 20812. [2023-11-29 05:57:55,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20812 states, 17574 states have (on average 1.2482075793786276) internal successors, (21936), 17943 states have internal predecessors, (21936), 1561 states have call successors, (1561), 1188 states have call predecessors, (1561), 1675 states have return successors, (3312), 1682 states have call predecessors, (3312), 1558 states have call successors, (3312) [2023-11-29 05:57:55,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20812 states to 20812 states and 26809 transitions. [2023-11-29 05:57:55,410 INFO L78 Accepts]: Start accepts. Automaton has 20812 states and 26809 transitions. Word has length 150 [2023-11-29 05:57:55,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:57:55,410 INFO L495 AbstractCegarLoop]: Abstraction has 20812 states and 26809 transitions. [2023-11-29 05:57:55,410 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, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-29 05:57:55,411 INFO L276 IsEmpty]: Start isEmpty. Operand 20812 states and 26809 transitions. [2023-11-29 05:57:55,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-29 05:57:55,425 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:57:55,425 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:57:55,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-29 05:57:55,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:57:55,626 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:57:55,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:55,626 INFO L85 PathProgramCache]: Analyzing trace with hash 874362032, now seen corresponding path program 1 times [2023-11-29 05:57:55,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:57:55,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297022365] [2023-11-29 05:57:55,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:55,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:57:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:55,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:57:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:55,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:57:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:55,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:57:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:55,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:57:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:55,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:57:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:55,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:57:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:55,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:57:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:55,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:57:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:55,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 05:57:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:55,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:57:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:55,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 05:57:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:55,721 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:57:55,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:57:55,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297022365] [2023-11-29 05:57:55,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297022365] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:57:55,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918530783] [2023-11-29 05:57:55,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:55,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:57:55,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:55,723 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:57:55,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-29 05:57:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:55,822 INFO L262 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:57:55,825 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:55,889 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:57:55,889 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:57:55,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918530783] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:57:55,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:57:55,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 05:57:55,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576543072] [2023-11-29 05:57:55,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:57:55,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:57:55,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:57:55,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:57:55,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:57:55,891 INFO L87 Difference]: Start difference. First operand 20812 states and 26809 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, (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:57:57,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:57:57,482 INFO L93 Difference]: Finished difference Result 33324 states and 44759 transitions. [2023-11-29 05:57:57,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:57:57,483 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, (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 151 [2023-11-29 05:57:57,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:57:57,525 INFO L225 Difference]: With dead ends: 33324 [2023-11-29 05:57:57,526 INFO L226 Difference]: Without dead ends: 20454 [2023-11-29 05:57:57,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 172 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:57:57,550 INFO L413 NwaCegarLoop]: 360 mSDtfsCounter, 108 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:57:57,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 616 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:57:57,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20454 states. [2023-11-29 05:57:59,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20454 to 20284. [2023-11-29 05:57:59,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20284 states, 17112 states have (on average 1.2232351566152408) internal successors, (20932), 17448 states have internal predecessors, (20932), 1561 states have call successors, (1561), 1188 states have call predecessors, (1561), 1609 states have return successors, (3208), 1649 states have call predecessors, (3208), 1558 states have call successors, (3208) [2023-11-29 05:57:59,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20284 states to 20284 states and 25701 transitions. [2023-11-29 05:57:59,339 INFO L78 Accepts]: Start accepts. Automaton has 20284 states and 25701 transitions. Word has length 151 [2023-11-29 05:57:59,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:57:59,340 INFO L495 AbstractCegarLoop]: Abstraction has 20284 states and 25701 transitions. [2023-11-29 05:57:59,340 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, (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:57:59,340 INFO L276 IsEmpty]: Start isEmpty. Operand 20284 states and 25701 transitions. [2023-11-29 05:57:59,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-29 05:57:59,350 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:57:59,350 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, 1] [2023-11-29 05:57:59,355 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-11-29 05:57:59,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:57:59,551 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:57:59,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:59,551 INFO L85 PathProgramCache]: Analyzing trace with hash -959580616, now seen corresponding path program 1 times [2023-11-29 05:57:59,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:57:59,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362771268] [2023-11-29 05:57:59,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:59,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:57:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:59,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:57:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:59,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:57:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:59,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:57:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:59,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:57:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:59,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:57:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:59,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:57:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:59,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:57:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:59,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:57:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:59,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 05:57:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:59,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:57:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:59,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-29 05:57:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:59,644 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:57:59,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:57:59,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362771268] [2023-11-29 05:57:59,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362771268] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:57:59,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368514151] [2023-11-29 05:57:59,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:59,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:57:59,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:59,646 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:57:59,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-29 05:57:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:59,754 INFO L262 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:57:59,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:59,833 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:57:59,833 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:57:59,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368514151] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:57:59,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:57:59,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-11-29 05:57:59,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473961941] [2023-11-29 05:57:59,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:57:59,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:57:59,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:57:59,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:57:59,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:57:59,835 INFO L87 Difference]: Start difference. First operand 20284 states and 25701 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, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 05:58:01,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:58:01,997 INFO L93 Difference]: Finished difference Result 38577 states and 49410 transitions. [2023-11-29 05:58:01,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:58:01,998 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, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 152 [2023-11-29 05:58:01,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:58:02,036 INFO L225 Difference]: With dead ends: 38577 [2023-11-29 05:58:02,036 INFO L226 Difference]: Without dead ends: 20284 [2023-11-29 05:58:02,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 171 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:58:02,056 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 329 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:58:02,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 399 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:58:02,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20284 states. [2023-11-29 05:58:03,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20284 to 20284. [2023-11-29 05:58:03,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20284 states, 17112 states have (on average 1.1969378214118747) internal successors, (20482), 17448 states have internal predecessors, (20482), 1561 states have call successors, (1561), 1188 states have call predecessors, (1561), 1609 states have return successors, (3208), 1649 states have call predecessors, (3208), 1558 states have call successors, (3208) [2023-11-29 05:58:03,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20284 states to 20284 states and 25251 transitions. [2023-11-29 05:58:03,971 INFO L78 Accepts]: Start accepts. Automaton has 20284 states and 25251 transitions. Word has length 152 [2023-11-29 05:58:03,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:58:03,972 INFO L495 AbstractCegarLoop]: Abstraction has 20284 states and 25251 transitions. [2023-11-29 05:58:03,972 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, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 05:58:03,972 INFO L276 IsEmpty]: Start isEmpty. Operand 20284 states and 25251 transitions. [2023-11-29 05:58:03,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-29 05:58:03,982 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:58:03,982 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, 1] [2023-11-29 05:58:03,987 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-11-29 05:58:04,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:58:04,182 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:58:04,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:58:04,183 INFO L85 PathProgramCache]: Analyzing trace with hash -488224266, now seen corresponding path program 1 times [2023-11-29 05:58:04,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:58:04,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263728092] [2023-11-29 05:58:04,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:58:04,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:58:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:04,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:58:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:04,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:58:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:04,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:58:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:04,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:58:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:04,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:58:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:04,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:58:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:04,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:58:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:04,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:58:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:04,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 05:58:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:04,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:58:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:04,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-29 05:58:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:04,282 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:58:04,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:58:04,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263728092] [2023-11-29 05:58:04,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263728092] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:58:04,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523548807] [2023-11-29 05:58:04,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:58:04,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:58:04,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:58:04,284 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:58:04,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-29 05:58:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:04,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:58:04,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:58:04,470 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:58:04,470 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:58:04,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523548807] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:58:04,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:58:04,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-11-29 05:58:04,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768553517] [2023-11-29 05:58:04,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:58:04,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:58:04,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:58:04,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:58:04,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:58:04,472 INFO L87 Difference]: Start difference. First operand 20284 states and 25251 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, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 05:58:06,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:58:06,551 INFO L93 Difference]: Finished difference Result 30694 states and 38666 transitions. [2023-11-29 05:58:06,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:58:06,551 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, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 152 [2023-11-29 05:58:06,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:58:06,586 INFO L225 Difference]: With dead ends: 30694 [2023-11-29 05:58:06,586 INFO L226 Difference]: Without dead ends: 17826 [2023-11-29 05:58:06,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:58:06,605 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 325 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:58:06,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 392 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:58:06,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17826 states. [2023-11-29 05:58:08,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17826 to 13299. [2023-11-29 05:58:08,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13299 states, 11211 states have (on average 1.1778610293461778) internal successors, (13205), 11412 states have internal predecessors, (13205), 1038 states have call successors, (1038), 779 states have call predecessors, (1038), 1048 states have return successors, (2116), 1108 states have call predecessors, (2116), 1035 states have call successors, (2116) [2023-11-29 05:58:08,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13299 states to 13299 states and 16359 transitions. [2023-11-29 05:58:08,076 INFO L78 Accepts]: Start accepts. Automaton has 13299 states and 16359 transitions. Word has length 152 [2023-11-29 05:58:08,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:58:08,077 INFO L495 AbstractCegarLoop]: Abstraction has 13299 states and 16359 transitions. [2023-11-29 05:58:08,077 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, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 05:58:08,077 INFO L276 IsEmpty]: Start isEmpty. Operand 13299 states and 16359 transitions. [2023-11-29 05:58:08,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-29 05:58:08,082 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:58:08,083 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, 1] [2023-11-29 05:58:08,088 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-11-29 05:58:08,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:58:08,283 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:58:08,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:58:08,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1238920696, now seen corresponding path program 1 times [2023-11-29 05:58:08,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:58:08,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118322869] [2023-11-29 05:58:08,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:58:08,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:58:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:08,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:58:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:08,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:58:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:08,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:58:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:08,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:58:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:08,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:58:08,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:08,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:58:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:08,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:58:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:08,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:58:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:08,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 05:58:08,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:08,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:58:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:08,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-29 05:58:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:08,385 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:58:08,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:58:08,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118322869] [2023-11-29 05:58:08,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118322869] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:58:08,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274632115] [2023-11-29 05:58:08,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:58:08,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:58:08,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:58:08,387 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:58:08,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-29 05:58:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:08,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 05:58:08,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:58:08,545 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:58:08,545 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:58:08,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274632115] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:58:08,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:58:08,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-11-29 05:58:08,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644883825] [2023-11-29 05:58:08,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:58:08,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:58:08,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:58:08,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:58:08,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:58:08,547 INFO L87 Difference]: Start difference. First operand 13299 states and 16359 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 05:58:09,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:58:09,952 INFO L93 Difference]: Finished difference Result 23025 states and 28823 transitions. [2023-11-29 05:58:09,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:58:09,953 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 152 [2023-11-29 05:58:09,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:58:09,971 INFO L225 Difference]: With dead ends: 23025 [2023-11-29 05:58:09,971 INFO L226 Difference]: Without dead ends: 9834 [2023-11-29 05:58:09,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 174 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:58:09,990 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 20 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:58:09,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 787 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:58:09,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9834 states. [2023-11-29 05:58:11,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9834 to 9712. [2023-11-29 05:58:11,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9712 states, 8108 states have (on average 1.1581154415392205) internal successors, (9390), 8248 states have internal predecessors, (9390), 799 states have call successors, (799), 605 states have call predecessors, (799), 803 states have return successors, (1364), 859 states have call predecessors, (1364), 796 states have call successors, (1364) [2023-11-29 05:58:11,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9712 states to 9712 states and 11553 transitions. [2023-11-29 05:58:11,098 INFO L78 Accepts]: Start accepts. Automaton has 9712 states and 11553 transitions. Word has length 152 [2023-11-29 05:58:11,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:58:11,098 INFO L495 AbstractCegarLoop]: Abstraction has 9712 states and 11553 transitions. [2023-11-29 05:58:11,099 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 05:58:11,099 INFO L276 IsEmpty]: Start isEmpty. Operand 9712 states and 11553 transitions. [2023-11-29 05:58:11,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-29 05:58:11,102 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:58:11,102 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, 1] [2023-11-29 05:58:11,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-11-29 05:58:11,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:58:11,303 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:58:11,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:58:11,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1951251100, now seen corresponding path program 1 times [2023-11-29 05:58:11,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:58:11,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636754294] [2023-11-29 05:58:11,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:58:11,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:58:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:11,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:58:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:11,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:58:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:11,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:58:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:11,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:58:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:11,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:58:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:11,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:58:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:11,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:58:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:11,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:58:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:11,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 05:58:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:11,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:58:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:11,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-29 05:58:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:11,401 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:58:11,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:58:11,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636754294] [2023-11-29 05:58:11,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636754294] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:58:11,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985814796] [2023-11-29 05:58:11,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:58:11,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:58:11,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:58:11,403 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:58:11,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-29 05:58:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:11,516 INFO L262 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 05:58:11,518 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:58:11,526 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:58:11,527 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:58:11,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985814796] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:58:11,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:58:11,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-11-29 05:58:11,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774310751] [2023-11-29 05:58:11,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:58:11,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:58:11,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:58:11,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:58:11,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:58:11,529 INFO L87 Difference]: Start difference. First operand 9712 states and 11553 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 05:58:12,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:58:12,619 INFO L93 Difference]: Finished difference Result 16572 states and 20079 transitions. [2023-11-29 05:58:12,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:58:12,619 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 152 [2023-11-29 05:58:12,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:58:12,632 INFO L225 Difference]: With dead ends: 16572 [2023-11-29 05:58:12,632 INFO L226 Difference]: Without dead ends: 8852 [2023-11-29 05:58:12,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 174 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:58:12,640 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 11 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:58:12,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 789 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:58:12,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8852 states. [2023-11-29 05:58:13,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8852 to 8832. [2023-11-29 05:58:13,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8832 states, 7343 states have (on average 1.1424485904943484) internal successors, (8389), 7465 states have internal predecessors, (8389), 747 states have call successors, (747), 564 states have call predecessors, (747), 740 states have return successors, (1209), 803 states have call predecessors, (1209), 744 states have call successors, (1209) [2023-11-29 05:58:13,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8832 states to 8832 states and 10345 transitions. [2023-11-29 05:58:13,670 INFO L78 Accepts]: Start accepts. Automaton has 8832 states and 10345 transitions. Word has length 152 [2023-11-29 05:58:13,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:58:13,670 INFO L495 AbstractCegarLoop]: Abstraction has 8832 states and 10345 transitions. [2023-11-29 05:58:13,670 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 05:58:13,670 INFO L276 IsEmpty]: Start isEmpty. Operand 8832 states and 10345 transitions. [2023-11-29 05:58:13,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-29 05:58:13,673 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:58:13,673 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, 1] [2023-11-29 05:58:13,678 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-11-29 05:58:13,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:58:13,874 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:58:13,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:58:13,874 INFO L85 PathProgramCache]: Analyzing trace with hash -387512990, now seen corresponding path program 1 times [2023-11-29 05:58:13,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:58:13,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058155376] [2023-11-29 05:58:13,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:58:13,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:58:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:13,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:58:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:13,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:58:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:13,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:58:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:13,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:58:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:13,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:58:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:13,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:58:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:13,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:58:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:13,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:58:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:13,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 05:58:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:13,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:58:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:13,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-29 05:58:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:13,984 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:58:13,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:58:13,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058155376] [2023-11-29 05:58:13,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058155376] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:58:13,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596932677] [2023-11-29 05:58:13,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:58:13,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:58:13,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:58:13,986 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:58:13,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-29 05:58:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:14,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 05:58:14,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:58:14,113 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:58:14,113 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:58:14,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596932677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:58:14,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:58:14,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-11-29 05:58:14,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605402720] [2023-11-29 05:58:14,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:58:14,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:58:14,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:58:14,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:58:14,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:58:14,115 INFO L87 Difference]: Start difference. First operand 8832 states and 10345 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 05:58:14,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:58:14,782 INFO L93 Difference]: Finished difference Result 11697 states and 13673 transitions. [2023-11-29 05:58:14,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:58:14,783 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 152 [2023-11-29 05:58:14,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:58:14,789 INFO L225 Difference]: With dead ends: 11697 [2023-11-29 05:58:14,789 INFO L226 Difference]: Without dead ends: 3883 [2023-11-29 05:58:14,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 174 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:58:14,797 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 2 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:58:14,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 790 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:58:14,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3883 states. [2023-11-29 05:58:15,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3883 to 3883. [2023-11-29 05:58:15,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3883 states, 3188 states have (on average 1.140840652446675) internal successors, (3637), 3217 states have internal predecessors, (3637), 362 states have call successors, (362), 268 states have call predecessors, (362), 331 states have return successors, (464), 398 states have call predecessors, (464), 359 states have call successors, (464) [2023-11-29 05:58:15,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3883 states to 3883 states and 4463 transitions. [2023-11-29 05:58:15,326 INFO L78 Accepts]: Start accepts. Automaton has 3883 states and 4463 transitions. Word has length 152 [2023-11-29 05:58:15,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:58:15,326 INFO L495 AbstractCegarLoop]: Abstraction has 3883 states and 4463 transitions. [2023-11-29 05:58:15,326 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 05:58:15,326 INFO L276 IsEmpty]: Start isEmpty. Operand 3883 states and 4463 transitions. [2023-11-29 05:58:15,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2023-11-29 05:58:15,328 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:58:15,329 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, 1] [2023-11-29 05:58:15,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-11-29 05:58:15,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2023-11-29 05:58:15,529 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:58:15,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:58:15,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1425379479, now seen corresponding path program 1 times [2023-11-29 05:58:15,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:58:15,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417198324] [2023-11-29 05:58:15,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:58:15,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:58:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:15,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:58:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:15,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:58:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:15,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:58:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:15,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:58:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:15,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:58:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:15,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 05:58:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:15,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 05:58:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:15,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:58:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:15,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 05:58:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:15,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:58:15,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:15,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:58:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:15,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:58:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:15,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-11-29 05:58:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:15,706 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:58:15,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:58:15,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417198324] [2023-11-29 05:58:15,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417198324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:58:15,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:58:15,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:58:15,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62818810] [2023-11-29 05:58:15,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:58:15,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:58:15,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:58:15,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:58:15,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:58:15,709 INFO L87 Difference]: Start difference. First operand 3883 states and 4463 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2023-11-29 05:58:17,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:58:17,377 INFO L93 Difference]: Finished difference Result 4108 states and 4705 transitions. [2023-11-29 05:58:17,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 05:58:17,378 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), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 184 [2023-11-29 05:58:17,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:58:17,384 INFO L225 Difference]: With dead ends: 4108 [2023-11-29 05:58:17,384 INFO L226 Difference]: Without dead ends: 4105 [2023-11-29 05:58:17,385 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:58:17,386 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 831 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:58:17,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 914 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 05:58:17,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4105 states. [2023-11-29 05:58:17,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4105 to 3816. [2023-11-29 05:58:17,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3816 states, 3132 states have (on average 1.1408045977011494) internal successors, (3573), 3161 states have internal predecessors, (3573), 355 states have call successors, (355), 263 states have call predecessors, (355), 327 states have return successors, (459), 392 states have call predecessors, (459), 353 states have call successors, (459) [2023-11-29 05:58:17,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3816 states to 3816 states and 4387 transitions. [2023-11-29 05:58:17,966 INFO L78 Accepts]: Start accepts. Automaton has 3816 states and 4387 transitions. Word has length 184 [2023-11-29 05:58:17,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:58:17,966 INFO L495 AbstractCegarLoop]: Abstraction has 3816 states and 4387 transitions. [2023-11-29 05:58:17,966 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), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2023-11-29 05:58:17,967 INFO L276 IsEmpty]: Start isEmpty. Operand 3816 states and 4387 transitions. [2023-11-29 05:58:17,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2023-11-29 05:58:17,969 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:58:17,969 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, 1, 1, 1, 1, 1] [2023-11-29 05:58:17,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-11-29 05:58:17,969 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:58:17,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:58:17,970 INFO L85 PathProgramCache]: Analyzing trace with hash -59143617, now seen corresponding path program 1 times [2023-11-29 05:58:17,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:58:17,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260775797] [2023-11-29 05:58:17,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:58:17,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:58:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:18,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:58:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:18,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:58:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:18,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:58:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:18,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:58:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:18,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:58:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:18,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 05:58:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:18,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 05:58:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:18,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:58:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:18,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 05:58:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:18,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:58:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:18,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:58:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:18,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:58:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:18,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-11-29 05:58:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:18,057 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-11-29 05:58:18,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:58:18,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260775797] [2023-11-29 05:58:18,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260775797] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:58:18,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:58:18,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:58:18,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801279172] [2023-11-29 05:58:18,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:58:18,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:58:18,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:58:18,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:58:18,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:58:18,058 INFO L87 Difference]: Start difference. First operand 3816 states and 4387 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-29 05:58:19,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:58:19,110 INFO L93 Difference]: Finished difference Result 4756 states and 5423 transitions. [2023-11-29 05:58:19,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:58:19,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 188 [2023-11-29 05:58:19,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:58:19,117 INFO L225 Difference]: With dead ends: 4756 [2023-11-29 05:58:19,117 INFO L226 Difference]: Without dead ends: 3889 [2023-11-29 05:58:19,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:58:19,119 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 223 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:58:19,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 496 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:58:19,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3889 states. [2023-11-29 05:58:19,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3889 to 3818. [2023-11-29 05:58:19,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3818 states, 3134 states have (on average 1.1407147415443524) internal successors, (3575), 3163 states have internal predecessors, (3575), 355 states have call successors, (355), 263 states have call predecessors, (355), 327 states have return successors, (459), 392 states have call predecessors, (459), 353 states have call successors, (459) [2023-11-29 05:58:19,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3818 states to 3818 states and 4389 transitions. [2023-11-29 05:58:19,664 INFO L78 Accepts]: Start accepts. Automaton has 3818 states and 4389 transitions. Word has length 188 [2023-11-29 05:58:19,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:58:19,664 INFO L495 AbstractCegarLoop]: Abstraction has 3818 states and 4389 transitions. [2023-11-29 05:58:19,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-29 05:58:19,665 INFO L276 IsEmpty]: Start isEmpty. Operand 3818 states and 4389 transitions. [2023-11-29 05:58:19,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2023-11-29 05:58:19,667 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:58:19,667 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, 1, 1, 1, 1, 1, 1] [2023-11-29 05:58:19,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2023-11-29 05:58:19,667 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:58:19,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:58:19,668 INFO L85 PathProgramCache]: Analyzing trace with hash -604398580, now seen corresponding path program 1 times [2023-11-29 05:58:19,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:58:19,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266505629] [2023-11-29 05:58:19,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:58:19,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:58:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:58:19,682 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:58:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:58:19,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:58:19,784 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:58:19,785 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-11-29 05:58:19,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-11-29 05:58:19,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2023-11-29 05:58:19,790 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:58:19,795 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:58:19,909 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated [2023-11-29 05:58:19,915 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated [2023-11-29 05:58:19,934 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated [2023-11-29 05:58:19,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:58:19 BoogieIcfgContainer [2023-11-29 05:58:19,976 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:58:19,977 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:58:19,977 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:58:19,977 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:58:19,977 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:56:07" (3/4) ... [2023-11-29 05:58:19,978 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 05:58:20,033 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated [2023-11-29 05:58:20,036 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated [2023-11-29 05:58:20,049 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated [2023-11-29 05:58:20,178 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 05:58:20,178 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:58:20,178 INFO L158 Benchmark]: Toolchain (without parser) took 133688.00ms. Allocated memory was 157.3MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 118.1MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-11-29 05:58:20,179 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 107.0MB. Free memory was 57.9MB in the beginning and 57.8MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:58:20,179 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.35ms. Allocated memory is still 157.3MB. Free memory was 117.8MB in the beginning and 100.0MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 05:58:20,179 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.20ms. Allocated memory is still 157.3MB. Free memory was 100.0MB in the beginning and 97.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:58:20,180 INFO L158 Benchmark]: Boogie Preprocessor took 56.97ms. Allocated memory is still 157.3MB. Free memory was 97.0MB in the beginning and 93.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:58:20,180 INFO L158 Benchmark]: RCFGBuilder took 620.01ms. Allocated memory is still 157.3MB. Free memory was 93.5MB in the beginning and 106.3MB in the end (delta: -12.8MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2023-11-29 05:58:20,180 INFO L158 Benchmark]: TraceAbstraction took 132361.67ms. Allocated memory was 157.3MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 105.7MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-11-29 05:58:20,181 INFO L158 Benchmark]: Witness Printer took 201.22ms. Allocated memory is still 4.2GB. Free memory was 2.8GB in the beginning and 2.7GB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 05:58:20,183 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.18ms. Allocated memory is still 107.0MB. Free memory was 57.9MB in the beginning and 57.8MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.35ms. Allocated memory is still 157.3MB. Free memory was 117.8MB in the beginning and 100.0MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.20ms. Allocated memory is still 157.3MB. Free memory was 100.0MB in the beginning and 97.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.97ms. Allocated memory is still 157.3MB. Free memory was 97.0MB in the beginning and 93.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 620.01ms. Allocated memory is still 157.3MB. Free memory was 93.5MB in the beginning and 106.3MB in the end (delta: -12.8MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * TraceAbstraction took 132361.67ms. Allocated memory was 157.3MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 105.7MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 201.22ms. Allocated memory is still 4.2GB. Free memory was 2.8GB in the beginning and 2.7GB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - CounterExampleResult [Line: 496]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int t2_pc = 0; [L503] int m_st ; [L504] int t1_st ; [L505] int t2_st ; [L506] int m_i ; [L507] int t1_i ; [L508] int t2_i ; [L509] int M_E = 2; [L510] int T1_E = 2; [L511] int T2_E = 2; [L512] int E_M = 2; [L513] int E_1 = 2; [L514] int E_2 = 2; [L519] int token ; [L521] int local ; [L1099] COND FALSE !(__VERIFIER_nondet_int()) [L1102] CALL main2() [L1086] int __retres1 ; [L1090] CALL init_model2() [L1000] m_i = 1 [L1001] t1_i = 1 [L1002] t2_i = 1 [L1090] RET init_model2() [L1091] CALL start_simulation2() [L1027] int kernel_st ; [L1028] int tmp ; [L1029] int tmp___0 ; [L1033] kernel_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1034] FCALL update_channels2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1035] CALL init_threads2() [L719] COND TRUE m_i == 1 [L720] m_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L724] COND TRUE t1_i == 1 [L725] t1_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L729] COND TRUE t2_i == 1 [L730] t2_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1035] RET init_threads2() [L1036] CALL fire_delta_events2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L832] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L837] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L842] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L847] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L852] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L857] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1036] RET fire_delta_events2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1037] CALL activate_threads2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L654] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L664] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L666] return (__retres1); [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L673] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L683] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L685] return (__retres1); [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L692] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L702] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L704] return (__retres1); [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L1037] RET activate_threads2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1038] CALL reset_delta_events2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L870] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L875] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L880] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L885] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L890] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L895] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1038] RET reset_delta_events2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1041] COND TRUE 1 [L1044] kernel_st = 1 [L1045] CALL eval2() [L765] int tmp ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L769] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L772] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L739] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L742] COND TRUE m_st == 0 [L743] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L760] return (__retres1); [L772] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L772] tmp = exists_runnable_thread2() [L774] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L779] COND TRUE m_st == 0 [L780] int tmp_ndt_1; [L781] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L782] COND FALSE, EXPR !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L779-L790] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L793] COND TRUE t1_st == 0 [L794] int tmp_ndt_2; [L795] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L796] COND TRUE, EXPR \read(tmp_ndt_2) [L798] EXPR t1_st = 1 [L799] CALL, EXPR transmit1() [L582] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, token=0] [L593] COND TRUE 1 [L595] t1_pc = 1 [L596] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L799] RET, EXPR transmit1() [L793-L804] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L807] COND TRUE t2_st == 0 [L808] int tmp_ndt_3; [L809] EXPR tmp_ndt_3 = __VERIFIER_nondet_int() [L810] COND TRUE, EXPR \read(tmp_ndt_3) [L812] EXPR t2_st = 1 [L813] CALL, EXPR transmit2() [L618] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L629] COND TRUE 1 [L631] t2_pc = 1 [L632] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L813] RET, EXPR transmit2() [L807-L818] { int tmp_ndt_3; tmp_ndt_3 = __VERIFIER_nondet_int(); if (tmp_ndt_3) { { t2_st = 1; transmit2(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=0] [L769] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=0] [L772] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L739] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L742] COND TRUE m_st == 0 [L743] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L760] return (__retres1); [L772] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=0] [L772] tmp = exists_runnable_thread2() [L774] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=0] [L779] COND TRUE m_st == 0 [L780] int tmp_ndt_1; [L781] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L782] COND TRUE, EXPR \read(tmp_ndt_1) [L784] EXPR m_st = 1 [L785] CALL, EXPR master() [L524] int tmp_var = __VERIFIER_nondet_int(); [L526] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L537] COND TRUE 1 [L540] token = __VERIFIER_nondet_int() [L541] local = token [L542] E_1 = 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L543] CALL immediate_notify() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L943] CALL activate_threads2() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L654] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L664] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L666] return (__retres1); [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L673] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L674] COND TRUE E_1 == 1 [L675] __retres1 = 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L685] return (__retres1); [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND TRUE \read(tmp___0) [L922] t1_st = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=0] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L692] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L693] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L702] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L704] return (__retres1); [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L943] RET activate_threads2() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L543] RET immediate_notify() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L544] E_1 = 2 [L545] m_pc = 1 [L546] m_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L785] RET, EXPR master() [L779-L790] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=0] [L793] COND TRUE t1_st == 0 [L794] int tmp_ndt_2; [L795] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L796] COND TRUE, EXPR \read(tmp_ndt_2) [L798] EXPR t1_st = 1 [L799] CALL, EXPR transmit1() [L582] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=0] [L585] COND TRUE t1_pc == 1 [L601] token += 1 [L602] E_2 = 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L603] CALL immediate_notify() VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L943] CALL activate_threads2() VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L654] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L655] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L664] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L666] return (__retres1); [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=1] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L673] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L674] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L683] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L685] return (__retres1); [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=1] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L692] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L693] COND TRUE E_2 == 1 [L694] __retres1 = 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L704] return (__retres1); [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND TRUE \read(tmp___1) [L930] t2_st = 0 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1, token=1] [L943] RET activate_threads2() VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, token=1] [L603] RET immediate_notify() VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, token=1] [L604] E_2 = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, token=1] [L593] COND TRUE 1 [L595] t1_pc = 1 [L596] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L799] RET, EXPR transmit1() [L793-L804] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1, token=1] [L807] COND TRUE t2_st == 0 [L808] int tmp_ndt_3; [L809] EXPR tmp_ndt_3 = __VERIFIER_nondet_int() [L810] COND TRUE, EXPR \read(tmp_ndt_3) [L812] EXPR t2_st = 1 [L813] CALL, EXPR transmit2() [L618] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L621] COND TRUE t2_pc == 1 [L637] token += 1 [L638] E_M = 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L639] CALL immediate_notify() VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L943] CALL activate_threads2() VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L654] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L655] COND TRUE E_M == 1 [L656] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L666] return (__retres1); [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND TRUE \read(tmp) [L914] m_st = 0 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=2] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L673] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L674] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L683] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L685] return (__retres1); [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=2] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L692] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L693] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L702] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L704] return (__retres1); [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, tmp___1=0, token=2] [L943] RET activate_threads2() VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L639] RET immediate_notify() VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L640] E_M = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L629] COND TRUE 1 [L631] t2_pc = 1 [L632] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L813] RET, EXPR transmit2() [L807-L818] { int tmp_ndt_3; tmp_ndt_3 = __VERIFIER_nondet_int(); if (tmp_ndt_3) { { t2_st = 1; transmit2(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=2] [L769] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=2] [L772] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L739] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L742] COND TRUE m_st == 0 [L743] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L760] return (__retres1); [L772] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=2] [L772] tmp = exists_runnable_thread2() [L774] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=2] [L779] COND TRUE m_st == 0 [L780] int tmp_ndt_1; [L781] tmp_ndt_1 = __VERIFIER_nondet_int() [L782] COND TRUE \read(tmp_ndt_1) [L784] m_st = 1 [L785] CALL master() [L524] int tmp_var = __VERIFIER_nondet_int(); [L526] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L529] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L551] COND FALSE !(token != local + 2) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L556] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L557] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L562] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L563] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L564] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L565] CALL error2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L496] reach_error() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - UnprovableResult [Line: 28]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 217 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 132.1s, OverallIterations: 47, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.3s, AutomataDifference: 70.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21086 SdHoareTripleChecker+Valid, 18.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20593 mSDsluCounter, 31236 SdHoareTripleChecker+Invalid, 15.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20271 mSDsCounter, 3783 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22163 IncrementalHoareTripleChecker+Invalid, 25946 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3783 mSolverCounterUnsat, 10965 mSDtfsCounter, 22163 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4429 GetRequests, 3959 SyntacticMatches, 0 SemanticMatches, 470 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1292 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35196occurred in iteration=33, InterpolantAutomatonStates: 413, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 46.7s AutomataMinimizationTime, 46 MinimizatonAttempts, 26697 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 8130 NumberOfCodeBlocks, 8130 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 7941 ConstructedInterpolants, 0 QuantifiedInterpolants, 13982 SizeOfPredicates, 4 NumberOfNonLiveVariables, 10767 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 68 InterpolantComputations, 45 PerfectInterpolantSequences, 3489/3955 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 RESULT: Ultimate proved your program to be incorrect! [2023-11-29 05:58:20,217 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63b3f13-3e29-481d-bd95-7415e0b8018f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE