./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 d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5b48973-b5be-41cb-b11b-3c5701fd0369/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5b48973-b5be-41cb-b11b-3c5701fd0369/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5b48973-b5be-41cb-b11b-3c5701fd0369/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5b48973-b5be-41cb-b11b-3c5701fd0369/bin/uautomizer-verify-aQ6SnzHsRB/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_f5b48973-b5be-41cb-b11b-3c5701fd0369/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5b48973-b5be-41cb-b11b-3c5701fd0369/bin/uautomizer-verify-aQ6SnzHsRB --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.3.0-dev-d790fec [2024-11-27 19:50:37,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 19:50:38,088 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5b48973-b5be-41cb-b11b-3c5701fd0369/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-27 19:50:38,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 19:50:38,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 19:50:38,141 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 19:50:38,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 19:50:38,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 19:50:38,142 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 19:50:38,142 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 19:50:38,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 19:50:38,142 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 19:50:38,143 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 19:50:38,143 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 19:50:38,144 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 19:50:38,145 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 19:50:38,145 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 19:50:38,146 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 19:50:38,147 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 19:50:38,147 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 19:50:38,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 19:50:38,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 19:50:38,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 19:50:38,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 19:50:38,148 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 19:50:38,148 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 19:50:38,148 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 19:50:38,148 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 19:50:38,148 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 19:50:38,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:50:38,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:50:38,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:50:38,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:50:38,150 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 19:50:38,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:50:38,150 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:50:38,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:50:38,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:50:38,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 19:50:38,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 19:50:38,150 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 19:50:38,150 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 19:50:38,150 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 19:50:38,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 19:50:38,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 19:50:38,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 19:50:38,151 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 19:50:38,151 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 19:50:38,151 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5b48973-b5be-41cb-b11b-3c5701fd0369/bin/uautomizer-verify-aQ6SnzHsRB 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 [2024-11-27 19:50:38,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 19:50:38,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 19:50:38,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 19:50:38,523 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 19:50:38,523 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 19:50:38,525 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5b48973-b5be-41cb-b11b-3c5701fd0369/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-27 19:50:41,683 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5b48973-b5be-41cb-b11b-3c5701fd0369/bin/uautomizer-verify-aQ6SnzHsRB/data/b8ca95fe5/10b0277b9cb74551b2e4866688614a79/FLAGf042a8cf8 [2024-11-27 19:50:42,123 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 19:50:42,126 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5b48973-b5be-41cb-b11b-3c5701fd0369/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-27 19:50:42,147 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5b48973-b5be-41cb-b11b-3c5701fd0369/bin/uautomizer-verify-aQ6SnzHsRB/data/b8ca95fe5/10b0277b9cb74551b2e4866688614a79/FLAGf042a8cf8 [2024-11-27 19:50:42,265 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5b48973-b5be-41cb-b11b-3c5701fd0369/bin/uautomizer-verify-aQ6SnzHsRB/data/b8ca95fe5/10b0277b9cb74551b2e4866688614a79 [2024-11-27 19:50:42,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 19:50:42,269 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 19:50:42,270 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 19:50:42,271 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 19:50:42,282 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 19:50:42,283 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:50:42" (1/1) ... [2024-11-27 19:50:42,284 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a4cc957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:42, skipping insertion in model container [2024-11-27 19:50:42,284 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:50:42" (1/1) ... [2024-11-27 19:50:42,335 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 19:50:42,544 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5b48973-b5be-41cb-b11b-3c5701fd0369/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2024-11-27 19:50:42,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:50:42,907 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 19:50:42,920 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5b48973-b5be-41cb-b11b-3c5701fd0369/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2024-11-27 19:50:43,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:50:43,067 INFO L204 MainTranslator]: Completed translation [2024-11-27 19:50:43,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:43 WrapperNode [2024-11-27 19:50:43,068 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 19:50:43,069 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 19:50:43,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 19:50:43,069 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 19:50:43,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:43" (1/1) ... [2024-11-27 19:50:43,090 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:43" (1/1) ... [2024-11-27 19:50:43,118 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2024-11-27 19:50:43,118 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 19:50:43,119 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 19:50:43,119 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 19:50:43,119 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 19:50:43,130 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:43" (1/1) ... [2024-11-27 19:50:43,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:43" (1/1) ... [2024-11-27 19:50:43,135 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:43" (1/1) ... [2024-11-27 19:50:43,162 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-27 19:50:43,163 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:43" (1/1) ... [2024-11-27 19:50:43,163 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:43" (1/1) ... [2024-11-27 19:50:43,179 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:43" (1/1) ... [2024-11-27 19:50:43,181 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:43" (1/1) ... [2024-11-27 19:50:43,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:43" (1/1) ... [2024-11-27 19:50:43,189 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:43" (1/1) ... [2024-11-27 19:50:43,193 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:43" (1/1) ... [2024-11-27 19:50:43,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 19:50:43,200 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 19:50:43,201 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 19:50:43,201 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 19:50:43,202 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:43" (1/1) ... [2024-11-27 19:50:43,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:50:43,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5b48973-b5be-41cb-b11b-3c5701fd0369/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:50:43,240 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5b48973-b5be-41cb-b11b-3c5701fd0369/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 19:50:43,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5b48973-b5be-41cb-b11b-3c5701fd0369/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 19:50:43,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-27 19:50:43,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 19:50:43,277 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-27 19:50:43,278 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-27 19:50:43,278 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-27 19:50:43,278 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-27 19:50:43,278 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-27 19:50:43,279 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-27 19:50:43,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 19:50:43,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-27 19:50:43,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 19:50:43,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 19:50:43,281 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-27 19:50:43,435 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 19:50:43,436 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 19:50:43,944 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-27 19:50:43,944 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 19:50:44,259 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 19:50:44,260 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-27 19:50:44,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:50:44 BoogieIcfgContainer [2024-11-27 19:50:44,260 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 19:50:44,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 19:50:44,264 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 19:50:44,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 19:50:44,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 07:50:42" (1/3) ... [2024-11-27 19:50:44,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77fe8fd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:50:44, skipping insertion in model container [2024-11-27 19:50:44,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:43" (2/3) ... [2024-11-27 19:50:44,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77fe8fd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:50:44, skipping insertion in model container [2024-11-27 19:50:44,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:50:44" (3/3) ... [2024-11-27 19:50:44,274 INFO L128 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-27 19:50:44,290 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 19:50:44,292 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 4 procedures, 41 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2024-11-27 19:50:44,292 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-27 19:50:44,399 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-27 19:50:44,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 94 flow [2024-11-27 19:50:44,493 INFO L124 PetriNetUnfolderBase]: 1/38 cut-off events. [2024-11-27 19:50:44,495 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 19:50:44,500 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 78 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. [2024-11-27 19:50:44,500 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 41 transitions, 94 flow [2024-11-27 19:50:44,505 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 38 transitions, 85 flow [2024-11-27 19:50:44,515 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 19:50:44,536 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@355e1fdb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 19:50:44,536 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-27 19:50:44,550 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-27 19:50:44,550 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-11-27 19:50:44,550 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 19:50:44,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:50:44,551 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:44,551 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 19:50:44,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:44,560 INFO L85 PathProgramCache]: Analyzing trace with hash -515892989, now seen corresponding path program 1 times [2024-11-27 19:50:44,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:44,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792317160] [2024-11-27 19:50:44,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:44,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:45,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:45,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:45,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792317160] [2024-11-27 19:50:45,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792317160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:45,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:45,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-27 19:50:45,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626104838] [2024-11-27 19:50:45,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:45,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:50:45,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:45,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:50:45,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:50:45,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2024-11-27 19:50:45,285 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) [2024-11-27 19:50:45,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:50:45,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2024-11-27 19:50:45,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:50:46,185 INFO L124 PetriNetUnfolderBase]: 920/1670 cut-off events. [2024-11-27 19:50:46,185 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-27 19:50:46,198 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 120. Compared 10861 event pairs, 188 based on Foata normal form. 60/1699 useless extension candidates. Maximal degree in co-relation 3079. Up to 1048 conditions per place. [2024-11-27 19:50:46,217 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 29 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2024-11-27 19:50:46,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 48 transitions, 171 flow [2024-11-27 19:50:46,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:50:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 19:50:46,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-11-27 19:50:46,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7317073170731707 [2024-11-27 19:50:46,237 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 90 transitions. [2024-11-27 19:50:46,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 48 transitions, 171 flow [2024-11-27 19:50:46,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 48 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-27 19:50:46,251 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 80 flow [2024-11-27 19:50:46,254 INFO L262 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} [2024-11-27 19:50:46,260 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2024-11-27 19:50:46,260 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 80 flow [2024-11-27 19:50:46,261 INFO L472 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) [2024-11-27 19:50:46,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:50:46,261 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:46,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 19:50:46,262 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 19:50:46,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:46,263 INFO L85 PathProgramCache]: Analyzing trace with hash 718352395, now seen corresponding path program 1 times [2024-11-27 19:50:46,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:46,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409429310] [2024-11-27 19:50:46,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:46,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:46,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:47,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:47,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:47,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409429310] [2024-11-27 19:50:47,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409429310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:47,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:47,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:50:47,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631250024] [2024-11-27 19:50:47,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:47,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 19:50:47,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:47,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 19:50:47,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 19:50:47,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-11-27 19:50:47,364 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) [2024-11-27 19:50:47,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:50:47,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-11-27 19:50:47,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:50:49,178 INFO L124 PetriNetUnfolderBase]: 2805/4495 cut-off events. [2024-11-27 19:50:49,178 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2024-11-27 19:50:49,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8857 conditions, 4495 events. 2805/4495 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 29288 event pairs, 834 based on Foata normal form. 0/4383 useless extension candidates. Maximal degree in co-relation 8847. Up to 2284 conditions per place. [2024-11-27 19:50:49,209 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 39 selfloop transitions, 11 changer transitions 80/141 dead transitions. [2024-11-27 19:50:49,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 141 transitions, 568 flow [2024-11-27 19:50:49,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 19:50:49,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-27 19:50:49,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 301 transitions. [2024-11-27 19:50:49,214 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6117886178861789 [2024-11-27 19:50:49,216 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 80 flow. Second operand 12 states and 301 transitions. [2024-11-27 19:50:49,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 141 transitions, 568 flow [2024-11-27 19:50:49,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 141 transitions, 552 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 19:50:49,223 INFO L231 Difference]: Finished difference. Result has 62 places, 43 transitions, 186 flow [2024-11-27 19:50:49,223 INFO L262 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=186, PETRI_PLACES=62, PETRI_TRANSITIONS=43} [2024-11-27 19:50:49,224 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 15 predicate places. [2024-11-27 19:50:49,225 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 43 transitions, 186 flow [2024-11-27 19:50:49,225 INFO L472 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) [2024-11-27 19:50:49,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:50:49,225 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:49,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 19:50:49,226 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 19:50:49,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:49,227 INFO L85 PathProgramCache]: Analyzing trace with hash -33432628, now seen corresponding path program 1 times [2024-11-27 19:50:49,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:49,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864513743] [2024-11-27 19:50:49,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:49,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:49,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:49,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:49,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864513743] [2024-11-27 19:50:49,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864513743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:49,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:49,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:50:49,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213953499] [2024-11-27 19:50:49,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:49,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 19:50:49,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:49,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 19:50:49,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 19:50:49,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-11-27 19:50:49,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 43 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:49,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:50:49,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-11-27 19:50:49,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:50:51,241 INFO L124 PetriNetUnfolderBase]: 1908/3086 cut-off events. [2024-11-27 19:50:51,241 INFO L125 PetriNetUnfolderBase]: For 6045/6045 co-relation queries the response was YES. [2024-11-27 19:50:51,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11043 conditions, 3086 events. 1908/3086 cut-off events. For 6045/6045 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 19260 event pairs, 395 based on Foata normal form. 105/3174 useless extension candidates. Maximal degree in co-relation 11024. Up to 1458 conditions per place. [2024-11-27 19:50:51,267 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 46 selfloop transitions, 10 changer transitions 58/125 dead transitions. [2024-11-27 19:50:51,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 125 transitions, 830 flow [2024-11-27 19:50:51,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 19:50:51,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-27 19:50:51,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 239 transitions. [2024-11-27 19:50:51,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5829268292682926 [2024-11-27 19:50:51,274 INFO L175 Difference]: Start difference. First operand has 62 places, 43 transitions, 186 flow. Second operand 10 states and 239 transitions. [2024-11-27 19:50:51,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 125 transitions, 830 flow [2024-11-27 19:50:51,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 125 transitions, 760 flow, removed 35 selfloop flow, removed 5 redundant places. [2024-11-27 19:50:51,322 INFO L231 Difference]: Finished difference. Result has 66 places, 49 transitions, 277 flow [2024-11-27 19:50:51,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=277, PETRI_PLACES=66, PETRI_TRANSITIONS=49} [2024-11-27 19:50:51,324 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 19 predicate places. [2024-11-27 19:50:51,324 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 49 transitions, 277 flow [2024-11-27 19:50:51,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:51,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:50:51,324 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:51,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 19:50:51,325 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 19:50:51,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:51,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1041094976, now seen corresponding path program 1 times [2024-11-27 19:50:51,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:51,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784167655] [2024-11-27 19:50:51,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:51,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:52,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:52,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:52,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784167655] [2024-11-27 19:50:52,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784167655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:52,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:52,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:50:52,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888750150] [2024-11-27 19:50:52,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:52,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 19:50:52,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:52,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 19:50:52,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 19:50:52,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-27 19:50:52,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 49 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:52,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:50:52,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-27 19:50:52,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:50:53,200 INFO L124 PetriNetUnfolderBase]: 1561/2667 cut-off events. [2024-11-27 19:50:53,201 INFO L125 PetriNetUnfolderBase]: For 6406/6478 co-relation queries the response was YES. [2024-11-27 19:50:53,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9630 conditions, 2667 events. 1561/2667 cut-off events. For 6406/6478 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 16869 event pairs, 181 based on Foata normal form. 115/2755 useless extension candidates. Maximal degree in co-relation 9605. Up to 1644 conditions per place. [2024-11-27 19:50:53,227 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 48 selfloop transitions, 8 changer transitions 31/105 dead transitions. [2024-11-27 19:50:53,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 105 transitions, 757 flow [2024-11-27 19:50:53,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 19:50:53,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-27 19:50:53,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2024-11-27 19:50:53,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5914634146341463 [2024-11-27 19:50:53,229 INFO L175 Difference]: Start difference. First operand has 66 places, 49 transitions, 277 flow. Second operand 8 states and 194 transitions. [2024-11-27 19:50:53,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 105 transitions, 757 flow [2024-11-27 19:50:53,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 105 transitions, 717 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-11-27 19:50:53,256 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 346 flow [2024-11-27 19:50:53,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=346, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2024-11-27 19:50:53,257 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 23 predicate places. [2024-11-27 19:50:53,258 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 346 flow [2024-11-27 19:50:53,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:53,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:50:53,260 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:53,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 19:50:53,261 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 19:50:53,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:53,261 INFO L85 PathProgramCache]: Analyzing trace with hash 547590798, now seen corresponding path program 2 times [2024-11-27 19:50:53,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:53,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338715009] [2024-11-27 19:50:53,262 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 19:50:53,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:53,319 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 19:50:53,321 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 19:50:54,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:54,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:54,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338715009] [2024-11-27 19:50:54,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338715009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:54,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:54,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 19:50:54,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270735246] [2024-11-27 19:50:54,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:54,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 19:50:54,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:54,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 19:50:54,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-27 19:50:54,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-27 19:50:54,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 346 flow. Second operand has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:54,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:50:54,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-27 19:50:54,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:50:56,432 INFO L124 PetriNetUnfolderBase]: 2084/3498 cut-off events. [2024-11-27 19:50:56,433 INFO L125 PetriNetUnfolderBase]: For 9735/9874 co-relation queries the response was YES. [2024-11-27 19:50:56,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14359 conditions, 3498 events. 2084/3498 cut-off events. For 9735/9874 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 22584 event pairs, 202 based on Foata normal form. 217/3683 useless extension candidates. Maximal degree in co-relation 14329. Up to 1819 conditions per place. [2024-11-27 19:50:56,474 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 70 selfloop transitions, 39 changer transitions 42/169 dead transitions. [2024-11-27 19:50:56,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 169 transitions, 1430 flow [2024-11-27 19:50:56,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 19:50:56,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-27 19:50:56,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 320 transitions. [2024-11-27 19:50:56,477 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5574912891986062 [2024-11-27 19:50:56,477 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 346 flow. Second operand 14 states and 320 transitions. [2024-11-27 19:50:56,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 169 transitions, 1430 flow [2024-11-27 19:50:56,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 169 transitions, 1366 flow, removed 29 selfloop flow, removed 9 redundant places. [2024-11-27 19:50:56,515 INFO L231 Difference]: Finished difference. Result has 77 places, 96 transitions, 822 flow [2024-11-27 19:50:56,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=822, PETRI_PLACES=77, PETRI_TRANSITIONS=96} [2024-11-27 19:50:56,516 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 30 predicate places. [2024-11-27 19:50:56,516 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 96 transitions, 822 flow [2024-11-27 19:50:56,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:56,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:50:56,517 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:56,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 19:50:56,517 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 19:50:56,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:56,518 INFO L85 PathProgramCache]: Analyzing trace with hash 279130414, now seen corresponding path program 1 times [2024-11-27 19:50:56,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:56,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858668614] [2024-11-27 19:50:56,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:56,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:56,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:56,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:56,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858668614] [2024-11-27 19:50:56,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858668614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:56,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:56,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:50:56,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255594711] [2024-11-27 19:50:56,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:56,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:50:56,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:56,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:50:56,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:50:56,846 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-11-27 19:50:56,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 96 transitions, 822 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) [2024-11-27 19:50:56,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:50:56,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-11-27 19:50:56,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:50:58,120 INFO L124 PetriNetUnfolderBase]: 3106/5292 cut-off events. [2024-11-27 19:50:58,121 INFO L125 PetriNetUnfolderBase]: For 16919/16940 co-relation queries the response was YES. [2024-11-27 19:50:58,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22455 conditions, 5292 events. 3106/5292 cut-off events. For 16919/16940 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 37513 event pairs, 831 based on Foata normal form. 82/5320 useless extension candidates. Maximal degree in co-relation 22425. Up to 2116 conditions per place. [2024-11-27 19:50:58,167 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 75 selfloop transitions, 7 changer transitions 86/181 dead transitions. [2024-11-27 19:50:58,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 181 transitions, 1911 flow [2024-11-27 19:50:58,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 19:50:58,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-27 19:50:58,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2024-11-27 19:50:58,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.578397212543554 [2024-11-27 19:50:58,169 INFO L175 Difference]: Start difference. First operand has 77 places, 96 transitions, 822 flow. Second operand 7 states and 166 transitions. [2024-11-27 19:50:58,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 181 transitions, 1911 flow [2024-11-27 19:50:58,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 181 transitions, 1623 flow, removed 144 selfloop flow, removed 1 redundant places. [2024-11-27 19:50:58,209 INFO L231 Difference]: Finished difference. Result has 85 places, 75 transitions, 584 flow [2024-11-27 19:50:58,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=584, PETRI_PLACES=85, PETRI_TRANSITIONS=75} [2024-11-27 19:50:58,210 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 38 predicate places. [2024-11-27 19:50:58,211 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 75 transitions, 584 flow [2024-11-27 19:50:58,211 INFO L472 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) [2024-11-27 19:50:58,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:50:58,211 INFO L206 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] [2024-11-27 19:50:58,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 19:50:58,211 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 19:50:58,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:58,212 INFO L85 PathProgramCache]: Analyzing trace with hash -629371760, now seen corresponding path program 1 times [2024-11-27 19:50:58,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:58,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89944743] [2024-11-27 19:50:58,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:58,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:59,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:59,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:59,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89944743] [2024-11-27 19:50:59,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89944743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:59,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:59,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 19:50:59,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427962416] [2024-11-27 19:50:59,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:59,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 19:50:59,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:59,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 19:50:59,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-27 19:50:59,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-27 19:50:59,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 75 transitions, 584 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) [2024-11-27 19:50:59,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:50:59,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-27 19:50:59,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:51:00,686 INFO L124 PetriNetUnfolderBase]: 2664/4609 cut-off events. [2024-11-27 19:51:00,687 INFO L125 PetriNetUnfolderBase]: For 18509/18715 co-relation queries the response was YES. [2024-11-27 19:51:00,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20139 conditions, 4609 events. 2664/4609 cut-off events. For 18509/18715 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 32231 event pairs, 478 based on Foata normal form. 192/4724 useless extension candidates. Maximal degree in co-relation 20104. Up to 2410 conditions per place. [2024-11-27 19:51:00,716 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 51 selfloop transitions, 26 changer transitions 40/135 dead transitions. [2024-11-27 19:51:00,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 135 transitions, 1292 flow [2024-11-27 19:51:00,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 19:51:00,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-27 19:51:00,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 206 transitions. [2024-11-27 19:51:00,718 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5582655826558266 [2024-11-27 19:51:00,718 INFO L175 Difference]: Start difference. First operand has 85 places, 75 transitions, 584 flow. Second operand 9 states and 206 transitions. [2024-11-27 19:51:00,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 135 transitions, 1292 flow [2024-11-27 19:51:00,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 135 transitions, 1263 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-11-27 19:51:00,771 INFO L231 Difference]: Finished difference. Result has 81 places, 81 transitions, 778 flow [2024-11-27 19:51:00,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=778, PETRI_PLACES=81, PETRI_TRANSITIONS=81} [2024-11-27 19:51:00,772 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 34 predicate places. [2024-11-27 19:51:00,772 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 81 transitions, 778 flow [2024-11-27 19:51:00,772 INFO L472 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) [2024-11-27 19:51:00,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:51:00,773 INFO L206 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] [2024-11-27 19:51:00,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 19:51:00,773 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 19:51:00,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:00,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1633970883, now seen corresponding path program 1 times [2024-11-27 19:51:00,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:00,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016704878] [2024-11-27 19:51:00,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:00,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:01,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:01,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:01,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016704878] [2024-11-27 19:51:01,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016704878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:01,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:01,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 19:51:01,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652638332] [2024-11-27 19:51:01,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:01,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:51:01,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:01,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:51:01,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:51:01,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-11-27 19:51:01,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 81 transitions, 778 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:51:01,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:51:01,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-11-27 19:51:01,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:51:02,468 INFO L124 PetriNetUnfolderBase]: 4950/7671 cut-off events. [2024-11-27 19:51:02,469 INFO L125 PetriNetUnfolderBase]: For 69370/70214 co-relation queries the response was YES. [2024-11-27 19:51:02,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38320 conditions, 7671 events. 4950/7671 cut-off events. For 69370/70214 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 48872 event pairs, 507 based on Foata normal form. 894/8407 useless extension candidates. Maximal degree in co-relation 38285. Up to 3740 conditions per place. [2024-11-27 19:51:02,526 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 115 selfloop transitions, 5 changer transitions 33/172 dead transitions. [2024-11-27 19:51:02,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 172 transitions, 2154 flow [2024-11-27 19:51:02,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:51:02,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-27 19:51:02,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-11-27 19:51:02,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6646341463414634 [2024-11-27 19:51:02,528 INFO L175 Difference]: Start difference. First operand has 81 places, 81 transitions, 778 flow. Second operand 4 states and 109 transitions. [2024-11-27 19:51:02,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 172 transitions, 2154 flow [2024-11-27 19:51:02,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 172 transitions, 2000 flow, removed 64 selfloop flow, removed 6 redundant places. [2024-11-27 19:51:02,656 INFO L231 Difference]: Finished difference. Result has 76 places, 84 transitions, 744 flow [2024-11-27 19:51:02,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=744, PETRI_PLACES=76, PETRI_TRANSITIONS=84} [2024-11-27 19:51:02,657 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 29 predicate places. [2024-11-27 19:51:02,657 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 84 transitions, 744 flow [2024-11-27 19:51:02,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:51:02,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:51:02,657 INFO L206 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] [2024-11-27 19:51:02,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 19:51:02,658 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 19:51:02,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:02,658 INFO L85 PathProgramCache]: Analyzing trace with hash 759580609, now seen corresponding path program 1 times [2024-11-27 19:51:02,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:02,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838455315] [2024-11-27 19:51:02,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:02,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:02,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:02,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:02,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838455315] [2024-11-27 19:51:02,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838455315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:02,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:02,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:51:02,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812428551] [2024-11-27 19:51:02,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:02,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:51:02,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:02,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:51:02,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:51:02,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-11-27 19:51:02,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 84 transitions, 744 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) [2024-11-27 19:51:02,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:51:02,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-11-27 19:51:02,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:51:04,159 INFO L124 PetriNetUnfolderBase]: 3690/5835 cut-off events. [2024-11-27 19:51:04,159 INFO L125 PetriNetUnfolderBase]: For 39402/40043 co-relation queries the response was YES. [2024-11-27 19:51:04,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27754 conditions, 5835 events. 3690/5835 cut-off events. For 39402/40043 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 35997 event pairs, 345 based on Foata normal form. 722/6431 useless extension candidates. Maximal degree in co-relation 27721. Up to 2286 conditions per place. [2024-11-27 19:51:04,196 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 108 selfloop transitions, 8 changer transitions 26/161 dead transitions. [2024-11-27 19:51:04,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 161 transitions, 1819 flow [2024-11-27 19:51:04,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 19:51:04,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-27 19:51:04,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2024-11-27 19:51:04,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6780487804878049 [2024-11-27 19:51:04,197 INFO L175 Difference]: Start difference. First operand has 76 places, 84 transitions, 744 flow. Second operand 5 states and 139 transitions. [2024-11-27 19:51:04,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 161 transitions, 1819 flow [2024-11-27 19:51:04,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 161 transitions, 1796 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-11-27 19:51:04,242 INFO L231 Difference]: Finished difference. Result has 80 places, 83 transitions, 729 flow [2024-11-27 19:51:04,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=729, PETRI_PLACES=80, PETRI_TRANSITIONS=83} [2024-11-27 19:51:04,244 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 33 predicate places. [2024-11-27 19:51:04,244 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 83 transitions, 729 flow [2024-11-27 19:51:04,244 INFO L472 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) [2024-11-27 19:51:04,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:51:04,244 INFO L206 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] [2024-11-27 19:51:04,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 19:51:04,245 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 19:51:04,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:04,246 INFO L85 PathProgramCache]: Analyzing trace with hash -397922807, now seen corresponding path program 1 times [2024-11-27 19:51:04,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:04,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531107853] [2024-11-27 19:51:04,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:04,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:04,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:04,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:04,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531107853] [2024-11-27 19:51:04,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531107853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:04,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:04,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:51:04,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413977693] [2024-11-27 19:51:04,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:04,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 19:51:04,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:04,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 19:51:04,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-27 19:51:04,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-11-27 19:51:04,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 83 transitions, 729 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) [2024-11-27 19:51:04,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:51:04,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-11-27 19:51:04,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:51:05,659 INFO L124 PetriNetUnfolderBase]: 3108/4905 cut-off events. [2024-11-27 19:51:05,659 INFO L125 PetriNetUnfolderBase]: For 37582/38070 co-relation queries the response was YES. [2024-11-27 19:51:05,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24738 conditions, 4905 events. 3108/4905 cut-off events. For 37582/38070 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 30086 event pairs, 342 based on Foata normal form. 509/5315 useless extension candidates. Maximal degree in co-relation 24703. Up to 2045 conditions per place. [2024-11-27 19:51:05,689 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 85 selfloop transitions, 11 changer transitions 33/147 dead transitions. [2024-11-27 19:51:05,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 147 transitions, 1594 flow [2024-11-27 19:51:05,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 19:51:05,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-27 19:51:05,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-11-27 19:51:05,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6056910569105691 [2024-11-27 19:51:05,690 INFO L175 Difference]: Start difference. First operand has 80 places, 83 transitions, 729 flow. Second operand 6 states and 149 transitions. [2024-11-27 19:51:05,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 147 transitions, 1594 flow [2024-11-27 19:51:05,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 147 transitions, 1541 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-11-27 19:51:05,718 INFO L231 Difference]: Finished difference. Result has 84 places, 79 transitions, 692 flow [2024-11-27 19:51:05,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=692, PETRI_PLACES=84, PETRI_TRANSITIONS=79} [2024-11-27 19:51:05,719 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 37 predicate places. [2024-11-27 19:51:05,719 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 79 transitions, 692 flow [2024-11-27 19:51:05,719 INFO L472 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) [2024-11-27 19:51:05,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:51:05,719 INFO L206 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] [2024-11-27 19:51:05,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 19:51:05,719 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 19:51:05,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:05,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1582005147, now seen corresponding path program 1 times [2024-11-27 19:51:05,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:05,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195095363] [2024-11-27 19:51:05,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:05,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:06,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:06,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:06,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195095363] [2024-11-27 19:51:06,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195095363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:06,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:06,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 19:51:06,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638680197] [2024-11-27 19:51:06,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:06,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 19:51:06,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:06,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 19:51:06,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-27 19:51:06,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-27 19:51:06,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 79 transitions, 692 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) [2024-11-27 19:51:06,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:51:06,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-27 19:51:06,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:51:07,774 INFO L124 PetriNetUnfolderBase]: 1811/3435 cut-off events. [2024-11-27 19:51:07,774 INFO L125 PetriNetUnfolderBase]: For 15006/15325 co-relation queries the response was YES. [2024-11-27 19:51:07,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14474 conditions, 3435 events. 1811/3435 cut-off events. For 15006/15325 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 25119 event pairs, 533 based on Foata normal form. 125/3136 useless extension candidates. Maximal degree in co-relation 14438. Up to 1543 conditions per place. [2024-11-27 19:51:07,792 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 62 selfloop transitions, 24 changer transitions 16/128 dead transitions. [2024-11-27 19:51:07,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 128 transitions, 1236 flow [2024-11-27 19:51:07,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-27 19:51:07,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-27 19:51:07,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 234 transitions. [2024-11-27 19:51:07,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5188470066518847 [2024-11-27 19:51:07,794 INFO L175 Difference]: Start difference. First operand has 84 places, 79 transitions, 692 flow. Second operand 11 states and 234 transitions. [2024-11-27 19:51:07,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 128 transitions, 1236 flow [2024-11-27 19:51:07,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 128 transitions, 1132 flow, removed 39 selfloop flow, removed 9 redundant places. [2024-11-27 19:51:07,842 INFO L231 Difference]: Finished difference. Result has 90 places, 90 transitions, 840 flow [2024-11-27 19:51:07,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=840, PETRI_PLACES=90, PETRI_TRANSITIONS=90} [2024-11-27 19:51:07,842 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 43 predicate places. [2024-11-27 19:51:07,842 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 90 transitions, 840 flow [2024-11-27 19:51:07,843 INFO L472 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) [2024-11-27 19:51:07,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:51:07,843 INFO L206 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] [2024-11-27 19:51:07,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 19:51:07,843 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 19:51:07,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:07,844 INFO L85 PathProgramCache]: Analyzing trace with hash 534882887, now seen corresponding path program 2 times [2024-11-27 19:51:07,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:07,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556478611] [2024-11-27 19:51:07,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 19:51:07,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:07,993 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 19:51:07,994 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 19:51:08,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:08,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:08,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556478611] [2024-11-27 19:51:08,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556478611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:08,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:08,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 19:51:08,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904423799] [2024-11-27 19:51:08,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:08,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 19:51:08,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:08,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 19:51:08,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-27 19:51:08,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-27 19:51:08,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 90 transitions, 840 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) [2024-11-27 19:51:08,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:51:08,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-27 19:51:08,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:51:10,024 INFO L124 PetriNetUnfolderBase]: 2279/4429 cut-off events. [2024-11-27 19:51:10,025 INFO L125 PetriNetUnfolderBase]: For 10192/10489 co-relation queries the response was YES. [2024-11-27 19:51:10,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16087 conditions, 4429 events. 2279/4429 cut-off events. For 10192/10489 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 34810 event pairs, 469 based on Foata normal form. 117/4080 useless extension candidates. Maximal degree in co-relation 16051. Up to 1783 conditions per place. [2024-11-27 19:51:10,064 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 51 selfloop transitions, 26 changer transitions 33/136 dead transitions. [2024-11-27 19:51:10,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 136 transitions, 1318 flow [2024-11-27 19:51:10,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 19:51:10,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-27 19:51:10,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 226 transitions. [2024-11-27 19:51:10,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.551219512195122 [2024-11-27 19:51:10,067 INFO L175 Difference]: Start difference. First operand has 90 places, 90 transitions, 840 flow. Second operand 10 states and 226 transitions. [2024-11-27 19:51:10,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 136 transitions, 1318 flow [2024-11-27 19:51:10,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 136 transitions, 1279 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-11-27 19:51:10,083 INFO L231 Difference]: Finished difference. Result has 97 places, 93 transitions, 917 flow [2024-11-27 19:51:10,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=917, PETRI_PLACES=97, PETRI_TRANSITIONS=93} [2024-11-27 19:51:10,084 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 50 predicate places. [2024-11-27 19:51:10,084 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 93 transitions, 917 flow [2024-11-27 19:51:10,084 INFO L472 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) [2024-11-27 19:51:10,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:51:10,084 INFO L206 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] [2024-11-27 19:51:10,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-27 19:51:10,085 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 19:51:10,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:10,085 INFO L85 PathProgramCache]: Analyzing trace with hash 165588499, now seen corresponding path program 3 times [2024-11-27 19:51:10,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:10,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496365420] [2024-11-27 19:51:10,086 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 19:51:10,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:10,189 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-27 19:51:10,189 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 19:51:12,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:12,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:12,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496365420] [2024-11-27 19:51:12,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496365420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:12,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:12,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-27 19:51:12,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195242353] [2024-11-27 19:51:12,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:12,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 19:51:12,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:12,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 19:51:12,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-27 19:51:12,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-27 19:51:12,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 93 transitions, 917 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) [2024-11-27 19:51:12,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:51:12,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-27 19:51:12,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:51:13,622 INFO L124 PetriNetUnfolderBase]: 1937/3779 cut-off events. [2024-11-27 19:51:13,622 INFO L125 PetriNetUnfolderBase]: For 13270/13564 co-relation queries the response was YES. [2024-11-27 19:51:13,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15267 conditions, 3779 events. 1937/3779 cut-off events. For 13270/13564 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 28480 event pairs, 311 based on Foata normal form. 134/3552 useless extension candidates. Maximal degree in co-relation 15228. Up to 1394 conditions per place. [2024-11-27 19:51:13,638 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 62 selfloop transitions, 55 changer transitions 23/166 dead transitions. [2024-11-27 19:51:13,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 166 transitions, 1805 flow [2024-11-27 19:51:13,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 19:51:13,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-27 19:51:13,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 297 transitions. [2024-11-27 19:51:13,640 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5174216027874564 [2024-11-27 19:51:13,640 INFO L175 Difference]: Start difference. First operand has 97 places, 93 transitions, 917 flow. Second operand 14 states and 297 transitions. [2024-11-27 19:51:13,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 166 transitions, 1805 flow [2024-11-27 19:51:13,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 166 transitions, 1641 flow, removed 30 selfloop flow, removed 9 redundant places. [2024-11-27 19:51:13,676 INFO L231 Difference]: Finished difference. Result has 100 places, 116 transitions, 1232 flow [2024-11-27 19:51:13,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1232, PETRI_PLACES=100, PETRI_TRANSITIONS=116} [2024-11-27 19:51:13,677 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 53 predicate places. [2024-11-27 19:51:13,677 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 116 transitions, 1232 flow [2024-11-27 19:51:13,678 INFO L472 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) [2024-11-27 19:51:13,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:51:13,678 INFO L206 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] [2024-11-27 19:51:13,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-27 19:51:13,678 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 19:51:13,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:13,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1770314009, now seen corresponding path program 4 times [2024-11-27 19:51:13,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:13,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977802553] [2024-11-27 19:51:13,679 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-27 19:51:13,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:13,869 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-27 19:51:13,869 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 19:51:15,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:15,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:15,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977802553] [2024-11-27 19:51:15,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977802553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:15,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:15,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 19:51:15,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890362173] [2024-11-27 19:51:15,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:15,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 19:51:15,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:15,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 19:51:15,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-27 19:51:15,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2024-11-27 19:51:15,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 116 transitions, 1232 flow. Second operand has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:51:15,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:51:15,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2024-11-27 19:51:15,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:51:16,537 INFO L124 PetriNetUnfolderBase]: 1814/3551 cut-off events. [2024-11-27 19:51:16,537 INFO L125 PetriNetUnfolderBase]: For 12082/12305 co-relation queries the response was YES. [2024-11-27 19:51:16,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14134 conditions, 3551 events. 1814/3551 cut-off events. For 12082/12305 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 26376 event pairs, 372 based on Foata normal form. 88/3288 useless extension candidates. Maximal degree in co-relation 14097. Up to 1411 conditions per place. [2024-11-27 19:51:16,551 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 63 selfloop transitions, 36 changer transitions 23/148 dead transitions. [2024-11-27 19:51:16,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 148 transitions, 1666 flow [2024-11-27 19:51:16,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 19:51:16,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-27 19:51:16,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 201 transitions. [2024-11-27 19:51:16,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5447154471544715 [2024-11-27 19:51:16,552 INFO L175 Difference]: Start difference. First operand has 100 places, 116 transitions, 1232 flow. Second operand 9 states and 201 transitions. [2024-11-27 19:51:16,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 148 transitions, 1666 flow [2024-11-27 19:51:16,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 148 transitions, 1556 flow, removed 28 selfloop flow, removed 8 redundant places. [2024-11-27 19:51:16,572 INFO L231 Difference]: Finished difference. Result has 101 places, 109 transitions, 1165 flow [2024-11-27 19:51:16,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1165, PETRI_PLACES=101, PETRI_TRANSITIONS=109} [2024-11-27 19:51:16,573 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 54 predicate places. [2024-11-27 19:51:16,573 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 109 transitions, 1165 flow [2024-11-27 19:51:16,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:51:16,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:51:16,573 INFO L206 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] [2024-11-27 19:51:16,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-27 19:51:16,573 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 19:51:16,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:16,574 INFO L85 PathProgramCache]: Analyzing trace with hash -18439837, now seen corresponding path program 5 times [2024-11-27 19:51:16,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:16,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446155780] [2024-11-27 19:51:16,574 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-27 19:51:16,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:16,606 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 19:51:16,606 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 19:51:17,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:17,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:17,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446155780] [2024-11-27 19:51:17,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446155780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:17,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:17,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 19:51:17,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48325501] [2024-11-27 19:51:17,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:17,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 19:51:17,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:17,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 19:51:17,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-27 19:51:17,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-27 19:51:17,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 109 transitions, 1165 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) [2024-11-27 19:51:17,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:51:17,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-27 19:51:17,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:51:18,379 INFO L124 PetriNetUnfolderBase]: 2144/4277 cut-off events. [2024-11-27 19:51:18,380 INFO L125 PetriNetUnfolderBase]: For 16392/16653 co-relation queries the response was YES. [2024-11-27 19:51:18,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16427 conditions, 4277 events. 2144/4277 cut-off events. For 16392/16653 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 34141 event pairs, 447 based on Foata normal form. 120/3991 useless extension candidates. Maximal degree in co-relation 16390. Up to 1590 conditions per place. [2024-11-27 19:51:18,402 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 63 selfloop transitions, 31 changer transitions 23/143 dead transitions. [2024-11-27 19:51:18,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 143 transitions, 1636 flow [2024-11-27 19:51:18,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 19:51:18,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-27 19:51:18,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions. [2024-11-27 19:51:18,403 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5396341463414634 [2024-11-27 19:51:18,403 INFO L175 Difference]: Start difference. First operand has 101 places, 109 transitions, 1165 flow. Second operand 8 states and 177 transitions. [2024-11-27 19:51:18,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 143 transitions, 1636 flow [2024-11-27 19:51:18,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 143 transitions, 1563 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-11-27 19:51:18,447 INFO L231 Difference]: Finished difference. Result has 99 places, 112 transitions, 1254 flow [2024-11-27 19:51:18,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1254, PETRI_PLACES=99, PETRI_TRANSITIONS=112} [2024-11-27 19:51:18,448 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 52 predicate places. [2024-11-27 19:51:18,448 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 112 transitions, 1254 flow [2024-11-27 19:51:18,449 INFO L472 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) [2024-11-27 19:51:18,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:51:18,449 INFO L206 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] [2024-11-27 19:51:18,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-27 19:51:18,449 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 19:51:18,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:18,450 INFO L85 PathProgramCache]: Analyzing trace with hash -158358133, now seen corresponding path program 6 times [2024-11-27 19:51:18,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:18,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065393139] [2024-11-27 19:51:18,450 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-27 19:51:18,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:18,489 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-27 19:51:18,490 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 19:51:19,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:19,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:19,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065393139] [2024-11-27 19:51:19,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065393139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:19,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:19,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 19:51:19,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36116470] [2024-11-27 19:51:19,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:19,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 19:51:19,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:19,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 19:51:19,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-27 19:51:19,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-27 19:51:19,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 112 transitions, 1254 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) [2024-11-27 19:51:19,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:51:19,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-27 19:51:19,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:51:20,761 INFO L124 PetriNetUnfolderBase]: 2300/4651 cut-off events. [2024-11-27 19:51:20,761 INFO L125 PetriNetUnfolderBase]: For 17195/17537 co-relation queries the response was YES. [2024-11-27 19:51:20,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17726 conditions, 4651 events. 2300/4651 cut-off events. For 17195/17537 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 38139 event pairs, 451 based on Foata normal form. 138/4329 useless extension candidates. Maximal degree in co-relation 17689. Up to 1089 conditions per place. [2024-11-27 19:51:20,784 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 71 selfloop transitions, 25 changer transitions 31/153 dead transitions. [2024-11-27 19:51:20,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 153 transitions, 1752 flow [2024-11-27 19:51:20,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 19:51:20,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-27 19:51:20,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 221 transitions. [2024-11-27 19:51:20,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5390243902439025 [2024-11-27 19:51:20,785 INFO L175 Difference]: Start difference. First operand has 99 places, 112 transitions, 1254 flow. Second operand 10 states and 221 transitions. [2024-11-27 19:51:20,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 153 transitions, 1752 flow [2024-11-27 19:51:20,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 153 transitions, 1699 flow, removed 24 selfloop flow, removed 4 redundant places. [2024-11-27 19:51:20,813 INFO L231 Difference]: Finished difference. Result has 105 places, 103 transitions, 1135 flow [2024-11-27 19:51:20,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1215, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1135, PETRI_PLACES=105, PETRI_TRANSITIONS=103} [2024-11-27 19:51:20,814 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 58 predicate places. [2024-11-27 19:51:20,814 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 103 transitions, 1135 flow [2024-11-27 19:51:20,814 INFO L472 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) [2024-11-27 19:51:20,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:51:20,814 INFO L206 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] [2024-11-27 19:51:20,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-27 19:51:20,814 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 19:51:20,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:20,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1851595253, now seen corresponding path program 7 times [2024-11-27 19:51:20,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:20,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663093632] [2024-11-27 19:51:20,815 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-27 19:51:20,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:21,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:21,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:21,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663093632] [2024-11-27 19:51:21,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663093632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:21,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:21,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 19:51:21,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6663184] [2024-11-27 19:51:21,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:21,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 19:51:21,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:21,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 19:51:21,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-27 19:51:21,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-27 19:51:21,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 103 transitions, 1135 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) [2024-11-27 19:51:21,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:51:21,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-27 19:51:21,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:51:22,686 INFO L124 PetriNetUnfolderBase]: 2068/4164 cut-off events. [2024-11-27 19:51:22,687 INFO L125 PetriNetUnfolderBase]: For 15830/16097 co-relation queries the response was YES. [2024-11-27 19:51:22,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15479 conditions, 4164 events. 2068/4164 cut-off events. For 15830/16097 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 33239 event pairs, 648 based on Foata normal form. 124/3802 useless extension candidates. Maximal degree in co-relation 15441. Up to 1969 conditions per place. [2024-11-27 19:51:22,705 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 58 selfloop transitions, 34 changer transitions 16/134 dead transitions. [2024-11-27 19:51:22,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 134 transitions, 1496 flow [2024-11-27 19:51:22,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-27 19:51:22,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-27 19:51:22,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 232 transitions. [2024-11-27 19:51:22,706 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5144124168514412 [2024-11-27 19:51:22,706 INFO L175 Difference]: Start difference. First operand has 105 places, 103 transitions, 1135 flow. Second operand 11 states and 232 transitions. [2024-11-27 19:51:22,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 134 transitions, 1496 flow [2024-11-27 19:51:22,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 134 transitions, 1359 flow, removed 10 selfloop flow, removed 11 redundant places. [2024-11-27 19:51:22,734 INFO L231 Difference]: Finished difference. Result has 105 places, 105 transitions, 1130 flow [2024-11-27 19:51:22,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1008, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1130, PETRI_PLACES=105, PETRI_TRANSITIONS=105} [2024-11-27 19:51:22,735 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 58 predicate places. [2024-11-27 19:51:22,735 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 105 transitions, 1130 flow [2024-11-27 19:51:22,735 INFO L472 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) [2024-11-27 19:51:22,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:51:22,735 INFO L206 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] [2024-11-27 19:51:22,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-27 19:51:22,735 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 19:51:22,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:22,736 INFO L85 PathProgramCache]: Analyzing trace with hash 971865299, now seen corresponding path program 8 times [2024-11-27 19:51:22,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:22,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569686345] [2024-11-27 19:51:22,736 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 19:51:22,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:22,784 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 19:51:22,784 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 19:51:24,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:24,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:24,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569686345] [2024-11-27 19:51:24,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569686345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:24,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:24,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 19:51:24,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432054402] [2024-11-27 19:51:24,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:24,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 19:51:24,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:24,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 19:51:24,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-27 19:51:24,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-27 19:51:24,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 105 transitions, 1130 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) [2024-11-27 19:51:24,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:51:24,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-27 19:51:24,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:51:25,271 INFO L124 PetriNetUnfolderBase]: 1967/4048 cut-off events. [2024-11-27 19:51:25,271 INFO L125 PetriNetUnfolderBase]: For 13062/13335 co-relation queries the response was YES. [2024-11-27 19:51:25,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14763 conditions, 4048 events. 1967/4048 cut-off events. For 13062/13335 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 32505 event pairs, 598 based on Foata normal form. 135/3749 useless extension candidates. Maximal degree in co-relation 14727. Up to 1950 conditions per place. [2024-11-27 19:51:25,347 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 62 selfloop transitions, 32 changer transitions 14/134 dead transitions. [2024-11-27 19:51:25,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 134 transitions, 1454 flow [2024-11-27 19:51:25,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 19:51:25,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-27 19:51:25,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 245 transitions. [2024-11-27 19:51:25,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49796747967479676 [2024-11-27 19:51:25,349 INFO L175 Difference]: Start difference. First operand has 105 places, 105 transitions, 1130 flow. Second operand 12 states and 245 transitions. [2024-11-27 19:51:25,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 134 transitions, 1454 flow [2024-11-27 19:51:25,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 134 transitions, 1369 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-11-27 19:51:25,368 INFO L231 Difference]: Finished difference. Result has 110 places, 106 transitions, 1160 flow [2024-11-27 19:51:25,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1160, PETRI_PLACES=110, PETRI_TRANSITIONS=106} [2024-11-27 19:51:25,368 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 63 predicate places. [2024-11-27 19:51:25,369 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 106 transitions, 1160 flow [2024-11-27 19:51:25,369 INFO L472 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) [2024-11-27 19:51:25,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:51:25,369 INFO L206 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] [2024-11-27 19:51:25,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-27 19:51:25,369 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 19:51:25,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:25,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1875998373, now seen corresponding path program 9 times [2024-11-27 19:51:25,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:25,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473825502] [2024-11-27 19:51:25,370 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 19:51:25,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:25,413 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-27 19:51:25,413 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 19:51:26,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:26,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:26,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473825502] [2024-11-27 19:51:26,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473825502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:26,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:26,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-27 19:51:26,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700571091] [2024-11-27 19:51:26,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:26,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-27 19:51:26,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:26,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-27 19:51:26,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-27 19:51:26,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-27 19:51:26,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 106 transitions, 1160 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) [2024-11-27 19:51:26,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:51:26,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-27 19:51:26,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:51:27,948 INFO L124 PetriNetUnfolderBase]: 1950/4026 cut-off events. [2024-11-27 19:51:27,948 INFO L125 PetriNetUnfolderBase]: For 13108/13360 co-relation queries the response was YES. [2024-11-27 19:51:27,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14864 conditions, 4026 events. 1950/4026 cut-off events. For 13108/13360 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 32424 event pairs, 715 based on Foata normal form. 112/3696 useless extension candidates. Maximal degree in co-relation 14826. Up to 2166 conditions per place. [2024-11-27 19:51:27,969 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 59 selfloop transitions, 23 changer transitions 31/139 dead transitions. [2024-11-27 19:51:27,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 139 transitions, 1528 flow [2024-11-27 19:51:27,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-27 19:51:27,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-27 19:51:27,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 266 transitions. [2024-11-27 19:51:27,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49906191369606 [2024-11-27 19:51:27,971 INFO L175 Difference]: Start difference. First operand has 110 places, 106 transitions, 1160 flow. Second operand 13 states and 266 transitions. [2024-11-27 19:51:27,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 139 transitions, 1528 flow [2024-11-27 19:51:27,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 139 transitions, 1451 flow, removed 11 selfloop flow, removed 10 redundant places. [2024-11-27 19:51:27,996 INFO L231 Difference]: Finished difference. Result has 115 places, 98 transitions, 1071 flow [2024-11-27 19:51:27,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1089, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1071, PETRI_PLACES=115, PETRI_TRANSITIONS=98} [2024-11-27 19:51:27,997 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 68 predicate places. [2024-11-27 19:51:27,997 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 98 transitions, 1071 flow [2024-11-27 19:51:27,997 INFO L472 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) [2024-11-27 19:51:27,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:51:27,997 INFO L206 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] [2024-11-27 19:51:27,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-27 19:51:27,998 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 19:51:27,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:27,999 INFO L85 PathProgramCache]: Analyzing trace with hash -2093126083, now seen corresponding path program 10 times [2024-11-27 19:51:27,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:27,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518247981] [2024-11-27 19:51:27,999 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-27 19:51:27,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:28,072 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-27 19:51:28,073 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 19:51:29,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:29,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:29,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518247981] [2024-11-27 19:51:29,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518247981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:29,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:29,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 19:51:29,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825540752] [2024-11-27 19:51:29,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:29,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 19:51:29,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:29,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 19:51:29,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-27 19:51:29,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2024-11-27 19:51:29,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 98 transitions, 1071 flow. Second operand has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:51:29,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:51:29,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2024-11-27 19:51:29,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:51:30,003 INFO L124 PetriNetUnfolderBase]: 2057/4241 cut-off events. [2024-11-27 19:51:30,003 INFO L125 PetriNetUnfolderBase]: For 14908/15183 co-relation queries the response was YES. [2024-11-27 19:51:30,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15425 conditions, 4241 events. 2057/4241 cut-off events. For 14908/15183 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 34784 event pairs, 1009 based on Foata normal form. 138/3928 useless extension candidates. Maximal degree in co-relation 15387. Up to 2139 conditions per place. [2024-11-27 19:51:30,021 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 57 selfloop transitions, 22 changer transitions 23/128 dead transitions. [2024-11-27 19:51:30,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 128 transitions, 1420 flow [2024-11-27 19:51:30,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 19:51:30,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-27 19:51:30,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 202 transitions. [2024-11-27 19:51:30,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5474254742547425 [2024-11-27 19:51:30,022 INFO L175 Difference]: Start difference. First operand has 115 places, 98 transitions, 1071 flow. Second operand 9 states and 202 transitions. [2024-11-27 19:51:30,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 128 transitions, 1420 flow [2024-11-27 19:51:30,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 128 transitions, 1275 flow, removed 23 selfloop flow, removed 13 redundant places. [2024-11-27 19:51:30,049 INFO L231 Difference]: Finished difference. Result has 106 places, 96 transitions, 964 flow [2024-11-27 19:51:30,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=964, PETRI_PLACES=106, PETRI_TRANSITIONS=96} [2024-11-27 19:51:30,050 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 59 predicate places. [2024-11-27 19:51:30,050 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 96 transitions, 964 flow [2024-11-27 19:51:30,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:51:30,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:51:30,051 INFO L206 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] [2024-11-27 19:51:30,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-27 19:51:30,051 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 19:51:30,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:30,051 INFO L85 PathProgramCache]: Analyzing trace with hash -706759379, now seen corresponding path program 11 times [2024-11-27 19:51:30,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:30,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223848496] [2024-11-27 19:51:30,052 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-27 19:51:30,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:30,112 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 19:51:30,113 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 19:51:31,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:31,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:31,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223848496] [2024-11-27 19:51:31,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223848496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:31,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:31,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-27 19:51:31,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077310426] [2024-11-27 19:51:31,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:31,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-27 19:51:31,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:31,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-27 19:51:31,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-27 19:51:31,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-27 19:51:31,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 96 transitions, 964 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) [2024-11-27 19:51:31,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:51:31,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-27 19:51:31,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:51:32,497 INFO L124 PetriNetUnfolderBase]: 2048/4202 cut-off events. [2024-11-27 19:51:32,497 INFO L125 PetriNetUnfolderBase]: For 11772/12069 co-relation queries the response was YES. [2024-11-27 19:51:32,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14384 conditions, 4202 events. 2048/4202 cut-off events. For 11772/12069 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 34341 event pairs, 411 based on Foata normal form. 117/3864 useless extension candidates. Maximal degree in co-relation 14347. Up to 1141 conditions per place. [2024-11-27 19:51:32,514 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 40 selfloop transitions, 14 changer transitions 59/139 dead transitions. [2024-11-27 19:51:32,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 139 transitions, 1384 flow [2024-11-27 19:51:32,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-27 19:51:32,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-27 19:51:32,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 268 transitions. [2024-11-27 19:51:32,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5028142589118199 [2024-11-27 19:51:32,515 INFO L175 Difference]: Start difference. First operand has 106 places, 96 transitions, 964 flow. Second operand 13 states and 268 transitions. [2024-11-27 19:51:32,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 139 transitions, 1384 flow [2024-11-27 19:51:32,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 139 transitions, 1334 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-11-27 19:51:32,534 INFO L231 Difference]: Finished difference. Result has 110 places, 67 transitions, 557 flow [2024-11-27 19:51:32,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=557, PETRI_PLACES=110, PETRI_TRANSITIONS=67} [2024-11-27 19:51:32,534 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 63 predicate places. [2024-11-27 19:51:32,535 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 67 transitions, 557 flow [2024-11-27 19:51:32,535 INFO L472 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) [2024-11-27 19:51:32,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:51:32,535 INFO L206 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] [2024-11-27 19:51:32,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-27 19:51:32,535 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 19:51:32,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:32,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1812790863, now seen corresponding path program 12 times [2024-11-27 19:51:32,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:32,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768513603] [2024-11-27 19:51:32,536 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-27 19:51:32,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:32,599 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-27 19:51:32,599 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 19:51:33,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:33,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:33,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768513603] [2024-11-27 19:51:33,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768513603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:33,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:33,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 19:51:33,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282338459] [2024-11-27 19:51:33,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:33,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 19:51:33,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:33,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 19:51:33,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-27 19:51:33,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-27 19:51:33,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 67 transitions, 557 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) [2024-11-27 19:51:33,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 19:51:33,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-27 19:51:33,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 19:51:34,178 INFO L124 PetriNetUnfolderBase]: 1193/2573 cut-off events. [2024-11-27 19:51:34,178 INFO L125 PetriNetUnfolderBase]: For 4879/5072 co-relation queries the response was YES. [2024-11-27 19:51:34,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8301 conditions, 2573 events. 1193/2573 cut-off events. For 4879/5072 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 19778 event pairs, 173 based on Foata normal form. 79/2412 useless extension candidates. Maximal degree in co-relation 8265. Up to 725 conditions per place. [2024-11-27 19:51:34,188 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 40 selfloop transitions, 18 changer transitions 18/102 dead transitions. [2024-11-27 19:51:34,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 102 transitions, 876 flow [2024-11-27 19:51:34,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-27 19:51:34,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-27 19:51:34,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 232 transitions. [2024-11-27 19:51:34,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5144124168514412 [2024-11-27 19:51:34,190 INFO L175 Difference]: Start difference. First operand has 110 places, 67 transitions, 557 flow. Second operand 11 states and 232 transitions. [2024-11-27 19:51:34,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 102 transitions, 876 flow [2024-11-27 19:51:34,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 102 transitions, 752 flow, removed 21 selfloop flow, removed 18 redundant places. [2024-11-27 19:51:34,199 INFO L231 Difference]: Finished difference. Result has 94 places, 67 transitions, 512 flow [2024-11-27 19:51:34,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=512, PETRI_PLACES=94, PETRI_TRANSITIONS=67} [2024-11-27 19:51:34,199 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 47 predicate places. [2024-11-27 19:51:34,199 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 67 transitions, 512 flow [2024-11-27 19:51:34,199 INFO L472 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) [2024-11-27 19:51:34,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 19:51:34,199 INFO L206 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] [2024-11-27 19:51:34,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-27 19:51:34,199 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 19:51:34,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:34,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1434181919, now seen corresponding path program 13 times [2024-11-27 19:51:34,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:34,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000029043] [2024-11-27 19:51:34,200 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-27 19:51:34,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 19:51:34,304 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 19:51:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 19:51:34,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 19:51:34,467 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 19:51:34,470 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-27 19:51:34,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-27 19:51:34,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-27 19:51:34,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-27 19:51:34,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-27 19:51:34,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-27 19:51:34,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-27 19:51:34,473 INFO L422 BasicCegarLoop]: Path program histogram: [13, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:34,534 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-27 19:51:34,534 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 19:51:34,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 07:51:34 BasicIcfg [2024-11-27 19:51:34,539 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 19:51:34,540 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 19:51:34,540 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 19:51:34,540 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 19:51:34,545 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:50:44" (3/4) ... [2024-11-27 19:51:34,546 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-27 19:51:34,663 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 9. [2024-11-27 19:51:34,712 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5b48973-b5be-41cb-b11b-3c5701fd0369/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-27 19:51:34,712 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5b48973-b5be-41cb-b11b-3c5701fd0369/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-27 19:51:34,712 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 19:51:34,713 INFO L158 Benchmark]: Toolchain (without parser) took 52444.56ms. Allocated memory was 117.4MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 93.6MB in the beginning and 640.6MB in the end (delta: -547.0MB). Peak memory consumption was 576.3MB. Max. memory is 16.1GB. [2024-11-27 19:51:34,714 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 142.6MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 19:51:34,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 797.86ms. Allocated memory is still 117.4MB. Free memory was 93.3MB in the beginning and 67.4MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-27 19:51:34,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.69ms. Allocated memory is still 117.4MB. Free memory was 67.4MB in the beginning and 64.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 19:51:34,715 INFO L158 Benchmark]: Boogie Preprocessor took 81.13ms. Allocated memory is still 117.4MB. Free memory was 64.8MB in the beginning and 60.6MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 19:51:34,715 INFO L158 Benchmark]: RCFGBuilder took 1060.04ms. Allocated memory is still 117.4MB. Free memory was 60.6MB in the beginning and 45.6MB in the end (delta: 15.0MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2024-11-27 19:51:34,715 INFO L158 Benchmark]: TraceAbstraction took 50276.31ms. Allocated memory was 117.4MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 45.0MB in the beginning and 653.2MB in the end (delta: -608.2MB). Peak memory consumption was 512.1MB. Max. memory is 16.1GB. [2024-11-27 19:51:34,716 INFO L158 Benchmark]: Witness Printer took 172.36ms. Allocated memory is still 1.2GB. Free memory was 653.2MB in the beginning and 640.6MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 19:51:34,717 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.43ms. Allocated memory is still 142.6MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 797.86ms. Allocated memory is still 117.4MB. Free memory was 93.3MB in the beginning and 67.4MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.69ms. Allocated memory is still 117.4MB. Free memory was 67.4MB in the beginning and 64.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 81.13ms. Allocated memory is still 117.4MB. Free memory was 64.8MB in the beginning and 60.6MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1060.04ms. Allocated memory is still 117.4MB. Free memory was 60.6MB in the beginning and 45.6MB in the end (delta: 15.0MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. * TraceAbstraction took 50276.31ms. Allocated memory was 117.4MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 45.0MB in the beginning and 653.2MB in the end (delta: -608.2MB). Peak memory consumption was 512.1MB. Max. memory is 16.1GB. * Witness Printer took 172.36ms. Allocated memory is still 1.2GB. Free memory was 653.2MB in the beginning and 640.6MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * 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 [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-3, 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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-3, t2538=-2, 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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, 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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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] [L772] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __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, weak$$choice0=1, 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=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 [\old(arg)={0:0}, \old(arg)={0:0}, __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, weak$$choice0=1, 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=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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, 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=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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, 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=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] [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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, 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=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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, 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=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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, 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=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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, 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=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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, weak$$choice0=0, weak$$choice2=0, 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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, weak$$choice0=0, weak$$choice2=0, 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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, weak$$choice0=1, 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(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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: 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. - 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. - 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: 50.0s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 13, EmptinessCheckTime: 0.0s, AutomataDifference: 26.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1326 SdHoareTripleChecker+Valid, 8.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1285 mSDsluCounter, 635 SdHoareTripleChecker+Invalid, 7.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 564 mSDsCounter, 310 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4441 IncrementalHoareTripleChecker+Invalid, 4751 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 310 mSolverCounterUnsat, 71 mSDtfsCounter, 4441 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 269 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1254occurred in iteration=15, InterpolantAutomatonStates: 209, 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, 1.5s SatisfiabilityAnalysisTime, 21.4s InterpolantComputationTime, 598 NumberOfCodeBlocks, 598 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 545 ConstructedInterpolants, 0 QuantifiedInterpolants, 6351 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-27 19:51:34,740 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5b48973-b5be-41cb-b11b-3c5701fd0369/bin/uautomizer-verify-aQ6SnzHsRB/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