./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd --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 8ff0a322ea14915785d13405f40f59a899d91f6127d01ad0d503cb7ec027b40c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:18:10,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:18:10,995 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:18:11,005 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:18:11,005 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:18:11,034 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:18:11,035 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:18:11,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:18:11,035 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:18:11,036 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:18:11,036 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:18:11,036 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:18:11,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:18:11,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:18:11,036 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:18:11,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:18:11,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:18:11,037 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:18:11,037 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:18:11,037 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:18:11,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:18:11,037 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:18:11,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:18:11,037 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:18:11,038 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:18:11,038 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:18:11,040 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:18:11,040 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:18:11,040 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:18:11,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:18:11,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:18:11,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:18:11,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:18:11,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:18:11,041 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:18:11,041 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:18:11,041 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:18:11,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:18:11,041 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:18:11,041 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:18:11,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:18:11,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:18:11,041 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd 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 -> 8ff0a322ea14915785d13405f40f59a899d91f6127d01ad0d503cb7ec027b40c [2024-11-13 14:18:11,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:18:11,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:18:11,394 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:18:11,395 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:18:11,396 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:18:11,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c Unable to find full path for "g++" [2024-11-13 14:18:13,306 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:18:13,679 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:18:13,681 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c [2024-11-13 14:18:13,705 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/data/4b00bc704/3e0c9a24c6ce43c789ea9827b83b7a86/FLAGc2b3f900d [2024-11-13 14:18:13,731 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/data/4b00bc704/3e0c9a24c6ce43c789ea9827b83b7a86 [2024-11-13 14:18:13,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:18:13,736 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:18:13,738 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:18:13,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:18:13,742 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:18:13,744 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:18:13" (1/1) ... [2024-11-13 14:18:13,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56adeaa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:18:13, skipping insertion in model container [2024-11-13 14:18:13,749 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:18:13" (1/1) ... [2024-11-13 14:18:13,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:18:13,987 WARN L250 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_19d92d90-3a10-46d8-bbc7-f9724150239e/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[911,924] [2024-11-13 14:18:14,065 WARN L250 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_19d92d90-3a10-46d8-bbc7-f9724150239e/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[8416,8429] [2024-11-13 14:18:14,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:18:14,142 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:18:14,152 WARN L250 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_19d92d90-3a10-46d8-bbc7-f9724150239e/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[911,924] [2024-11-13 14:18:14,192 WARN L250 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_19d92d90-3a10-46d8-bbc7-f9724150239e/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[8416,8429] [2024-11-13 14:18:14,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:18:14,234 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:18:14,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:18:14 WrapperNode [2024-11-13 14:18:14,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:18:14,236 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:18:14,236 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:18:14,236 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:18:14,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:18:14" (1/1) ... [2024-11-13 14:18:14,258 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:18:14" (1/1) ... [2024-11-13 14:18:14,311 INFO L138 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 438 [2024-11-13 14:18:14,312 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:18:14,313 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:18:14,313 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:18:14,313 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:18:14,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:18:14" (1/1) ... [2024-11-13 14:18:14,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:18:14" (1/1) ... [2024-11-13 14:18:14,326 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:18:14" (1/1) ... [2024-11-13 14:18:14,354 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]. [2024-11-13 14:18:14,358 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:18:14" (1/1) ... [2024-11-13 14:18:14,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:18:14" (1/1) ... [2024-11-13 14:18:14,369 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:18:14" (1/1) ... [2024-11-13 14:18:14,384 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:18:14" (1/1) ... [2024-11-13 14:18:14,386 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:18:14" (1/1) ... [2024-11-13 14:18:14,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:18:14" (1/1) ... [2024-11-13 14:18:14,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:18:14,398 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:18:14,401 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:18:14,401 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:18:14,405 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:18:14" (1/1) ... [2024-11-13 14:18:14,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:18:14,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:18:14,449 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:18:14,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:18:14,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:18:14,484 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-13 14:18:14,484 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-13 14:18:14,484 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-13 14:18:14,484 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-13 14:18:14,485 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-13 14:18:14,485 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-13 14:18:14,485 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-13 14:18:14,485 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-13 14:18:14,485 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-13 14:18:14,485 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-13 14:18:14,486 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-13 14:18:14,486 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-13 14:18:14,486 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-13 14:18:14,486 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-13 14:18:14,486 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-13 14:18:14,486 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-13 14:18:14,487 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-13 14:18:14,487 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-13 14:18:14,487 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-13 14:18:14,487 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-13 14:18:14,487 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-13 14:18:14,487 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-13 14:18:14,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:18:14,488 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-13 14:18:14,488 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-13 14:18:14,488 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-13 14:18:14,488 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-13 14:18:14,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:18:14,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:18:14,488 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-13 14:18:14,488 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-13 14:18:14,617 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:18:14,620 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:18:15,147 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-11-13 14:18:15,148 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2024-11-13 14:18:15,244 INFO L? ?]: Removed 64 outVars from TransFormulas that were not future-live. [2024-11-13 14:18:15,244 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:18:15,266 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:18:15,266 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-13 14:18:15,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:18:15 BoogieIcfgContainer [2024-11-13 14:18:15,267 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:18:15,272 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:18:15,272 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:18:15,277 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:18:15,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:18:13" (1/3) ... [2024-11-13 14:18:15,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17069e88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:18:15, skipping insertion in model container [2024-11-13 14:18:15,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:18:14" (2/3) ... [2024-11-13 14:18:15,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17069e88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:18:15, skipping insertion in model container [2024-11-13 14:18:15,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:18:15" (3/3) ... [2024-11-13 14:18:15,281 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.01.cil-1.c [2024-11-13 14:18:15,298 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:18:15,302 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil+token_ring.01.cil-1.c that has 15 procedures, 226 locations, 1 initial locations, 8 loop locations, and 2 error locations. [2024-11-13 14:18:15,419 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:18:15,436 INFO L333 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, 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;@4e3c3880, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:18:15,437 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 14:18:15,443 INFO L276 IsEmpty]: Start isEmpty. Operand has 226 states, 178 states have (on average 1.5280898876404494) internal successors, (272), 184 states have internal predecessors, (272), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-13 14:18:15,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-13 14:18:15,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:18:15,456 INFO L215 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] [2024-11-13 14:18:15,456 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:18:15,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:18:15,463 INFO L85 PathProgramCache]: Analyzing trace with hash -562482695, now seen corresponding path program 1 times [2024-11-13 14:18:15,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:18:15,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136792532] [2024-11-13 14:18:15,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:15,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:18:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:15,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:18:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:15,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:18:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:15,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 14:18:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:15,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 14:18:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:15,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:18:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:15,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:18:15,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:18:15,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136792532] [2024-11-13 14:18:15,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136792532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:18:15,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:18:15,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:18:15,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481016784] [2024-11-13 14:18:15,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:18:15,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:18:15,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:18:15,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:18:15,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:18:15,933 INFO L87 Difference]: Start difference. First operand has 226 states, 178 states have (on average 1.5280898876404494) internal successors, (272), 184 states have internal predecessors, (272), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 14:18:16,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:18:16,841 INFO L93 Difference]: Finished difference Result 456 states and 677 transitions. [2024-11-13 14:18:16,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:18:16,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-11-13 14:18:16,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:18:16,853 INFO L225 Difference]: With dead ends: 456 [2024-11-13 14:18:16,854 INFO L226 Difference]: Without dead ends: 237 [2024-11-13 14:18:16,858 INFO L431 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 [2024-11-13 14:18:16,861 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 333 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:18:16,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 561 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 14:18:16,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-13 14:18:16,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 216. [2024-11-13 14:18:16,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 170 states have (on average 1.4294117647058824) internal successors, (243), 174 states have internal predecessors, (243), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-13 14:18:16,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 303 transitions. [2024-11-13 14:18:16,929 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 303 transitions. Word has length 57 [2024-11-13 14:18:16,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:18:16,929 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 303 transitions. [2024-11-13 14:18:16,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 14:18:16,930 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 303 transitions. [2024-11-13 14:18:16,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-13 14:18:16,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:18:16,933 INFO L215 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] [2024-11-13 14:18:16,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:18:16,933 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:18:16,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:18:16,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1793322555, now seen corresponding path program 1 times [2024-11-13 14:18:16,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:18:16,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160904813] [2024-11-13 14:18:16,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:16,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:18:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:17,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:18:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:17,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:18:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:17,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 14:18:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:17,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 14:18:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:17,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:18:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:18:17,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:18:17,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160904813] [2024-11-13 14:18:17,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160904813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:18:17,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:18:17,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:18:17,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658734904] [2024-11-13 14:18:17,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:18:17,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:18:17,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:18:17,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:18:17,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:18:17,241 INFO L87 Difference]: Start difference. First operand 216 states and 303 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 14:18:18,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:18:18,257 INFO L93 Difference]: Finished difference Result 444 states and 634 transitions. [2024-11-13 14:18:18,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 14:18:18,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-11-13 14:18:18,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:18:18,262 INFO L225 Difference]: With dead ends: 444 [2024-11-13 14:18:18,262 INFO L226 Difference]: Without dead ends: 349 [2024-11-13 14:18:18,263 INFO L431 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 [2024-11-13 14:18:18,264 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 557 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 14:18:18,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 644 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 14:18:18,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-13 14:18:18,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 308. [2024-11-13 14:18:18,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 245 states have (on average 1.4285714285714286) internal successors, (350), 250 states have internal predecessors, (350), 41 states have call successors, (41), 20 states have call predecessors, (41), 20 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2024-11-13 14:18:18,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 433 transitions. [2024-11-13 14:18:18,332 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 433 transitions. Word has length 57 [2024-11-13 14:18:18,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:18:18,333 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 433 transitions. [2024-11-13 14:18:18,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 14:18:18,333 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 433 transitions. [2024-11-13 14:18:18,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-13 14:18:18,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:18:18,339 INFO L215 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] [2024-11-13 14:18:18,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:18:18,339 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:18:18,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:18:18,339 INFO L85 PathProgramCache]: Analyzing trace with hash 881370559, now seen corresponding path program 1 times [2024-11-13 14:18:18,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:18:18,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737779881] [2024-11-13 14:18:18,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:18,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:18:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:18,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:18:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:18,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:18:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:18,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 14:18:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:18,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 14:18:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:18,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:18:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:18,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:18:18,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:18:18,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737779881] [2024-11-13 14:18:18,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737779881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:18:18,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:18:18,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 14:18:18,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563668569] [2024-11-13 14:18:18,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:18:18,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:18:18,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:18:18,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:18:18,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:18:18,573 INFO L87 Difference]: Start difference. First operand 308 states and 433 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 14:18:19,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:18:19,788 INFO L93 Difference]: Finished difference Result 646 states and 913 transitions. [2024-11-13 14:18:19,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 14:18:19,788 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-11-13 14:18:19,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:18:19,792 INFO L225 Difference]: With dead ends: 646 [2024-11-13 14:18:19,792 INFO L226 Difference]: Without dead ends: 459 [2024-11-13 14:18:19,793 INFO L431 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 [2024-11-13 14:18:19,794 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 546 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:18:19,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 1000 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 14:18:19,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-13 14:18:19,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 395. [2024-11-13 14:18:19,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 315 states have (on average 1.4190476190476191) internal successors, (447), 321 states have internal predecessors, (447), 51 states have call successors, (51), 26 states have call predecessors, (51), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2024-11-13 14:18:19,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 552 transitions. [2024-11-13 14:18:19,877 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 552 transitions. Word has length 57 [2024-11-13 14:18:19,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:18:19,878 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 552 transitions. [2024-11-13 14:18:19,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 14:18:19,878 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 552 transitions. [2024-11-13 14:18:19,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-13 14:18:19,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:18:19,880 INFO L215 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] [2024-11-13 14:18:19,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:18:19,880 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:18:19,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:18:19,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1168017283, now seen corresponding path program 1 times [2024-11-13 14:18:19,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:18:19,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433434404] [2024-11-13 14:18:19,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:19,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:18:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:20,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:18:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:20,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:18:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:20,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 14:18:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:20,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 14:18:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:20,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:18:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:20,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:18:20,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:18:20,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433434404] [2024-11-13 14:18:20,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433434404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:18:20,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:18:20,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 14:18:20,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508136860] [2024-11-13 14:18:20,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:18:20,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:18:20,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:18:20,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:18:20,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:18:20,095 INFO L87 Difference]: Start difference. First operand 395 states and 552 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 14:18:20,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:18:20,756 INFO L93 Difference]: Finished difference Result 731 states and 1034 transitions. [2024-11-13 14:18:20,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:18:20,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-11-13 14:18:20,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:18:20,760 INFO L225 Difference]: With dead ends: 731 [2024-11-13 14:18:20,760 INFO L226 Difference]: Without dead ends: 457 [2024-11-13 14:18:20,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:18:20,763 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 587 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:18:20,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 550 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 14:18:20,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-11-13 14:18:20,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 395. [2024-11-13 14:18:20,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 315 states have (on average 1.4095238095238096) internal successors, (444), 321 states have internal predecessors, (444), 51 states have call successors, (51), 26 states have call predecessors, (51), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2024-11-13 14:18:20,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 549 transitions. [2024-11-13 14:18:20,809 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 549 transitions. Word has length 57 [2024-11-13 14:18:20,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:18:20,809 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 549 transitions. [2024-11-13 14:18:20,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 14:18:20,810 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 549 transitions. [2024-11-13 14:18:20,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-13 14:18:20,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:18:20,811 INFO L215 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] [2024-11-13 14:18:20,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 14:18:20,812 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:18:20,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:18:20,812 INFO L85 PathProgramCache]: Analyzing trace with hash -2065410561, now seen corresponding path program 1 times [2024-11-13 14:18:20,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:18:20,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290238188] [2024-11-13 14:18:20,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:20,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:18:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:20,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:18:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:20,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:18:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:20,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 14:18:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:20,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 14:18:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:20,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:18:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:20,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:18:20,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:18:20,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290238188] [2024-11-13 14:18:20,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290238188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:18:20,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:18:20,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 14:18:20,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129079829] [2024-11-13 14:18:20,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:18:20,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:18:20,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:18:20,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:18:20,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:18:20,958 INFO L87 Difference]: Start difference. First operand 395 states and 549 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 14:18:21,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:18:21,720 INFO L93 Difference]: Finished difference Result 728 states and 1028 transitions. [2024-11-13 14:18:21,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:18:21,720 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-11-13 14:18:21,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:18:21,724 INFO L225 Difference]: With dead ends: 728 [2024-11-13 14:18:21,724 INFO L226 Difference]: Without dead ends: 455 [2024-11-13 14:18:21,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:18:21,726 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 227 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:18:21,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 935 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 14:18:21,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-11-13 14:18:21,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 404. [2024-11-13 14:18:21,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 324 states have (on average 1.3981481481481481) internal successors, (453), 330 states have internal predecessors, (453), 51 states have call successors, (51), 26 states have call predecessors, (51), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2024-11-13 14:18:21,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 558 transitions. [2024-11-13 14:18:21,781 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 558 transitions. Word has length 57 [2024-11-13 14:18:21,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:18:21,781 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 558 transitions. [2024-11-13 14:18:21,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 14:18:21,782 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 558 transitions. [2024-11-13 14:18:21,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-13 14:18:21,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:18:21,784 INFO L215 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] [2024-11-13 14:18:21,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 14:18:21,784 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:18:21,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:18:21,785 INFO L85 PathProgramCache]: Analyzing trace with hash -2137797119, now seen corresponding path program 1 times [2024-11-13 14:18:21,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:18:21,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814172512] [2024-11-13 14:18:21,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:21,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:18:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:21,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:18:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:21,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:18:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:21,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 14:18:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:21,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 14:18:21,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:21,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:18:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:21,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:18:21,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:18:21,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814172512] [2024-11-13 14:18:21,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814172512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:18:21,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:18:21,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 14:18:21,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555735296] [2024-11-13 14:18:21,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:18:21,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:18:21,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:18:21,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:18:21,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:18:21,983 INFO L87 Difference]: Start difference. First operand 404 states and 558 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 14:18:23,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:18:23,467 INFO L93 Difference]: Finished difference Result 1583 states and 2275 transitions. [2024-11-13 14:18:23,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 14:18:23,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-11-13 14:18:23,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:18:23,475 INFO L225 Difference]: With dead ends: 1583 [2024-11-13 14:18:23,476 INFO L226 Difference]: Without dead ends: 1301 [2024-11-13 14:18:23,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-11-13 14:18:23,478 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 1112 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:18:23,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1129 Valid, 835 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 14:18:23,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2024-11-13 14:18:23,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1130. [2024-11-13 14:18:23,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 903 states have (on average 1.3654485049833887) internal successors, (1233), 924 states have internal predecessors, (1233), 138 states have call successors, (138), 80 states have call predecessors, (138), 87 states have return successors, (189), 128 states have call predecessors, (189), 136 states have call successors, (189) [2024-11-13 14:18:23,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1560 transitions. [2024-11-13 14:18:23,620 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1560 transitions. Word has length 57 [2024-11-13 14:18:23,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:18:23,621 INFO L471 AbstractCegarLoop]: Abstraction has 1130 states and 1560 transitions. [2024-11-13 14:18:23,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 14:18:23,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1560 transitions. [2024-11-13 14:18:23,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-13 14:18:23,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:18:23,624 INFO L215 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] [2024-11-13 14:18:23,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 14:18:23,624 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:18:23,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:18:23,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1621484926, now seen corresponding path program 1 times [2024-11-13 14:18:23,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:18:23,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961351071] [2024-11-13 14:18:23,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:23,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:18:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:23,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:18:23,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:23,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:18:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:23,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:18:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:23,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:18:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:23,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:18:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:23,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 14:18:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:23,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:18:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:23,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:18:23,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:18:23,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961351071] [2024-11-13 14:18:23,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961351071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:18:23,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:18:23,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 14:18:23,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336893397] [2024-11-13 14:18:23,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:18:23,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:18:23,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:18:23,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:18:23,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:18:23,797 INFO L87 Difference]: Start difference. First operand 1130 states and 1560 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-13 14:18:24,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:18:24,792 INFO L93 Difference]: Finished difference Result 1385 states and 1930 transitions. [2024-11-13 14:18:24,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 14:18:24,792 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-13 14:18:24,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:18:24,799 INFO L225 Difference]: With dead ends: 1385 [2024-11-13 14:18:24,800 INFO L226 Difference]: Without dead ends: 1281 [2024-11-13 14:18:24,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-13 14:18:24,802 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 627 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:18:24,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 746 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 14:18:24,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2024-11-13 14:18:24,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1242. [2024-11-13 14:18:24,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1242 states, 993 states have (on average 1.3695871097683787) internal successors, (1360), 1016 states have internal predecessors, (1360), 151 states have call successors, (151), 87 states have call predecessors, (151), 96 states have return successors, (207), 142 states have call predecessors, (207), 149 states have call successors, (207) [2024-11-13 14:18:24,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 1718 transitions. [2024-11-13 14:18:24,960 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 1718 transitions. Word has length 65 [2024-11-13 14:18:24,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:18:24,960 INFO L471 AbstractCegarLoop]: Abstraction has 1242 states and 1718 transitions. [2024-11-13 14:18:24,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-13 14:18:24,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1718 transitions. [2024-11-13 14:18:24,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-13 14:18:24,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:18:24,962 INFO L215 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] [2024-11-13 14:18:24,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 14:18:24,962 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:18:24,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:18:24,963 INFO L85 PathProgramCache]: Analyzing trace with hash -994593730, now seen corresponding path program 1 times [2024-11-13 14:18:24,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:18:24,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620099675] [2024-11-13 14:18:24,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:24,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:18:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:25,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:18:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:25,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:18:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:25,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:18:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:25,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:18:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:25,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:18:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:25,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 14:18:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:25,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:18:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:25,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:18:25,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:18:25,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620099675] [2024-11-13 14:18:25,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620099675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:18:25,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:18:25,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 14:18:25,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609673752] [2024-11-13 14:18:25,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:18:25,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:18:25,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:18:25,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:18:25,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:18:25,160 INFO L87 Difference]: Start difference. First operand 1242 states and 1718 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-13 14:18:26,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:18:26,418 INFO L93 Difference]: Finished difference Result 1639 states and 2284 transitions. [2024-11-13 14:18:26,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 14:18:26,419 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-13 14:18:26,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:18:26,427 INFO L225 Difference]: With dead ends: 1639 [2024-11-13 14:18:26,427 INFO L226 Difference]: Without dead ends: 1430 [2024-11-13 14:18:26,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-13 14:18:26,429 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 601 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:18:26,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 1044 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 14:18:26,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2024-11-13 14:18:26,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1354. [2024-11-13 14:18:26,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1083 states have (on average 1.3721144967682364) internal successors, (1486), 1108 states have internal predecessors, (1486), 164 states have call successors, (164), 94 states have call predecessors, (164), 105 states have return successors, (228), 156 states have call predecessors, (228), 162 states have call successors, (228) [2024-11-13 14:18:26,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1878 transitions. [2024-11-13 14:18:26,633 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1878 transitions. Word has length 65 [2024-11-13 14:18:26,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:18:26,633 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 1878 transitions. [2024-11-13 14:18:26,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-13 14:18:26,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1878 transitions. [2024-11-13 14:18:26,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-13 14:18:26,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:18:26,635 INFO L215 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] [2024-11-13 14:18:26,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 14:18:26,635 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:18:26,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:18:26,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1271787456, now seen corresponding path program 1 times [2024-11-13 14:18:26,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:18:26,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913090371] [2024-11-13 14:18:26,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:26,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:18:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:26,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:18:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:26,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:18:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:26,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:18:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:26,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:18:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:26,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:18:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:26,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 14:18:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:26,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:18:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:18:26,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:18:26,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913090371] [2024-11-13 14:18:26,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913090371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:18:26,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:18:26,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 14:18:26,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506153971] [2024-11-13 14:18:26,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:18:26,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:18:26,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:18:26,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:18:26,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:18:26,761 INFO L87 Difference]: Start difference. First operand 1354 states and 1878 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-13 14:18:27,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:18:27,759 INFO L93 Difference]: Finished difference Result 2026 states and 2820 transitions. [2024-11-13 14:18:27,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 14:18:27,760 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2024-11-13 14:18:27,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:18:27,768 INFO L225 Difference]: With dead ends: 2026 [2024-11-13 14:18:27,768 INFO L226 Difference]: Without dead ends: 1711 [2024-11-13 14:18:27,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-13 14:18:27,770 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 844 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:18:27,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 769 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 14:18:27,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2024-11-13 14:18:27,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1635. [2024-11-13 14:18:27,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1635 states, 1309 states have (on average 1.3697478991596639) internal successors, (1793), 1338 states have internal predecessors, (1793), 194 states have call successors, (194), 115 states have call predecessors, (194), 130 states have return successors, (266), 186 states have call predecessors, (266), 192 states have call successors, (266) [2024-11-13 14:18:27,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2253 transitions. [2024-11-13 14:18:27,971 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2253 transitions. Word has length 65 [2024-11-13 14:18:27,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:18:27,972 INFO L471 AbstractCegarLoop]: Abstraction has 1635 states and 2253 transitions. [2024-11-13 14:18:27,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-13 14:18:27,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2253 transitions. [2024-11-13 14:18:27,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-13 14:18:27,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:18:27,974 INFO L215 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] [2024-11-13 14:18:27,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 14:18:27,975 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:18:27,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:18:27,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1855216897, now seen corresponding path program 1 times [2024-11-13 14:18:27,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:18:27,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667274417] [2024-11-13 14:18:27,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:27,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:18:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:28,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:18:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:28,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:18:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:28,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:18:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:28,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:18:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:28,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:18:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:28,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-13 14:18:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:28,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-13 14:18:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:28,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:18:28,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:18:28,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667274417] [2024-11-13 14:18:28,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667274417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:18:28,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:18:28,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 14:18:28,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633597981] [2024-11-13 14:18:28,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:18:28,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:18:28,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:18:28,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:18:28,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:18:28,130 INFO L87 Difference]: Start difference. First operand 1635 states and 2253 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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) [2024-11-13 14:18:29,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:18:29,153 INFO L93 Difference]: Finished difference Result 2303 states and 3180 transitions. [2024-11-13 14:18:29,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 14:18:29,153 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 66 [2024-11-13 14:18:29,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:18:29,164 INFO L225 Difference]: With dead ends: 2303 [2024-11-13 14:18:29,164 INFO L226 Difference]: Without dead ends: 1707 [2024-11-13 14:18:29,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-13 14:18:29,167 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 223 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:18:29,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 1237 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 14:18:29,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2024-11-13 14:18:29,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1650. [2024-11-13 14:18:29,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1650 states, 1321 states have (on average 1.364118092354277) internal successors, (1802), 1350 states have internal predecessors, (1802), 194 states have call successors, (194), 115 states have call predecessors, (194), 133 states have return successors, (269), 189 states have call predecessors, (269), 192 states have call successors, (269) [2024-11-13 14:18:29,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 2265 transitions. [2024-11-13 14:18:29,387 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 2265 transitions. Word has length 66 [2024-11-13 14:18:29,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:18:29,388 INFO L471 AbstractCegarLoop]: Abstraction has 1650 states and 2265 transitions. [2024-11-13 14:18:29,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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) [2024-11-13 14:18:29,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2265 transitions. [2024-11-13 14:18:29,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-13 14:18:29,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:18:29,389 INFO L215 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] [2024-11-13 14:18:29,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 14:18:29,390 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:18:29,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:18:29,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1410391101, now seen corresponding path program 1 times [2024-11-13 14:18:29,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:18:29,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139040141] [2024-11-13 14:18:29,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:29,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:18:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:29,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:18:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:29,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:18:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:29,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:18:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:29,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:18:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:29,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:18:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:29,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-13 14:18:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:29,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-13 14:18:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:29,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:18:29,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:18:29,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139040141] [2024-11-13 14:18:29,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139040141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:18:29,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:18:29,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 14:18:29,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082263629] [2024-11-13 14:18:29,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:18:29,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:18:29,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:18:29,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:18:29,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:18:29,550 INFO L87 Difference]: Start difference. First operand 1650 states and 2265 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-13 14:18:31,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:18:31,908 INFO L93 Difference]: Finished difference Result 3855 states and 5386 transitions. [2024-11-13 14:18:31,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-13 14:18:31,909 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2024-11-13 14:18:31,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:18:31,921 INFO L225 Difference]: With dead ends: 3855 [2024-11-13 14:18:31,921 INFO L226 Difference]: Without dead ends: 2013 [2024-11-13 14:18:31,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-11-13 14:18:31,927 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 1496 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 1505 mSolverCounterSat, 382 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 1887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 382 IncrementalHoareTripleChecker+Valid, 1505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:18:31,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 1343 Invalid, 1887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [382 Valid, 1505 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-13 14:18:31,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2024-11-13 14:18:32,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 1858. [2024-11-13 14:18:32,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1473 states have (on average 1.3482688391038697) internal successors, (1986), 1506 states have internal predecessors, (1986), 224 states have call successors, (224), 136 states have call predecessors, (224), 159 states have return successors, (318), 220 states have call predecessors, (318), 222 states have call successors, (318) [2024-11-13 14:18:32,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2528 transitions. [2024-11-13 14:18:32,240 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2528 transitions. Word has length 66 [2024-11-13 14:18:32,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:18:32,240 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 2528 transitions. [2024-11-13 14:18:32,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-13 14:18:32,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2528 transitions. [2024-11-13 14:18:32,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-13 14:18:32,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:18:32,243 INFO L215 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, 1] [2024-11-13 14:18:32,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 14:18:32,244 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:18:32,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:18:32,244 INFO L85 PathProgramCache]: Analyzing trace with hash 671959056, now seen corresponding path program 1 times [2024-11-13 14:18:32,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:18:32,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581659498] [2024-11-13 14:18:32,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:32,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:18:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:32,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:18:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:32,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:18:32,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:32,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:18:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:32,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:18:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:32,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:18:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:32,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:18:32,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:32,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:18:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:32,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:18:32,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:18:32,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581659498] [2024-11-13 14:18:32,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581659498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:18:32,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:18:32,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 14:18:32,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139306014] [2024-11-13 14:18:32,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:18:32,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:18:32,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:18:32,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:18:32,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:18:32,392 INFO L87 Difference]: Start difference. First operand 1858 states and 2528 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 5 states have internal predecessors, (52), 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) [2024-11-13 14:18:33,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:18:33,319 INFO L93 Difference]: Finished difference Result 2814 states and 3834 transitions. [2024-11-13 14:18:33,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 14:18:33,320 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 5 states have internal predecessors, (52), 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 67 [2024-11-13 14:18:33,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:18:33,330 INFO L225 Difference]: With dead ends: 2814 [2024-11-13 14:18:33,331 INFO L226 Difference]: Without dead ends: 1995 [2024-11-13 14:18:33,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-13 14:18:33,334 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 325 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:18:33,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 1062 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 14:18:33,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2024-11-13 14:18:33,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1903. [2024-11-13 14:18:33,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1903 states, 1509 states have (on average 1.3399602385685885) internal successors, (2022), 1542 states have internal predecessors, (2022), 224 states have call successors, (224), 136 states have call predecessors, (224), 168 states have return successors, (327), 229 states have call predecessors, (327), 222 states have call successors, (327) [2024-11-13 14:18:33,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 2573 transitions. [2024-11-13 14:18:33,597 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 2573 transitions. Word has length 67 [2024-11-13 14:18:33,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:18:33,597 INFO L471 AbstractCegarLoop]: Abstraction has 1903 states and 2573 transitions. [2024-11-13 14:18:33,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 5 states have internal predecessors, (52), 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) [2024-11-13 14:18:33,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 2573 transitions. [2024-11-13 14:18:33,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-13 14:18:33,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:18:33,600 INFO L215 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, 1] [2024-11-13 14:18:33,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 14:18:33,601 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:18:33,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:18:33,601 INFO L85 PathProgramCache]: Analyzing trace with hash 2058162450, now seen corresponding path program 1 times [2024-11-13 14:18:33,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:18:33,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136103444] [2024-11-13 14:18:33,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:33,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:18:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:33,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:18:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:33,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:18:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:33,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:18:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:33,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:18:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:33,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:18:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:33,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:18:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:33,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:18:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:33,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:18:33,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:18:33,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136103444] [2024-11-13 14:18:33,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136103444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:18:33,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:18:33,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 14:18:33,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588960681] [2024-11-13 14:18:33,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:18:33,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:18:33,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:18:33,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:18:33,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:18:33,728 INFO L87 Difference]: Start difference. First operand 1903 states and 2573 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 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) [2024-11-13 14:18:34,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:18:34,614 INFO L93 Difference]: Finished difference Result 3758 states and 5071 transitions. [2024-11-13 14:18:34,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 14:18:34,615 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), 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 67 [2024-11-13 14:18:34,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:18:34,628 INFO L225 Difference]: With dead ends: 3758 [2024-11-13 14:18:34,628 INFO L226 Difference]: Without dead ends: 2897 [2024-11-13 14:18:34,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-13 14:18:34,633 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 711 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:18:34,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 597 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 14:18:34,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states. [2024-11-13 14:18:34,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 2743. [2024-11-13 14:18:34,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2743 states, 2154 states have (on average 1.3203342618384402) internal successors, (2844), 2202 states have internal predecessors, (2844), 327 states have call successors, (327), 199 states have call predecessors, (327), 260 states have return successors, (521), 349 states have call predecessors, (521), 325 states have call successors, (521) [2024-11-13 14:18:34,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2743 states to 2743 states and 3692 transitions. [2024-11-13 14:18:34,980 INFO L78 Accepts]: Start accepts. Automaton has 2743 states and 3692 transitions. Word has length 67 [2024-11-13 14:18:34,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:18:34,981 INFO L471 AbstractCegarLoop]: Abstraction has 2743 states and 3692 transitions. [2024-11-13 14:18:34,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 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) [2024-11-13 14:18:34,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2743 states and 3692 transitions. [2024-11-13 14:18:34,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-13 14:18:34,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:18:34,983 INFO L215 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, 1, 1] [2024-11-13 14:18:34,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 14:18:34,984 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:18:34,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:18:34,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1484712284, now seen corresponding path program 1 times [2024-11-13 14:18:34,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:18:34,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801602379] [2024-11-13 14:18:34,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:34,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:18:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:35,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:18:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:35,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:18:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:35,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:18:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:35,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:18:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:35,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:18:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:35,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:18:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:35,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:18:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:35,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:18:35,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:18:35,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801602379] [2024-11-13 14:18:35,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801602379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:18:35,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:18:35,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:18:35,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263129832] [2024-11-13 14:18:35,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:18:35,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:18:35,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:18:35,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:18:35,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:18:35,083 INFO L87 Difference]: Start difference. First operand 2743 states and 3692 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 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) [2024-11-13 14:18:35,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:18:35,817 INFO L93 Difference]: Finished difference Result 4438 states and 6028 transitions. [2024-11-13 14:18:35,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:18:35,818 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 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 68 [2024-11-13 14:18:35,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:18:35,822 INFO L225 Difference]: With dead ends: 4438 [2024-11-13 14:18:35,823 INFO L226 Difference]: Without dead ends: 1019 [2024-11-13 14:18:35,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:18:35,830 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 532 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:18:35,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 407 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:18:35,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2024-11-13 14:18:35,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1019. [2024-11-13 14:18:35,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 816 states have (on average 1.3553921568627452) internal successors, (1106), 834 states have internal predecessors, (1106), 122 states have call successors, (122), 72 states have call predecessors, (122), 80 states have return successors, (175), 114 states have call predecessors, (175), 122 states have call successors, (175) [2024-11-13 14:18:35,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1403 transitions. [2024-11-13 14:18:35,955 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1403 transitions. Word has length 68 [2024-11-13 14:18:35,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:18:35,956 INFO L471 AbstractCegarLoop]: Abstraction has 1019 states and 1403 transitions. [2024-11-13 14:18:35,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 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) [2024-11-13 14:18:35,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1403 transitions. [2024-11-13 14:18:35,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 14:18:35,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:18:35,958 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:18:35,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 14:18:35,958 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:18:35,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:18:35,959 INFO L85 PathProgramCache]: Analyzing trace with hash 192328129, now seen corresponding path program 1 times [2024-11-13 14:18:35,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:18:35,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874707175] [2024-11-13 14:18:35,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:35,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:18:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:36,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:18:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:36,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:18:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:36,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 14:18:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:36,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 14:18:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:36,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:18:36,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:36,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 14:18:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:36,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-13 14:18:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:36,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-13 14:18:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:36,092 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 14:18:36,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:18:36,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874707175] [2024-11-13 14:18:36,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874707175] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:18:36,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761949932] [2024-11-13 14:18:36,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:36,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:18:36,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:18:36,095 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:18:36,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:18:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:36,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 14:18:36,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:18:36,268 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 14:18:36,269 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:18:36,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761949932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:18:36,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:18:36,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-13 14:18:36,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387606582] [2024-11-13 14:18:36,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:18:36,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:18:36,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:18:36,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:18:36,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:18:36,270 INFO L87 Difference]: Start difference. First operand 1019 states and 1403 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-13 14:18:36,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:18:36,514 INFO L93 Difference]: Finished difference Result 2934 states and 4068 transitions. [2024-11-13 14:18:36,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:18:36,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93 [2024-11-13 14:18:36,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:18:36,521 INFO L225 Difference]: With dead ends: 2934 [2024-11-13 14:18:36,522 INFO L226 Difference]: Without dead ends: 1271 [2024-11-13 14:18:36,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:18:36,527 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 113 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:18:36,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 364 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:18:36,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2024-11-13 14:18:36,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1271. [2024-11-13 14:18:36,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 1020 states have (on average 1.3490196078431373) internal successors, (1376), 1040 states have internal predecessors, (1376), 150 states have call successors, (150), 90 states have call predecessors, (150), 100 states have return successors, (217), 142 states have call predecessors, (217), 150 states have call successors, (217) [2024-11-13 14:18:36,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1743 transitions. [2024-11-13 14:18:36,677 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1743 transitions. Word has length 93 [2024-11-13 14:18:36,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:18:36,678 INFO L471 AbstractCegarLoop]: Abstraction has 1271 states and 1743 transitions. [2024-11-13 14:18:36,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-13 14:18:36,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1743 transitions. [2024-11-13 14:18:36,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 14:18:36,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:18:36,681 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:18:36,701 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:18:36,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:18:36,882 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:18:36,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:18:36,882 INFO L85 PathProgramCache]: Analyzing trace with hash -703235277, now seen corresponding path program 1 times [2024-11-13 14:18:36,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:18:36,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617741315] [2024-11-13 14:18:36,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:36,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:18:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:36,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:18:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:36,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:18:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:36,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 14:18:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:37,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 14:18:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:37,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:18:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:37,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 14:18:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:37,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-13 14:18:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:37,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:18:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:37,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-13 14:18:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:37,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-13 14:18:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:37,043 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-13 14:18:37,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:18:37,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617741315] [2024-11-13 14:18:37,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617741315] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:18:37,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130104716] [2024-11-13 14:18:37,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:37,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:18:37,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:18:37,046 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:18:37,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 14:18:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:37,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 14:18:37,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:18:37,319 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 14:18:37,320 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:18:37,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130104716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:18:37,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:18:37,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2024-11-13 14:18:37,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557786714] [2024-11-13 14:18:37,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:18:37,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:18:37,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:18:37,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:18:37,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:18:37,322 INFO L87 Difference]: Start difference. First operand 1271 states and 1743 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) [2024-11-13 14:18:37,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:18:37,551 INFO L93 Difference]: Finished difference Result 3030 states and 4196 transitions. [2024-11-13 14:18:37,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:18:37,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 120 [2024-11-13 14:18:37,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:18:37,565 INFO L225 Difference]: With dead ends: 3030 [2024-11-13 14:18:37,565 INFO L226 Difference]: Without dead ends: 2008 [2024-11-13 14:18:37,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:18:37,568 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 67 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:18:37,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 266 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:18:37,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2024-11-13 14:18:37,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1982. [2024-11-13 14:18:37,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1982 states, 1596 states have (on average 1.3471177944862156) internal successors, (2150), 1625 states have internal predecessors, (2150), 228 states have call successors, (228), 141 states have call predecessors, (228), 157 states have return successors, (321), 217 states have call predecessors, (321), 228 states have call successors, (321) [2024-11-13 14:18:37,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 2699 transitions. [2024-11-13 14:18:37,799 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 2699 transitions. Word has length 120 [2024-11-13 14:18:37,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:18:37,800 INFO L471 AbstractCegarLoop]: Abstraction has 1982 states and 2699 transitions. [2024-11-13 14:18:37,800 INFO L472 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) [2024-11-13 14:18:37,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 2699 transitions. [2024-11-13 14:18:37,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 14:18:37,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:18:37,804 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:18:37,823 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 14:18:38,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:18:38,004 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:18:38,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:18:38,005 INFO L85 PathProgramCache]: Analyzing trace with hash 469995754, now seen corresponding path program 1 times [2024-11-13 14:18:38,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:18:38,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434176083] [2024-11-13 14:18:38,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:38,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:18:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:38,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:18:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:38,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:18:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:38,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 14:18:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:38,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 14:18:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:38,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:18:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:38,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:18:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:38,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-13 14:18:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:38,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-13 14:18:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:38,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 14:18:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:38,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-13 14:18:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:38,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-13 14:18:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:38,154 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 14:18:38,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:18:38,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434176083] [2024-11-13 14:18:38,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434176083] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:18:38,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384712965] [2024-11-13 14:18:38,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:38,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:18:38,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:18:38,157 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:18:38,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 14:18:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:38,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 14:18:38,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:18:38,426 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-13 14:18:38,428 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:18:38,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384712965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:18:38,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:18:38,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-13 14:18:38,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728161589] [2024-11-13 14:18:38,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:18:38,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:18:38,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:18:38,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:18:38,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:18:38,430 INFO L87 Difference]: Start difference. First operand 1982 states and 2699 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-13 14:18:38,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:18:38,764 INFO L93 Difference]: Finished difference Result 4260 states and 5857 transitions. [2024-11-13 14:18:38,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:18:38,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 137 [2024-11-13 14:18:38,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:18:38,775 INFO L225 Difference]: With dead ends: 4260 [2024-11-13 14:18:38,776 INFO L226 Difference]: Without dead ends: 2288 [2024-11-13 14:18:38,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:18:38,782 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 118 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:18:38,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 166 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:18:38,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2288 states. [2024-11-13 14:18:39,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2288 to 2222. [2024-11-13 14:18:39,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2222 states, 1815 states have (on average 1.2793388429752066) internal successors, (2322), 1841 states have internal predecessors, (2322), 228 states have call successors, (228), 159 states have call predecessors, (228), 178 states have return successors, (315), 223 states have call predecessors, (315), 228 states have call successors, (315) [2024-11-13 14:18:39,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 2222 states and 2865 transitions. [2024-11-13 14:18:39,031 INFO L78 Accepts]: Start accepts. Automaton has 2222 states and 2865 transitions. Word has length 137 [2024-11-13 14:18:39,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:18:39,031 INFO L471 AbstractCegarLoop]: Abstraction has 2222 states and 2865 transitions. [2024-11-13 14:18:39,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-13 14:18:39,032 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 2865 transitions. [2024-11-13 14:18:39,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 14:18:39,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:18:39,035 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:18:39,057 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-13 14:18:39,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-13 14:18:39,241 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:18:39,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:18:39,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1395817833, now seen corresponding path program 1 times [2024-11-13 14:18:39,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:18:39,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72030627] [2024-11-13 14:18:39,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:39,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:18:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:39,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:18:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:39,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:18:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:39,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 14:18:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:39,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 14:18:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:39,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:18:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:39,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:18:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:39,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-13 14:18:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:39,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-13 14:18:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:39,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 14:18:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:39,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-13 14:18:39,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:39,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-13 14:18:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:39,375 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 14:18:39,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:18:39,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72030627] [2024-11-13 14:18:39,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72030627] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:18:39,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009996635] [2024-11-13 14:18:39,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:39,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:18:39,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:18:39,378 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:18:39,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 14:18:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:39,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:18:39,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:18:39,528 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-13 14:18:39,528 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:18:39,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009996635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:18:39,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:18:39,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-13 14:18:39,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986809654] [2024-11-13 14:18:39,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:18:39,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:18:39,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:18:39,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:18:39,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:18:39,530 INFO L87 Difference]: Start difference. First operand 2222 states and 2865 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-13 14:18:39,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:18:39,793 INFO L93 Difference]: Finished difference Result 4483 states and 5812 transitions. [2024-11-13 14:18:39,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:18:39,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 137 [2024-11-13 14:18:39,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:18:39,804 INFO L225 Difference]: With dead ends: 4483 [2024-11-13 14:18:39,804 INFO L226 Difference]: Without dead ends: 2273 [2024-11-13 14:18:39,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:18:39,810 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 119 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:18:39,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 269 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:18:39,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2024-11-13 14:18:40,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2204. [2024-11-13 14:18:40,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2204 states, 1797 states have (on average 1.2520868113522539) internal successors, (2250), 1823 states have internal predecessors, (2250), 228 states have call successors, (228), 159 states have call predecessors, (228), 178 states have return successors, (315), 223 states have call predecessors, (315), 228 states have call successors, (315) [2024-11-13 14:18:40,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2204 states to 2204 states and 2793 transitions. [2024-11-13 14:18:40,101 INFO L78 Accepts]: Start accepts. Automaton has 2204 states and 2793 transitions. Word has length 137 [2024-11-13 14:18:40,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:18:40,101 INFO L471 AbstractCegarLoop]: Abstraction has 2204 states and 2793 transitions. [2024-11-13 14:18:40,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-13 14:18:40,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2204 states and 2793 transitions. [2024-11-13 14:18:40,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 14:18:40,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:18:40,106 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:18:40,126 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 14:18:40,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-13 14:18:40,307 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:18:40,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:18:40,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1616461022, now seen corresponding path program 1 times [2024-11-13 14:18:40,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:18:40,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519225957] [2024-11-13 14:18:40,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:40,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:18:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:40,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:18:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:40,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:18:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:40,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 14:18:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:40,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 14:18:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:40,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:18:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:40,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 14:18:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:40,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-13 14:18:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:40,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 14:18:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:40,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 14:18:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:40,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-13 14:18:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:40,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-13 14:18:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:40,452 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-13 14:18:40,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:18:40,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519225957] [2024-11-13 14:18:40,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519225957] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:18:40,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633161397] [2024-11-13 14:18:40,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:40,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:18:40,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:18:40,456 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:18:40,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 14:18:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:40,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 14:18:40,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:18:40,613 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-13 14:18:40,613 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:18:40,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633161397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:18:40,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:18:40,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-13 14:18:40,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345757823] [2024-11-13 14:18:40,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:18:40,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:18:40,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:18:40,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:18:40,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:18:40,616 INFO L87 Difference]: Start difference. First operand 2204 states and 2793 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-13 14:18:40,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:18:40,984 INFO L93 Difference]: Finished difference Result 4314 states and 5550 transitions. [2024-11-13 14:18:40,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:18:40,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 138 [2024-11-13 14:18:40,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:18:41,004 INFO L225 Difference]: With dead ends: 4314 [2024-11-13 14:18:41,005 INFO L226 Difference]: Without dead ends: 3199 [2024-11-13 14:18:41,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:18:41,008 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 104 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:18:41,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 380 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:18:41,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3199 states. [2024-11-13 14:18:41,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3199 to 3197. [2024-11-13 14:18:41,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3197 states, 2610 states have (on average 1.2482758620689656) internal successors, (3258), 2647 states have internal predecessors, (3258), 328 states have call successors, (328), 231 states have call predecessors, (328), 258 states have return successors, (503), 320 states have call predecessors, (503), 328 states have call successors, (503) [2024-11-13 14:18:41,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3197 states to 3197 states and 4089 transitions. [2024-11-13 14:18:41,483 INFO L78 Accepts]: Start accepts. Automaton has 3197 states and 4089 transitions. Word has length 138 [2024-11-13 14:18:41,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:18:41,483 INFO L471 AbstractCegarLoop]: Abstraction has 3197 states and 4089 transitions. [2024-11-13 14:18:41,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-13 14:18:41,484 INFO L276 IsEmpty]: Start isEmpty. Operand 3197 states and 4089 transitions. [2024-11-13 14:18:41,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-13 14:18:41,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:18:41,489 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:18:41,510 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 14:18:41,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:18:41,691 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:18:41,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:18:41,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1819062281, now seen corresponding path program 1 times [2024-11-13 14:18:41,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:18:41,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492055744] [2024-11-13 14:18:41,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:41,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:18:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:41,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:18:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:41,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:18:41,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:41,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 14:18:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:41,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 14:18:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:41,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:18:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:41,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:18:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:41,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-13 14:18:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:41,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-13 14:18:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:41,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 14:18:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:41,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-13 14:18:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:41,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 14:18:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:41,854 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-13 14:18:41,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:18:41,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492055744] [2024-11-13 14:18:41,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492055744] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:18:41,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646256720] [2024-11-13 14:18:41,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:41,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:18:41,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:18:41,857 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:18:41,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 14:18:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:41,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:18:41,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:18:42,084 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 14:18:42,085 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:18:42,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646256720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:18:42,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:18:42,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-13 14:18:42,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416776999] [2024-11-13 14:18:42,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:18:42,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:18:42,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:18:42,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:18:42,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:18:42,088 INFO L87 Difference]: Start difference. First operand 3197 states and 4089 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-13 14:18:42,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:18:42,396 INFO L93 Difference]: Finished difference Result 4953 states and 6491 transitions. [2024-11-13 14:18:42,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:18:42,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 139 [2024-11-13 14:18:42,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:18:42,415 INFO L225 Difference]: With dead ends: 4953 [2024-11-13 14:18:42,416 INFO L226 Difference]: Without dead ends: 2845 [2024-11-13 14:18:42,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:18:42,422 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 75 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:18:42,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 346 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:18:42,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2024-11-13 14:18:42,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 2789. [2024-11-13 14:18:42,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2789 states, 2283 states have (on average 1.228646517739816) internal successors, (2805), 2316 states have internal predecessors, (2805), 284 states have call successors, (284), 201 states have call predecessors, (284), 221 states have return successors, (417), 273 states have call predecessors, (417), 284 states have call successors, (417) [2024-11-13 14:18:42,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 3506 transitions. [2024-11-13 14:18:42,786 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 3506 transitions. Word has length 139 [2024-11-13 14:18:42,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:18:42,787 INFO L471 AbstractCegarLoop]: Abstraction has 2789 states and 3506 transitions. [2024-11-13 14:18:42,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-13 14:18:42,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 3506 transitions. [2024-11-13 14:18:42,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 14:18:42,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:18:42,792 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:18:42,812 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-13 14:18:42,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:18:42,996 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:18:42,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:18:42,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1566628801, now seen corresponding path program 1 times [2024-11-13 14:18:42,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:18:42,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856089562] [2024-11-13 14:18:42,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:42,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:18:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:43,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:18:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:43,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:18:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:43,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 14:18:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:43,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 14:18:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:43,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:18:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:43,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:18:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:43,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-13 14:18:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:43,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-13 14:18:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:43,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 14:18:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:43,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-13 14:18:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:43,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-13 14:18:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:43,116 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-13 14:18:43,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:18:43,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856089562] [2024-11-13 14:18:43,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856089562] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:18:43,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002921011] [2024-11-13 14:18:43,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:43,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:18:43,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:18:43,119 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:18:43,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 14:18:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:43,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 14:18:43,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:18:43,366 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-13 14:18:43,367 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:18:43,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002921011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:18:43,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:18:43,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-13 14:18:43,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660103066] [2024-11-13 14:18:43,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:18:43,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:18:43,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:18:43,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:18:43,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:18:43,369 INFO L87 Difference]: Start difference. First operand 2789 states and 3506 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-13 14:18:43,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:18:43,958 INFO L93 Difference]: Finished difference Result 4701 states and 5966 transitions. [2024-11-13 14:18:43,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:18:43,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 140 [2024-11-13 14:18:43,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:18:43,975 INFO L225 Difference]: With dead ends: 4701 [2024-11-13 14:18:43,975 INFO L226 Difference]: Without dead ends: 2779 [2024-11-13 14:18:43,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:18:43,980 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 135 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:18:43,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 227 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:18:43,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2779 states. [2024-11-13 14:18:44,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2779 to 1955. [2024-11-13 14:18:44,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1955 states, 1604 states have (on average 1.1970074812967582) internal successors, (1920), 1623 states have internal predecessors, (1920), 201 states have call successors, (201), 139 states have call predecessors, (201), 149 states have return successors, (276), 193 states have call predecessors, (276), 201 states have call successors, (276) [2024-11-13 14:18:44,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 1955 states and 2397 transitions. [2024-11-13 14:18:44,252 INFO L78 Accepts]: Start accepts. Automaton has 1955 states and 2397 transitions. Word has length 140 [2024-11-13 14:18:44,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:18:44,253 INFO L471 AbstractCegarLoop]: Abstraction has 1955 states and 2397 transitions. [2024-11-13 14:18:44,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-13 14:18:44,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 2397 transitions. [2024-11-13 14:18:44,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 14:18:44,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:18:44,256 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:18:44,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-13 14:18:44,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:18:44,457 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:18:44,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:18:44,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1685070275, now seen corresponding path program 1 times [2024-11-13 14:18:44,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:18:44,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828856063] [2024-11-13 14:18:44,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:44,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:18:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:44,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:18:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:44,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:18:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:44,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 14:18:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:44,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 14:18:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:44,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:18:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:44,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:18:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:44,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-13 14:18:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:44,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-13 14:18:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:44,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 14:18:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:44,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-13 14:18:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:44,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-13 14:18:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:44,578 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-13 14:18:44,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:18:44,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828856063] [2024-11-13 14:18:44,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828856063] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:18:44,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941106901] [2024-11-13 14:18:44,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:44,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:18:44,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:18:44,581 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:18:44,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 14:18:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:44,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 14:18:44,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:18:44,806 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-13 14:18:44,806 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:18:44,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941106901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:18:44,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:18:44,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-13 14:18:44,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66104339] [2024-11-13 14:18:44,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:18:44,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:18:44,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:18:44,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:18:44,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:18:44,809 INFO L87 Difference]: Start difference. First operand 1955 states and 2397 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-13 14:18:45,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:18:45,169 INFO L93 Difference]: Finished difference Result 3618 states and 4470 transitions. [2024-11-13 14:18:45,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:18:45,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 140 [2024-11-13 14:18:45,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:18:45,178 INFO L225 Difference]: With dead ends: 3618 [2024-11-13 14:18:45,179 INFO L226 Difference]: Without dead ends: 1675 [2024-11-13 14:18:45,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:18:45,184 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 172 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:18:45,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 222 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:18:45,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2024-11-13 14:18:45,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1653. [2024-11-13 14:18:45,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1360 states have (on average 1.1433823529411764) internal successors, (1555), 1375 states have internal predecessors, (1555), 163 states have call successors, (163), 117 states have call predecessors, (163), 129 states have return successors, (221), 161 states have call predecessors, (221), 163 states have call successors, (221) [2024-11-13 14:18:45,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 1939 transitions. [2024-11-13 14:18:45,409 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 1939 transitions. Word has length 140 [2024-11-13 14:18:45,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:18:45,409 INFO L471 AbstractCegarLoop]: Abstraction has 1653 states and 1939 transitions. [2024-11-13 14:18:45,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-13 14:18:45,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 1939 transitions. [2024-11-13 14:18:45,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 14:18:45,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:18:45,412 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:18:45,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-13 14:18:45,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:18:45,613 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:18:45,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:18:45,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1220603007, now seen corresponding path program 1 times [2024-11-13 14:18:45,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:18:45,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7306045] [2024-11-13 14:18:45,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:45,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:18:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:45,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:18:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:45,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:18:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:45,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 14:18:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:45,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 14:18:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:45,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:18:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:45,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:18:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:45,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-13 14:18:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:45,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-13 14:18:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:45,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 14:18:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:45,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-13 14:18:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:45,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-13 14:18:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:45,719 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-13 14:18:45,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:18:45,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7306045] [2024-11-13 14:18:45,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7306045] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:18:45,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872776208] [2024-11-13 14:18:45,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:45,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:18:45,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:18:45,722 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:18:45,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 14:18:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:45,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:18:45,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:18:45,965 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 57 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 14:18:45,965 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:18:46,061 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-13 14:18:46,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872776208] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:18:46,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:18:46,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 4] total 9 [2024-11-13 14:18:46,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192697836] [2024-11-13 14:18:46,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:18:46,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:18:46,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:18:46,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:18:46,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:18:46,063 INFO L87 Difference]: Start difference. First operand 1653 states and 1939 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-13 14:18:46,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:18:46,656 INFO L93 Difference]: Finished difference Result 3275 states and 3814 transitions. [2024-11-13 14:18:46,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:18:46,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 140 [2024-11-13 14:18:46,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:18:46,670 INFO L225 Difference]: With dead ends: 3275 [2024-11-13 14:18:46,670 INFO L226 Difference]: Without dead ends: 3273 [2024-11-13 14:18:46,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:18:46,672 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 210 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:18:46,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 427 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:18:46,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3273 states. [2024-11-13 14:18:47,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3273 to 2935. [2024-11-13 14:18:47,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2935 states, 2414 states have (on average 1.1387738193869097) internal successors, (2749), 2439 states have internal predecessors, (2749), 291 states have call successors, (291), 205 states have call predecessors, (291), 229 states have return successors, (382), 291 states have call predecessors, (382), 291 states have call successors, (382) [2024-11-13 14:18:47,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2935 states to 2935 states and 3422 transitions. [2024-11-13 14:18:47,107 INFO L78 Accepts]: Start accepts. Automaton has 2935 states and 3422 transitions. Word has length 140 [2024-11-13 14:18:47,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:18:47,108 INFO L471 AbstractCegarLoop]: Abstraction has 2935 states and 3422 transitions. [2024-11-13 14:18:47,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-13 14:18:47,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2935 states and 3422 transitions. [2024-11-13 14:18:47,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 14:18:47,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:18:47,116 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:18:47,136 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 14:18:47,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-13 14:18:47,317 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:18:47,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:18:47,318 INFO L85 PathProgramCache]: Analyzing trace with hash 57423791, now seen corresponding path program 1 times [2024-11-13 14:18:47,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:18:47,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251777510] [2024-11-13 14:18:47,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:47,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:18:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:47,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:18:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:47,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:18:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:47,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 14:18:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:47,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 14:18:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:47,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:18:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:47,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:18:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:47,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-13 14:18:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:47,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-13 14:18:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:47,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 14:18:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:47,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-13 14:18:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:47,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-13 14:18:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:47,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-13 14:18:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:47,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-13 14:18:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:47,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-13 14:18:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:47,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-13 14:18:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:47,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-13 14:18:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:47,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-13 14:18:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:47,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-13 14:18:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:47,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-11-13 14:18:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:47,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-13 14:18:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:47,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-13 14:18:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:47,485 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2024-11-13 14:18:47,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:18:47,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251777510] [2024-11-13 14:18:47,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251777510] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:18:47,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328006827] [2024-11-13 14:18:47,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:47,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:18:47,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:18:47,487 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:18:47,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 14:18:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:47,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 704 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:18:47,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:18:47,716 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-13 14:18:47,716 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:18:47,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328006827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:18:47,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:18:47,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-11-13 14:18:47,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919425320] [2024-11-13 14:18:47,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:18:47,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:18:47,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:18:47,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:18:47,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:18:47,718 INFO L87 Difference]: Start difference. First operand 2935 states and 3422 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-13 14:18:47,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:18:47,905 INFO L93 Difference]: Finished difference Result 4121 states and 4790 transitions. [2024-11-13 14:18:47,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:18:47,906 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 248 [2024-11-13 14:18:47,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:18:47,913 INFO L225 Difference]: With dead ends: 4121 [2024-11-13 14:18:47,913 INFO L226 Difference]: Without dead ends: 1198 [2024-11-13 14:18:47,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:18:47,918 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:18:47,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 656 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:18:47,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2024-11-13 14:18:48,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1198. [2024-11-13 14:18:48,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 989 states have (on average 1.1253791708796765) internal successors, (1113), 1000 states have internal predecessors, (1113), 103 states have call successors, (103), 78 states have call predecessors, (103), 105 states have return successors, (156), 119 states have call predecessors, (156), 103 states have call successors, (156) [2024-11-13 14:18:48,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1372 transitions. [2024-11-13 14:18:48,062 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1372 transitions. Word has length 248 [2024-11-13 14:18:48,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:18:48,063 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1372 transitions. [2024-11-13 14:18:48,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-13 14:18:48,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1372 transitions. [2024-11-13 14:18:48,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-13 14:18:48,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:18:48,067 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:18:48,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-13 14:18:48,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-13 14:18:48,267 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:18:48,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:18:48,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1603149273, now seen corresponding path program 1 times [2024-11-13 14:18:48,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:18:48,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915923656] [2024-11-13 14:18:48,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:48,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:18:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:48,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:18:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:48,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:18:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:48,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 14:18:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:48,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 14:18:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:48,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:18:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:48,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:18:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:48,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-13 14:18:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:48,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-13 14:18:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:48,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 14:18:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:48,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-13 14:18:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:48,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-13 14:18:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:48,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 14:18:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:48,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 14:18:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:48,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-13 14:18:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:48,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-13 14:18:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:48,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-13 14:18:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:48,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-13 14:18:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:48,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-13 14:18:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:48,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-13 14:18:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:48,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-13 14:18:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:48,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-13 14:18:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:48,446 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2024-11-13 14:18:48,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:18:48,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915923656] [2024-11-13 14:18:48,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915923656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:18:48,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100742002] [2024-11-13 14:18:48,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:48,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:18:48,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:18:48,449 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:18:48,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 14:18:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:48,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:18:48,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:18:48,656 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-11-13 14:18:48,656 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:18:48,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100742002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:18:48,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:18:48,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2024-11-13 14:18:48,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022882437] [2024-11-13 14:18:48,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:18:48,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:18:48,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:18:48,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:18:48,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:18:48,658 INFO L87 Difference]: Start difference. First operand 1198 states and 1372 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-13 14:18:48,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:18:48,793 INFO L93 Difference]: Finished difference Result 2132 states and 2451 transitions. [2024-11-13 14:18:48,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:18:48,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 250 [2024-11-13 14:18:48,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:18:48,800 INFO L225 Difference]: With dead ends: 2132 [2024-11-13 14:18:48,800 INFO L226 Difference]: Without dead ends: 1198 [2024-11-13 14:18:48,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:18:48,802 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:18:48,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 529 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:18:48,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2024-11-13 14:18:48,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1198. [2024-11-13 14:18:48,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 989 states have (on average 1.121334681496461) internal successors, (1109), 1000 states have internal predecessors, (1109), 103 states have call successors, (103), 78 states have call predecessors, (103), 105 states have return successors, (156), 119 states have call predecessors, (156), 103 states have call successors, (156) [2024-11-13 14:18:48,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1368 transitions. [2024-11-13 14:18:48,991 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1368 transitions. Word has length 250 [2024-11-13 14:18:48,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:18:48,991 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1368 transitions. [2024-11-13 14:18:48,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-13 14:18:48,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1368 transitions. [2024-11-13 14:18:48,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-13 14:18:48,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:18:48,995 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:18:49,015 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 14:18:49,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-13 14:18:49,196 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:18:49,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:18:49,196 INFO L85 PathProgramCache]: Analyzing trace with hash 308357143, now seen corresponding path program 2 times [2024-11-13 14:18:49,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:18:49,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709787728] [2024-11-13 14:18:49,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:18:49,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:18:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:49,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 14:18:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:49,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:18:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:49,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 14:18:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:49,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 14:18:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:49,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:18:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:49,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:18:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:49,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-13 14:18:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:49,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-13 14:18:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:49,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 14:18:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:49,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-13 14:18:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:49,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 14:18:49,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:49,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-13 14:18:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:49,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-13 14:18:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:49,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-13 14:18:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:49,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-13 14:18:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:49,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-13 14:18:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:49,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-13 14:18:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:49,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-13 14:18:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:49,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-13 14:18:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:49,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-13 14:18:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:49,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-13 14:18:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:18:49,359 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2024-11-13 14:18:49,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:18:49,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709787728] [2024-11-13 14:18:49,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709787728] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:18:49,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535421525] [2024-11-13 14:18:49,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:18:49,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:18:49,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:18:49,362 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:18:49,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 14:18:49,467 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 14:18:49,467 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:18:49,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 14:18:49,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:18:49,488 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-13 14:18:49,488 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:18:49,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535421525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:18:49,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:18:49,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2024-11-13 14:18:49,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465817882] [2024-11-13 14:18:49,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:18:49,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:18:49,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:18:49,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:18:49,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:18:49,490 INFO L87 Difference]: Start difference. First operand 1198 states and 1368 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-13 14:18:49,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:18:49,616 INFO L93 Difference]: Finished difference Result 2108 states and 2440 transitions. [2024-11-13 14:18:49,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:18:49,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 251 [2024-11-13 14:18:49,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:18:49,621 INFO L225 Difference]: With dead ends: 2108 [2024-11-13 14:18:49,621 INFO L226 Difference]: Without dead ends: 0 [2024-11-13 14:18:49,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:18:49,625 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:18:49,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 518 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:18:49,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-13 14:18:49,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-13 14:18:49,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:18:49,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-13 14:18:49,632 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 251 [2024-11-13 14:18:49,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:18:49,632 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-13 14:18:49,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-13 14:18:49,632 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-13 14:18:49,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 14:18:49,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-13 14:18:49,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-13 14:18:49,657 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 14:18:49,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-13 14:18:49,844 INFO L407 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] [2024-11-13 14:18:49,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-13 14:20:29,048 WARN L286 SmtUtils]: Spent 9.35s on a formula simplification. DAG size of input: 89 DAG size of output: 73 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-13 14:20:38,699 WARN L286 SmtUtils]: Spent 9.65s on a formula simplification. DAG size of input: 91 DAG size of output: 82 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-13 14:20:47,970 WARN L286 SmtUtils]: Spent 9.27s on a formula simplification. DAG size of input: 88 DAG size of output: 83 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-13 14:20:59,136 WARN L286 SmtUtils]: Spent 9.57s on a formula simplification. DAG size of input: 88 DAG size of output: 82 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-13 14:21:12,964 WARN L286 SmtUtils]: Spent 9.74s on a formula simplification. DAG size of input: 90 DAG size of output: 92 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-13 14:21:22,273 WARN L286 SmtUtils]: Spent 9.20s on a formula simplification. DAG size of input: 86 DAG size of output: 73 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-13 14:22:04,684 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:22:04,739 WARN L162 FloydHoareUtils]: Requires clause for immediate_notify contained old-variable. Original clause: (and (= |old(~t1_st~0)| ~t1_st~0) (let ((.cse0 (= ~t1_pc~0 1)) (.cse9 (<= 2 ~E_M~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (= ~token~0 ~local~0)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (<= 2 |old(~m_st~0)|)) (.cse6 (not (= ~E_M~0 0))) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 (<= 2 ~E_1~0) .cse1 (= (+ ~local~0 1) ~token~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 (= ~m_pc~0 ~t1_pc~0) .cse9 .cse2 .cse3 (<= ~t1_pc~0 0) .cse5 .cse7 .cse8 .cse10 (= ~M_E~0 2)) (and .cse0 .cse1 .cse9 .cse2 (<= 2 |old(~t1_st~0)|) .cse3 .cse5 .cse7 .cse8 .cse10) (and .cse1 .cse2 (or (< 0 ~t1_pc~0) (< 0 ~m_pc~0)) .cse3 .cse4 .cse6 .cse7 .cse8 (or (< ~m_pc~0 1) (and (<= ~t1_pc~0 1) (<= 2 ~m_pc~0)))))) (= ~m_st~0 |old(~m_st~0)|)) Eliminated clause: (let ((.cse3 (<= 2 ~E_M~0)) (.cse8 (= ~token~0 ~local~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~t1_i~0 1)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse9 (<= 2 ~m_st~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~E_M~0 0))) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0))) (or (and .cse0 (<= 2 ~t1_st~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse3 .cse4 (<= ~t1_pc~0 0) .cse5 .cse6 .cse7 .cse8 (= ~M_E~0 2)) (and .cse1 .cse2 .cse4 (or (< 0 ~t1_pc~0) (< 0 ~m_pc~0)) .cse9 .cse10 .cse6 .cse7 (or (< ~m_pc~0 1) (and (<= ~t1_pc~0 1) (<= 2 ~m_pc~0)))) (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 (= (+ ~local~0 1) ~token~0) .cse4 .cse9 .cse5 .cse10 .cse6 .cse7))) [2024-11-13 14:22:04,785 WARN L162 FloydHoareUtils]: Requires clause for update_channels1 contained old-variable. Original clause: (and (= ~q_ev~0 |old(~q_ev~0)|) (let ((.cse3 (= ~c_dr_pc~0 1)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse7 (<= 1 ~p_dw_pc~0)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~c_dr_pc~0 0)) (.cse5 (= ~M_E~0 2))) (or (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse4 .cse6 .cse5))) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|)) Eliminated clause: (let ((.cse7 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~T1_E~0 2)) (.cse3 (not (= ~m_pc~0 1))) (.cse8 (= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse8 .cse4 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse6))) [2024-11-13 14:22:04,821 WARN L162 FloydHoareUtils]: Requires clause for activate_threads2 contained old-variable. Original clause: (and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (let ((.cse12 (<= ~t1_pc~0 0)) (.cse11 (<= 2 |old(~t1_st~0)|)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (= ~token~0 ~local~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse5 (<= 2 |old(~m_st~0)|)) (.cse7 (not (= ~E_M~0 0))) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 (= (+ ~local~0 1) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse11 .cse4 .cse5 .cse6 .cse8 .cse9) (and .cse2 (= ~m_pc~0 ~t1_pc~0) .cse10 .cse3 .cse4 .cse12 .cse6 .cse8 .cse9 .cse13 (= ~M_E~0 2)) (and .cse1 .cse2 .cse10 .cse3 .cse4 .cse12 .cse5 .cse6 .cse8 .cse9 .cse13) (and .cse0 .cse2 .cse10 .cse3 .cse11 .cse4 .cse6 .cse8 .cse9 .cse13) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse13) (and .cse2 .cse3 (not (= ~m_pc~0 1)) .cse4 .cse5 .cse7 .cse8 .cse9)))) Eliminated clause: (let ((.cse12 (<= 2 ~t1_st~0)) (.cse3 (<= 2 ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse10 (= ~token~0 ~local~0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~t1_i~0 1)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse5 (<= 2 ~m_st~0)) (.cse7 (<= 2 ~T1_E~0)) (.cse13 (not (= ~E_M~0 0))) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9) (and .cse11 .cse12 .cse0 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~M_E~0 2)) (and .cse0 .cse2 .cse4 (not (= ~m_pc~0 1)) .cse5 .cse13 .cse8 .cse9) (and .cse11 .cse0 .cse1 .cse2 (= (+ ~local~0 1) ~token~0) .cse4 .cse5 .cse7 .cse13 .cse8 .cse9))) [2024-11-13 14:22:04,899 WARN L162 FloydHoareUtils]: Requires clause for activate_threads1 contained old-variable. Original clause: (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (let ((.cse3 (= ~c_dr_pc~0 1)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse7 (<= 1 ~p_dw_pc~0)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~c_dr_pc~0 0)) (.cse5 (= ~M_E~0 2))) (or (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse4 .cse6 .cse5)))) Eliminated clause: (let ((.cse7 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~T1_E~0 2)) (.cse3 (not (= ~m_pc~0 1))) (.cse8 (= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse8 .cse4 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse6))) [2024-11-13 14:22:04,982 WARN L162 FloydHoareUtils]: Requires clause for fire_delta_events2 contained old-variable. Original clause: (let ((.cse0 (= ~m_st~0 0))) (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (or (and (= ~T1_E~0 2) (= ~M_E~0 2)) (not .cse0)) (let ((.cse8 (<= ~t1_pc~0 0)) (.cse11 (= ~token~0 ~local~0)) (.cse12 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse7 (<= 2 |old(~T1_E~0)|)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse9 (<= 2 |old(~E_M~0)|)) (.cse10 (<= 2 |old(~E_1~0)|)) (.cse5 (= ~p_dw_st~0 0)) (.cse6 (= ~c_dr_pc~0 0))) (or (and .cse1 .cse2 (not (= ~m_pc~0 1)) .cse3 .cse4 (not (= |old(~E_M~0)| 0)) .cse5 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse8 .cse9 .cse10 .cse5 .cse6 .cse11) (and .cse12 .cse1 .cse2 .cse7 .cse3 .cse4 .cse9 .cse10 .cse5 .cse6 .cse11) (and .cse1 (= ~m_pc~0 ~t1_pc~0) .cse2 .cse0 .cse4 .cse8 .cse9 .cse10 .cse5 .cse6 .cse11) (and .cse12 (<= 2 ~t1_st~0) .cse1 .cse2 .cse7 .cse3 .cse4 .cse9 .cse10 .cse5 .cse6))) (= ~E_1~0 |old(~E_1~0)|))) Eliminated clause: (let ((.cse0 (= ~m_st~0 0))) (and (or (and (= ~T1_E~0 2) (= ~M_E~0 2)) (not .cse0)) (let ((.cse12 (= ~t1_pc~0 1)) (.cse8 (<= 2 ~T1_E~0)) (.cse6 (<= 2 ~m_st~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse7 (<= ~t1_pc~0 0)) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~token~0 ~local~0))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11) (and .cse12 (<= 2 ~t1_st~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10) (and .cse1 .cse3 .cse5 (not (= ~m_pc~0 1)) .cse6 (not (= ~E_M~0 0)) .cse9 .cse10) (and .cse1 .cse2 .cse3 (= ~m_pc~0 ~t1_pc~0) .cse4 .cse5 .cse0 .cse7 .cse9 .cse10 .cse11))))) [2024-11-13 14:22:05,037 WARN L162 FloydHoareUtils]: Requires clause for fire_delta_events1 contained old-variable. Original clause: (and (let ((.cse3 (= ~c_dr_pc~0 1)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse7 (<= 1 ~p_dw_pc~0)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~c_dr_pc~0 0)) (.cse5 (= ~M_E~0 2))) (or (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse4 .cse6 .cse5))) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)) Eliminated clause: (let ((.cse7 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~T1_E~0 2)) (.cse3 (not (= ~m_pc~0 1))) (.cse8 (= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse8 .cse4 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse6))) [2024-11-13 14:22:05,202 WARN L162 FloydHoareUtils]: Requires clause for reset_delta_events1 contained old-variable. Original clause: (and (let ((.cse3 (= ~c_dr_pc~0 1)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse7 (<= 1 ~p_dw_pc~0)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~c_dr_pc~0 0)) (.cse5 (= ~M_E~0 2))) (or (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse4 .cse6 .cse5))) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)) Eliminated clause: (let ((.cse7 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~T1_E~0 2)) (.cse3 (not (= ~m_pc~0 1))) (.cse8 (= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse8 .cse4 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse6))) [2024-11-13 14:22:05,237 WARN L162 FloydHoareUtils]: Requires clause for reset_delta_events2 contained old-variable. Original clause: (let ((.cse0 (= ~m_st~0 0))) (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (or (and (= ~T1_E~0 2) (= ~M_E~0 2)) (not .cse0)) (let ((.cse8 (<= ~t1_pc~0 0)) (.cse11 (= ~token~0 ~local~0)) (.cse12 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse7 (<= 2 |old(~T1_E~0)|)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse9 (<= 2 |old(~E_M~0)|)) (.cse10 (<= 2 |old(~E_1~0)|)) (.cse5 (= ~p_dw_st~0 0)) (.cse6 (= ~c_dr_pc~0 0))) (or (and .cse1 .cse2 (not (= ~m_pc~0 1)) .cse3 .cse4 (not (= |old(~E_M~0)| 0)) .cse5 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse8 .cse9 .cse10 .cse5 .cse6 .cse11) (and .cse12 .cse1 .cse2 .cse7 .cse3 .cse4 .cse9 .cse10 .cse5 .cse6 .cse11) (and .cse1 (= ~m_pc~0 ~t1_pc~0) .cse2 .cse0 .cse4 .cse8 .cse9 .cse10 .cse5 .cse6 .cse11) (and .cse12 (<= 2 ~t1_st~0) .cse1 .cse2 .cse7 .cse3 .cse4 .cse9 .cse10 .cse5 .cse6))) (= ~E_1~0 |old(~E_1~0)|))) Eliminated clause: (let ((.cse0 (= ~m_st~0 0))) (and (or (and (= ~T1_E~0 2) (= ~M_E~0 2)) (not .cse0)) (let ((.cse12 (= ~t1_pc~0 1)) (.cse8 (<= 2 ~T1_E~0)) (.cse6 (<= 2 ~m_st~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse7 (<= ~t1_pc~0 0)) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~token~0 ~local~0))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11) (and .cse12 (<= 2 ~t1_st~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10) (and .cse1 .cse3 .cse5 (not (= ~m_pc~0 1)) .cse6 (not (= ~E_M~0 0)) .cse9 .cse10) (and .cse1 .cse2 .cse3 (= ~m_pc~0 ~t1_pc~0) .cse4 .cse5 .cse0 .cse7 .cse9 .cse10 .cse11))))) [2024-11-13 14:22:05,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:22:05 BoogieIcfgContainer [2024-11-13 14:22:05,273 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:22:05,274 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:22:05,274 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:22:05,274 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:22:05,275 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:18:15" (3/4) ... [2024-11-13 14:22:05,277 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 14:22:05,283 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2024-11-13 14:22:05,284 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2024-11-13 14:22:05,284 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2024-11-13 14:22:05,284 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2024-11-13 14:22:05,284 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2024-11-13 14:22:05,284 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2024-11-13 14:22:05,284 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2024-11-13 14:22:05,284 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2024-11-13 14:22:05,285 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2024-11-13 14:22:05,285 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2024-11-13 14:22:05,285 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2024-11-13 14:22:05,285 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2024-11-13 14:22:05,285 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2024-11-13 14:22:05,285 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2024-11-13 14:22:05,303 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2024-11-13 14:22:05,306 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-13 14:22:05,307 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-13 14:22:05,307 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 14:22:05,487 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 14:22:05,488 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/witness.yml [2024-11-13 14:22:05,488 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:22:05,489 INFO L158 Benchmark]: Toolchain (without parser) took 231752.65ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 93.6MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 119.7MB. Max. memory is 16.1GB. [2024-11-13 14:22:05,490 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 167.8MB. Free memory is still 104.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:22:05,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 497.57ms. Allocated memory is still 117.4MB. Free memory was 93.6MB in the beginning and 76.5MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 14:22:05,491 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.49ms. Allocated memory is still 117.4MB. Free memory was 76.5MB in the beginning and 74.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:22:05,491 INFO L158 Benchmark]: Boogie Preprocessor took 83.86ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 71.5MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:22:05,491 INFO L158 Benchmark]: RCFGBuilder took 869.18ms. Allocated memory is still 117.4MB. Free memory was 71.2MB in the beginning and 41.2MB in the end (delta: 30.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-13 14:22:05,491 INFO L158 Benchmark]: TraceAbstraction took 230001.33ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 40.6MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-11-13 14:22:05,492 INFO L158 Benchmark]: Witness Printer took 213.83ms. Allocated memory is still 1.7GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:22:05,493 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.35ms. Allocated memory is still 167.8MB. Free memory is still 104.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 497.57ms. Allocated memory is still 117.4MB. Free memory was 93.6MB in the beginning and 76.5MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.49ms. Allocated memory is still 117.4MB. Free memory was 76.5MB in the beginning and 74.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 83.86ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 71.5MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 869.18ms. Allocated memory is still 117.4MB. Free memory was 71.2MB in the beginning and 41.2MB in the end (delta: 30.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 230001.33ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 40.6MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 213.83ms. Allocated memory is still 1.7GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 599]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 27]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 226 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 34.5s, OverallIterations: 26, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 19.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10086 SdHoareTripleChecker+Valid, 11.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9834 mSDsluCounter, 16100 SdHoareTripleChecker+Invalid, 9.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11190 mSDsCounter, 2041 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10338 IncrementalHoareTripleChecker+Invalid, 12379 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2041 mSolverCounterUnsat, 4910 mSDtfsCounter, 10338 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2878 GetRequests, 2604 SyntacticMatches, 0 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3197occurred in iteration=19, InterpolantAutomatonStates: 225, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 2462 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 4737 NumberOfCodeBlocks, 4539 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 4838 ConstructedInterpolants, 0 QuantifiedInterpolants, 7483 SizeOfPredicates, 0 NumberOfNonLiveVariables, 5411 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 39 InterpolantComputations, 26 PerfectInterpolantSequences, 3339/3500 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 499]: Loop Invariant Derived loop invariant: ((((((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2)) || (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (1 <= p_dw_pc)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2))) || (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (1 <= p_dw_pc)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2))) || (((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2))) - InvariantResult [Line: 172]: Location Invariant Derived location invariant: (((((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (M_E == 2)) || ((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (1 <= p_dw_pc)) && (E_M != 0)) && (M_E == 2))) && (c_dr_pc == 0)) || ((((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (M_E == 2)) || ((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (1 <= p_dw_pc)) && (E_M != 0)) && (M_E == 2))) && (c_dr_pc == 1))) - InvariantResult [Line: 634]: Location Invariant Derived location invariant: ((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (t1_pc <= 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2)) || (((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || (((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0))) - InvariantResult [Line: 1007]: Loop Invariant Derived loop invariant: (((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) || (((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || (((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || (((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (t1_pc <= 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2))) || ((((((((p_dw_pc == 0) && (t1_i == 1)) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) - InvariantResult [Line: 789]: Loop Invariant Derived loop invariant: (((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) || (((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || (((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || ((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || ((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (m_pc != 1)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2))) || (((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (t1_pc <= 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2))) || ((((((((p_dw_pc == 0) && (t1_i == 1)) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: ((((((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2)) || (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (1 <= p_dw_pc)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2))) || (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (1 <= p_dw_pc)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2))) || (((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2))) - InvariantResult [Line: 678]: Location Invariant Derived location invariant: (((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (m_pc != 1)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2)) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || ((((((((p_dw_pc == 0) && (t1_i == 1)) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || ((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0))) - InvariantResult [Line: 218]: Location Invariant Derived location invariant: (((((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2)) || ((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (1 <= p_dw_pc)) && (E_M != 0)) && (M_E == 2))) || (((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2))) - ProcedureContractResult [Line: 915]: Procedure Contract for immediate_notify Derived contract for procedure immediate_notify. Requires: (((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) || (((((((((((p_dw_pc == 0) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (t1_pc <= 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2))) || (((((((((p_dw_pc == 0) && (t1_i == 1)) && (q_write_ev == q_read_ev)) && ((0 < t1_pc) || (0 < m_pc))) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && ((m_pc < 1) || ((t1_pc <= 1) && (2 <= m_pc))))) || (((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (2 <= T1_E)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) Ensures: ((((((((t1_pc <= 0) && (m_pc <= 0)) || (1 < m_st)) || (m_pc == 1)) || (\old(m_st) < 2)) && (((1 < m_st) || ((m_st == 0) && (E_M <= 1))) || (((long long) local + 1) != token))) && (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= \old(t1_st))) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) || (((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (q_write_ev == q_read_ev)) && (2 <= \old(m_st))) && (2 <= T1_E)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || (((((((((p_dw_pc == 0) && (t1_i == 1)) && (q_write_ev == q_read_ev)) && ((0 < t1_pc) || (0 < m_pc))) && (2 <= \old(m_st))) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && ((m_pc < 1) || ((t1_pc <= 1) && (2 <= m_pc))))) || (((((((((((p_dw_pc == 0) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (t1_pc <= 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2)))) && ((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 262]: Procedure Contract for update_channels1 Derived contract for procedure update_channels1. Requires: ((((((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2)) || (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (1 <= p_dw_pc)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2))) || (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (1 <= p_dw_pc)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2))) || (((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2))) Ensures: (((((((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2)) || (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (1 <= p_dw_pc)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2))) || (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (1 <= p_dw_pc)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2))) || (((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2))) && ((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 890]: Procedure Contract for activate_threads2 Derived contract for procedure activate_threads2. Requires: (((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) || (((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || (((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || ((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || (((((((((((p_dw_pc == 0) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (t1_pc <= 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2))) || ((((((((p_dw_pc == 0) && (t1_i == 1)) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || (((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (2 <= T1_E)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) Ensures: ((((((((((((((((T1_E < 2) || (M_E != 2)) || (1 < t1_st)) || (T1_E == 2)) || (\old(t1_st) < 2)) || (t1_pc != 1)) || (E_M < 2)) || (\old(m_st) < 2)) || (E_1 < 2)) && (((((((\old(t1_st) < 2) || (t1_pc != 1)) || (E_M < 2)) || (((((((p_dw_pc == 0) && (t1_i == 1)) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (2 <= m_st)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || (\old(m_st) < 2)) || (E_1 < 2)) || ((2 <= t1_st) && (2 <= m_st)))) && (((1 < m_st) || ((m_st == 0) && (E_M <= 1))) || (((long long) local + 1) != token))) && (((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= \old(m_st))) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) || ((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= \old(t1_st))) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || (((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (q_write_ev == q_read_ev)) && (2 <= \old(m_st))) && (2 <= T1_E)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || (((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (t1_pc <= 0)) && (2 <= \old(m_st))) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || ((m_pc != 1) && (2 <= \old(m_st)))) || (((((((((((p_dw_pc == 0) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (t1_pc <= 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2))) || (((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= \old(t1_st))) && (2 <= \old(m_st))) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)))) && (((((0 < t1_pc) || (m_st == 0)) || (T1_E != M_E)) || (\old(m_st) != 0)) || (E_1 < 2))) && (((((((((p_dw_pc == 0) && (t1_i == 1)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) || (m_pc == 1)) || (\old(m_st) < 2))) && ((((1 < m_st) || (\old(m_st) < 2)) || (E_1 < 2)) || (token != local))) && ((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 387]: Procedure Contract for activate_threads1 Derived contract for procedure activate_threads1. Requires: ((((((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2)) || (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (1 <= p_dw_pc)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2))) || (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (1 <= p_dw_pc)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2))) || (((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2))) Ensures: (((((((((\old(p_dw_st) == p_dw_st) && (c_dr_st == \old(c_dr_st))) || (c_dr_pc == 1)) || (p_dw_pc == 1)) || (q_read_ev != 2)) && (((c_dr_pc != 0) || ((\old(p_dw_st) == p_dw_st) && (c_dr_st == \old(c_dr_st)))) || (p_dw_st == 0))) && ((((((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2)) || (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (1 <= p_dw_pc)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2))) || (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (1 <= p_dw_pc)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2))) || (((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2)))) && ((((\old(p_dw_st) == p_dw_st) && (c_dr_st == \old(c_dr_st))) || (p_dw_pc == 1)) || (c_dr_pc != p_dw_pc))) && ((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 737]: Procedure Contract for update_channels2 Derived contract for procedure update_channels2. Requires: (((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) || (((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || (((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || (((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (t1_pc <= 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2))) || ((((((((p_dw_pc == 0) && (t1_i == 1)) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) Ensures: ((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) || (((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || (((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || (((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (t1_pc <= 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2))) || ((((((((p_dw_pc == 0) && (t1_i == 1)) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) && ((((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 834]: Procedure Contract for fire_delta_events2 Derived contract for procedure fire_delta_events2. Requires: ((((T1_E == 2) && (M_E == 2)) || (m_st != 0)) && (((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) || (((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || (((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || ((((((((p_dw_pc == 0) && (t1_i == 1)) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || (((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (t1_pc <= 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)))) Ensures: (((((((((((((((((((p_dw_pc == 0) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (2 <= m_st)) && (p_dw_st == 0)) && (c_dr_pc == 0)) || ((((((((((p_dw_pc == 0) && (q_write_ev == q_read_ev)) && (2 <= \old(T1_E))) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= \old(E_M))) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || (((((((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (t1_pc <= 0)) && (2 <= \old(E_M))) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (2 == \old(M_E)))) || ((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (q_write_ev == q_read_ev)) && (2 <= \old(T1_E))) && (2 <= m_st)) && (2 <= \old(E_M))) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (c_dr_pc == 0))) || ((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (q_write_ev == q_read_ev)) && (2 <= \old(T1_E))) && (2 <= m_st)) && (2 <= \old(E_M))) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) && ((((\old(T1_E) == T1_E) && (M_E == 2)) || ((\old(T1_E) != 2) && (M_E == 2))) || (2 != \old(M_E)))) && (t1_i == 1)) && (((T1_E == M_E) && (\old(T1_E) == T1_E)) || (m_st != 0))) && (((((((2 <= E_1) && (\old(T1_E) <= T1_E)) || (t1_pc != 1)) || (\old(E_1) < 2)) || (\old(E_M) < 2)) || (\old(T1_E) < 2)) || (token != local))) && (E_M == \old(E_M))) && (E_M != 0)) && (((((((2 <= E_1) && (\old(T1_E) <= T1_E)) || (0 < t1_pc)) || (\old(E_1) < 2)) || (\old(E_M) < 2)) || (\old(T1_E) < 2)) || (token != local))) && (((((((2 <= E_1) && (\old(T1_E) <= T1_E)) || (t1_st < 2)) || (t1_pc != 1)) || (\old(E_1) < 2)) || (\old(E_M) < 2)) || (\old(T1_E) < 2))) && ((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 315]: Procedure Contract for fire_delta_events1 Derived contract for procedure fire_delta_events1. Requires: ((((((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2)) || (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (1 <= p_dw_pc)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2))) || (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (1 <= p_dw_pc)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2))) || (((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2))) Ensures: ((((((q_write_ev == 2) || (\old(q_read_ev) != 2)) || (2 != \old(q_write_ev))) && (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (\old(q_read_ev) == q_read_ev)) && (M_E == 2)) || ((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (M_E == 2)) && (\old(q_read_ev) == 0)))) && (((((1 <= p_dw_pc) && (c_dr_pc == 1)) || ((1 <= p_dw_pc) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 1)))) && ((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 99]: Procedure Contract for is_do_read_c_triggered Derived contract for procedure is_do_read_c_triggered. Requires: ((((((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2)) || (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (1 <= p_dw_pc)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2))) || (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (1 <= p_dw_pc)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2))) || (((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2))) Ensures: ((((\result == 0) || (c_dr_pc != 0)) && ((((((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2)) || (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (1 <= p_dw_pc)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2))) || (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (1 <= p_dw_pc)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2))) || (((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2)))) && ((((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 70]: Procedure Contract for is_do_write_p_triggered Derived contract for procedure is_do_write_p_triggered. Requires: ((((((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2)) || (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (1 <= p_dw_pc)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2))) || (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (1 <= p_dw_pc)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2))) || (((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2))) Ensures: ((((((p_dw_pc == 1) || (\result == 0)) || (q_read_ev != 2)) && ((p_dw_pc != 0) || (\result == 0))) && ((((((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2)) || (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (1 <= p_dw_pc)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2))) || (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (1 <= p_dw_pc)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2))) || (((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2)))) && ((((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 295]: Procedure Contract for exists_runnable_thread1 Derived contract for procedure exists_runnable_thread1. Requires: ((((((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2)) || (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (1 <= p_dw_pc)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2))) || (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (1 <= p_dw_pc)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2))) || (((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2))) Ensures: (((((((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2)) || (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (1 <= p_dw_pc)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2))) || (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (1 <= p_dw_pc)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2))) || (((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2))) && ((((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 23]: Procedure Contract for error1 Derived contract for procedure error1. Requires: 0 Ensures: (0 && ((((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 763]: Procedure Contract for exists_runnable_thread2 Derived contract for procedure exists_runnable_thread2. Requires: (((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) || (((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || (((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || ((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || ((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (m_pc != 1)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2))) || (((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (t1_pc <= 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2))) || ((((((((p_dw_pc == 0) && (t1_i == 1)) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) Ensures: ((((0 < \result) || (m_st != 0)) && (((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) || (((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || (((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || ((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || ((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (m_pc != 1)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2))) || (((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 <= E_M)) && (T1_E == 2)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (t1_pc <= 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2))) || ((((((((p_dw_pc == 0) && (t1_i == 1)) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)))) && ((((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 333]: Procedure Contract for reset_delta_events1 Derived contract for procedure reset_delta_events1. Requires: ((((((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2)) || (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (1 <= p_dw_pc)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2))) || (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (1 <= p_dw_pc)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2))) || (((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2))) Ensures: (((((((1 <= p_dw_pc) && (c_dr_pc == 1)) || ((1 <= p_dw_pc) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 0))) || ((p_dw_pc == 0) && (c_dr_pc == 1))) && (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (\old(q_read_ev) == q_read_ev)) && (M_E == 2)) || ((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (q_read_ev == 2)) && (M_E == 2)))) && ((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 862]: Procedure Contract for reset_delta_events2 Derived contract for procedure reset_delta_events2. Requires: ((((T1_E == 2) && (M_E == 2)) || (m_st != 0)) && (((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) || (((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || (((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (2 <= T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || ((((((((p_dw_pc == 0) && (t1_i == 1)) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || (((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 <= E_M)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (t1_pc <= 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)))) Ensures: (((((((((t1_i == 1) && ((T1_E == 2) || (m_st != 0))) && ((M_E == 2) || (2 != \old(M_E)))) && (E_M != 0)) && ((((((0 < t1_pc) || (((2 <= E_1) && (\old(E_M) <= E_M)) && (\old(T1_E) <= T1_E))) || (\old(E_1) < 2)) || (\old(E_M) < 2)) || (\old(T1_E) < 2)) || (token != local))) && ((((((((2 <= E_1) && (\old(E_M) <= E_M)) && (\old(T1_E) <= T1_E)) || (t1_pc != 1)) || (\old(E_1) < 2)) || (\old(E_M) < 2)) || (\old(T1_E) < 2)) || (token != local))) && ((((((t1_st < 2) || (((2 <= E_1) && (\old(E_M) <= E_M)) && (\old(T1_E) <= T1_E))) || (t1_pc != 1)) || (\old(E_1) < 2)) || (\old(E_M) < 2)) || (\old(T1_E) < 2))) && (((((((((((p_dw_pc == 0) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (2 <= m_st)) && (\old(E_M) != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) || ((((((((((p_dw_pc == 0) && (q_write_ev == q_read_ev)) && (2 <= \old(T1_E))) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= \old(E_M))) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || ((((((((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (t1_pc <= 0)) && (2 <= \old(E_M))) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (2 == \old(M_E))) && (\old(T1_E) == 2))) || ((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (q_write_ev == q_read_ev)) && (2 <= \old(T1_E))) && (2 <= m_st)) && (2 <= \old(E_M))) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (c_dr_pc == 0))) || ((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (q_write_ev == q_read_ev)) && (2 <= \old(T1_E))) && (2 <= m_st)) && (2 <= \old(E_M))) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)))) && ((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (token == \old(token))) && (local == \old(local)))) RESULT: Ultimate proved your program to be correct! [2024-11-13 14:22:05,549 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19d92d90-3a10-46d8-bbc7-f9724150239e/bin/uautomizer-verify-qhAvR1uOyd/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 Result: TRUE