./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b9ffdd-133b-45d0-8b61-a1b97284b193/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b9ffdd-133b-45d0-8b61-a1b97284b193/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b9ffdd-133b-45d0-8b61-a1b97284b193/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b9ffdd-133b-45d0-8b61-a1b97284b193/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b9ffdd-133b-45d0-8b61-a1b97284b193/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b9ffdd-133b-45d0-8b61-a1b97284b193/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:22:28,785 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:22:28,848 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b9ffdd-133b-45d0-8b61-a1b97284b193/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 04:22:28,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:22:28,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:22:28,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:22:28,878 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:22:28,879 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:22:28,879 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:22:28,880 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:22:28,880 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:22:28,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:22:28,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:22:28,882 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:22:28,883 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:22:28,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:22:28,884 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:22:28,884 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:22:28,885 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:22:28,885 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:22:28,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:22:28,886 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:22:28,887 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:22:28,887 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:22:28,888 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:22:28,888 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:22:28,888 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:22:28,889 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:22:28,889 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:22:28,890 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:22:28,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:22:28,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:22:28,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:22:28,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:22:28,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:22:28,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:22:28,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:22:28,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:22:28,892 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:22:28,892 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:22:28,892 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:22:28,893 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:22:28,893 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b9ffdd-133b-45d0-8b61-a1b97284b193/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b9ffdd-133b-45d0-8b61-a1b97284b193/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 [2023-11-29 04:22:29,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:22:29,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:22:29,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:22:29,139 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:22:29,139 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:22:29,140 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b9ffdd-133b-45d0-8b61-a1b97284b193/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-29 04:22:31,998 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:22:32,231 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:22:32,231 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b9ffdd-133b-45d0-8b61-a1b97284b193/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-29 04:22:32,247 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b9ffdd-133b-45d0-8b61-a1b97284b193/bin/uautomizer-verify-BQ2R08f2Ya/data/84739c6a6/a071592953f3426ba19962e46ead4229/FLAG06dfe3beb [2023-11-29 04:22:32,260 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b9ffdd-133b-45d0-8b61-a1b97284b193/bin/uautomizer-verify-BQ2R08f2Ya/data/84739c6a6/a071592953f3426ba19962e46ead4229 [2023-11-29 04:22:32,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:22:32,264 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:22:32,265 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:22:32,265 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:22:32,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:22:32,271 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:22:32" (1/1) ... [2023-11-29 04:22:32,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52a560f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:22:32, skipping insertion in model container [2023-11-29 04:22:32,272 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:22:32" (1/1) ... [2023-11-29 04:22:32,342 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:22:32,505 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b9ffdd-133b-45d0-8b61-a1b97284b193/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-11-29 04:22:32,716 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:22:32,730 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:22:32,743 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b9ffdd-133b-45d0-8b61-a1b97284b193/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-11-29 04:22:32,791 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:22:32,825 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:22:32,826 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:22:32,833 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:22:32,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:22:32 WrapperNode [2023-11-29 04:22:32,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:22:32,835 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:22:32,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:22:32,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:22:32,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:22:32" (1/1) ... [2023-11-29 04:22:32,862 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:22:32" (1/1) ... [2023-11-29 04:22:32,889 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-11-29 04:22:32,890 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:22:32,890 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:22:32,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:22:32,891 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:22:32,903 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:22:32" (1/1) ... [2023-11-29 04:22:32,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:22:32" (1/1) ... [2023-11-29 04:22:32,907 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:22:32" (1/1) ... [2023-11-29 04:22:32,953 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-29 04:22:32,953 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:22:32" (1/1) ... [2023-11-29 04:22:32,954 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:22:32" (1/1) ... [2023-11-29 04:22:32,965 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:22:32" (1/1) ... [2023-11-29 04:22:32,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:22:32" (1/1) ... [2023-11-29 04:22:32,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:22:32" (1/1) ... [2023-11-29 04:22:32,972 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:22:32" (1/1) ... [2023-11-29 04:22:32,976 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:22:32,977 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:22:32,977 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:22:32,978 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:22:32,978 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:22:32" (1/1) ... [2023-11-29 04:22:32,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:22:32,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b9ffdd-133b-45d0-8b61-a1b97284b193/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:22:33,006 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b9ffdd-133b-45d0-8b61-a1b97284b193/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:22:33,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b9ffdd-133b-45d0-8b61-a1b97284b193/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:22:33,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 04:22:33,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 04:22:33,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 04:22:33,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 04:22:33,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 04:22:33,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:22:33,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:22:33,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:22:33,043 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 04:22:33,044 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 04:22:33,044 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 04:22:33,044 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 04:22:33,044 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 04:22:33,044 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 04:22:33,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:22:33,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 04:22:33,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 04:22:33,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 04:22:33,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 04:22:33,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:22:33,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:22:33,047 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 04:22:33,201 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:22:33,203 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:22:33,515 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:22:33,736 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:22:33,736 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 04:22:33,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:22:33 BoogieIcfgContainer [2023-11-29 04:22:33,737 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:22:33,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:22:33,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:22:33,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:22:33,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:22:32" (1/3) ... [2023-11-29 04:22:33,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ed5392c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:22:33, skipping insertion in model container [2023-11-29 04:22:33,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:22:32" (2/3) ... [2023-11-29 04:22:33,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ed5392c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:22:33, skipping insertion in model container [2023-11-29 04:22:33,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:22:33" (3/3) ... [2023-11-29 04:22:33,745 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-29 04:22:33,754 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 04:22:33,764 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:22:33,765 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-29 04:22:33,765 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 04:22:33,812 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 04:22:33,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 94 flow [2023-11-29 04:22:33,874 INFO L124 PetriNetUnfolderBase]: 1/38 cut-off events. [2023-11-29 04:22:33,874 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:22:33,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 1/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 77 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2023-11-29 04:22:33,878 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 41 transitions, 94 flow [2023-11-29 04:22:33,882 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 38 transitions, 85 flow [2023-11-29 04:22:33,892 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:22:33,897 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@c454aa3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:22:33,897 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-29 04:22:33,906 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 04:22:33,906 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2023-11-29 04:22:33,906 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:22:33,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:22:33,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:22:33,907 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 04:22:33,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:22:33,912 INFO L85 PathProgramCache]: Analyzing trace with hash 2121823724, now seen corresponding path program 1 times [2023-11-29 04:22:33,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:22:33,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059180819] [2023-11-29 04:22:33,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:22:33,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:22:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:34,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:22:34,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:22:34,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059180819] [2023-11-29 04:22:34,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059180819] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:22:34,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:22:34,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:22:34,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222057865] [2023-11-29 04:22:34,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:22:34,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:22:34,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:22:34,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:22:34,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:22:34,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2023-11-29 04:22:34,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:34,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:22:34,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2023-11-29 04:22:34,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:22:34,886 INFO L124 PetriNetUnfolderBase]: 920/1670 cut-off events. [2023-11-29 04:22:34,886 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-11-29 04:22:34,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3090 conditions, 1670 events. 920/1670 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 10829 event pairs, 188 based on Foata normal form. 60/1698 useless extension candidates. Maximal degree in co-relation 3079. Up to 1048 conditions per place. [2023-11-29 04:22:34,906 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 29 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2023-11-29 04:22:34,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 48 transitions, 171 flow [2023-11-29 04:22:34,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:22:34,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:22:34,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2023-11-29 04:22:34,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7317073170731707 [2023-11-29 04:22:34,918 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 90 transitions. [2023-11-29 04:22:34,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 90 transitions. [2023-11-29 04:22:34,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:22:34,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 90 transitions. [2023-11-29 04:22:34,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:34,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:34,926 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:34,927 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 90 transitions. [2023-11-29 04:22:34,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 48 transitions, 171 flow [2023-11-29 04:22:34,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 48 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 04:22:34,934 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 80 flow [2023-11-29 04:22:34,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2023-11-29 04:22:34,939 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2023-11-29 04:22:34,940 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 80 flow [2023-11-29 04:22:34,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:34,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:22:34,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:22:34,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:22:34,941 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 04:22:34,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:22:34,941 INFO L85 PathProgramCache]: Analyzing trace with hash -443078926, now seen corresponding path program 1 times [2023-11-29 04:22:34,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:22:34,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508982733] [2023-11-29 04:22:34,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:22:34,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:22:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:35,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:22:35,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:22:35,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508982733] [2023-11-29 04:22:35,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508982733] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:22:35,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:22:35,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:22:35,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010754138] [2023-11-29 04:22:35,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:22:35,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:22:35,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:22:35,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:22:35,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:22:35,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2023-11-29 04:22:35,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 80 flow. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:35,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:22:35,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2023-11-29 04:22:35,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:22:36,729 INFO L124 PetriNetUnfolderBase]: 2381/3758 cut-off events. [2023-11-29 04:22:36,729 INFO L125 PetriNetUnfolderBase]: For 188/188 co-relation queries the response was YES. [2023-11-29 04:22:36,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7502 conditions, 3758 events. 2381/3758 cut-off events. For 188/188 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 23675 event pairs, 435 based on Foata normal form. 0/3670 useless extension candidates. Maximal degree in co-relation 7492. Up to 1520 conditions per place. [2023-11-29 04:22:36,752 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 38 selfloop transitions, 8 changer transitions 73/130 dead transitions. [2023-11-29 04:22:36,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 130 transitions, 522 flow [2023-11-29 04:22:36,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:22:36,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 04:22:36,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 290 transitions. [2023-11-29 04:22:36,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5894308943089431 [2023-11-29 04:22:36,756 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 290 transitions. [2023-11-29 04:22:36,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 290 transitions. [2023-11-29 04:22:36,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:22:36,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 290 transitions. [2023-11-29 04:22:36,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 24.166666666666668) internal successors, (290), 12 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:36,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 41.0) internal successors, (533), 13 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:36,763 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 41.0) internal successors, (533), 13 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:36,763 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 80 flow. Second operand 12 states and 290 transitions. [2023-11-29 04:22:36,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 130 transitions, 522 flow [2023-11-29 04:22:36,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 130 transitions, 506 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:22:36,768 INFO L231 Difference]: Finished difference. Result has 64 places, 40 transitions, 176 flow [2023-11-29 04:22:36,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=176, PETRI_PLACES=64, PETRI_TRANSITIONS=40} [2023-11-29 04:22:36,769 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 17 predicate places. [2023-11-29 04:22:36,770 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 40 transitions, 176 flow [2023-11-29 04:22:36,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:36,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:22:36,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:22:36,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:22:36,770 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 04:22:36,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:22:36,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1356133776, now seen corresponding path program 1 times [2023-11-29 04:22:36,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:22:36,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169387808] [2023-11-29 04:22:36,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:22:36,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:22:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:37,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:22:37,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:22:37,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169387808] [2023-11-29 04:22:37,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169387808] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:22:37,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:22:37,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:22:37,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021222198] [2023-11-29 04:22:37,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:22:37,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:22:37,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:22:37,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:22:37,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:22:37,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2023-11-29 04:22:37,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 40 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:37,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:22:37,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2023-11-29 04:22:37,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:22:37,659 INFO L124 PetriNetUnfolderBase]: 1671/2821 cut-off events. [2023-11-29 04:22:37,659 INFO L125 PetriNetUnfolderBase]: For 6474/6474 co-relation queries the response was YES. [2023-11-29 04:22:37,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9764 conditions, 2821 events. 1671/2821 cut-off events. For 6474/6474 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 17626 event pairs, 751 based on Foata normal form. 71/2860 useless extension candidates. Maximal degree in co-relation 9743. Up to 2001 conditions per place. [2023-11-29 04:22:37,680 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 40 selfloop transitions, 4 changer transitions 39/94 dead transitions. [2023-11-29 04:22:37,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 94 transitions, 648 flow [2023-11-29 04:22:37,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:22:37,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:22:37,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2023-11-29 04:22:37,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5853658536585366 [2023-11-29 04:22:37,683 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 168 transitions. [2023-11-29 04:22:37,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 168 transitions. [2023-11-29 04:22:37,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:22:37,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 168 transitions. [2023-11-29 04:22:37,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:37,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 41.0) internal successors, (328), 8 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:37,686 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 41.0) internal successors, (328), 8 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:37,686 INFO L175 Difference]: Start difference. First operand has 64 places, 40 transitions, 176 flow. Second operand 7 states and 168 transitions. [2023-11-29 04:22:37,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 94 transitions, 648 flow [2023-11-29 04:22:37,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 94 transitions, 589 flow, removed 28 selfloop flow, removed 5 redundant places. [2023-11-29 04:22:37,703 INFO L231 Difference]: Finished difference. Result has 61 places, 43 transitions, 214 flow [2023-11-29 04:22:37,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=214, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2023-11-29 04:22:37,704 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 14 predicate places. [2023-11-29 04:22:37,704 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 214 flow [2023-11-29 04:22:37,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:37,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:22:37,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:22:37,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:22:37,705 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 04:22:37,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:22:37,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1283087541, now seen corresponding path program 1 times [2023-11-29 04:22:37,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:22:37,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220958459] [2023-11-29 04:22:37,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:22:37,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:22:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:38,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:22:38,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:22:38,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220958459] [2023-11-29 04:22:38,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220958459] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:22:38,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:22:38,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:22:38,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56289911] [2023-11-29 04:22:38,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:22:38,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:22:38,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:22:38,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:22:38,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:22:38,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2023-11-29 04:22:38,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 43 transitions, 214 flow. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:38,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:22:38,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2023-11-29 04:22:38,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:22:38,999 INFO L124 PetriNetUnfolderBase]: 1559/2694 cut-off events. [2023-11-29 04:22:38,999 INFO L125 PetriNetUnfolderBase]: For 5497/5703 co-relation queries the response was YES. [2023-11-29 04:22:39,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8960 conditions, 2694 events. 1559/2694 cut-off events. For 5497/5703 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 17091 event pairs, 295 based on Foata normal form. 61/2702 useless extension candidates. Maximal degree in co-relation 8937. Up to 1524 conditions per place. [2023-11-29 04:22:39,029 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 47 selfloop transitions, 13 changer transitions 31/108 dead transitions. [2023-11-29 04:22:39,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 108 transitions, 691 flow [2023-11-29 04:22:39,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:22:39,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 04:22:39,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 218 transitions. [2023-11-29 04:22:39,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5907859078590786 [2023-11-29 04:22:39,032 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 218 transitions. [2023-11-29 04:22:39,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 218 transitions. [2023-11-29 04:22:39,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:22:39,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 218 transitions. [2023-11-29 04:22:39,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 24.22222222222222) internal successors, (218), 9 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:39,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 41.0) internal successors, (410), 10 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:39,035 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 41.0) internal successors, (410), 10 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:39,035 INFO L175 Difference]: Start difference. First operand has 61 places, 43 transitions, 214 flow. Second operand 9 states and 218 transitions. [2023-11-29 04:22:39,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 108 transitions, 691 flow [2023-11-29 04:22:39,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 108 transitions, 667 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-11-29 04:22:39,048 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 319 flow [2023-11-29 04:22:39,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=319, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2023-11-29 04:22:39,049 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 20 predicate places. [2023-11-29 04:22:39,049 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 319 flow [2023-11-29 04:22:39,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:39,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:22:39,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:22:39,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:22:39,050 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 04:22:39,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:22:39,051 INFO L85 PathProgramCache]: Analyzing trace with hash -150829015, now seen corresponding path program 2 times [2023-11-29 04:22:39,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:22:39,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118118197] [2023-11-29 04:22:39,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:22:39,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:22:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:40,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:22:40,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:22:40,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118118197] [2023-11-29 04:22:40,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118118197] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:22:40,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:22:40,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:22:40,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250744573] [2023-11-29 04:22:40,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:22:40,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:22:40,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:22:40,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:22:40,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:22:40,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2023-11-29 04:22:40,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 319 flow. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:40,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:22:40,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2023-11-29 04:22:40,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:22:40,851 INFO L124 PetriNetUnfolderBase]: 1560/2693 cut-off events. [2023-11-29 04:22:40,852 INFO L125 PetriNetUnfolderBase]: For 8861/9077 co-relation queries the response was YES. [2023-11-29 04:22:40,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10439 conditions, 2693 events. 1560/2693 cut-off events. For 8861/9077 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 17129 event pairs, 313 based on Foata normal form. 73/2705 useless extension candidates. Maximal degree in co-relation 10412. Up to 1523 conditions per place. [2023-11-29 04:22:40,885 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 47 selfloop transitions, 12 changer transitions 40/116 dead transitions. [2023-11-29 04:22:40,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 116 transitions, 908 flow [2023-11-29 04:22:40,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:22:40,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 04:22:40,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 234 transitions. [2023-11-29 04:22:40,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5707317073170731 [2023-11-29 04:22:40,888 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 234 transitions. [2023-11-29 04:22:40,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 234 transitions. [2023-11-29 04:22:40,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:22:40,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 234 transitions. [2023-11-29 04:22:40,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 23.4) internal successors, (234), 10 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:40,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 41.0) internal successors, (451), 11 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:40,891 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 41.0) internal successors, (451), 11 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:40,891 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 319 flow. Second operand 10 states and 234 transitions. [2023-11-29 04:22:40,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 116 transitions, 908 flow [2023-11-29 04:22:40,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 116 transitions, 880 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-11-29 04:22:40,908 INFO L231 Difference]: Finished difference. Result has 75 places, 58 transitions, 406 flow [2023-11-29 04:22:40,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=406, PETRI_PLACES=75, PETRI_TRANSITIONS=58} [2023-11-29 04:22:40,909 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 28 predicate places. [2023-11-29 04:22:40,909 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 58 transitions, 406 flow [2023-11-29 04:22:40,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:40,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:22:40,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:22:40,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:22:40,910 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 04:22:40,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:22:40,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1699072096, now seen corresponding path program 1 times [2023-11-29 04:22:40,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:22:40,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189276602] [2023-11-29 04:22:40,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:22:40,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:22:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:42,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:22:42,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:22:42,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189276602] [2023-11-29 04:22:42,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189276602] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:22:42,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:22:42,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:22:42,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104998819] [2023-11-29 04:22:42,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:22:42,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:22:42,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:22:42,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:22:42,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:22:42,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2023-11-29 04:22:42,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 58 transitions, 406 flow. Second operand has 10 states, 10 states have (on average 16.6) internal successors, (166), 10 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:42,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:22:42,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2023-11-29 04:22:42,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:22:43,341 INFO L124 PetriNetUnfolderBase]: 1482/2544 cut-off events. [2023-11-29 04:22:43,341 INFO L125 PetriNetUnfolderBase]: For 14076/14306 co-relation queries the response was YES. [2023-11-29 04:22:43,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11225 conditions, 2544 events. 1482/2544 cut-off events. For 14076/14306 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 15788 event pairs, 202 based on Foata normal form. 52/2553 useless extension candidates. Maximal degree in co-relation 11193. Up to 1513 conditions per place. [2023-11-29 04:22:43,367 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 50 selfloop transitions, 11 changer transitions 31/109 dead transitions. [2023-11-29 04:22:43,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 109 transitions, 983 flow [2023-11-29 04:22:43,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:22:43,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 04:22:43,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2023-11-29 04:22:43,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5701219512195121 [2023-11-29 04:22:43,369 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 187 transitions. [2023-11-29 04:22:43,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 187 transitions. [2023-11-29 04:22:43,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:22:43,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 187 transitions. [2023-11-29 04:22:43,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 23.375) internal successors, (187), 8 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:43,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 41.0) internal successors, (369), 9 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:43,372 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 41.0) internal successors, (369), 9 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:43,372 INFO L175 Difference]: Start difference. First operand has 75 places, 58 transitions, 406 flow. Second operand 8 states and 187 transitions. [2023-11-29 04:22:43,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 109 transitions, 983 flow [2023-11-29 04:22:43,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 109 transitions, 897 flow, removed 38 selfloop flow, removed 7 redundant places. [2023-11-29 04:22:43,399 INFO L231 Difference]: Finished difference. Result has 74 places, 61 transitions, 438 flow [2023-11-29 04:22:43,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=438, PETRI_PLACES=74, PETRI_TRANSITIONS=61} [2023-11-29 04:22:43,400 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 27 predicate places. [2023-11-29 04:22:43,400 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 61 transitions, 438 flow [2023-11-29 04:22:43,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.6) internal successors, (166), 10 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:43,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:22:43,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:22:43,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 04:22:43,401 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 04:22:43,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:22:43,402 INFO L85 PathProgramCache]: Analyzing trace with hash 891394177, now seen corresponding path program 1 times [2023-11-29 04:22:43,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:22:43,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447053898] [2023-11-29 04:22:43,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:22:43,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:22:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:43,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:22:43,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:22:43,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447053898] [2023-11-29 04:22:43,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447053898] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:22:43,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:22:43,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:22:43,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819451069] [2023-11-29 04:22:43,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:22:43,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:22:43,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:22:43,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:22:43,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:22:43,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2023-11-29 04:22:43,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 61 transitions, 438 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:43,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:22:43,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2023-11-29 04:22:43,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:22:44,258 INFO L124 PetriNetUnfolderBase]: 2197/3857 cut-off events. [2023-11-29 04:22:44,258 INFO L125 PetriNetUnfolderBase]: For 15123/15155 co-relation queries the response was YES. [2023-11-29 04:22:44,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15557 conditions, 3857 events. 2197/3857 cut-off events. For 15123/15155 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 26689 event pairs, 596 based on Foata normal form. 91/3888 useless extension candidates. Maximal degree in co-relation 15525. Up to 1690 conditions per place. [2023-11-29 04:22:44,278 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 54 selfloop transitions, 6 changer transitions 29/103 dead transitions. [2023-11-29 04:22:44,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 103 transitions, 921 flow [2023-11-29 04:22:44,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:22:44,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:22:44,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2023-11-29 04:22:44,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.578397212543554 [2023-11-29 04:22:44,280 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 166 transitions. [2023-11-29 04:22:44,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 166 transitions. [2023-11-29 04:22:44,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:22:44,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 166 transitions. [2023-11-29 04:22:44,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:44,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 41.0) internal successors, (328), 8 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:44,282 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 41.0) internal successors, (328), 8 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:44,282 INFO L175 Difference]: Start difference. First operand has 74 places, 61 transitions, 438 flow. Second operand 7 states and 166 transitions. [2023-11-29 04:22:44,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 103 transitions, 921 flow [2023-11-29 04:22:44,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 103 transitions, 883 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-11-29 04:22:44,301 INFO L231 Difference]: Finished difference. Result has 76 places, 61 transitions, 448 flow [2023-11-29 04:22:44,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=448, PETRI_PLACES=76, PETRI_TRANSITIONS=61} [2023-11-29 04:22:44,302 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 29 predicate places. [2023-11-29 04:22:44,302 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 61 transitions, 448 flow [2023-11-29 04:22:44,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:44,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:22:44,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:22:44,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 04:22:44,303 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 04:22:44,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:22:44,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1572612949, now seen corresponding path program 1 times [2023-11-29 04:22:44,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:22:44,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529321745] [2023-11-29 04:22:44,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:22:44,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:22:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:45,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:22:45,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:22:45,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529321745] [2023-11-29 04:22:45,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529321745] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:22:45,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:22:45,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:22:45,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518228614] [2023-11-29 04:22:45,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:22:45,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:22:45,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:22:45,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:22:45,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:22:45,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2023-11-29 04:22:45,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 61 transitions, 448 flow. Second operand has 10 states, 10 states have (on average 16.6) internal successors, (166), 10 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:45,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:22:45,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2023-11-29 04:22:45,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:22:46,030 INFO L124 PetriNetUnfolderBase]: 2366/4186 cut-off events. [2023-11-29 04:22:46,030 INFO L125 PetriNetUnfolderBase]: For 19342/19728 co-relation queries the response was YES. [2023-11-29 04:22:46,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17066 conditions, 4186 events. 2366/4186 cut-off events. For 19342/19728 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 29367 event pairs, 399 based on Foata normal form. 124/4160 useless extension candidates. Maximal degree in co-relation 17033. Up to 2394 conditions per place. [2023-11-29 04:22:46,056 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 49 selfloop transitions, 21 changer transitions 39/126 dead transitions. [2023-11-29 04:22:46,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 126 transitions, 1077 flow [2023-11-29 04:22:46,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:22:46,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 04:22:46,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 214 transitions. [2023-11-29 04:22:46,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5799457994579946 [2023-11-29 04:22:46,058 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 214 transitions. [2023-11-29 04:22:46,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 214 transitions. [2023-11-29 04:22:46,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:22:46,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 214 transitions. [2023-11-29 04:22:46,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 23.77777777777778) internal successors, (214), 9 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:46,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 41.0) internal successors, (410), 10 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:46,060 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 41.0) internal successors, (410), 10 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:46,061 INFO L175 Difference]: Start difference. First operand has 76 places, 61 transitions, 448 flow. Second operand 9 states and 214 transitions. [2023-11-29 04:22:46,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 126 transitions, 1077 flow [2023-11-29 04:22:46,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 126 transitions, 1051 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-11-29 04:22:46,083 INFO L231 Difference]: Finished difference. Result has 80 places, 68 transitions, 593 flow [2023-11-29 04:22:46,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=593, PETRI_PLACES=80, PETRI_TRANSITIONS=68} [2023-11-29 04:22:46,084 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 33 predicate places. [2023-11-29 04:22:46,084 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 68 transitions, 593 flow [2023-11-29 04:22:46,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.6) internal successors, (166), 10 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:46,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:22:46,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:22:46,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 04:22:46,084 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 04:22:46,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:22:46,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1597780817, now seen corresponding path program 2 times [2023-11-29 04:22:46,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:22:46,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164387636] [2023-11-29 04:22:46,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:22:46,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:22:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:46,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:22:46,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:22:46,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164387636] [2023-11-29 04:22:46,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164387636] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:22:46,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:22:46,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:22:46,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011951411] [2023-11-29 04:22:46,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:22:46,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:22:46,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:22:46,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:22:46,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:22:46,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2023-11-29 04:22:46,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 68 transitions, 593 flow. Second operand has 8 states, 8 states have (on average 17.0) internal successors, (136), 8 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:46,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:22:46,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2023-11-29 04:22:46,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:22:47,902 INFO L124 PetriNetUnfolderBase]: 3304/5731 cut-off events. [2023-11-29 04:22:47,903 INFO L125 PetriNetUnfolderBase]: For 44280/44893 co-relation queries the response was YES. [2023-11-29 04:22:47,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28640 conditions, 5731 events. 3304/5731 cut-off events. For 44280/44893 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 41642 event pairs, 236 based on Foata normal form. 200/5754 useless extension candidates. Maximal degree in co-relation 28605. Up to 2817 conditions per place. [2023-11-29 04:22:47,934 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 76 selfloop transitions, 41 changer transitions 44/178 dead transitions. [2023-11-29 04:22:47,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 178 transitions, 1925 flow [2023-11-29 04:22:47,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 04:22:47,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-29 04:22:47,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 308 transitions. [2023-11-29 04:22:47,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5778611632270169 [2023-11-29 04:22:47,935 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 308 transitions. [2023-11-29 04:22:47,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 308 transitions. [2023-11-29 04:22:47,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:22:47,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 308 transitions. [2023-11-29 04:22:47,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 23.692307692307693) internal successors, (308), 13 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:47,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 41.0) internal successors, (574), 14 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:47,938 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 41.0) internal successors, (574), 14 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:47,938 INFO L175 Difference]: Start difference. First operand has 80 places, 68 transitions, 593 flow. Second operand 13 states and 308 transitions. [2023-11-29 04:22:47,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 178 transitions, 1925 flow [2023-11-29 04:22:47,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 178 transitions, 1878 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-11-29 04:22:47,971 INFO L231 Difference]: Finished difference. Result has 90 places, 94 transitions, 1056 flow [2023-11-29 04:22:47,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1056, PETRI_PLACES=90, PETRI_TRANSITIONS=94} [2023-11-29 04:22:47,972 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 43 predicate places. [2023-11-29 04:22:47,973 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 94 transitions, 1056 flow [2023-11-29 04:22:47,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.0) internal successors, (136), 8 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:47,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:22:47,973 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:22:47,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 04:22:47,974 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 04:22:47,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:22:47,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1459591463, now seen corresponding path program 3 times [2023-11-29 04:22:47,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:22:47,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402765462] [2023-11-29 04:22:47,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:22:47,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:22:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:48,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:22:48,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:22:48,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402765462] [2023-11-29 04:22:48,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402765462] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:22:48,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:22:48,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:22:48,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687050227] [2023-11-29 04:22:48,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:22:48,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:22:48,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:22:48,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:22:48,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:22:48,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2023-11-29 04:22:48,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 94 transitions, 1056 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:48,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:22:48,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2023-11-29 04:22:48,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:22:49,566 INFO L124 PetriNetUnfolderBase]: 6361/9894 cut-off events. [2023-11-29 04:22:49,567 INFO L125 PetriNetUnfolderBase]: For 111140/112913 co-relation queries the response was YES. [2023-11-29 04:22:49,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51123 conditions, 9894 events. 6361/9894 cut-off events. For 111140/112913 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 65610 event pairs, 723 based on Foata normal form. 777/10372 useless extension candidates. Maximal degree in co-relation 51083. Up to 4715 conditions per place. [2023-11-29 04:22:49,619 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 139 selfloop transitions, 5 changer transitions 22/184 dead transitions. [2023-11-29 04:22:49,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 184 transitions, 2541 flow [2023-11-29 04:22:49,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:22:49,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:22:49,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2023-11-29 04:22:49,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6646341463414634 [2023-11-29 04:22:49,620 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 109 transitions. [2023-11-29 04:22:49,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 109 transitions. [2023-11-29 04:22:49,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:22:49,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 109 transitions. [2023-11-29 04:22:49,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:49,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:49,622 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:49,622 INFO L175 Difference]: Start difference. First operand has 90 places, 94 transitions, 1056 flow. Second operand 4 states and 109 transitions. [2023-11-29 04:22:49,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 184 transitions, 2541 flow [2023-11-29 04:22:49,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 184 transitions, 2133 flow, removed 183 selfloop flow, removed 5 redundant places. [2023-11-29 04:22:49,849 INFO L231 Difference]: Finished difference. Result has 86 places, 93 transitions, 868 flow [2023-11-29 04:22:49,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=868, PETRI_PLACES=86, PETRI_TRANSITIONS=93} [2023-11-29 04:22:49,850 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 39 predicate places. [2023-11-29 04:22:49,850 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 93 transitions, 868 flow [2023-11-29 04:22:49,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:49,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:22:49,851 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-29 04:22:49,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 04:22:49,851 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 04:22:49,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:22:49,852 INFO L85 PathProgramCache]: Analyzing trace with hash -898966090, now seen corresponding path program 1 times [2023-11-29 04:22:49,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:22:49,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016183698] [2023-11-29 04:22:49,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:22:49,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:22:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:50,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:22:50,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:22:50,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016183698] [2023-11-29 04:22:50,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016183698] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:22:50,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:22:50,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:22:50,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531457373] [2023-11-29 04:22:50,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:22:50,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:22:50,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:22:50,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:22:50,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:22:50,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2023-11-29 04:22:50,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 93 transitions, 868 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:50,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:22:50,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2023-11-29 04:22:50,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:22:51,263 INFO L124 PetriNetUnfolderBase]: 4799/7658 cut-off events. [2023-11-29 04:22:51,263 INFO L125 PetriNetUnfolderBase]: For 51241/52342 co-relation queries the response was YES. [2023-11-29 04:22:51,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35312 conditions, 7658 events. 4799/7658 cut-off events. For 51241/52342 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 50100 event pairs, 438 based on Foata normal form. 644/8097 useless extension candidates. Maximal degree in co-relation 35272. Up to 2721 conditions per place. [2023-11-29 04:22:51,297 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 121 selfloop transitions, 8 changer transitions 32/179 dead transitions. [2023-11-29 04:22:51,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 179 transitions, 2035 flow [2023-11-29 04:22:51,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:22:51,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:22:51,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2023-11-29 04:22:51,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6780487804878049 [2023-11-29 04:22:51,299 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 139 transitions. [2023-11-29 04:22:51,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 139 transitions. [2023-11-29 04:22:51,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:22:51,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 139 transitions. [2023-11-29 04:22:51,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:51,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:51,301 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:51,301 INFO L175 Difference]: Start difference. First operand has 86 places, 93 transitions, 868 flow. Second operand 5 states and 139 transitions. [2023-11-29 04:22:51,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 179 transitions, 2035 flow [2023-11-29 04:22:51,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 179 transitions, 1992 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-11-29 04:22:51,356 INFO L231 Difference]: Finished difference. Result has 89 places, 88 transitions, 795 flow [2023-11-29 04:22:51,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=795, PETRI_PLACES=89, PETRI_TRANSITIONS=88} [2023-11-29 04:22:51,357 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 42 predicate places. [2023-11-29 04:22:51,357 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 88 transitions, 795 flow [2023-11-29 04:22:51,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:51,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:22:51,358 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-29 04:22:51,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 04:22:51,358 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 04:22:51,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:22:51,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1536716452, now seen corresponding path program 1 times [2023-11-29 04:22:51,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:22:51,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153060392] [2023-11-29 04:22:51,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:22:51,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:22:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:51,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:22:51,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:22:51,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153060392] [2023-11-29 04:22:51,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153060392] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:22:51,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:22:51,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:22:51,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886683084] [2023-11-29 04:22:51,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:22:51,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:22:51,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:22:51,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:22:51,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:22:51,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2023-11-29 04:22:51,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 88 transitions, 795 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:51,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:22:51,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2023-11-29 04:22:51,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:22:52,731 INFO L124 PetriNetUnfolderBase]: 4089/6532 cut-off events. [2023-11-29 04:22:52,731 INFO L125 PetriNetUnfolderBase]: For 47677/48702 co-relation queries the response was YES. [2023-11-29 04:22:52,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31755 conditions, 6532 events. 4089/6532 cut-off events. For 47677/48702 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 42929 event pairs, 434 based on Foata normal form. 398/6733 useless extension candidates. Maximal degree in co-relation 31713. Up to 2705 conditions per place. [2023-11-29 04:22:52,755 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 95 selfloop transitions, 11 changer transitions 36/159 dead transitions. [2023-11-29 04:22:52,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 159 transitions, 1720 flow [2023-11-29 04:22:52,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:22:52,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:22:52,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2023-11-29 04:22:52,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6056910569105691 [2023-11-29 04:22:52,757 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 149 transitions. [2023-11-29 04:22:52,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 149 transitions. [2023-11-29 04:22:52,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:22:52,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 149 transitions. [2023-11-29 04:22:52,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:52,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 41.0) internal successors, (287), 7 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:52,759 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 41.0) internal successors, (287), 7 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:52,759 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 795 flow. Second operand 6 states and 149 transitions. [2023-11-29 04:22:52,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 159 transitions, 1720 flow [2023-11-29 04:22:52,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 159 transitions, 1580 flow, removed 43 selfloop flow, removed 8 redundant places. [2023-11-29 04:22:52,850 INFO L231 Difference]: Finished difference. Result has 88 places, 83 transitions, 679 flow [2023-11-29 04:22:52,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=679, PETRI_PLACES=88, PETRI_TRANSITIONS=83} [2023-11-29 04:22:52,850 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 41 predicate places. [2023-11-29 04:22:52,850 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 83 transitions, 679 flow [2023-11-29 04:22:52,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:52,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:22:52,851 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-29 04:22:52,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 04:22:52,851 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 04:22:52,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:22:52,852 INFO L85 PathProgramCache]: Analyzing trace with hash 59048768, now seen corresponding path program 1 times [2023-11-29 04:22:52,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:22:52,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231099689] [2023-11-29 04:22:52,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:22:52,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:22:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:53,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:22:53,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:22:53,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231099689] [2023-11-29 04:22:53,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231099689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:22:53,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:22:53,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:22:53,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875458436] [2023-11-29 04:22:53,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:22:53,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:22:53,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:22:53,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:22:53,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:22:53,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2023-11-29 04:22:53,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 83 transitions, 679 flow. Second operand has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:53,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:22:53,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2023-11-29 04:22:53,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:22:54,318 INFO L124 PetriNetUnfolderBase]: 2205/4374 cut-off events. [2023-11-29 04:22:54,318 INFO L125 PetriNetUnfolderBase]: For 20962/21795 co-relation queries the response was YES. [2023-11-29 04:22:54,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17518 conditions, 4374 events. 2205/4374 cut-off events. For 20962/21795 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 34598 event pairs, 367 based on Foata normal form. 131/4033 useless extension candidates. Maximal degree in co-relation 17480. Up to 1662 conditions per place. [2023-11-29 04:22:54,338 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 52 selfloop transitions, 20 changer transitions 30/128 dead transitions. [2023-11-29 04:22:54,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 128 transitions, 1122 flow [2023-11-29 04:22:54,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:22:54,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 04:22:54,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 226 transitions. [2023-11-29 04:22:54,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.551219512195122 [2023-11-29 04:22:54,340 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 226 transitions. [2023-11-29 04:22:54,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 226 transitions. [2023-11-29 04:22:54,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:22:54,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 226 transitions. [2023-11-29 04:22:54,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 22.6) internal successors, (226), 10 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:54,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 41.0) internal successors, (451), 11 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:54,343 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 41.0) internal successors, (451), 11 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:54,343 INFO L175 Difference]: Start difference. First operand has 88 places, 83 transitions, 679 flow. Second operand 10 states and 226 transitions. [2023-11-29 04:22:54,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 128 transitions, 1122 flow [2023-11-29 04:22:54,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 128 transitions, 935 flow, removed 79 selfloop flow, removed 10 redundant places. [2023-11-29 04:22:54,383 INFO L231 Difference]: Finished difference. Result has 92 places, 87 transitions, 632 flow [2023-11-29 04:22:54,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=632, PETRI_PLACES=92, PETRI_TRANSITIONS=87} [2023-11-29 04:22:54,384 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 45 predicate places. [2023-11-29 04:22:54,384 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 87 transitions, 632 flow [2023-11-29 04:22:54,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:54,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:22:54,385 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-29 04:22:54,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 04:22:54,385 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 04:22:54,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:22:54,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1080882014, now seen corresponding path program 2 times [2023-11-29 04:22:54,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:22:54,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410741527] [2023-11-29 04:22:54,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:22:54,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:22:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:55,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:22:55,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:22:55,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410741527] [2023-11-29 04:22:55,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410741527] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:22:55,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:22:55,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:22:55,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288093074] [2023-11-29 04:22:55,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:22:55,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:22:55,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:22:55,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:22:55,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:22:55,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2023-11-29 04:22:55,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 87 transitions, 632 flow. Second operand has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:55,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:22:55,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2023-11-29 04:22:55,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:22:56,232 INFO L124 PetriNetUnfolderBase]: 2086/4170 cut-off events. [2023-11-29 04:22:56,232 INFO L125 PetriNetUnfolderBase]: For 10299/10775 co-relation queries the response was YES. [2023-11-29 04:22:56,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15050 conditions, 4170 events. 2086/4170 cut-off events. For 10299/10775 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 32713 event pairs, 307 based on Foata normal form. 133/3857 useless extension candidates. Maximal degree in co-relation 15013. Up to 1378 conditions per place. [2023-11-29 04:22:56,249 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 61 selfloop transitions, 34 changer transitions 25/146 dead transitions. [2023-11-29 04:22:56,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 146 transitions, 1227 flow [2023-11-29 04:22:56,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:22:56,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 04:22:56,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 222 transitions. [2023-11-29 04:22:56,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5414634146341464 [2023-11-29 04:22:56,251 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 222 transitions. [2023-11-29 04:22:56,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 222 transitions. [2023-11-29 04:22:56,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:22:56,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 222 transitions. [2023-11-29 04:22:56,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 22.2) internal successors, (222), 10 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:56,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 41.0) internal successors, (451), 11 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:56,253 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 41.0) internal successors, (451), 11 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:56,253 INFO L175 Difference]: Start difference. First operand has 92 places, 87 transitions, 632 flow. Second operand 10 states and 222 transitions. [2023-11-29 04:22:56,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 146 transitions, 1227 flow [2023-11-29 04:22:56,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 146 transitions, 1157 flow, removed 16 selfloop flow, removed 8 redundant places. [2023-11-29 04:22:56,291 INFO L231 Difference]: Finished difference. Result has 95 places, 102 transitions, 861 flow [2023-11-29 04:22:56,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=861, PETRI_PLACES=95, PETRI_TRANSITIONS=102} [2023-11-29 04:22:56,292 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 48 predicate places. [2023-11-29 04:22:56,292 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 102 transitions, 861 flow [2023-11-29 04:22:56,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:56,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:22:56,293 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-29 04:22:56,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 04:22:56,293 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 04:22:56,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:22:56,293 INFO L85 PathProgramCache]: Analyzing trace with hash -874534928, now seen corresponding path program 3 times [2023-11-29 04:22:56,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:22:56,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006942697] [2023-11-29 04:22:56,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:22:56,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:22:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:57,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:22:57,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:22:57,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006942697] [2023-11-29 04:22:57,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006942697] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:22:57,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:22:57,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 04:22:57,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463780041] [2023-11-29 04:22:57,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:22:57,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 04:22:57,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:22:57,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 04:22:57,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:22:57,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2023-11-29 04:22:57,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 102 transitions, 861 flow. Second operand has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:57,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:22:57,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2023-11-29 04:22:57,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:22:58,596 INFO L124 PetriNetUnfolderBase]: 2089/4084 cut-off events. [2023-11-29 04:22:58,596 INFO L125 PetriNetUnfolderBase]: For 13568/14069 co-relation queries the response was YES. [2023-11-29 04:22:58,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16029 conditions, 4084 events. 2089/4084 cut-off events. For 13568/14069 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 31912 event pairs, 412 based on Foata normal form. 139/3725 useless extension candidates. Maximal degree in co-relation 15990. Up to 1631 conditions per place. [2023-11-29 04:22:58,619 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 70 selfloop transitions, 32 changer transitions 18/146 dead transitions. [2023-11-29 04:22:58,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 146 transitions, 1350 flow [2023-11-29 04:22:58,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:22:58,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 04:22:58,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 253 transitions. [2023-11-29 04:22:58,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142276422764228 [2023-11-29 04:22:58,621 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 253 transitions. [2023-11-29 04:22:58,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 253 transitions. [2023-11-29 04:22:58,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:22:58,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 253 transitions. [2023-11-29 04:22:58,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 21.083333333333332) internal successors, (253), 12 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:58,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 41.0) internal successors, (533), 13 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:58,624 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 41.0) internal successors, (533), 13 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:58,624 INFO L175 Difference]: Start difference. First operand has 95 places, 102 transitions, 861 flow. Second operand 12 states and 253 transitions. [2023-11-29 04:22:58,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 146 transitions, 1350 flow [2023-11-29 04:22:58,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 146 transitions, 1296 flow, removed 17 selfloop flow, removed 7 redundant places. [2023-11-29 04:22:58,669 INFO L231 Difference]: Finished difference. Result has 103 places, 108 transitions, 1013 flow [2023-11-29 04:22:58,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1013, PETRI_PLACES=103, PETRI_TRANSITIONS=108} [2023-11-29 04:22:58,670 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 56 predicate places. [2023-11-29 04:22:58,670 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 108 transitions, 1013 flow [2023-11-29 04:22:58,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:58,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:22:58,671 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-29 04:22:58,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 04:22:58,671 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 04:22:58,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:22:58,671 INFO L85 PathProgramCache]: Analyzing trace with hash 630984324, now seen corresponding path program 4 times [2023-11-29 04:22:58,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:22:58,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650391972] [2023-11-29 04:22:58,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:22:58,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:22:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:59,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:22:59,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:22:59,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650391972] [2023-11-29 04:22:59,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650391972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:22:59,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:22:59,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 04:22:59,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728222745] [2023-11-29 04:22:59,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:22:59,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 04:22:59,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:22:59,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 04:22:59,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:22:59,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2023-11-29 04:22:59,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 108 transitions, 1013 flow. Second operand has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:22:59,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:22:59,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2023-11-29 04:22:59,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:23:00,875 INFO L124 PetriNetUnfolderBase]: 2208/4318 cut-off events. [2023-11-29 04:23:00,875 INFO L125 PetriNetUnfolderBase]: For 15613/16156 co-relation queries the response was YES. [2023-11-29 04:23:00,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17904 conditions, 4318 events. 2208/4318 cut-off events. For 15613/16156 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 34364 event pairs, 327 based on Foata normal form. 138/3993 useless extension candidates. Maximal degree in co-relation 17863. Up to 1624 conditions per place. [2023-11-29 04:23:00,898 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 74 selfloop transitions, 27 changer transitions 24/151 dead transitions. [2023-11-29 04:23:00,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 151 transitions, 1491 flow [2023-11-29 04:23:00,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 04:23:00,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-29 04:23:00,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 269 transitions. [2023-11-29 04:23:00,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5046904315196998 [2023-11-29 04:23:00,899 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 269 transitions. [2023-11-29 04:23:00,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 269 transitions. [2023-11-29 04:23:00,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:23:00,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 269 transitions. [2023-11-29 04:23:00,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 20.692307692307693) internal successors, (269), 13 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:00,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 41.0) internal successors, (574), 14 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:00,901 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 41.0) internal successors, (574), 14 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:00,902 INFO L175 Difference]: Start difference. First operand has 103 places, 108 transitions, 1013 flow. Second operand 13 states and 269 transitions. [2023-11-29 04:23:00,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 151 transitions, 1491 flow [2023-11-29 04:23:00,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 151 transitions, 1452 flow, removed 12 selfloop flow, removed 7 redundant places. [2023-11-29 04:23:00,950 INFO L231 Difference]: Finished difference. Result has 113 places, 109 transitions, 1116 flow [2023-11-29 04:23:00,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=984, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1116, PETRI_PLACES=113, PETRI_TRANSITIONS=109} [2023-11-29 04:23:00,951 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 66 predicate places. [2023-11-29 04:23:00,951 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 109 transitions, 1116 flow [2023-11-29 04:23:00,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:00,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:23:00,951 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-29 04:23:00,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 04:23:00,952 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 04:23:00,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:23:00,952 INFO L85 PathProgramCache]: Analyzing trace with hash 92915186, now seen corresponding path program 5 times [2023-11-29 04:23:00,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:23:00,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292568611] [2023-11-29 04:23:00,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:23:00,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:23:00,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:23:01,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:23:01,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:23:01,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292568611] [2023-11-29 04:23:01,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292568611] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:23:01,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:23:01,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 04:23:01,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213421139] [2023-11-29 04:23:01,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:23:01,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 04:23:01,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:23:01,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 04:23:01,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:23:01,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2023-11-29 04:23:01,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 109 transitions, 1116 flow. Second operand has 12 states, 12 states have (on average 14.75) internal successors, (177), 12 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:01,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:23:01,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2023-11-29 04:23:01,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:23:03,098 INFO L124 PetriNetUnfolderBase]: 3303/6304 cut-off events. [2023-11-29 04:23:03,098 INFO L125 PetriNetUnfolderBase]: For 25442/26092 co-relation queries the response was YES. [2023-11-29 04:23:03,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26673 conditions, 6304 events. 3303/6304 cut-off events. For 25442/26092 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 51937 event pairs, 814 based on Foata normal form. 110/5795 useless extension candidates. Maximal degree in co-relation 26627. Up to 2095 conditions per place. [2023-11-29 04:23:03,130 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 72 selfloop transitions, 55 changer transitions 85/231 dead transitions. [2023-11-29 04:23:03,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 231 transitions, 2592 flow [2023-11-29 04:23:03,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:23:03,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 04:23:03,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 265 transitions. [2023-11-29 04:23:03,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5386178861788617 [2023-11-29 04:23:03,131 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 265 transitions. [2023-11-29 04:23:03,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 265 transitions. [2023-11-29 04:23:03,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:23:03,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 265 transitions. [2023-11-29 04:23:03,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 22.083333333333332) internal successors, (265), 12 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:03,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 41.0) internal successors, (533), 13 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:03,133 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 41.0) internal successors, (533), 13 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:03,133 INFO L175 Difference]: Start difference. First operand has 113 places, 109 transitions, 1116 flow. Second operand 12 states and 265 transitions. [2023-11-29 04:23:03,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 231 transitions, 2592 flow [2023-11-29 04:23:03,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 231 transitions, 2499 flow, removed 25 selfloop flow, removed 7 redundant places. [2023-11-29 04:23:03,213 INFO L231 Difference]: Finished difference. Result has 117 places, 123 transitions, 1452 flow [2023-11-29 04:23:03,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1058, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1452, PETRI_PLACES=117, PETRI_TRANSITIONS=123} [2023-11-29 04:23:03,213 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 70 predicate places. [2023-11-29 04:23:03,213 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 123 transitions, 1452 flow [2023-11-29 04:23:03,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.75) internal successors, (177), 12 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:03,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:23:03,214 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-29 04:23:03,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 04:23:03,214 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 04:23:03,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:23:03,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1071269944, now seen corresponding path program 6 times [2023-11-29 04:23:03,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:23:03,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669167688] [2023-11-29 04:23:03,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:23:03,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:23:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:23:03,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:23:03,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:23:03,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669167688] [2023-11-29 04:23:03,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669167688] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:23:03,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:23:03,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:23:03,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299343508] [2023-11-29 04:23:03,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:23:03,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:23:03,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:23:03,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:23:03,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:23:03,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2023-11-29 04:23:03,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 123 transitions, 1452 flow. Second operand has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:03,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:23:03,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2023-11-29 04:23:03,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:23:04,122 INFO L124 PetriNetUnfolderBase]: 1216/2459 cut-off events. [2023-11-29 04:23:04,122 INFO L125 PetriNetUnfolderBase]: For 11198/11644 co-relation queries the response was YES. [2023-11-29 04:23:04,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10339 conditions, 2459 events. 1216/2459 cut-off events. For 11198/11644 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 17520 event pairs, 291 based on Foata normal form. 96/2274 useless extension candidates. Maximal degree in co-relation 10289. Up to 977 conditions per place. [2023-11-29 04:23:04,137 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 68 selfloop transitions, 29 changer transitions 16/143 dead transitions. [2023-11-29 04:23:04,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 143 transitions, 1764 flow [2023-11-29 04:23:04,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:23:04,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 04:23:04,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 174 transitions. [2023-11-29 04:23:04,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5304878048780488 [2023-11-29 04:23:04,139 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 174 transitions. [2023-11-29 04:23:04,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 174 transitions. [2023-11-29 04:23:04,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:23:04,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 174 transitions. [2023-11-29 04:23:04,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 21.75) internal successors, (174), 8 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:04,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 41.0) internal successors, (369), 9 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:04,141 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 41.0) internal successors, (369), 9 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:04,141 INFO L175 Difference]: Start difference. First operand has 117 places, 123 transitions, 1452 flow. Second operand 8 states and 174 transitions. [2023-11-29 04:23:04,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 143 transitions, 1764 flow [2023-11-29 04:23:04,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 143 transitions, 1662 flow, removed 25 selfloop flow, removed 9 redundant places. [2023-11-29 04:23:04,167 INFO L231 Difference]: Finished difference. Result has 114 places, 119 transitions, 1376 flow [2023-11-29 04:23:04,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1356, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1376, PETRI_PLACES=114, PETRI_TRANSITIONS=119} [2023-11-29 04:23:04,168 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 67 predicate places. [2023-11-29 04:23:04,168 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 119 transitions, 1376 flow [2023-11-29 04:23:04,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:04,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:23:04,168 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-29 04:23:04,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 04:23:04,169 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 04:23:04,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:23:04,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1326806296, now seen corresponding path program 7 times [2023-11-29 04:23:04,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:23:04,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701032636] [2023-11-29 04:23:04,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:23:04,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:23:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:23:05,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:23:05,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:23:05,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701032636] [2023-11-29 04:23:05,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701032636] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:23:05,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:23:05,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 04:23:05,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178188196] [2023-11-29 04:23:05,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:23:05,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 04:23:05,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:23:05,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 04:23:05,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:23:05,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2023-11-29 04:23:05,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 119 transitions, 1376 flow. Second operand has 12 states, 12 states have (on average 16.583333333333332) internal successors, (199), 12 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:05,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:23:05,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2023-11-29 04:23:05,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:23:06,022 INFO L124 PetriNetUnfolderBase]: 1469/2988 cut-off events. [2023-11-29 04:23:06,022 INFO L125 PetriNetUnfolderBase]: For 13158/13580 co-relation queries the response was YES. [2023-11-29 04:23:06,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12438 conditions, 2988 events. 1469/2988 cut-off events. For 13158/13580 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 22442 event pairs, 392 based on Foata normal form. 89/2731 useless extension candidates. Maximal degree in co-relation 12392. Up to 1412 conditions per place. [2023-11-29 04:23:06,040 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 79 selfloop transitions, 34 changer transitions 23/166 dead transitions. [2023-11-29 04:23:06,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 166 transitions, 1986 flow [2023-11-29 04:23:06,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:23:06,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 04:23:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 256 transitions. [2023-11-29 04:23:06,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5203252032520326 [2023-11-29 04:23:06,041 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 256 transitions. [2023-11-29 04:23:06,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 256 transitions. [2023-11-29 04:23:06,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:23:06,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 256 transitions. [2023-11-29 04:23:06,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 21.333333333333332) internal successors, (256), 12 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:06,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 41.0) internal successors, (533), 13 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:06,044 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 41.0) internal successors, (533), 13 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:06,044 INFO L175 Difference]: Start difference. First operand has 114 places, 119 transitions, 1376 flow. Second operand 12 states and 256 transitions. [2023-11-29 04:23:06,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 166 transitions, 1986 flow [2023-11-29 04:23:06,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 166 transitions, 1882 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-11-29 04:23:06,075 INFO L231 Difference]: Finished difference. Result has 121 places, 127 transitions, 1554 flow [2023-11-29 04:23:06,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1554, PETRI_PLACES=121, PETRI_TRANSITIONS=127} [2023-11-29 04:23:06,075 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 74 predicate places. [2023-11-29 04:23:06,076 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 127 transitions, 1554 flow [2023-11-29 04:23:06,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.583333333333332) internal successors, (199), 12 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:06,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:23:06,076 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-29 04:23:06,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 04:23:06,076 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 04:23:06,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:23:06,076 INFO L85 PathProgramCache]: Analyzing trace with hash -25933404, now seen corresponding path program 8 times [2023-11-29 04:23:06,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:23:06,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229774595] [2023-11-29 04:23:06,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:23:06,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:23:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:23:07,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:23:07,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:23:07,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229774595] [2023-11-29 04:23:07,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229774595] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:23:07,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:23:07,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 04:23:07,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063981212] [2023-11-29 04:23:07,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:23:07,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 04:23:07,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:23:07,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 04:23:07,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:23:07,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2023-11-29 04:23:07,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 127 transitions, 1554 flow. Second operand has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:07,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:23:07,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2023-11-29 04:23:07,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:23:08,233 INFO L124 PetriNetUnfolderBase]: 1316/2674 cut-off events. [2023-11-29 04:23:08,233 INFO L125 PetriNetUnfolderBase]: For 14776/15177 co-relation queries the response was YES. [2023-11-29 04:23:08,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11478 conditions, 2674 events. 1316/2674 cut-off events. For 14776/15177 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 19500 event pairs, 312 based on Foata normal form. 74/2470 useless extension candidates. Maximal degree in co-relation 11430. Up to 1146 conditions per place. [2023-11-29 04:23:08,250 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 73 selfloop transitions, 35 changer transitions 21/159 dead transitions. [2023-11-29 04:23:08,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 159 transitions, 1946 flow [2023-11-29 04:23:08,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:23:08,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 04:23:08,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 251 transitions. [2023-11-29 04:23:08,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5101626016260162 [2023-11-29 04:23:08,251 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 251 transitions. [2023-11-29 04:23:08,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 251 transitions. [2023-11-29 04:23:08,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:23:08,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 251 transitions. [2023-11-29 04:23:08,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 20.916666666666668) internal successors, (251), 12 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:08,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 41.0) internal successors, (533), 13 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:08,253 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 41.0) internal successors, (533), 13 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:08,253 INFO L175 Difference]: Start difference. First operand has 121 places, 127 transitions, 1554 flow. Second operand 12 states and 251 transitions. [2023-11-29 04:23:08,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 159 transitions, 1946 flow [2023-11-29 04:23:08,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 159 transitions, 1871 flow, removed 14 selfloop flow, removed 8 redundant places. [2023-11-29 04:23:08,284 INFO L231 Difference]: Finished difference. Result has 126 places, 122 transitions, 1537 flow [2023-11-29 04:23:08,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1485, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1537, PETRI_PLACES=126, PETRI_TRANSITIONS=122} [2023-11-29 04:23:08,285 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 79 predicate places. [2023-11-29 04:23:08,285 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 122 transitions, 1537 flow [2023-11-29 04:23:08,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:08,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:23:08,285 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-29 04:23:08,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 04:23:08,285 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 04:23:08,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:23:08,285 INFO L85 PathProgramCache]: Analyzing trace with hash -467004498, now seen corresponding path program 9 times [2023-11-29 04:23:08,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:23:08,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745011425] [2023-11-29 04:23:08,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:23:08,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:23:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:23:09,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:23:09,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:23:09,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745011425] [2023-11-29 04:23:09,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745011425] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:23:09,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:23:09,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:23:09,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341088082] [2023-11-29 04:23:09,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:23:09,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:23:09,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:23:09,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:23:09,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:23:09,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2023-11-29 04:23:09,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 122 transitions, 1537 flow. Second operand has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:09,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:23:09,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2023-11-29 04:23:09,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:23:09,726 INFO L124 PetriNetUnfolderBase]: 1405/2814 cut-off events. [2023-11-29 04:23:09,726 INFO L125 PetriNetUnfolderBase]: For 17907/18371 co-relation queries the response was YES. [2023-11-29 04:23:09,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12648 conditions, 2814 events. 1405/2814 cut-off events. For 17907/18371 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 20657 event pairs, 277 based on Foata normal form. 82/2589 useless extension candidates. Maximal degree in co-relation 12599. Up to 1098 conditions per place. [2023-11-29 04:23:09,742 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 63 selfloop transitions, 23 changer transitions 39/151 dead transitions. [2023-11-29 04:23:09,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 151 transitions, 1942 flow [2023-11-29 04:23:09,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:23:09,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 04:23:09,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 194 transitions. [2023-11-29 04:23:09,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5257452574525745 [2023-11-29 04:23:09,743 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 194 transitions. [2023-11-29 04:23:09,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 194 transitions. [2023-11-29 04:23:09,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:23:09,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 194 transitions. [2023-11-29 04:23:09,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 21.555555555555557) internal successors, (194), 9 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:09,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 41.0) internal successors, (410), 10 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:09,745 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 41.0) internal successors, (410), 10 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:09,745 INFO L175 Difference]: Start difference. First operand has 126 places, 122 transitions, 1537 flow. Second operand 9 states and 194 transitions. [2023-11-29 04:23:09,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 151 transitions, 1942 flow [2023-11-29 04:23:09,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 151 transitions, 1838 flow, removed 18 selfloop flow, removed 9 redundant places. [2023-11-29 04:23:09,819 INFO L231 Difference]: Finished difference. Result has 123 places, 99 transitions, 1212 flow [2023-11-29 04:23:09,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1442, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1212, PETRI_PLACES=123, PETRI_TRANSITIONS=99} [2023-11-29 04:23:09,820 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 76 predicate places. [2023-11-29 04:23:09,820 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 99 transitions, 1212 flow [2023-11-29 04:23:09,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:09,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:23:09,821 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-29 04:23:09,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 04:23:09,821 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 04:23:09,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:23:09,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1899382972, now seen corresponding path program 10 times [2023-11-29 04:23:09,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:23:09,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980000265] [2023-11-29 04:23:09,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:23:09,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:23:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:23:10,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:23:10,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:23:10,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980000265] [2023-11-29 04:23:10,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980000265] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:23:10,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:23:10,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:23:10,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138995155] [2023-11-29 04:23:10,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:23:10,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:23:10,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:23:10,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:23:10,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:23:10,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2023-11-29 04:23:10,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 99 transitions, 1212 flow. Second operand has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:10,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:23:10,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2023-11-29 04:23:10,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:23:10,741 INFO L124 PetriNetUnfolderBase]: 1207/2505 cut-off events. [2023-11-29 04:23:10,741 INFO L125 PetriNetUnfolderBase]: For 13746/14129 co-relation queries the response was YES. [2023-11-29 04:23:10,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10624 conditions, 2505 events. 1207/2505 cut-off events. For 13746/14129 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 18629 event pairs, 395 based on Foata normal form. 62/2312 useless extension candidates. Maximal degree in co-relation 10585. Up to 1146 conditions per place. [2023-11-29 04:23:10,754 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 44 selfloop transitions, 12 changer transitions 42/122 dead transitions. [2023-11-29 04:23:10,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 122 transitions, 1526 flow [2023-11-29 04:23:10,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:23:10,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 04:23:10,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2023-11-29 04:23:10,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5213414634146342 [2023-11-29 04:23:10,756 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 171 transitions. [2023-11-29 04:23:10,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 171 transitions. [2023-11-29 04:23:10,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:23:10,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 171 transitions. [2023-11-29 04:23:10,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 21.375) internal successors, (171), 8 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:10,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 41.0) internal successors, (369), 9 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:10,757 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 41.0) internal successors, (369), 9 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:10,757 INFO L175 Difference]: Start difference. First operand has 123 places, 99 transitions, 1212 flow. Second operand 8 states and 171 transitions. [2023-11-29 04:23:10,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 122 transitions, 1526 flow [2023-11-29 04:23:10,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 122 transitions, 1386 flow, removed 26 selfloop flow, removed 10 redundant places. [2023-11-29 04:23:10,797 INFO L231 Difference]: Finished difference. Result has 119 places, 74 transitions, 776 flow [2023-11-29 04:23:10,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1081, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=776, PETRI_PLACES=119, PETRI_TRANSITIONS=74} [2023-11-29 04:23:10,797 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 72 predicate places. [2023-11-29 04:23:10,798 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 74 transitions, 776 flow [2023-11-29 04:23:10,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:10,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:23:10,798 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-29 04:23:10,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 04:23:10,798 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 04:23:10,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:23:10,799 INFO L85 PathProgramCache]: Analyzing trace with hash 292263680, now seen corresponding path program 11 times [2023-11-29 04:23:10,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:23:10,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099866391] [2023-11-29 04:23:10,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:23:10,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:23:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:23:11,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:23:11,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:23:11,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099866391] [2023-11-29 04:23:11,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099866391] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:23:11,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:23:11,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:23:11,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208295384] [2023-11-29 04:23:11,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:23:11,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:23:11,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:23:11,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:23:11,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:23:11,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2023-11-29 04:23:11,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 74 transitions, 776 flow. Second operand has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:11,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:23:11,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2023-11-29 04:23:11,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:23:12,050 INFO L124 PetriNetUnfolderBase]: 916/1811 cut-off events. [2023-11-29 04:23:12,050 INFO L125 PetriNetUnfolderBase]: For 8811/9106 co-relation queries the response was YES. [2023-11-29 04:23:12,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7205 conditions, 1811 events. 916/1811 cut-off events. For 8811/9106 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 12204 event pairs, 267 based on Foata normal form. 42/1644 useless extension candidates. Maximal degree in co-relation 7168. Up to 681 conditions per place. [2023-11-29 04:23:12,063 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 31 selfloop transitions, 7 changer transitions 38/97 dead transitions. [2023-11-29 04:23:12,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 97 transitions, 1006 flow [2023-11-29 04:23:12,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:23:12,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 04:23:12,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 188 transitions. [2023-11-29 04:23:12,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5094850948509485 [2023-11-29 04:23:12,065 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 188 transitions. [2023-11-29 04:23:12,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 188 transitions. [2023-11-29 04:23:12,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:23:12,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 188 transitions. [2023-11-29 04:23:12,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 20.88888888888889) internal successors, (188), 9 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:12,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 41.0) internal successors, (410), 10 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:12,067 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 41.0) internal successors, (410), 10 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:12,067 INFO L175 Difference]: Start difference. First operand has 119 places, 74 transitions, 776 flow. Second operand 9 states and 188 transitions. [2023-11-29 04:23:12,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 97 transitions, 1006 flow [2023-11-29 04:23:12,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 97 transitions, 902 flow, removed 22 selfloop flow, removed 15 redundant places. [2023-11-29 04:23:12,089 INFO L231 Difference]: Finished difference. Result has 107 places, 52 transitions, 397 flow [2023-11-29 04:23:12,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=397, PETRI_PLACES=107, PETRI_TRANSITIONS=52} [2023-11-29 04:23:12,090 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 60 predicate places. [2023-11-29 04:23:12,090 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 52 transitions, 397 flow [2023-11-29 04:23:12,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:12,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:23:12,090 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-29 04:23:12,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 04:23:12,090 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 04:23:12,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:23:12,091 INFO L85 PathProgramCache]: Analyzing trace with hash -503002566, now seen corresponding path program 12 times [2023-11-29 04:23:12,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:23:12,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923128348] [2023-11-29 04:23:12,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:23:12,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:23:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:23:13,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:23:13,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:23:13,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923128348] [2023-11-29 04:23:13,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923128348] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:23:13,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:23:13,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 04:23:13,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451969338] [2023-11-29 04:23:13,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:23:13,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 04:23:13,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:23:13,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 04:23:13,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:23:13,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2023-11-29 04:23:13,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 52 transitions, 397 flow. Second operand has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:13,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:23:13,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2023-11-29 04:23:13,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:23:13,826 INFO L124 PetriNetUnfolderBase]: 674/1353 cut-off events. [2023-11-29 04:23:13,826 INFO L125 PetriNetUnfolderBase]: For 3693/3908 co-relation queries the response was YES. [2023-11-29 04:23:13,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4578 conditions, 1353 events. 674/1353 cut-off events. For 3693/3908 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 8633 event pairs, 144 based on Foata normal form. 37/1260 useless extension candidates. Maximal degree in co-relation 4547. Up to 389 conditions per place. [2023-11-29 04:23:13,832 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 23 selfloop transitions, 5 changer transitions 34/83 dead transitions. [2023-11-29 04:23:13,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 83 transitions, 647 flow [2023-11-29 04:23:13,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:23:13,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 04:23:13,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 208 transitions. [2023-11-29 04:23:13,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5073170731707317 [2023-11-29 04:23:13,833 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 208 transitions. [2023-11-29 04:23:13,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 208 transitions. [2023-11-29 04:23:13,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:23:13,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 208 transitions. [2023-11-29 04:23:13,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 20.8) internal successors, (208), 10 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:13,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 41.0) internal successors, (451), 11 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:13,835 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 41.0) internal successors, (451), 11 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:13,835 INFO L175 Difference]: Start difference. First operand has 107 places, 52 transitions, 397 flow. Second operand 10 states and 208 transitions. [2023-11-29 04:23:13,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 83 transitions, 647 flow [2023-11-29 04:23:13,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 83 transitions, 521 flow, removed 33 selfloop flow, removed 23 redundant places. [2023-11-29 04:23:13,844 INFO L231 Difference]: Finished difference. Result has 92 places, 43 transitions, 250 flow [2023-11-29 04:23:13,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=250, PETRI_PLACES=92, PETRI_TRANSITIONS=43} [2023-11-29 04:23:13,844 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 45 predicate places. [2023-11-29 04:23:13,844 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 43 transitions, 250 flow [2023-11-29 04:23:13,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:13,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:23:13,845 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-29 04:23:13,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 04:23:13,845 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 04:23:13,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:23:13,845 INFO L85 PathProgramCache]: Analyzing trace with hash 866276138, now seen corresponding path program 13 times [2023-11-29 04:23:13,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:23:13,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748247677] [2023-11-29 04:23:13,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:23:13,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:23:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:23:13,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:23:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:23:13,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:23:13,949 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 04:23:13,950 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-29 04:23:13,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-29 04:23:13,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-29 04:23:13,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-29 04:23:13,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-29 04:23:13,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-29 04:23:13,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 04:23:13,952 INFO L445 BasicCegarLoop]: Path program histogram: [13, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:23:13,958 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 04:23:13,958 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:23:14,002 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 04:23:14,005 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 04:23:14,005 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 04:23:14,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:23:14 BasicIcfg [2023-11-29 04:23:14,029 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:23:14,029 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:23:14,029 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:23:14,029 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:23:14,030 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:22:33" (3/4) ... [2023-11-29 04:23:14,030 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 04:23:14,048 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 04:23:14,049 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 04:23:14,050 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 04:23:14,126 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b9ffdd-133b-45d0-8b61-a1b97284b193/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 04:23:14,126 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:23:14,127 INFO L158 Benchmark]: Toolchain (without parser) took 41863.20ms. Allocated memory was 155.2MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 108.6MB in the beginning and 936.7MB in the end (delta: -828.1MB). Peak memory consumption was 996.9MB. Max. memory is 16.1GB. [2023-11-29 04:23:14,127 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 107.0MB. Free memory was 57.8MB in the beginning and 57.6MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:23:14,128 INFO L158 Benchmark]: CACSL2BoogieTranslator took 569.43ms. Allocated memory is still 155.2MB. Free memory was 108.6MB in the beginning and 82.3MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-29 04:23:14,128 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.70ms. Allocated memory is still 155.2MB. Free memory was 82.3MB in the beginning and 79.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:23:14,129 INFO L158 Benchmark]: Boogie Preprocessor took 85.99ms. Allocated memory is still 155.2MB. Free memory was 79.8MB in the beginning and 122.1MB in the end (delta: -42.3MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2023-11-29 04:23:14,129 INFO L158 Benchmark]: RCFGBuilder took 759.47ms. Allocated memory is still 155.2MB. Free memory was 122.1MB in the beginning and 112.9MB in the end (delta: 9.1MB). Peak memory consumption was 59.8MB. Max. memory is 16.1GB. [2023-11-29 04:23:14,129 INFO L158 Benchmark]: TraceAbstraction took 40289.50ms. Allocated memory was 155.2MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 111.9MB in the beginning and 950.3MB in the end (delta: -838.4MB). Peak memory consumption was 984.0MB. Max. memory is 16.1GB. [2023-11-29 04:23:14,130 INFO L158 Benchmark]: Witness Printer took 97.27ms. Allocated memory is still 2.0GB. Free memory was 950.3MB in the beginning and 936.7MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 04:23:14,132 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.14ms. Allocated memory is still 107.0MB. Free memory was 57.8MB in the beginning and 57.6MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 569.43ms. Allocated memory is still 155.2MB. Free memory was 108.6MB in the beginning and 82.3MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.70ms. Allocated memory is still 155.2MB. Free memory was 82.3MB in the beginning and 79.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.99ms. Allocated memory is still 155.2MB. Free memory was 79.8MB in the beginning and 122.1MB in the end (delta: -42.3MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * RCFGBuilder took 759.47ms. Allocated memory is still 155.2MB. Free memory was 122.1MB in the beginning and 112.9MB in the end (delta: 9.1MB). Peak memory consumption was 59.8MB. Max. memory is 16.1GB. * TraceAbstraction took 40289.50ms. Allocated memory was 155.2MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 111.9MB in the beginning and 950.3MB in the end (delta: -838.4MB). Peak memory consumption was 984.0MB. Max. memory is 16.1GB. * Witness Printer took 97.27ms. Allocated memory is still 2.0GB. Free memory was 950.3MB in the beginning and 936.7MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2537; [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2537={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L851] 0 pthread_t t2538; [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L853] 0 pthread_t t2539; [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L772] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L19] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 68 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 40.1s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 13, EmptinessCheckTime: 0.0s, AutomataDifference: 22.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1467 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1411 mSDsluCounter, 700 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 612 mSDsCounter, 414 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4806 IncrementalHoareTripleChecker+Invalid, 5220 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 414 mSolverCounterUnsat, 88 mSDtfsCounter, 4806 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 299 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1554occurred in iteration=19, InterpolantAutomatonStates: 218, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 16.6s InterpolantComputationTime, 642 NumberOfCodeBlocks, 642 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 587 ConstructedInterpolants, 0 QuantifiedInterpolants, 7380 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-29 04:23:14,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b9ffdd-133b-45d0-8b61-a1b97284b193/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE