./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe023_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 e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04c95cab-cd53-4315-9a1b-2f5164315509/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04c95cab-cd53-4315-9a1b-2f5164315509/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04c95cab-cd53-4315-9a1b-2f5164315509/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04c95cab-cd53-4315-9a1b-2f5164315509/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04c95cab-cd53-4315-9a1b-2f5164315509/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04c95cab-cd53-4315-9a1b-2f5164315509/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 2b11be791089901ed5596869d293da40c27b85c1e89c21a55cf2181db7595687 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:15:40,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:15:40,839 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04c95cab-cd53-4315-9a1b-2f5164315509/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:15:40,845 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:15:40,846 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:15:40,874 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:15:40,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:15:40,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:15:40,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:15:40,877 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:15:40,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:15:40,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:15:40,880 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:15:40,881 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:15:40,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:15:40,883 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:15:40,883 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:15:40,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:15:40,885 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:15:40,885 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:15:40,886 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:15:40,887 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:15:40,887 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:15:40,888 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:15:40,888 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:15:40,889 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:15:40,889 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:15:40,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:15:40,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:15:40,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:15:40,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:15:40,892 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:15:40,892 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:15:40,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:15:40,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:15:40,893 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:15:40,894 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:15:40,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:15:40,894 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:15:40,918 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04c95cab-cd53-4315-9a1b-2f5164315509/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04c95cab-cd53-4315-9a1b-2f5164315509/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 2b11be791089901ed5596869d293da40c27b85c1e89c21a55cf2181db7595687 [2023-11-06 22:15:41,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:15:41,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:15:41,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:15:41,261 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:15:41,262 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:15:41,263 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04c95cab-cd53-4315-9a1b-2f5164315509/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-06 22:15:44,432 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:15:44,798 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:15:44,800 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04c95cab-cd53-4315-9a1b-2f5164315509/sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-06 22:15:44,829 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04c95cab-cd53-4315-9a1b-2f5164315509/bin/uautomizer-verify-WvqO1wxjHP/data/b3212cb42/13b80099c0c04f2a96fa016f352aae3a/FLAG2879288ee [2023-11-06 22:15:44,850 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04c95cab-cd53-4315-9a1b-2f5164315509/bin/uautomizer-verify-WvqO1wxjHP/data/b3212cb42/13b80099c0c04f2a96fa016f352aae3a [2023-11-06 22:15:44,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:15:44,859 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:15:44,880 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:15:44,880 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:15:44,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:15:44,889 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:15:44" (1/1) ... [2023-11-06 22:15:44,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a1f473f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:44, skipping insertion in model container [2023-11-06 22:15:44,891 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:15:44" (1/1) ... [2023-11-06 22:15:44,968 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:15:45,158 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04c95cab-cd53-4315-9a1b-2f5164315509/sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-11-06 22:15:45,464 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:15:45,480 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:15:45,494 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04c95cab-cd53-4315-9a1b-2f5164315509/sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-11-06 22:15:45,592 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:15:45,636 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:15:45,636 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:15:45,644 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:15:45,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:45 WrapperNode [2023-11-06 22:15:45,645 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:15:45,647 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:15:45,647 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:15:45,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:15:45,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:45" (1/1) ... [2023-11-06 22:15:45,699 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:45" (1/1) ... [2023-11-06 22:15:45,755 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-11-06 22:15:45,757 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:15:45,758 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:15:45,758 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:15:45,758 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:15:45,770 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:45" (1/1) ... [2023-11-06 22:15:45,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:45" (1/1) ... [2023-11-06 22:15:45,784 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:45" (1/1) ... [2023-11-06 22:15:45,796 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:45" (1/1) ... [2023-11-06 22:15:45,817 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:45" (1/1) ... [2023-11-06 22:15:45,819 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:45" (1/1) ... [2023-11-06 22:15:45,826 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:45" (1/1) ... [2023-11-06 22:15:45,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:45" (1/1) ... [2023-11-06 22:15:45,840 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:15:45,844 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:15:45,845 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:15:45,845 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:15:45,846 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:45" (1/1) ... [2023-11-06 22:15:45,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:15:45,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04c95cab-cd53-4315-9a1b-2f5164315509/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:15:45,916 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04c95cab-cd53-4315-9a1b-2f5164315509/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:15:45,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04c95cab-cd53-4315-9a1b-2f5164315509/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:15:46,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:15:46,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:15:46,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:15:46,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:15:46,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:15:46,016 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:15:46,016 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:15:46,016 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:15:46,016 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:15:46,017 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:15:46,018 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:15:46,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:15:46,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:15:46,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:15:46,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:15:46,021 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:15:46,212 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:15:46,214 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:15:46,660 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:15:46,880 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:15:46,880 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:15:46,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:15:46 BoogieIcfgContainer [2023-11-06 22:15:46,883 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:15:46,886 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:15:46,886 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:15:46,890 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:15:46,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:15:44" (1/3) ... [2023-11-06 22:15:46,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35328adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:15:46, skipping insertion in model container [2023-11-06 22:15:46,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:45" (2/3) ... [2023-11-06 22:15:46,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35328adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:15:46, skipping insertion in model container [2023-11-06 22:15:46,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:15:46" (3/3) ... [2023-11-06 22:15:46,893 INFO L112 eAbstractionObserver]: Analyzing ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-06 22:15:46,904 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 22:15:46,916 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:15:46,916 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-06 22:15:46,916 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:15:46,997 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:15:47,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 236 flow [2023-11-06 22:15:47,127 INFO L124 PetriNetUnfolderBase]: 2/109 cut-off events. [2023-11-06 22:15:47,128 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:15:47,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2023-11-06 22:15:47,138 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 236 flow [2023-11-06 22:15:47,145 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2023-11-06 22:15:47,150 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:15:47,171 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 227 flow [2023-11-06 22:15:47,176 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 227 flow [2023-11-06 22:15:47,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 227 flow [2023-11-06 22:15:47,271 INFO L124 PetriNetUnfolderBase]: 2/109 cut-off events. [2023-11-06 22:15:47,272 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:15:47,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2023-11-06 22:15:47,277 INFO L119 LiptonReduction]: Number of co-enabled transitions 2206 [2023-11-06 22:15:53,131 INFO L134 LiptonReduction]: Checked pairs total: 5647 [2023-11-06 22:15:53,131 INFO L136 LiptonReduction]: Total number of compositions: 98 [2023-11-06 22:15:53,157 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:15:53,166 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@11fa69f8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:15:53,167 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-06 22:15:53,172 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:15:53,173 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-11-06 22:15:53,173 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:15:53,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:15:53,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:15:53,175 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:15:53,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:53,180 INFO L85 PathProgramCache]: Analyzing trace with hash 539106358, now seen corresponding path program 1 times [2023-11-06 22:15:53,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:53,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97476876] [2023-11-06 22:15:53,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:53,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:53,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:15:53,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:53,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97476876] [2023-11-06 22:15:53,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97476876] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:15:53,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:15:53,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:15:53,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693711244] [2023-11-06 22:15:53,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:15:53,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:15:53,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:53,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:15:53,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:15:53,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 210 [2023-11-06 22:15:53,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:53,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:15:53,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 210 [2023-11-06 22:15:53,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:15:54,544 INFO L124 PetriNetUnfolderBase]: 1397/2220 cut-off events. [2023-11-06 22:15:54,544 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-11-06 22:15:54,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4345 conditions, 2220 events. 1397/2220 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11390 event pairs, 236 based on Foata normal form. 0/2100 useless extension candidates. Maximal degree in co-relation 4334. Up to 1648 conditions per place. [2023-11-06 22:15:54,566 INFO L140 encePairwiseOnDemand]: 206/210 looper letters, 33 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2023-11-06 22:15:54,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 38 transitions, 162 flow [2023-11-06 22:15:54,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:15:54,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:15:54,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2023-11-06 22:15:54,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5158730158730159 [2023-11-06 22:15:54,583 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 325 transitions. [2023-11-06 22:15:54,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 325 transitions. [2023-11-06 22:15:54,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:15:54,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 325 transitions. [2023-11-06 22:15:54,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:54,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:54,600 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:54,602 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 325 transitions. [2023-11-06 22:15:54,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 38 transitions, 162 flow [2023-11-06 22:15:54,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 38 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:15:54,608 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2023-11-06 22:15:54,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-11-06 22:15:54,614 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-11-06 22:15:54,615 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2023-11-06 22:15:54,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:54,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:15:54,616 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:54,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:15:54,616 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:15:54,617 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:54,617 INFO L85 PathProgramCache]: Analyzing trace with hash -814280827, now seen corresponding path program 1 times [2023-11-06 22:15:54,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:54,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970234197] [2023-11-06 22:15:54,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:54,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:56,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:15:56,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:56,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970234197] [2023-11-06 22:15:56,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970234197] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:15:56,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:15:56,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:15:56,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241309586] [2023-11-06 22:15:56,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:15:56,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:15:56,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:56,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:15:56,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:15:56,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-11-06 22:15:56,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:56,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:15:56,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-11-06 22:15:56,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:15:56,630 INFO L124 PetriNetUnfolderBase]: 1049/1569 cut-off events. [2023-11-06 22:15:56,631 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2023-11-06 22:15:56,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3327 conditions, 1569 events. 1049/1569 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6736 event pairs, 249 based on Foata normal form. 24/1589 useless extension candidates. Maximal degree in co-relation 3317. Up to 1257 conditions per place. [2023-11-06 22:15:56,646 INFO L140 encePairwiseOnDemand]: 207/210 looper letters, 29 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2023-11-06 22:15:56,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 32 transitions, 138 flow [2023-11-06 22:15:56,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:15:56,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:15:56,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-11-06 22:15:56,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46984126984126984 [2023-11-06 22:15:56,653 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-11-06 22:15:56,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-11-06 22:15:56,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:15:56,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-11-06 22:15:56,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:56,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:56,666 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:56,666 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 3 states and 296 transitions. [2023-11-06 22:15:56,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 32 transitions, 138 flow [2023-11-06 22:15:56,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:15:56,672 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 58 flow [2023-11-06 22:15:56,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-11-06 22:15:56,673 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-11-06 22:15:56,679 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 58 flow [2023-11-06 22:15:56,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:56,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:15:56,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:56,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:15:56,681 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:15:56,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:56,682 INFO L85 PathProgramCache]: Analyzing trace with hash 527096809, now seen corresponding path program 1 times [2023-11-06 22:15:56,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:56,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335411677] [2023-11-06 22:15:56,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:56,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:57,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:15:57,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:57,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335411677] [2023-11-06 22:15:57,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335411677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:15:57,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:15:57,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:15:57,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372703217] [2023-11-06 22:15:57,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:15:57,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:15:57,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:57,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:15:57,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:15:57,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 210 [2023-11-06 22:15:57,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:57,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:15:57,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 210 [2023-11-06 22:15:57,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:15:58,578 INFO L124 PetriNetUnfolderBase]: 1463/2156 cut-off events. [2023-11-06 22:15:58,579 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2023-11-06 22:15:58,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4691 conditions, 2156 events. 1463/2156 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9556 event pairs, 208 based on Foata normal form. 18/2174 useless extension candidates. Maximal degree in co-relation 4680. Up to 1303 conditions per place. [2023-11-06 22:15:58,597 INFO L140 encePairwiseOnDemand]: 199/210 looper letters, 44 selfloop transitions, 16 changer transitions 0/60 dead transitions. [2023-11-06 22:15:58,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 60 transitions, 268 flow [2023-11-06 22:15:58,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:15:58,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:15:58,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 492 transitions. [2023-11-06 22:15:58,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4685714285714286 [2023-11-06 22:15:58,600 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 492 transitions. [2023-11-06 22:15:58,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 492 transitions. [2023-11-06 22:15:58,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:15:58,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 492 transitions. [2023-11-06 22:15:58,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:58,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:58,607 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:58,607 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 58 flow. Second operand 5 states and 492 transitions. [2023-11-06 22:15:58,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 60 transitions, 268 flow [2023-11-06 22:15:58,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 60 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:15:58,610 INFO L231 Difference]: Finished difference. Result has 37 places, 36 transitions, 169 flow [2023-11-06 22:15:58,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=37, PETRI_TRANSITIONS=36} [2023-11-06 22:15:58,611 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2023-11-06 22:15:58,611 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 36 transitions, 169 flow [2023-11-06 22:15:58,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:58,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:15:58,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:58,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:15:58,612 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:15:58,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:58,613 INFO L85 PathProgramCache]: Analyzing trace with hash 527053099, now seen corresponding path program 2 times [2023-11-06 22:15:58,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:58,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072498077] [2023-11-06 22:15:58,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:58,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:58,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:15:58,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:58,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072498077] [2023-11-06 22:15:58,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072498077] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:15:58,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:15:58,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:15:58,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441580267] [2023-11-06 22:15:58,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:15:58,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:15:58,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:58,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:15:58,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:15:58,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 210 [2023-11-06 22:15:58,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 36 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:58,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:15:58,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 210 [2023-11-06 22:15:58,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:15:59,521 INFO L124 PetriNetUnfolderBase]: 1753/2614 cut-off events. [2023-11-06 22:15:59,521 INFO L125 PetriNetUnfolderBase]: For 2624/2624 co-relation queries the response was YES. [2023-11-06 22:15:59,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8114 conditions, 2614 events. 1753/2614 cut-off events. For 2624/2624 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11978 event pairs, 324 based on Foata normal form. 120/2734 useless extension candidates. Maximal degree in co-relation 8100. Up to 1095 conditions per place. [2023-11-06 22:15:59,543 INFO L140 encePairwiseOnDemand]: 206/210 looper letters, 40 selfloop transitions, 3 changer transitions 18/61 dead transitions. [2023-11-06 22:15:59,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 61 transitions, 388 flow [2023-11-06 22:15:59,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:15:59,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:15:59,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 417 transitions. [2023-11-06 22:15:59,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49642857142857144 [2023-11-06 22:15:59,547 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 417 transitions. [2023-11-06 22:15:59,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 417 transitions. [2023-11-06 22:15:59,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:15:59,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 417 transitions. [2023-11-06 22:15:59,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:59,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:59,554 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:59,554 INFO L175 Difference]: Start difference. First operand has 37 places, 36 transitions, 169 flow. Second operand 4 states and 417 transitions. [2023-11-06 22:15:59,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 61 transitions, 388 flow [2023-11-06 22:15:59,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 61 transitions, 380 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:15:59,560 INFO L231 Difference]: Finished difference. Result has 41 places, 25 transitions, 120 flow [2023-11-06 22:15:59,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=41, PETRI_TRANSITIONS=25} [2023-11-06 22:15:59,561 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2023-11-06 22:15:59,562 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 25 transitions, 120 flow [2023-11-06 22:15:59,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:59,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:15:59,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:59,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:15:59,563 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:15:59,564 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:59,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1002467017, now seen corresponding path program 1 times [2023-11-06 22:15:59,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:59,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940032673] [2023-11-06 22:15:59,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:59,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:00,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:16:00,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:00,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940032673] [2023-11-06 22:16:00,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940032673] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:00,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:00,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:16:00,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121383563] [2023-11-06 22:16:00,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:00,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:16:00,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:00,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:16:00,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:16:00,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-11-06 22:16:00,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 25 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:00,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:00,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-11-06 22:16:00,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:00,908 INFO L124 PetriNetUnfolderBase]: 720/1112 cut-off events. [2023-11-06 22:16:00,908 INFO L125 PetriNetUnfolderBase]: For 1346/1354 co-relation queries the response was YES. [2023-11-06 22:16:00,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3549 conditions, 1112 events. 720/1112 cut-off events. For 1346/1354 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4589 event pairs, 264 based on Foata normal form. 36/1146 useless extension candidates. Maximal degree in co-relation 3532. Up to 637 conditions per place. [2023-11-06 22:16:00,921 INFO L140 encePairwiseOnDemand]: 207/210 looper letters, 35 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2023-11-06 22:16:00,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 242 flow [2023-11-06 22:16:00,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:16:00,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:16:00,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2023-11-06 22:16:00,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4746031746031746 [2023-11-06 22:16:00,924 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 299 transitions. [2023-11-06 22:16:00,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 299 transitions. [2023-11-06 22:16:00,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:00,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 299 transitions. [2023-11-06 22:16:00,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:00,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:00,929 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:00,930 INFO L175 Difference]: Start difference. First operand has 41 places, 25 transitions, 120 flow. Second operand 3 states and 299 transitions. [2023-11-06 22:16:00,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 242 flow [2023-11-06 22:16:00,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 216 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-11-06 22:16:00,937 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 106 flow [2023-11-06 22:16:00,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-11-06 22:16:00,940 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2023-11-06 22:16:00,941 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 106 flow [2023-11-06 22:16:00,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:00,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:00,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:00,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:16:00,942 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:16:00,942 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:00,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1338796969, now seen corresponding path program 1 times [2023-11-06 22:16:00,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:00,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077947336] [2023-11-06 22:16:00,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:00,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:01,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:16:01,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:01,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077947336] [2023-11-06 22:16:01,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077947336] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:01,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:01,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:16:01,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773207807] [2023-11-06 22:16:01,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:01,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:16:01,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:01,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:16:01,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:16:01,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 210 [2023-11-06 22:16:01,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 94.8) internal successors, (474), 5 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:01,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:01,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 210 [2023-11-06 22:16:01,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:02,263 INFO L124 PetriNetUnfolderBase]: 932/1446 cut-off events. [2023-11-06 22:16:02,264 INFO L125 PetriNetUnfolderBase]: For 1255/1255 co-relation queries the response was YES. [2023-11-06 22:16:02,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4483 conditions, 1446 events. 932/1446 cut-off events. For 1255/1255 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6062 event pairs, 207 based on Foata normal form. 12/1458 useless extension candidates. Maximal degree in co-relation 4468. Up to 1061 conditions per place. [2023-11-06 22:16:02,280 INFO L140 encePairwiseOnDemand]: 200/210 looper letters, 42 selfloop transitions, 12 changer transitions 0/55 dead transitions. [2023-11-06 22:16:02,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 55 transitions, 334 flow [2023-11-06 22:16:02,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:16:02,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:16:02,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 604 transitions. [2023-11-06 22:16:02,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4793650793650794 [2023-11-06 22:16:02,284 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 604 transitions. [2023-11-06 22:16:02,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 604 transitions. [2023-11-06 22:16:02,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:02,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 604 transitions. [2023-11-06 22:16:02,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:02,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:02,291 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:02,291 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 106 flow. Second operand 6 states and 604 transitions. [2023-11-06 22:16:02,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 55 transitions, 334 flow [2023-11-06 22:16:02,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 55 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:16:02,295 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 203 flow [2023-11-06 22:16:02,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=203, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2023-11-06 22:16:02,296 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2023-11-06 22:16:02,296 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 203 flow [2023-11-06 22:16:02,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.8) internal successors, (474), 5 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:02,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:02,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:02,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:16:02,298 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:16:02,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:02,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1673258003, now seen corresponding path program 2 times [2023-11-06 22:16:02,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:02,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116777106] [2023-11-06 22:16:02,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:02,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:03,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:16:03,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:03,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116777106] [2023-11-06 22:16:03,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116777106] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:03,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:03,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:16:03,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370281869] [2023-11-06 22:16:03,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:03,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:16:03,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:03,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:16:03,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:16:03,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 210 [2023-11-06 22:16:03,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 203 flow. Second operand has 5 states, 5 states have (on average 94.8) internal successors, (474), 5 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:03,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:03,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 210 [2023-11-06 22:16:03,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:03,756 INFO L124 PetriNetUnfolderBase]: 946/1471 cut-off events. [2023-11-06 22:16:03,756 INFO L125 PetriNetUnfolderBase]: For 2641/2641 co-relation queries the response was YES. [2023-11-06 22:16:03,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5529 conditions, 1471 events. 946/1471 cut-off events. For 2641/2641 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6197 event pairs, 219 based on Foata normal form. 1/1472 useless extension candidates. Maximal degree in co-relation 5512. Up to 1318 conditions per place. [2023-11-06 22:16:03,773 INFO L140 encePairwiseOnDemand]: 200/210 looper letters, 45 selfloop transitions, 19 changer transitions 0/65 dead transitions. [2023-11-06 22:16:03,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 65 transitions, 493 flow [2023-11-06 22:16:03,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:16:03,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:16:03,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 511 transitions. [2023-11-06 22:16:03,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4866666666666667 [2023-11-06 22:16:03,776 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 511 transitions. [2023-11-06 22:16:03,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 511 transitions. [2023-11-06 22:16:03,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:03,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 511 transitions. [2023-11-06 22:16:03,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:03,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:03,781 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:03,782 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 203 flow. Second operand 5 states and 511 transitions. [2023-11-06 22:16:03,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 65 transitions, 493 flow [2023-11-06 22:16:03,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 65 transitions, 492 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:16:03,788 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 381 flow [2023-11-06 22:16:03,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=381, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2023-11-06 22:16:03,789 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2023-11-06 22:16:03,789 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 381 flow [2023-11-06 22:16:03,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.8) internal successors, (474), 5 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:03,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:03,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:03,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:16:03,790 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:16:03,791 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:03,791 INFO L85 PathProgramCache]: Analyzing trace with hash 796913059, now seen corresponding path program 3 times [2023-11-06 22:16:03,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:03,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037210304] [2023-11-06 22:16:03,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:03,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:04,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:16:04,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:04,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037210304] [2023-11-06 22:16:04,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037210304] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:04,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:04,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:16:04,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714695228] [2023-11-06 22:16:04,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:04,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:16:04,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:04,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:16:04,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:16:04,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 210 [2023-11-06 22:16:04,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:04,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:04,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 210 [2023-11-06 22:16:04,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:05,075 INFO L124 PetriNetUnfolderBase]: 975/1513 cut-off events. [2023-11-06 22:16:05,076 INFO L125 PetriNetUnfolderBase]: For 4553/4553 co-relation queries the response was YES. [2023-11-06 22:16:05,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6490 conditions, 1513 events. 975/1513 cut-off events. For 4553/4553 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6519 event pairs, 207 based on Foata normal form. 3/1516 useless extension candidates. Maximal degree in co-relation 6469. Up to 1344 conditions per place. [2023-11-06 22:16:05,096 INFO L140 encePairwiseOnDemand]: 201/210 looper letters, 55 selfloop transitions, 25 changer transitions 0/81 dead transitions. [2023-11-06 22:16:05,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 81 transitions, 750 flow [2023-11-06 22:16:05,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:16:05,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:16:05,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 603 transitions. [2023-11-06 22:16:05,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4785714285714286 [2023-11-06 22:16:05,100 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 603 transitions. [2023-11-06 22:16:05,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 603 transitions. [2023-11-06 22:16:05,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:05,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 603 transitions. [2023-11-06 22:16:05,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:05,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:05,106 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:05,106 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 381 flow. Second operand 6 states and 603 transitions. [2023-11-06 22:16:05,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 81 transitions, 750 flow [2023-11-06 22:16:05,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 81 transitions, 726 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-11-06 22:16:05,113 INFO L231 Difference]: Finished difference. Result has 54 places, 57 transitions, 559 flow [2023-11-06 22:16:05,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=559, PETRI_PLACES=54, PETRI_TRANSITIONS=57} [2023-11-06 22:16:05,114 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 20 predicate places. [2023-11-06 22:16:05,115 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 57 transitions, 559 flow [2023-11-06 22:16:05,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:05,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:05,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:05,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:16:05,116 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:16:05,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:05,116 INFO L85 PathProgramCache]: Analyzing trace with hash 931586851, now seen corresponding path program 1 times [2023-11-06 22:16:05,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:05,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473927978] [2023-11-06 22:16:05,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:05,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:06,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:16:06,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:06,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473927978] [2023-11-06 22:16:06,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473927978] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:06,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:06,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:16:06,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776237455] [2023-11-06 22:16:06,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:06,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:16:06,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:06,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:16:06,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:16:06,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 210 [2023-11-06 22:16:06,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 57 transitions, 559 flow. Second operand has 8 states, 8 states have (on average 92.875) internal successors, (743), 8 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:06,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:06,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 210 [2023-11-06 22:16:06,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:07,351 INFO L124 PetriNetUnfolderBase]: 1025/1595 cut-off events. [2023-11-06 22:16:07,351 INFO L125 PetriNetUnfolderBase]: For 5728/5728 co-relation queries the response was YES. [2023-11-06 22:16:07,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7327 conditions, 1595 events. 1025/1595 cut-off events. For 5728/5728 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7035 event pairs, 175 based on Foata normal form. 2/1597 useless extension candidates. Maximal degree in co-relation 7303. Up to 1334 conditions per place. [2023-11-06 22:16:07,379 INFO L140 encePairwiseOnDemand]: 202/210 looper letters, 63 selfloop transitions, 36 changer transitions 0/100 dead transitions. [2023-11-06 22:16:07,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 100 transitions, 1066 flow [2023-11-06 22:16:07,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:16:07,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:16:07,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 796 transitions. [2023-11-06 22:16:07,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4738095238095238 [2023-11-06 22:16:07,383 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 796 transitions. [2023-11-06 22:16:07,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 796 transitions. [2023-11-06 22:16:07,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:07,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 796 transitions. [2023-11-06 22:16:07,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 99.5) internal successors, (796), 8 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:07,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:07,392 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:07,392 INFO L175 Difference]: Start difference. First operand has 54 places, 57 transitions, 559 flow. Second operand 8 states and 796 transitions. [2023-11-06 22:16:07,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 100 transitions, 1066 flow [2023-11-06 22:16:07,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 100 transitions, 1038 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-06 22:16:07,405 INFO L231 Difference]: Finished difference. Result has 63 places, 74 transitions, 868 flow [2023-11-06 22:16:07,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=868, PETRI_PLACES=63, PETRI_TRANSITIONS=74} [2023-11-06 22:16:07,406 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 29 predicate places. [2023-11-06 22:16:07,406 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 74 transitions, 868 flow [2023-11-06 22:16:07,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.875) internal successors, (743), 8 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:07,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:07,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:07,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:16:07,407 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:16:07,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:07,408 INFO L85 PathProgramCache]: Analyzing trace with hash -971836039, now seen corresponding path program 1 times [2023-11-06 22:16:07,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:07,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725910640] [2023-11-06 22:16:07,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:07,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:07,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:16:07,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:07,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725910640] [2023-11-06 22:16:07,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725910640] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:07,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:07,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:16:07,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153319377] [2023-11-06 22:16:07,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:07,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:16:07,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:07,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:16:07,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:16:07,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 210 [2023-11-06 22:16:07,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 74 transitions, 868 flow. Second operand has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:07,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:07,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 210 [2023-11-06 22:16:07,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:08,170 INFO L124 PetriNetUnfolderBase]: 825/1352 cut-off events. [2023-11-06 22:16:08,170 INFO L125 PetriNetUnfolderBase]: For 10549/10551 co-relation queries the response was YES. [2023-11-06 22:16:08,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6656 conditions, 1352 events. 825/1352 cut-off events. For 10549/10551 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6299 event pairs, 101 based on Foata normal form. 134/1484 useless extension candidates. Maximal degree in co-relation 6628. Up to 705 conditions per place. [2023-11-06 22:16:08,208 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 76 selfloop transitions, 4 changer transitions 64/145 dead transitions. [2023-11-06 22:16:08,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 145 transitions, 1857 flow [2023-11-06 22:16:08,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:16:08,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:16:08,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 514 transitions. [2023-11-06 22:16:08,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4895238095238095 [2023-11-06 22:16:08,212 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 514 transitions. [2023-11-06 22:16:08,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 514 transitions. [2023-11-06 22:16:08,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:08,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 514 transitions. [2023-11-06 22:16:08,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.8) internal successors, (514), 5 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:08,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:08,219 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:08,219 INFO L175 Difference]: Start difference. First operand has 63 places, 74 transitions, 868 flow. Second operand 5 states and 514 transitions. [2023-11-06 22:16:08,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 145 transitions, 1857 flow [2023-11-06 22:16:08,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 145 transitions, 1696 flow, removed 30 selfloop flow, removed 7 redundant places. [2023-11-06 22:16:08,236 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 582 flow [2023-11-06 22:16:08,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=582, PETRI_PLACES=62, PETRI_TRANSITIONS=59} [2023-11-06 22:16:08,238 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 28 predicate places. [2023-11-06 22:16:08,238 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 582 flow [2023-11-06 22:16:08,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:08,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:08,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:08,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:16:08,239 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:16:08,240 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:08,240 INFO L85 PathProgramCache]: Analyzing trace with hash 55390314, now seen corresponding path program 1 times [2023-11-06 22:16:08,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:08,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775624728] [2023-11-06 22:16:08,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:08,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:08,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:16:08,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:08,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775624728] [2023-11-06 22:16:08,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775624728] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:08,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:08,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:16:08,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243428383] [2023-11-06 22:16:08,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:08,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:16:08,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:08,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:16:08,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:16:08,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 210 [2023-11-06 22:16:08,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 582 flow. Second operand has 5 states, 5 states have (on average 93.2) internal successors, (466), 5 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:08,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:08,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 210 [2023-11-06 22:16:08,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:08,851 INFO L124 PetriNetUnfolderBase]: 438/771 cut-off events. [2023-11-06 22:16:08,852 INFO L125 PetriNetUnfolderBase]: For 5792/5794 co-relation queries the response was YES. [2023-11-06 22:16:08,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3966 conditions, 771 events. 438/771 cut-off events. For 5792/5794 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3278 event pairs, 63 based on Foata normal form. 69/838 useless extension candidates. Maximal degree in co-relation 3938. Up to 297 conditions per place. [2023-11-06 22:16:08,860 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 84 selfloop transitions, 7 changer transitions 35/127 dead transitions. [2023-11-06 22:16:08,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 127 transitions, 1462 flow [2023-11-06 22:16:08,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:16:08,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:16:08,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 616 transitions. [2023-11-06 22:16:08,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2023-11-06 22:16:08,864 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 616 transitions. [2023-11-06 22:16:08,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 616 transitions. [2023-11-06 22:16:08,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:08,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 616 transitions. [2023-11-06 22:16:08,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 102.66666666666667) internal successors, (616), 6 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:08,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:08,873 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:08,873 INFO L175 Difference]: Start difference. First operand has 62 places, 59 transitions, 582 flow. Second operand 6 states and 616 transitions. [2023-11-06 22:16:08,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 127 transitions, 1462 flow [2023-11-06 22:16:08,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 127 transitions, 1390 flow, removed 32 selfloop flow, removed 3 redundant places. [2023-11-06 22:16:08,885 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 546 flow [2023-11-06 22:16:08,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=546, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2023-11-06 22:16:08,886 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 30 predicate places. [2023-11-06 22:16:08,886 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 546 flow [2023-11-06 22:16:08,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.2) internal successors, (466), 5 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:08,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:08,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:08,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:16:08,887 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:16:08,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:08,888 INFO L85 PathProgramCache]: Analyzing trace with hash 2090260358, now seen corresponding path program 1 times [2023-11-06 22:16:08,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:08,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065126564] [2023-11-06 22:16:08,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:08,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:09,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:16:09,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:09,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065126564] [2023-11-06 22:16:09,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065126564] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:09,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:09,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:16:09,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219365456] [2023-11-06 22:16:09,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:09,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:16:09,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:09,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:16:09,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:16:09,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 210 [2023-11-06 22:16:09,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 546 flow. Second operand has 6 states, 6 states have (on average 93.0) internal successors, (558), 6 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:09,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:09,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 210 [2023-11-06 22:16:09,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:09,538 INFO L124 PetriNetUnfolderBase]: 309/554 cut-off events. [2023-11-06 22:16:09,538 INFO L125 PetriNetUnfolderBase]: For 3220/3222 co-relation queries the response was YES. [2023-11-06 22:16:09,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2839 conditions, 554 events. 309/554 cut-off events. For 3220/3222 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2239 event pairs, 60 based on Foata normal form. 14/566 useless extension candidates. Maximal degree in co-relation 2809. Up to 257 conditions per place. [2023-11-06 22:16:09,545 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 81 selfloop transitions, 10 changer transitions 14/106 dead transitions. [2023-11-06 22:16:09,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 106 transitions, 1195 flow [2023-11-06 22:16:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:16:09,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:16:09,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 694 transitions. [2023-11-06 22:16:09,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47210884353741495 [2023-11-06 22:16:09,551 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 694 transitions. [2023-11-06 22:16:09,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 694 transitions. [2023-11-06 22:16:09,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:09,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 694 transitions. [2023-11-06 22:16:09,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.14285714285714) internal successors, (694), 7 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:09,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:09,560 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:09,560 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 546 flow. Second operand 7 states and 694 transitions. [2023-11-06 22:16:09,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 106 transitions, 1195 flow [2023-11-06 22:16:09,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 106 transitions, 1080 flow, removed 45 selfloop flow, removed 7 redundant places. [2023-11-06 22:16:09,575 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 506 flow [2023-11-06 22:16:09,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=506, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2023-11-06 22:16:09,576 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 30 predicate places. [2023-11-06 22:16:09,577 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 506 flow [2023-11-06 22:16:09,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.0) internal successors, (558), 6 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:09,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:09,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:09,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:16:09,578 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:16:09,579 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:09,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1201524016, now seen corresponding path program 1 times [2023-11-06 22:16:09,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:09,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768037508] [2023-11-06 22:16:09,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:09,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:11,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:16:11,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:11,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768037508] [2023-11-06 22:16:11,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768037508] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:11,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:11,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:16:11,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491781644] [2023-11-06 22:16:11,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:11,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:16:11,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:11,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:16:11,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:16:11,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 210 [2023-11-06 22:16:11,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 506 flow. Second operand has 9 states, 9 states have (on average 88.33333333333333) internal successors, (795), 9 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:11,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:11,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 210 [2023-11-06 22:16:11,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:12,253 INFO L124 PetriNetUnfolderBase]: 357/649 cut-off events. [2023-11-06 22:16:12,254 INFO L125 PetriNetUnfolderBase]: For 2969/2969 co-relation queries the response was YES. [2023-11-06 22:16:12,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3174 conditions, 649 events. 357/649 cut-off events. For 2969/2969 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2785 event pairs, 51 based on Foata normal form. 1/650 useless extension candidates. Maximal degree in co-relation 3146. Up to 313 conditions per place. [2023-11-06 22:16:12,260 INFO L140 encePairwiseOnDemand]: 202/210 looper letters, 65 selfloop transitions, 23 changer transitions 10/99 dead transitions. [2023-11-06 22:16:12,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 99 transitions, 993 flow [2023-11-06 22:16:12,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:16:12,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:16:12,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 666 transitions. [2023-11-06 22:16:12,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4530612244897959 [2023-11-06 22:16:12,265 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 666 transitions. [2023-11-06 22:16:12,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 666 transitions. [2023-11-06 22:16:12,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:12,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 666 transitions. [2023-11-06 22:16:12,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:12,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:12,272 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:12,273 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 506 flow. Second operand 7 states and 666 transitions. [2023-11-06 22:16:12,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 99 transitions, 993 flow [2023-11-06 22:16:12,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 99 transitions, 903 flow, removed 30 selfloop flow, removed 6 redundant places. [2023-11-06 22:16:12,285 INFO L231 Difference]: Finished difference. Result has 63 places, 60 transitions, 558 flow [2023-11-06 22:16:12,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=558, PETRI_PLACES=63, PETRI_TRANSITIONS=60} [2023-11-06 22:16:12,288 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 29 predicate places. [2023-11-06 22:16:12,288 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 558 flow [2023-11-06 22:16:12,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 88.33333333333333) internal successors, (795), 9 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:12,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:12,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:12,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:16:12,289 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:16:12,290 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:12,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1905751558, now seen corresponding path program 2 times [2023-11-06 22:16:12,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:12,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116717813] [2023-11-06 22:16:12,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:12,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:12,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:16:12,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:12,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116717813] [2023-11-06 22:16:12,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116717813] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:12,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:12,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:16:12,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42456849] [2023-11-06 22:16:12,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:12,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:16:12,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:12,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:16:12,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:16:12,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 210 [2023-11-06 22:16:12,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 558 flow. Second operand has 5 states, 5 states have (on average 94.2) internal successors, (471), 5 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:12,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:12,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 210 [2023-11-06 22:16:12,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:13,303 INFO L124 PetriNetUnfolderBase]: 425/774 cut-off events. [2023-11-06 22:16:13,303 INFO L125 PetriNetUnfolderBase]: For 3608/3608 co-relation queries the response was YES. [2023-11-06 22:16:13,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3749 conditions, 774 events. 425/774 cut-off events. For 3608/3608 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3530 event pairs, 103 based on Foata normal form. 1/775 useless extension candidates. Maximal degree in co-relation 3723. Up to 471 conditions per place. [2023-11-06 22:16:13,312 INFO L140 encePairwiseOnDemand]: 201/210 looper letters, 50 selfloop transitions, 18 changer transitions 40/109 dead transitions. [2023-11-06 22:16:13,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 109 transitions, 1130 flow [2023-11-06 22:16:13,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:16:13,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:16:13,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 599 transitions. [2023-11-06 22:16:13,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4753968253968254 [2023-11-06 22:16:13,316 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 599 transitions. [2023-11-06 22:16:13,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 599 transitions. [2023-11-06 22:16:13,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:13,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 599 transitions. [2023-11-06 22:16:13,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:13,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:13,323 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:13,323 INFO L175 Difference]: Start difference. First operand has 63 places, 60 transitions, 558 flow. Second operand 6 states and 599 transitions. [2023-11-06 22:16:13,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 109 transitions, 1130 flow [2023-11-06 22:16:13,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 109 transitions, 1064 flow, removed 23 selfloop flow, removed 4 redundant places. [2023-11-06 22:16:13,336 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 591 flow [2023-11-06 22:16:13,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=591, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2023-11-06 22:16:13,337 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 33 predicate places. [2023-11-06 22:16:13,338 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 591 flow [2023-11-06 22:16:13,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.2) internal successors, (471), 5 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:13,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:13,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:13,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:16:13,339 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:16:13,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:13,339 INFO L85 PathProgramCache]: Analyzing trace with hash 323198636, now seen corresponding path program 3 times [2023-11-06 22:16:13,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:13,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292759530] [2023-11-06 22:16:13,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:13,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:14,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:16:14,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:14,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292759530] [2023-11-06 22:16:14,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292759530] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:14,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:14,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:16:14,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025247381] [2023-11-06 22:16:14,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:14,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:16:14,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:14,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:16:14,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:16:15,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 210 [2023-11-06 22:16:15,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 591 flow. Second operand has 7 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:15,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:15,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 210 [2023-11-06 22:16:15,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:15,394 INFO L124 PetriNetUnfolderBase]: 355/645 cut-off events. [2023-11-06 22:16:15,394 INFO L125 PetriNetUnfolderBase]: For 3405/3405 co-relation queries the response was YES. [2023-11-06 22:16:15,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3290 conditions, 645 events. 355/645 cut-off events. For 3405/3405 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2819 event pairs, 48 based on Foata normal form. 1/646 useless extension candidates. Maximal degree in co-relation 3270. Up to 513 conditions per place. [2023-11-06 22:16:15,400 INFO L140 encePairwiseOnDemand]: 201/210 looper letters, 56 selfloop transitions, 22 changer transitions 9/88 dead transitions. [2023-11-06 22:16:15,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 88 transitions, 928 flow [2023-11-06 22:16:15,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:16:15,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:16:15,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 593 transitions. [2023-11-06 22:16:15,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47063492063492063 [2023-11-06 22:16:15,404 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 593 transitions. [2023-11-06 22:16:15,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 593 transitions. [2023-11-06 22:16:15,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:15,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 593 transitions. [2023-11-06 22:16:15,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:15,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:15,411 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:15,412 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 591 flow. Second operand 6 states and 593 transitions. [2023-11-06 22:16:15,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 88 transitions, 928 flow [2023-11-06 22:16:15,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 88 transitions, 835 flow, removed 30 selfloop flow, removed 5 redundant places. [2023-11-06 22:16:15,423 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 605 flow [2023-11-06 22:16:15,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=605, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2023-11-06 22:16:15,424 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2023-11-06 22:16:15,425 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 605 flow [2023-11-06 22:16:15,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:15,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:15,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:15,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:16:15,426 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:16:15,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:15,427 INFO L85 PathProgramCache]: Analyzing trace with hash 2028735736, now seen corresponding path program 4 times [2023-11-06 22:16:15,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:15,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654806591] [2023-11-06 22:16:15,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:15,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:16,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:16:16,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:16,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654806591] [2023-11-06 22:16:16,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654806591] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:16,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:16,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:16:16,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597461417] [2023-11-06 22:16:16,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:16,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:16:16,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:16,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:16:16,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:16:17,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 210 [2023-11-06 22:16:17,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 605 flow. Second operand has 8 states, 8 states have (on average 88.625) internal successors, (709), 8 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:17,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:17,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 210 [2023-11-06 22:16:17,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:17,620 INFO L124 PetriNetUnfolderBase]: 339/631 cut-off events. [2023-11-06 22:16:17,621 INFO L125 PetriNetUnfolderBase]: For 3011/3011 co-relation queries the response was YES. [2023-11-06 22:16:17,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3135 conditions, 631 events. 339/631 cut-off events. For 3011/3011 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2729 event pairs, 46 based on Foata normal form. 1/632 useless extension candidates. Maximal degree in co-relation 3109. Up to 315 conditions per place. [2023-11-06 22:16:17,626 INFO L140 encePairwiseOnDemand]: 202/210 looper letters, 69 selfloop transitions, 29 changer transitions 25/124 dead transitions. [2023-11-06 22:16:17,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 124 transitions, 1192 flow [2023-11-06 22:16:17,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:16:17,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 22:16:17,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 937 transitions. [2023-11-06 22:16:17,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4461904761904762 [2023-11-06 22:16:17,632 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 937 transitions. [2023-11-06 22:16:17,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 937 transitions. [2023-11-06 22:16:17,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:17,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 937 transitions. [2023-11-06 22:16:17,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 93.7) internal successors, (937), 10 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:17,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 210.0) internal successors, (2310), 11 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:17,645 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 210.0) internal successors, (2310), 11 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:17,645 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 605 flow. Second operand 10 states and 937 transitions. [2023-11-06 22:16:17,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 124 transitions, 1192 flow [2023-11-06 22:16:17,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 124 transitions, 1150 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-11-06 22:16:17,657 INFO L231 Difference]: Finished difference. Result has 74 places, 70 transitions, 764 flow [2023-11-06 22:16:17,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=764, PETRI_PLACES=74, PETRI_TRANSITIONS=70} [2023-11-06 22:16:17,658 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 40 predicate places. [2023-11-06 22:16:17,660 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 70 transitions, 764 flow [2023-11-06 22:16:17,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.625) internal successors, (709), 8 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:17,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:17,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:17,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:16:17,662 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:16:17,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:17,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1182257090, now seen corresponding path program 5 times [2023-11-06 22:16:17,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:17,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508742185] [2023-11-06 22:16:17,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:17,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:19,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:16:19,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:19,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508742185] [2023-11-06 22:16:19,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508742185] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:19,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:19,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:16:19,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919762029] [2023-11-06 22:16:19,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:19,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:16:19,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:19,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:16:19,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:16:19,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 210 [2023-11-06 22:16:19,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 70 transitions, 764 flow. Second operand has 9 states, 9 states have (on average 91.33333333333333) internal successors, (822), 9 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:19,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:19,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 210 [2023-11-06 22:16:19,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:20,304 INFO L124 PetriNetUnfolderBase]: 527/976 cut-off events. [2023-11-06 22:16:20,304 INFO L125 PetriNetUnfolderBase]: For 6074/6089 co-relation queries the response was YES. [2023-11-06 22:16:20,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5240 conditions, 976 events. 527/976 cut-off events. For 6074/6089 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4906 event pairs, 58 based on Foata normal form. 1/976 useless extension candidates. Maximal degree in co-relation 5211. Up to 444 conditions per place. [2023-11-06 22:16:20,313 INFO L140 encePairwiseOnDemand]: 200/210 looper letters, 107 selfloop transitions, 31 changer transitions 32/171 dead transitions. [2023-11-06 22:16:20,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 171 transitions, 1881 flow [2023-11-06 22:16:20,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:16:20,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:16:20,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 890 transitions. [2023-11-06 22:16:20,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4708994708994709 [2023-11-06 22:16:20,318 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 890 transitions. [2023-11-06 22:16:20,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 890 transitions. [2023-11-06 22:16:20,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:20,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 890 transitions. [2023-11-06 22:16:20,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.88888888888889) internal successors, (890), 9 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:20,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 210.0) internal successors, (2100), 10 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:20,327 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 210.0) internal successors, (2100), 10 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:20,328 INFO L175 Difference]: Start difference. First operand has 74 places, 70 transitions, 764 flow. Second operand 9 states and 890 transitions. [2023-11-06 22:16:20,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 171 transitions, 1881 flow [2023-11-06 22:16:20,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 171 transitions, 1732 flow, removed 58 selfloop flow, removed 4 redundant places. [2023-11-06 22:16:20,350 INFO L231 Difference]: Finished difference. Result has 78 places, 90 transitions, 1091 flow [2023-11-06 22:16:20,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1091, PETRI_PLACES=78, PETRI_TRANSITIONS=90} [2023-11-06 22:16:20,351 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 44 predicate places. [2023-11-06 22:16:20,351 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 90 transitions, 1091 flow [2023-11-06 22:16:20,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.33333333333333) internal successors, (822), 9 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:20,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:20,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:20,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:16:20,353 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:16:20,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:20,353 INFO L85 PathProgramCache]: Analyzing trace with hash -644038546, now seen corresponding path program 6 times [2023-11-06 22:16:20,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:20,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654508613] [2023-11-06 22:16:20,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:20,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:21,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:16:21,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:21,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654508613] [2023-11-06 22:16:21,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654508613] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:21,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:21,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:16:21,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238304311] [2023-11-06 22:16:21,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:21,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:16:21,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:21,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:16:21,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:16:21,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 210 [2023-11-06 22:16:21,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 90 transitions, 1091 flow. Second operand has 6 states, 6 states have (on average 93.5) internal successors, (561), 6 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:21,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:21,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 210 [2023-11-06 22:16:21,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:21,563 INFO L124 PetriNetUnfolderBase]: 449/836 cut-off events. [2023-11-06 22:16:21,563 INFO L125 PetriNetUnfolderBase]: For 5374/5374 co-relation queries the response was YES. [2023-11-06 22:16:21,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4660 conditions, 836 events. 449/836 cut-off events. For 5374/5374 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4004 event pairs, 83 based on Foata normal form. 1/837 useless extension candidates. Maximal degree in co-relation 4627. Up to 570 conditions per place. [2023-11-06 22:16:21,572 INFO L140 encePairwiseOnDemand]: 201/210 looper letters, 81 selfloop transitions, 26 changer transitions 19/127 dead transitions. [2023-11-06 22:16:21,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 127 transitions, 1636 flow [2023-11-06 22:16:21,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:16:21,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:16:21,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 593 transitions. [2023-11-06 22:16:21,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47063492063492063 [2023-11-06 22:16:21,577 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 593 transitions. [2023-11-06 22:16:21,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 593 transitions. [2023-11-06 22:16:21,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:21,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 593 transitions. [2023-11-06 22:16:21,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:21,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:21,585 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:21,585 INFO L175 Difference]: Start difference. First operand has 78 places, 90 transitions, 1091 flow. Second operand 6 states and 593 transitions. [2023-11-06 22:16:21,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 127 transitions, 1636 flow [2023-11-06 22:16:21,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 127 transitions, 1542 flow, removed 23 selfloop flow, removed 3 redundant places. [2023-11-06 22:16:21,612 INFO L231 Difference]: Finished difference. Result has 82 places, 98 transitions, 1217 flow [2023-11-06 22:16:21,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1025, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1217, PETRI_PLACES=82, PETRI_TRANSITIONS=98} [2023-11-06 22:16:21,613 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 48 predicate places. [2023-11-06 22:16:21,614 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 98 transitions, 1217 flow [2023-11-06 22:16:21,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.5) internal successors, (561), 6 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:21,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:21,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:21,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:16:21,615 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:16:21,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:21,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1864595922, now seen corresponding path program 7 times [2023-11-06 22:16:21,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:21,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515001845] [2023-11-06 22:16:21,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:21,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:22,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:16:22,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:22,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515001845] [2023-11-06 22:16:22,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515001845] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:22,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:22,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:16:22,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244566516] [2023-11-06 22:16:22,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:22,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:16:22,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:22,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:16:22,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:16:22,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 210 [2023-11-06 22:16:22,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 98 transitions, 1217 flow. Second operand has 9 states, 9 states have (on average 89.33333333333333) internal successors, (804), 9 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:22,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:22,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 210 [2023-11-06 22:16:22,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:23,232 INFO L124 PetriNetUnfolderBase]: 462/861 cut-off events. [2023-11-06 22:16:23,232 INFO L125 PetriNetUnfolderBase]: For 5760/5760 co-relation queries the response was YES. [2023-11-06 22:16:23,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4754 conditions, 861 events. 462/861 cut-off events. For 5760/5760 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4158 event pairs, 99 based on Foata normal form. 1/862 useless extension candidates. Maximal degree in co-relation 4719. Up to 497 conditions per place. [2023-11-06 22:16:23,240 INFO L140 encePairwiseOnDemand]: 201/210 looper letters, 81 selfloop transitions, 16 changer transitions 37/135 dead transitions. [2023-11-06 22:16:23,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 135 transitions, 1707 flow [2023-11-06 22:16:23,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:16:23,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:16:23,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 755 transitions. [2023-11-06 22:16:23,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494047619047619 [2023-11-06 22:16:23,244 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 755 transitions. [2023-11-06 22:16:23,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 755 transitions. [2023-11-06 22:16:23,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:23,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 755 transitions. [2023-11-06 22:16:23,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.375) internal successors, (755), 8 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:23,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:23,250 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:23,250 INFO L175 Difference]: Start difference. First operand has 82 places, 98 transitions, 1217 flow. Second operand 8 states and 755 transitions. [2023-11-06 22:16:23,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 135 transitions, 1707 flow [2023-11-06 22:16:23,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 135 transitions, 1652 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-11-06 22:16:23,274 INFO L231 Difference]: Finished difference. Result has 89 places, 84 transitions, 994 flow [2023-11-06 22:16:23,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1169, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=994, PETRI_PLACES=89, PETRI_TRANSITIONS=84} [2023-11-06 22:16:23,274 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 55 predicate places. [2023-11-06 22:16:23,275 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 84 transitions, 994 flow [2023-11-06 22:16:23,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 89.33333333333333) internal successors, (804), 9 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:23,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:23,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:23,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 22:16:23,276 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:16:23,277 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:23,277 INFO L85 PathProgramCache]: Analyzing trace with hash -963697178, now seen corresponding path program 8 times [2023-11-06 22:16:23,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:23,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719419018] [2023-11-06 22:16:23,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:23,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:16:24,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:24,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719419018] [2023-11-06 22:16:24,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719419018] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:24,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:24,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:16:24,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429507254] [2023-11-06 22:16:24,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:24,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:16:24,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:24,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:16:24,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:16:24,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 210 [2023-11-06 22:16:24,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 84 transitions, 994 flow. Second operand has 7 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:24,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:24,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 210 [2023-11-06 22:16:24,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:25,211 INFO L124 PetriNetUnfolderBase]: 397/737 cut-off events. [2023-11-06 22:16:25,212 INFO L125 PetriNetUnfolderBase]: For 4962/4962 co-relation queries the response was YES. [2023-11-06 22:16:25,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4040 conditions, 737 events. 397/737 cut-off events. For 4962/4962 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3422 event pairs, 66 based on Foata normal form. 1/738 useless extension candidates. Maximal degree in co-relation 4008. Up to 541 conditions per place. [2023-11-06 22:16:25,221 INFO L140 encePairwiseOnDemand]: 201/210 looper letters, 79 selfloop transitions, 27 changer transitions 9/116 dead transitions. [2023-11-06 22:16:25,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 116 transitions, 1398 flow [2023-11-06 22:16:25,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:16:25,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:16:25,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 688 transitions. [2023-11-06 22:16:25,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46802721088435373 [2023-11-06 22:16:25,224 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 688 transitions. [2023-11-06 22:16:25,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 688 transitions. [2023-11-06 22:16:25,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:25,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 688 transitions. [2023-11-06 22:16:25,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.28571428571429) internal successors, (688), 7 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:25,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:25,230 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:25,230 INFO L175 Difference]: Start difference. First operand has 89 places, 84 transitions, 994 flow. Second operand 7 states and 688 transitions. [2023-11-06 22:16:25,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 116 transitions, 1398 flow [2023-11-06 22:16:25,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 116 transitions, 1314 flow, removed 15 selfloop flow, removed 9 redundant places. [2023-11-06 22:16:25,257 INFO L231 Difference]: Finished difference. Result has 85 places, 87 transitions, 1026 flow [2023-11-06 22:16:25,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=912, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1026, PETRI_PLACES=85, PETRI_TRANSITIONS=87} [2023-11-06 22:16:25,258 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 51 predicate places. [2023-11-06 22:16:25,258 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 87 transitions, 1026 flow [2023-11-06 22:16:25,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:25,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:25,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:25,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 22:16:25,260 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:16:25,260 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:25,260 INFO L85 PathProgramCache]: Analyzing trace with hash 470137810, now seen corresponding path program 9 times [2023-11-06 22:16:25,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:25,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314643643] [2023-11-06 22:16:25,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:25,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:26,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:16:26,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:26,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314643643] [2023-11-06 22:16:26,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314643643] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:26,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:26,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:16:26,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885766188] [2023-11-06 22:16:26,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:26,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:16:26,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:26,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:16:26,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:16:26,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 210 [2023-11-06 22:16:26,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 87 transitions, 1026 flow. Second operand has 9 states, 9 states have (on average 88.33333333333333) internal successors, (795), 9 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:26,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:26,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 210 [2023-11-06 22:16:26,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:27,893 INFO L124 PetriNetUnfolderBase]: 551/1054 cut-off events. [2023-11-06 22:16:27,893 INFO L125 PetriNetUnfolderBase]: For 6559/6559 co-relation queries the response was YES. [2023-11-06 22:16:27,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5802 conditions, 1054 events. 551/1054 cut-off events. For 6559/6559 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5539 event pairs, 45 based on Foata normal form. 1/1055 useless extension candidates. Maximal degree in co-relation 5766. Up to 379 conditions per place. [2023-11-06 22:16:27,907 INFO L140 encePairwiseOnDemand]: 200/210 looper letters, 93 selfloop transitions, 62 changer transitions 39/195 dead transitions. [2023-11-06 22:16:27,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 195 transitions, 2326 flow [2023-11-06 22:16:27,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:16:27,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-06 22:16:27,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1140 transitions. [2023-11-06 22:16:27,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2023-11-06 22:16:27,913 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1140 transitions. [2023-11-06 22:16:27,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1140 transitions. [2023-11-06 22:16:27,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:27,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1140 transitions. [2023-11-06 22:16:27,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 95.0) internal successors, (1140), 12 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:27,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 210.0) internal successors, (2730), 13 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:27,925 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 210.0) internal successors, (2730), 13 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:27,925 INFO L175 Difference]: Start difference. First operand has 85 places, 87 transitions, 1026 flow. Second operand 12 states and 1140 transitions. [2023-11-06 22:16:27,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 195 transitions, 2326 flow [2023-11-06 22:16:27,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 195 transitions, 2223 flow, removed 28 selfloop flow, removed 4 redundant places. [2023-11-06 22:16:27,969 INFO L231 Difference]: Finished difference. Result has 96 places, 102 transitions, 1379 flow [2023-11-06 22:16:27,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=967, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1379, PETRI_PLACES=96, PETRI_TRANSITIONS=102} [2023-11-06 22:16:27,970 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 62 predicate places. [2023-11-06 22:16:27,970 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 102 transitions, 1379 flow [2023-11-06 22:16:27,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 88.33333333333333) internal successors, (795), 9 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:27,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:27,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:27,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-06 22:16:27,971 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:16:27,972 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:27,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1579793080, now seen corresponding path program 10 times [2023-11-06 22:16:27,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:27,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780939020] [2023-11-06 22:16:27,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:27,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:29,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:16:29,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:29,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780939020] [2023-11-06 22:16:29,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780939020] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:29,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:29,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:16:29,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301950399] [2023-11-06 22:16:29,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:29,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:16:29,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:29,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:16:29,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:16:29,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 210 [2023-11-06 22:16:29,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 102 transitions, 1379 flow. Second operand has 8 states, 8 states have (on average 92.625) internal successors, (741), 8 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:29,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:29,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 210 [2023-11-06 22:16:29,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:29,835 INFO L124 PetriNetUnfolderBase]: 486/990 cut-off events. [2023-11-06 22:16:29,835 INFO L125 PetriNetUnfolderBase]: For 6140/6140 co-relation queries the response was YES. [2023-11-06 22:16:29,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5496 conditions, 990 events. 486/990 cut-off events. For 6140/6140 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5445 event pairs, 94 based on Foata normal form. 2/992 useless extension candidates. Maximal degree in co-relation 5456. Up to 520 conditions per place. [2023-11-06 22:16:29,842 INFO L140 encePairwiseOnDemand]: 200/210 looper letters, 55 selfloop transitions, 49 changer transitions 43/148 dead transitions. [2023-11-06 22:16:29,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 148 transitions, 2004 flow [2023-11-06 22:16:29,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:16:29,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:16:29,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 688 transitions. [2023-11-06 22:16:29,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46802721088435373 [2023-11-06 22:16:29,845 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 688 transitions. [2023-11-06 22:16:29,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 688 transitions. [2023-11-06 22:16:29,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:29,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 688 transitions. [2023-11-06 22:16:29,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.28571428571429) internal successors, (688), 7 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:29,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:29,850 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:29,850 INFO L175 Difference]: Start difference. First operand has 96 places, 102 transitions, 1379 flow. Second operand 7 states and 688 transitions. [2023-11-06 22:16:29,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 148 transitions, 2004 flow [2023-11-06 22:16:29,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 148 transitions, 1782 flow, removed 52 selfloop flow, removed 6 redundant places. [2023-11-06 22:16:29,895 INFO L231 Difference]: Finished difference. Result has 98 places, 92 transitions, 1133 flow [2023-11-06 22:16:29,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1184, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1133, PETRI_PLACES=98, PETRI_TRANSITIONS=92} [2023-11-06 22:16:29,896 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 64 predicate places. [2023-11-06 22:16:29,896 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 92 transitions, 1133 flow [2023-11-06 22:16:29,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.625) internal successors, (741), 8 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:29,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:29,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:29,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-06 22:16:29,898 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:16:29,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:29,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1216910010, now seen corresponding path program 11 times [2023-11-06 22:16:29,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:29,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563124311] [2023-11-06 22:16:29,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:29,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:30,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:16:30,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:30,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563124311] [2023-11-06 22:16:30,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563124311] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:30,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:30,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:16:30,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203985399] [2023-11-06 22:16:30,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:30,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:16:30,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:30,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:16:30,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:16:30,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-11-06 22:16:30,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 92 transitions, 1133 flow. Second operand has 8 states, 8 states have (on average 90.625) internal successors, (725), 8 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:30,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:30,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-11-06 22:16:30,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:31,130 INFO L124 PetriNetUnfolderBase]: 391/819 cut-off events. [2023-11-06 22:16:31,131 INFO L125 PetriNetUnfolderBase]: For 4465/4465 co-relation queries the response was YES. [2023-11-06 22:16:31,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4454 conditions, 819 events. 391/819 cut-off events. For 4465/4465 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4349 event pairs, 65 based on Foata normal form. 1/820 useless extension candidates. Maximal degree in co-relation 4414. Up to 489 conditions per place. [2023-11-06 22:16:31,136 INFO L140 encePairwiseOnDemand]: 201/210 looper letters, 101 selfloop transitions, 23 changer transitions 24/149 dead transitions. [2023-11-06 22:16:31,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 149 transitions, 1788 flow [2023-11-06 22:16:31,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:16:31,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:16:31,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 870 transitions. [2023-11-06 22:16:31,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2023-11-06 22:16:31,138 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 870 transitions. [2023-11-06 22:16:31,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 870 transitions. [2023-11-06 22:16:31,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:31,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 870 transitions. [2023-11-06 22:16:31,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.66666666666667) internal successors, (870), 9 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:31,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 210.0) internal successors, (2100), 10 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:31,144 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 210.0) internal successors, (2100), 10 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:31,145 INFO L175 Difference]: Start difference. First operand has 98 places, 92 transitions, 1133 flow. Second operand 9 states and 870 transitions. [2023-11-06 22:16:31,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 149 transitions, 1788 flow [2023-11-06 22:16:31,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 149 transitions, 1623 flow, removed 31 selfloop flow, removed 8 redundant places. [2023-11-06 22:16:31,178 INFO L231 Difference]: Finished difference. Result has 102 places, 90 transitions, 1027 flow [2023-11-06 22:16:31,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=988, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1027, PETRI_PLACES=102, PETRI_TRANSITIONS=90} [2023-11-06 22:16:31,179 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 68 predicate places. [2023-11-06 22:16:31,179 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 90 transitions, 1027 flow [2023-11-06 22:16:31,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.625) internal successors, (725), 8 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:31,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:31,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:31,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-06 22:16:31,180 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:16:31,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:31,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1538089368, now seen corresponding path program 12 times [2023-11-06 22:16:31,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:31,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897424422] [2023-11-06 22:16:31,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:31,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:32,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:16:32,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:32,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897424422] [2023-11-06 22:16:32,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897424422] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:32,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:32,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:16:32,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65070696] [2023-11-06 22:16:32,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:32,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:16:32,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:32,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:16:32,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:16:32,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 210 [2023-11-06 22:16:32,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 90 transitions, 1027 flow. Second operand has 9 states, 9 states have (on average 89.33333333333333) internal successors, (804), 9 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:32,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:32,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 210 [2023-11-06 22:16:32,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:33,470 INFO L124 PetriNetUnfolderBase]: 397/867 cut-off events. [2023-11-06 22:16:33,470 INFO L125 PetriNetUnfolderBase]: For 4173/4173 co-relation queries the response was YES. [2023-11-06 22:16:33,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4456 conditions, 867 events. 397/867 cut-off events. For 4173/4173 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4877 event pairs, 78 based on Foata normal form. 2/869 useless extension candidates. Maximal degree in co-relation 4425. Up to 344 conditions per place. [2023-11-06 22:16:33,479 INFO L140 encePairwiseOnDemand]: 200/210 looper letters, 69 selfloop transitions, 18 changer transitions 48/136 dead transitions. [2023-11-06 22:16:33,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 136 transitions, 1603 flow [2023-11-06 22:16:33,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:16:33,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:16:33,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 756 transitions. [2023-11-06 22:16:33,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2023-11-06 22:16:33,482 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 756 transitions. [2023-11-06 22:16:33,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 756 transitions. [2023-11-06 22:16:33,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:33,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 756 transitions. [2023-11-06 22:16:33,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.5) internal successors, (756), 8 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:33,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:33,488 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:33,488 INFO L175 Difference]: Start difference. First operand has 102 places, 90 transitions, 1027 flow. Second operand 8 states and 756 transitions. [2023-11-06 22:16:33,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 136 transitions, 1603 flow [2023-11-06 22:16:33,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 136 transitions, 1560 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-06 22:16:33,517 INFO L231 Difference]: Finished difference. Result has 106 places, 68 transitions, 744 flow [2023-11-06 22:16:33,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=744, PETRI_PLACES=106, PETRI_TRANSITIONS=68} [2023-11-06 22:16:33,518 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 72 predicate places. [2023-11-06 22:16:33,518 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 68 transitions, 744 flow [2023-11-06 22:16:33,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 89.33333333333333) internal successors, (804), 9 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:33,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:33,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:33,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-06 22:16:33,519 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:16:33,520 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:33,520 INFO L85 PathProgramCache]: Analyzing trace with hash 852090552, now seen corresponding path program 13 times [2023-11-06 22:16:33,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:33,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400891598] [2023-11-06 22:16:33,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:33,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:34,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:16:34,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:34,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400891598] [2023-11-06 22:16:34,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400891598] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:34,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:34,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:16:34,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448586660] [2023-11-06 22:16:34,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:34,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:16:34,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:34,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:16:34,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:16:34,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 210 [2023-11-06 22:16:34,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 68 transitions, 744 flow. Second operand has 8 states, 8 states have (on average 92.625) internal successors, (741), 8 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:34,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:34,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 210 [2023-11-06 22:16:34,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:34,817 INFO L124 PetriNetUnfolderBase]: 263/563 cut-off events. [2023-11-06 22:16:34,817 INFO L125 PetriNetUnfolderBase]: For 2722/2722 co-relation queries the response was YES. [2023-11-06 22:16:34,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2904 conditions, 563 events. 263/563 cut-off events. For 2722/2722 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2714 event pairs, 35 based on Foata normal form. 1/564 useless extension candidates. Maximal degree in co-relation 2871. Up to 380 conditions per place. [2023-11-06 22:16:34,821 INFO L140 encePairwiseOnDemand]: 203/210 looper letters, 63 selfloop transitions, 15 changer transitions 22/101 dead transitions. [2023-11-06 22:16:34,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 101 transitions, 1124 flow [2023-11-06 22:16:34,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:16:34,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:16:34,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 683 transitions. [2023-11-06 22:16:34,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46462585034013604 [2023-11-06 22:16:34,826 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 683 transitions. [2023-11-06 22:16:34,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 683 transitions. [2023-11-06 22:16:34,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:34,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 683 transitions. [2023-11-06 22:16:34,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.57142857142857) internal successors, (683), 7 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:34,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:34,831 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:34,831 INFO L175 Difference]: Start difference. First operand has 106 places, 68 transitions, 744 flow. Second operand 7 states and 683 transitions. [2023-11-06 22:16:34,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 101 transitions, 1124 flow [2023-11-06 22:16:34,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 101 transitions, 1016 flow, removed 23 selfloop flow, removed 15 redundant places. [2023-11-06 22:16:34,850 INFO L231 Difference]: Finished difference. Result has 92 places, 64 transitions, 631 flow [2023-11-06 22:16:34,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=631, PETRI_PLACES=92, PETRI_TRANSITIONS=64} [2023-11-06 22:16:34,851 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 58 predicate places. [2023-11-06 22:16:34,851 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 64 transitions, 631 flow [2023-11-06 22:16:34,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.625) internal successors, (741), 8 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:34,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:34,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:34,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-06 22:16:34,852 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:16:34,853 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:34,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1839311204, now seen corresponding path program 14 times [2023-11-06 22:16:34,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:34,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809527619] [2023-11-06 22:16:34,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:34,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:36,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:16:36,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:36,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809527619] [2023-11-06 22:16:36,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809527619] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:36,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:36,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:16:36,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238800174] [2023-11-06 22:16:36,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:36,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:16:36,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:36,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:16:36,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:16:36,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 210 [2023-11-06 22:16:36,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 64 transitions, 631 flow. Second operand has 10 states, 10 states have (on average 89.1) internal successors, (891), 10 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:36,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:36,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 210 [2023-11-06 22:16:36,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:37,327 INFO L124 PetriNetUnfolderBase]: 249/539 cut-off events. [2023-11-06 22:16:37,327 INFO L125 PetriNetUnfolderBase]: For 2160/2160 co-relation queries the response was YES. [2023-11-06 22:16:37,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2638 conditions, 539 events. 249/539 cut-off events. For 2160/2160 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2559 event pairs, 25 based on Foata normal form. 1/540 useless extension candidates. Maximal degree in co-relation 2611. Up to 171 conditions per place. [2023-11-06 22:16:37,330 INFO L140 encePairwiseOnDemand]: 203/210 looper letters, 73 selfloop transitions, 16 changer transitions 21/111 dead transitions. [2023-11-06 22:16:37,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 111 transitions, 1129 flow [2023-11-06 22:16:37,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:16:37,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:16:37,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 669 transitions. [2023-11-06 22:16:37,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45510204081632655 [2023-11-06 22:16:37,333 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 669 transitions. [2023-11-06 22:16:37,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 669 transitions. [2023-11-06 22:16:37,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:37,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 669 transitions. [2023-11-06 22:16:37,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.57142857142857) internal successors, (669), 7 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:37,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:37,338 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:37,338 INFO L175 Difference]: Start difference. First operand has 92 places, 64 transitions, 631 flow. Second operand 7 states and 669 transitions. [2023-11-06 22:16:37,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 111 transitions, 1129 flow [2023-11-06 22:16:37,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 111 transitions, 1065 flow, removed 6 selfloop flow, removed 9 redundant places. [2023-11-06 22:16:37,352 INFO L231 Difference]: Finished difference. Result has 88 places, 59 transitions, 549 flow [2023-11-06 22:16:37,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=549, PETRI_PLACES=88, PETRI_TRANSITIONS=59} [2023-11-06 22:16:37,352 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 54 predicate places. [2023-11-06 22:16:37,353 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 59 transitions, 549 flow [2023-11-06 22:16:37,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.1) internal successors, (891), 10 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:37,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:37,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:37,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-06 22:16:37,354 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:16:37,354 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:37,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1351885908, now seen corresponding path program 15 times [2023-11-06 22:16:37,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:37,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541683476] [2023-11-06 22:16:37,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:37,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:38,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:16:38,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:38,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541683476] [2023-11-06 22:16:38,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541683476] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:38,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:38,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:16:38,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807244023] [2023-11-06 22:16:38,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:38,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:16:38,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:38,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:16:38,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:16:38,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 210 [2023-11-06 22:16:38,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 59 transitions, 549 flow. Second operand has 8 states, 8 states have (on average 91.625) internal successors, (733), 8 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:38,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:38,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 210 [2023-11-06 22:16:38,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:38,751 INFO L124 PetriNetUnfolderBase]: 208/445 cut-off events. [2023-11-06 22:16:38,751 INFO L125 PetriNetUnfolderBase]: For 1802/1802 co-relation queries the response was YES. [2023-11-06 22:16:38,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2146 conditions, 445 events. 208/445 cut-off events. For 1802/1802 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1946 event pairs, 24 based on Foata normal form. 3/448 useless extension candidates. Maximal degree in co-relation 2121. Up to 166 conditions per place. [2023-11-06 22:16:38,754 INFO L140 encePairwiseOnDemand]: 201/210 looper letters, 52 selfloop transitions, 10 changer transitions 31/94 dead transitions. [2023-11-06 22:16:38,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 94 transitions, 911 flow [2023-11-06 22:16:38,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:16:38,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:16:38,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 680 transitions. [2023-11-06 22:16:38,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46258503401360546 [2023-11-06 22:16:38,757 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 680 transitions. [2023-11-06 22:16:38,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 680 transitions. [2023-11-06 22:16:38,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:38,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 680 transitions. [2023-11-06 22:16:38,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:38,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:38,763 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:38,763 INFO L175 Difference]: Start difference. First operand has 88 places, 59 transitions, 549 flow. Second operand 7 states and 680 transitions. [2023-11-06 22:16:38,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 94 transitions, 911 flow [2023-11-06 22:16:38,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 94 transitions, 870 flow, removed 7 selfloop flow, removed 7 redundant places. [2023-11-06 22:16:38,773 INFO L231 Difference]: Finished difference. Result has 88 places, 49 transitions, 416 flow [2023-11-06 22:16:38,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=416, PETRI_PLACES=88, PETRI_TRANSITIONS=49} [2023-11-06 22:16:38,774 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 54 predicate places. [2023-11-06 22:16:38,774 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 49 transitions, 416 flow [2023-11-06 22:16:38,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.625) internal successors, (733), 8 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:38,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:38,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:38,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-06 22:16:38,776 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:16:38,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:38,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1304313718, now seen corresponding path program 16 times [2023-11-06 22:16:38,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:38,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59134012] [2023-11-06 22:16:38,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:38,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:40,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:16:40,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:40,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59134012] [2023-11-06 22:16:40,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59134012] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:40,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:40,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:16:40,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571805790] [2023-11-06 22:16:40,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:40,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:16:40,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:40,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:16:40,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:16:40,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-11-06 22:16:40,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 49 transitions, 416 flow. Second operand has 8 states, 8 states have (on average 90.625) internal successors, (725), 8 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:40,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:40,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-11-06 22:16:40,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:40,911 INFO L124 PetriNetUnfolderBase]: 117/245 cut-off events. [2023-11-06 22:16:40,911 INFO L125 PetriNetUnfolderBase]: For 915/915 co-relation queries the response was YES. [2023-11-06 22:16:40,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1188 conditions, 245 events. 117/245 cut-off events. For 915/915 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 830 event pairs, 11 based on Foata normal form. 1/246 useless extension candidates. Maximal degree in co-relation 1164. Up to 124 conditions per place. [2023-11-06 22:16:40,913 INFO L140 encePairwiseOnDemand]: 200/210 looper letters, 32 selfloop transitions, 15 changer transitions 23/71 dead transitions. [2023-11-06 22:16:40,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 71 transitions, 662 flow [2023-11-06 22:16:40,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:16:40,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:16:40,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 572 transitions. [2023-11-06 22:16:40,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45396825396825397 [2023-11-06 22:16:40,916 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 572 transitions. [2023-11-06 22:16:40,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 572 transitions. [2023-11-06 22:16:40,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:40,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 572 transitions. [2023-11-06 22:16:40,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.33333333333333) internal successors, (572), 6 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:40,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:40,920 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:40,920 INFO L175 Difference]: Start difference. First operand has 88 places, 49 transitions, 416 flow. Second operand 6 states and 572 transitions. [2023-11-06 22:16:40,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 71 transitions, 662 flow [2023-11-06 22:16:40,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 71 transitions, 581 flow, removed 11 selfloop flow, removed 19 redundant places. [2023-11-06 22:16:40,926 INFO L231 Difference]: Finished difference. Result has 69 places, 40 transitions, 293 flow [2023-11-06 22:16:40,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=293, PETRI_PLACES=69, PETRI_TRANSITIONS=40} [2023-11-06 22:16:40,927 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 35 predicate places. [2023-11-06 22:16:40,928 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 40 transitions, 293 flow [2023-11-06 22:16:40,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.625) internal successors, (725), 8 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:16:40,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:40,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:40,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-06 22:16:40,929 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 22:16:40,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:40,929 INFO L85 PathProgramCache]: Analyzing trace with hash 993959544, now seen corresponding path program 17 times [2023-11-06 22:16:40,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:40,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992576896] [2023-11-06 22:16:40,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:40,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:16:40,989 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:16:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:16:41,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:16:41,087 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:16:41,088 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-06 22:16:41,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-06 22:16:41,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-06 22:16:41,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-06 22:16:41,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-06 22:16:41,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-06 22:16:41,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-06 22:16:41,092 INFO L445 BasicCegarLoop]: Path program histogram: [17, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:41,098 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:16:41,099 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:16:41,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:16:41 BasicIcfg [2023-11-06 22:16:41,180 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:16:41,180 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:16:41,181 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:16:41,181 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:16:41,181 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:15:46" (3/4) ... [2023-11-06 22:16:41,183 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 22:16:41,321 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04c95cab-cd53-4315-9a1b-2f5164315509/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:16:41,322 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:16:41,323 INFO L158 Benchmark]: Toolchain (without parser) took 56463.69ms. Allocated memory was 192.9MB in the beginning and 851.4MB in the end (delta: 658.5MB). Free memory was 160.3MB in the beginning and 398.8MB in the end (delta: -238.6MB). Peak memory consumption was 420.8MB. Max. memory is 16.1GB. [2023-11-06 22:16:41,323 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 130.0MB. Free memory was 102.3MB in the beginning and 102.1MB in the end (delta: 132.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:16:41,324 INFO L158 Benchmark]: CACSL2BoogieTranslator took 765.60ms. Allocated memory is still 192.9MB. Free memory was 162.5MB in the beginning and 136.4MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-06 22:16:41,324 INFO L158 Benchmark]: Boogie Procedure Inliner took 110.57ms. Allocated memory is still 192.9MB. Free memory was 136.4MB in the beginning and 134.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:16:41,324 INFO L158 Benchmark]: Boogie Preprocessor took 85.73ms. Allocated memory is still 192.9MB. Free memory was 134.2MB in the beginning and 131.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:16:41,325 INFO L158 Benchmark]: RCFGBuilder took 1039.08ms. Allocated memory is still 192.9MB. Free memory was 131.9MB in the beginning and 108.3MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-06 22:16:41,325 INFO L158 Benchmark]: TraceAbstraction took 54293.78ms. Allocated memory was 192.9MB in the beginning and 851.4MB in the end (delta: 658.5MB). Free memory was 108.3MB in the beginning and 409.3MB in the end (delta: -301.0MB). Peak memory consumption was 359.5MB. Max. memory is 16.1GB. [2023-11-06 22:16:41,326 INFO L158 Benchmark]: Witness Printer took 141.77ms. Allocated memory is still 851.4MB. Free memory was 409.3MB in the beginning and 398.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:16:41,334 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.34ms. Allocated memory is still 130.0MB. Free memory was 102.3MB in the beginning and 102.1MB in the end (delta: 132.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 765.60ms. Allocated memory is still 192.9MB. Free memory was 162.5MB in the beginning and 136.4MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 110.57ms. Allocated memory is still 192.9MB. Free memory was 136.4MB in the beginning and 134.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.73ms. Allocated memory is still 192.9MB. Free memory was 134.2MB in the beginning and 131.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1039.08ms. Allocated memory is still 192.9MB. Free memory was 131.9MB in the beginning and 108.3MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 54293.78ms. Allocated memory was 192.9MB in the beginning and 851.4MB in the end (delta: 658.5MB). Free memory was 108.3MB in the beginning and 409.3MB in the end (delta: -301.0MB). Peak memory consumption was 359.5MB. Max. memory is 16.1GB. * Witness Printer took 141.77ms. Allocated memory is still 851.4MB. Free memory was 409.3MB in the beginning and 398.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.0s, 117 PlacesBefore, 34 PlacesAfterwards, 109 TransitionsBefore, 25 TransitionsAfterwards, 2206 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 98 TotalNumberOfCompositions, 5647 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2398, independent: 2242, independent conditional: 0, independent unconditional: 2242, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1216, independent: 1170, independent conditional: 0, independent unconditional: 1170, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2398, independent: 1072, independent conditional: 0, independent unconditional: 1072, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 1216, unknown conditional: 0, unknown unconditional: 1216] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 76, Positive conditional cache size: 0, Positive unconditional cache size: 76, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$r_buff1_thd3; [L733] 0 _Bool y$read_delayed; [L734] 0 int *y$read_delayed_var; [L735] 0 int y$w_buff0; [L736] 0 _Bool y$w_buff0_used; [L737] 0 int y$w_buff1; [L738] 0 _Bool y$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2321; [L855] FCALL, FORK 0 pthread_create(&t2321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2321, ((void *)0), P0, ((void *)0))=-2, t2321={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L856] 0 pthread_t t2322; [L857] FCALL, FORK 0 pthread_create(&t2322, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2322, ((void *)0), P1, ((void *)0))=-1, t2321={5:0}, t2322={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L858] 0 pthread_t t2323; [L859] FCALL, FORK 0 pthread_create(&t2323, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2323, ((void *)0), P2, ((void *)0))=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L796] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L813] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L744] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L832] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L770] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 3 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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: 855]: 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: 859]: 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: 857]: 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, 140 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: 54.1s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 17, EmptinessCheckTime: 0.0s, AutomataDifference: 16.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1694 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1440 mSDsluCounter, 962 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 785 mSDsCounter, 740 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4616 IncrementalHoareTripleChecker+Invalid, 5356 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 740 mSolverCounterUnsat, 177 mSDtfsCounter, 4616 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1379occurred in iteration=21, InterpolantAutomatonStates: 183, 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.0s SatisfiabilityAnalysisTime, 29.4s InterpolantComputationTime, 533 NumberOfCodeBlocks, 533 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 483 ConstructedInterpolants, 0 QuantifiedInterpolants, 7306 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-06 22:16:41,368 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04c95cab-cd53-4315-9a1b-2f5164315509/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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