./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5280cf6f-b2b3-4674-9850-89915beda763/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5280cf6f-b2b3-4674-9850-89915beda763/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5280cf6f-b2b3-4674-9850-89915beda763/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5280cf6f-b2b3-4674-9850-89915beda763/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5280cf6f-b2b3-4674-9850-89915beda763/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5280cf6f-b2b3-4674-9850-89915beda763/bin/uautomizer-verify-LYvppIcaGC --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 00:12:23,751 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 00:12:23,863 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5280cf6f-b2b3-4674-9850-89915beda763/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-24 00:12:23,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 00:12:23,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 00:12:23,917 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 00:12:23,918 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 00:12:23,918 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 00:12:23,919 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 00:12:23,919 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 00:12:23,919 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 00:12:23,919 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 00:12:23,919 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 00:12:23,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 00:12:23,920 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 00:12:23,920 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 00:12:23,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 00:12:23,920 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 00:12:23,920 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 00:12:23,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 00:12:23,922 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 00:12:23,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 00:12:23,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 00:12:23,923 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 00:12:23,923 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 00:12:23,923 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 00:12:23,923 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 00:12:23,923 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 00:12:23,923 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 00:12:23,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:12:23,924 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:12:23,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:12:23,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:12:23,924 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 00:12:23,924 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:12:23,924 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:12:23,925 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:12:23,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:12:23,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 00:12:23,925 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 00:12:23,925 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 00:12:23,925 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 00:12:23,925 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 00:12:23,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 00:12:23,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 00:12:23,926 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 00:12:23,926 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 00:12:23,926 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 00:12:23,926 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5280cf6f-b2b3-4674-9850-89915beda763/bin/uautomizer-verify-LYvppIcaGC Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 [2024-11-24 00:12:24,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 00:12:24,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 00:12:24,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 00:12:24,315 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 00:12:24,315 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 00:12:24,317 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5280cf6f-b2b3-4674-9850-89915beda763/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-11-24 00:12:27,425 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5280cf6f-b2b3-4674-9850-89915beda763/bin/uautomizer-verify-LYvppIcaGC/data/47e7b229c/263ee3490d9f4aafaeffa6346b25a0c0/FLAGe3765d491 [2024-11-24 00:12:27,879 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 00:12:27,880 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5280cf6f-b2b3-4674-9850-89915beda763/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-11-24 00:12:27,902 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5280cf6f-b2b3-4674-9850-89915beda763/bin/uautomizer-verify-LYvppIcaGC/data/47e7b229c/263ee3490d9f4aafaeffa6346b25a0c0/FLAGe3765d491 [2024-11-24 00:12:27,927 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5280cf6f-b2b3-4674-9850-89915beda763/bin/uautomizer-verify-LYvppIcaGC/data/47e7b229c/263ee3490d9f4aafaeffa6346b25a0c0 [2024-11-24 00:12:27,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 00:12:27,934 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 00:12:27,936 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 00:12:27,936 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 00:12:27,942 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 00:12:27,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:12:27" (1/1) ... [2024-11-24 00:12:27,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@209f10b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:12:27, skipping insertion in model container [2024-11-24 00:12:27,946 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:12:27" (1/1) ... [2024-11-24 00:12:28,007 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 00:12:28,217 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5280cf6f-b2b3-4674-9850-89915beda763/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2024-11-24 00:12:28,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:12:28,473 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 00:12:28,484 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5280cf6f-b2b3-4674-9850-89915beda763/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2024-11-24 00:12:28,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:12:28,608 INFO L204 MainTranslator]: Completed translation [2024-11-24 00:12:28,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:12:28 WrapperNode [2024-11-24 00:12:28,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 00:12:28,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 00:12:28,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 00:12:28,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 00:12:28,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:12:28" (1/1) ... [2024-11-24 00:12:28,650 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:12:28" (1/1) ... [2024-11-24 00:12:28,698 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2024-11-24 00:12:28,699 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 00:12:28,700 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 00:12:28,700 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 00:12:28,700 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 00:12:28,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:12:28" (1/1) ... [2024-11-24 00:12:28,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:12:28" (1/1) ... [2024-11-24 00:12:28,728 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:12:28" (1/1) ... [2024-11-24 00:12:28,748 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-24 00:12:28,749 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:12:28" (1/1) ... [2024-11-24 00:12:28,749 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:12:28" (1/1) ... [2024-11-24 00:12:28,757 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:12:28" (1/1) ... [2024-11-24 00:12:28,758 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:12:28" (1/1) ... [2024-11-24 00:12:28,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:12:28" (1/1) ... [2024-11-24 00:12:28,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:12:28" (1/1) ... [2024-11-24 00:12:28,769 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:12:28" (1/1) ... [2024-11-24 00:12:28,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 00:12:28,774 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 00:12:28,774 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 00:12:28,774 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 00:12:28,775 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:12:28" (1/1) ... [2024-11-24 00:12:28,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:12:28,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5280cf6f-b2b3-4674-9850-89915beda763/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:12:28,822 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5280cf6f-b2b3-4674-9850-89915beda763/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 00:12:28,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5280cf6f-b2b3-4674-9850-89915beda763/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 00:12:28,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-24 00:12:28,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 00:12:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-24 00:12:28,867 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-24 00:12:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-24 00:12:28,868 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-24 00:12:28,868 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-24 00:12:28,868 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-24 00:12:28,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-24 00:12:28,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-24 00:12:28,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 00:12:28,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 00:12:28,870 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-24 00:12:29,074 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 00:12:29,076 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 00:12:29,556 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-24 00:12:29,556 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 00:12:29,879 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 00:12:29,879 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-24 00:12:29,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:12:29 BoogieIcfgContainer [2024-11-24 00:12:29,880 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 00:12:29,882 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 00:12:29,883 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 00:12:29,888 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 00:12:29,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:12:27" (1/3) ... [2024-11-24 00:12:29,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd39bd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:12:29, skipping insertion in model container [2024-11-24 00:12:29,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:12:28" (2/3) ... [2024-11-24 00:12:29,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd39bd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:12:29, skipping insertion in model container [2024-11-24 00:12:29,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:12:29" (3/3) ... [2024-11-24 00:12:29,893 INFO L128 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-11-24 00:12:29,913 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 00:12:29,917 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i that has 4 procedures, 39 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2024-11-24 00:12:29,917 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-24 00:12:29,998 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-24 00:12:30,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2024-11-24 00:12:30,109 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2024-11-24 00:12:30,111 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:12:30,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2024-11-24 00:12:30,118 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2024-11-24 00:12:30,122 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2024-11-24 00:12:30,135 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 00:12:30,159 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1cd84209, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 00:12:30,159 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-24 00:12:30,168 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-24 00:12:30,169 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-24 00:12:30,169 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:12:30,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:12:30,170 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-24 00:12:30,171 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-24 00:12:30,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:12:30,179 INFO L85 PathProgramCache]: Analyzing trace with hash 10922588, now seen corresponding path program 1 times [2024-11-24 00:12:30,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:12:30,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582168838] [2024-11-24 00:12:30,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:12:30,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:12:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:12:30,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:12:30,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:12:30,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582168838] [2024-11-24 00:12:30,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582168838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:12:30,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:12:30,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-24 00:12:30,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305279372] [2024-11-24 00:12:30,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:12:30,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:12:30,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:12:30,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:12:30,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:12:30,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 39 [2024-11-24 00:12:30,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:12:30,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:12:30,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 39 [2024-11-24 00:12:30,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:12:31,713 INFO L124 PetriNetUnfolderBase]: 530/980 cut-off events. [2024-11-24 00:12:31,713 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-24 00:12:31,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1834 conditions, 980 events. 530/980 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5509 event pairs, 284 based on Foata normal form. 36/994 useless extension candidates. Maximal degree in co-relation 1823. Up to 664 conditions per place. [2024-11-24 00:12:31,737 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 29 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2024-11-24 00:12:31,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 177 flow [2024-11-24 00:12:31,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:12:31,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 00:12:31,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-11-24 00:12:31,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7692307692307693 [2024-11-24 00:12:31,769 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 90 transitions. [2024-11-24 00:12:31,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 177 flow [2024-11-24 00:12:31,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 48 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-24 00:12:31,787 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2024-11-24 00:12:31,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2024-11-24 00:12:31,800 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2024-11-24 00:12:31,800 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2024-11-24 00:12:31,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:12:31,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:12:31,801 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:12:31,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-24 00:12:31,802 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-24 00:12:31,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:12:31,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1679189843, now seen corresponding path program 1 times [2024-11-24 00:12:31,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:12:31,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813652959] [2024-11-24 00:12:31,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:12:31,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:12:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:12:33,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:12:33,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:12:33,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813652959] [2024-11-24 00:12:33,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813652959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:12:33,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:12:33,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:12:33,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245553130] [2024-11-24 00:12:33,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:12:33,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:12:33,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:12:33,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:12:33,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:12:33,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-11-24 00:12:33,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:12:33,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:12:33,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-11-24 00:12:33,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:12:35,451 INFO L124 PetriNetUnfolderBase]: 2216/3644 cut-off events. [2024-11-24 00:12:35,452 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2024-11-24 00:12:35,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7151 conditions, 3644 events. 2216/3644 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 23354 event pairs, 299 based on Foata normal form. 0/3553 useless extension candidates. Maximal degree in co-relation 7141. Up to 1815 conditions per place. [2024-11-24 00:12:35,480 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 41 selfloop transitions, 10 changer transitions 72/133 dead transitions. [2024-11-24 00:12:35,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 133 transitions, 542 flow [2024-11-24 00:12:35,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-24 00:12:35,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-24 00:12:35,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 282 transitions. [2024-11-24 00:12:35,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6025641025641025 [2024-11-24 00:12:35,486 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 12 states and 282 transitions. [2024-11-24 00:12:35,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 133 transitions, 542 flow [2024-11-24 00:12:35,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 133 transitions, 526 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 00:12:35,493 INFO L231 Difference]: Finished difference. Result has 60 places, 40 transitions, 169 flow [2024-11-24 00:12:35,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=169, PETRI_PLACES=60, PETRI_TRANSITIONS=40} [2024-11-24 00:12:35,494 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2024-11-24 00:12:35,494 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 40 transitions, 169 flow [2024-11-24 00:12:35,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:12:35,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:12:35,495 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:12:35,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-24 00:12:35,495 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-24 00:12:35,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:12:35,497 INFO L85 PathProgramCache]: Analyzing trace with hash -417730636, now seen corresponding path program 1 times [2024-11-24 00:12:35,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:12:35,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451772231] [2024-11-24 00:12:35,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:12:35,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:12:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:12:35,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:12:35,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:12:35,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451772231] [2024-11-24 00:12:35,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451772231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:12:35,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:12:35,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 00:12:35,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320712728] [2024-11-24 00:12:35,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:12:35,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 00:12:35,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:12:35,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 00:12:35,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:12:35,938 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-11-24 00:12:35,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 40 transitions, 169 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:12:35,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:12:35,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-11-24 00:12:35,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:12:36,802 INFO L124 PetriNetUnfolderBase]: 1342/2357 cut-off events. [2024-11-24 00:12:36,802 INFO L125 PetriNetUnfolderBase]: For 5932/6032 co-relation queries the response was YES. [2024-11-24 00:12:36,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8251 conditions, 2357 events. 1342/2357 cut-off events. For 5932/6032 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 15229 event pairs, 220 based on Foata normal form. 127/2425 useless extension candidates. Maximal degree in co-relation 8232. Up to 1268 conditions per place. [2024-11-24 00:12:36,831 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 41 selfloop transitions, 8 changer transitions 28/92 dead transitions. [2024-11-24 00:12:36,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 92 transitions, 602 flow [2024-11-24 00:12:36,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 00:12:36,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-24 00:12:36,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2024-11-24 00:12:36,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6007326007326007 [2024-11-24 00:12:36,836 INFO L175 Difference]: Start difference. First operand has 60 places, 40 transitions, 169 flow. Second operand 7 states and 164 transitions. [2024-11-24 00:12:36,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 92 transitions, 602 flow [2024-11-24 00:12:36,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 92 transitions, 550 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-11-24 00:12:36,876 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 215 flow [2024-11-24 00:12:36,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=215, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2024-11-24 00:12:36,879 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2024-11-24 00:12:36,879 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 215 flow [2024-11-24 00:12:36,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:12:36,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:12:36,879 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:12:36,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-24 00:12:36,880 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-24 00:12:36,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:12:36,881 INFO L85 PathProgramCache]: Analyzing trace with hash -609637483, now seen corresponding path program 1 times [2024-11-24 00:12:36,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:12:36,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136985611] [2024-11-24 00:12:36,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:12:36,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:12:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:12:38,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:12:38,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:12:38,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136985611] [2024-11-24 00:12:38,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136985611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:12:38,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:12:38,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:12:38,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603307013] [2024-11-24 00:12:38,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:12:38,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:12:38,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:12:38,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:12:38,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:12:38,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-11-24 00:12:38,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 215 flow. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:12:38,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:12:38,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-11-24 00:12:38,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:12:39,844 INFO L124 PetriNetUnfolderBase]: 2594/4236 cut-off events. [2024-11-24 00:12:39,844 INFO L125 PetriNetUnfolderBase]: For 6860/6862 co-relation queries the response was YES. [2024-11-24 00:12:39,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13741 conditions, 4236 events. 2594/4236 cut-off events. For 6860/6862 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 27174 event pairs, 271 based on Foata normal form. 93/4317 useless extension candidates. Maximal degree in co-relation 13722. Up to 1887 conditions per place. [2024-11-24 00:12:39,886 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 58 selfloop transitions, 27 changer transitions 94/188 dead transitions. [2024-11-24 00:12:39,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 188 transitions, 1267 flow [2024-11-24 00:12:39,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-24 00:12:39,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-24 00:12:39,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 302 transitions. [2024-11-24 00:12:39,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5956607495069034 [2024-11-24 00:12:39,888 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 215 flow. Second operand 13 states and 302 transitions. [2024-11-24 00:12:39,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 188 transitions, 1267 flow [2024-11-24 00:12:39,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 188 transitions, 1267 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-24 00:12:39,899 INFO L231 Difference]: Finished difference. Result has 79 places, 60 transitions, 483 flow [2024-11-24 00:12:39,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=483, PETRI_PLACES=79, PETRI_TRANSITIONS=60} [2024-11-24 00:12:39,901 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 34 predicate places. [2024-11-24 00:12:39,901 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 60 transitions, 483 flow [2024-11-24 00:12:39,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:12:39,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:12:39,901 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:12:39,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-24 00:12:39,902 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-24 00:12:39,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:12:39,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1622333237, now seen corresponding path program 2 times [2024-11-24 00:12:39,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:12:39,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499568875] [2024-11-24 00:12:39,903 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 00:12:39,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:12:39,933 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-24 00:12:39,933 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 00:12:40,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:12:40,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:12:40,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499568875] [2024-11-24 00:12:40,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499568875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:12:40,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:12:40,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 00:12:40,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933913778] [2024-11-24 00:12:40,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:12:40,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 00:12:40,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:12:40,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 00:12:40,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-24 00:12:40,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-11-24 00:12:40,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 60 transitions, 483 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:12:40,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:12:40,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-11-24 00:12:40,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:12:42,198 INFO L124 PetriNetUnfolderBase]: 2363/3851 cut-off events. [2024-11-24 00:12:42,198 INFO L125 PetriNetUnfolderBase]: For 28308/28312 co-relation queries the response was YES. [2024-11-24 00:12:42,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19711 conditions, 3851 events. 2363/3851 cut-off events. For 28308/28312 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 23919 event pairs, 353 based on Foata normal form. 82/3916 useless extension candidates. Maximal degree in co-relation 19678. Up to 1446 conditions per place. [2024-11-24 00:12:42,251 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 54 selfloop transitions, 10 changer transitions 68/141 dead transitions. [2024-11-24 00:12:42,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 141 transitions, 1508 flow [2024-11-24 00:12:42,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-24 00:12:42,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-24 00:12:42,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 202 transitions. [2024-11-24 00:12:42,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5754985754985755 [2024-11-24 00:12:42,254 INFO L175 Difference]: Start difference. First operand has 79 places, 60 transitions, 483 flow. Second operand 9 states and 202 transitions. [2024-11-24 00:12:42,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 141 transitions, 1508 flow [2024-11-24 00:12:42,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 141 transitions, 1448 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-11-24 00:12:42,306 INFO L231 Difference]: Finished difference. Result has 77 places, 51 transitions, 418 flow [2024-11-24 00:12:42,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=418, PETRI_PLACES=77, PETRI_TRANSITIONS=51} [2024-11-24 00:12:42,308 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 32 predicate places. [2024-11-24 00:12:42,310 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 51 transitions, 418 flow [2024-11-24 00:12:42,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:12:42,311 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:12:42,311 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:12:42,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-24 00:12:42,311 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-24 00:12:42,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:12:42,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1830961084, now seen corresponding path program 1 times [2024-11-24 00:12:42,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:12:42,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199133273] [2024-11-24 00:12:42,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:12:42,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:12:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:12:42,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:12:42,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:12:42,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199133273] [2024-11-24 00:12:42,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199133273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:12:42,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:12:42,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:12:42,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635491850] [2024-11-24 00:12:42,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:12:42,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:12:42,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:12:42,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:12:42,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:12:42,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-11-24 00:12:42,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 51 transitions, 418 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:12:42,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:12:42,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-11-24 00:12:42,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:12:43,680 INFO L124 PetriNetUnfolderBase]: 1322/2249 cut-off events. [2024-11-24 00:12:43,681 INFO L125 PetriNetUnfolderBase]: For 19913/20075 co-relation queries the response was YES. [2024-11-24 00:12:43,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12064 conditions, 2249 events. 1322/2249 cut-off events. For 19913/20075 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13014 event pairs, 553 based on Foata normal form. 216/2437 useless extension candidates. Maximal degree in co-relation 12038. Up to 1514 conditions per place. [2024-11-24 00:12:43,709 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 38 selfloop transitions, 4 changer transitions 33/95 dead transitions. [2024-11-24 00:12:43,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 95 transitions, 958 flow [2024-11-24 00:12:43,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 00:12:43,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-24 00:12:43,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2024-11-24 00:12:43,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6043956043956044 [2024-11-24 00:12:43,710 INFO L175 Difference]: Start difference. First operand has 77 places, 51 transitions, 418 flow. Second operand 7 states and 165 transitions. [2024-11-24 00:12:43,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 95 transitions, 958 flow [2024-11-24 00:12:43,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 95 transitions, 887 flow, removed 15 selfloop flow, removed 10 redundant places. [2024-11-24 00:12:43,733 INFO L231 Difference]: Finished difference. Result has 74 places, 53 transitions, 417 flow [2024-11-24 00:12:43,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=417, PETRI_PLACES=74, PETRI_TRANSITIONS=53} [2024-11-24 00:12:43,735 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2024-11-24 00:12:43,736 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 53 transitions, 417 flow [2024-11-24 00:12:43,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:12:43,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:12:43,737 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:12:43,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-24 00:12:43,737 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-24 00:12:43,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:12:43,738 INFO L85 PathProgramCache]: Analyzing trace with hash 804089851, now seen corresponding path program 1 times [2024-11-24 00:12:43,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:12:43,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455647831] [2024-11-24 00:12:43,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:12:43,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:12:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:12:44,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:12:44,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:12:44,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455647831] [2024-11-24 00:12:44,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455647831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:12:44,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:12:44,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:12:44,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471269293] [2024-11-24 00:12:44,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:12:44,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:12:44,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:12:44,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:12:44,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:12:44,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-11-24 00:12:44,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 53 transitions, 417 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:12:44,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:12:44,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-11-24 00:12:44,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:12:45,581 INFO L124 PetriNetUnfolderBase]: 1444/2376 cut-off events. [2024-11-24 00:12:45,581 INFO L125 PetriNetUnfolderBase]: For 17771/17771 co-relation queries the response was YES. [2024-11-24 00:12:45,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12752 conditions, 2376 events. 1444/2376 cut-off events. For 17771/17771 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 13056 event pairs, 527 based on Foata normal form. 53/2427 useless extension candidates. Maximal degree in co-relation 12728. Up to 1462 conditions per place. [2024-11-24 00:12:45,604 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 52 selfloop transitions, 23 changer transitions 38/123 dead transitions. [2024-11-24 00:12:45,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 123 transitions, 1214 flow [2024-11-24 00:12:45,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-24 00:12:45,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-24 00:12:45,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 235 transitions. [2024-11-24 00:12:45,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5477855477855478 [2024-11-24 00:12:45,606 INFO L175 Difference]: Start difference. First operand has 74 places, 53 transitions, 417 flow. Second operand 11 states and 235 transitions. [2024-11-24 00:12:45,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 123 transitions, 1214 flow [2024-11-24 00:12:45,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 123 transitions, 1181 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-11-24 00:12:45,631 INFO L231 Difference]: Finished difference. Result has 84 places, 55 transitions, 490 flow [2024-11-24 00:12:45,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=490, PETRI_PLACES=84, PETRI_TRANSITIONS=55} [2024-11-24 00:12:45,632 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 39 predicate places. [2024-11-24 00:12:45,632 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 55 transitions, 490 flow [2024-11-24 00:12:45,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:12:45,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:12:45,632 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:12:45,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-24 00:12:45,633 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-24 00:12:45,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:12:45,633 INFO L85 PathProgramCache]: Analyzing trace with hash -258843994, now seen corresponding path program 1 times [2024-11-24 00:12:45,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:12:45,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343154435] [2024-11-24 00:12:45,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:12:45,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:12:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:12:46,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:12:46,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:12:46,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343154435] [2024-11-24 00:12:46,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343154435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:12:46,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:12:46,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 00:12:46,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602575713] [2024-11-24 00:12:46,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:12:46,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 00:12:46,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:12:46,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 00:12:46,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-24 00:12:46,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-11-24 00:12:46,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 55 transitions, 490 flow. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:12:46,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:12:46,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-11-24 00:12:46,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:12:47,810 INFO L124 PetriNetUnfolderBase]: 1496/2468 cut-off events. [2024-11-24 00:12:47,811 INFO L125 PetriNetUnfolderBase]: For 21505/21505 co-relation queries the response was YES. [2024-11-24 00:12:47,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14014 conditions, 2468 events. 1496/2468 cut-off events. For 21505/21505 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 13711 event pairs, 416 based on Foata normal form. 60/2523 useless extension candidates. Maximal degree in co-relation 13985. Up to 1546 conditions per place. [2024-11-24 00:12:47,837 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 66 selfloop transitions, 34 changer transitions 53/163 dead transitions. [2024-11-24 00:12:47,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 163 transitions, 1913 flow [2024-11-24 00:12:47,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-24 00:12:47,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-24 00:12:47,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 260 transitions. [2024-11-24 00:12:47,839 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-11-24 00:12:47,839 INFO L175 Difference]: Start difference. First operand has 84 places, 55 transitions, 490 flow. Second operand 12 states and 260 transitions. [2024-11-24 00:12:47,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 163 transitions, 1913 flow [2024-11-24 00:12:47,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 163 transitions, 1773 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-11-24 00:12:47,879 INFO L231 Difference]: Finished difference. Result has 91 places, 79 transitions, 911 flow [2024-11-24 00:12:47,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=911, PETRI_PLACES=91, PETRI_TRANSITIONS=79} [2024-11-24 00:12:47,880 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 46 predicate places. [2024-11-24 00:12:47,883 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 79 transitions, 911 flow [2024-11-24 00:12:47,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:12:47,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:12:47,884 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:12:47,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-24 00:12:47,884 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-24 00:12:47,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:12:47,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1824752836, now seen corresponding path program 2 times [2024-11-24 00:12:47,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:12:47,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752168122] [2024-11-24 00:12:47,884 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 00:12:47,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:12:47,932 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-24 00:12:47,933 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 00:12:48,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:12:48,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:12:48,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752168122] [2024-11-24 00:12:48,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752168122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:12:48,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:12:48,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:12:48,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999788467] [2024-11-24 00:12:48,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:12:48,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 00:12:48,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:12:48,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 00:12:48,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 00:12:48,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-11-24 00:12:48,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 79 transitions, 911 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:12:48,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:12:48,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-11-24 00:12:48,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:12:48,772 INFO L124 PetriNetUnfolderBase]: 2129/3334 cut-off events. [2024-11-24 00:12:48,772 INFO L125 PetriNetUnfolderBase]: For 55648/56714 co-relation queries the response was YES. [2024-11-24 00:12:48,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20181 conditions, 3334 events. 2129/3334 cut-off events. For 55648/56714 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 18218 event pairs, 323 based on Foata normal form. 607/3763 useless extension candidates. Maximal degree in co-relation 20149. Up to 1615 conditions per place. [2024-11-24 00:12:48,810 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 70 selfloop transitions, 5 changer transitions 0/99 dead transitions. [2024-11-24 00:12:48,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 99 transitions, 1260 flow [2024-11-24 00:12:48,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 00:12:48,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-24 00:12:48,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-11-24 00:12:48,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6602564102564102 [2024-11-24 00:12:48,812 INFO L175 Difference]: Start difference. First operand has 91 places, 79 transitions, 911 flow. Second operand 4 states and 103 transitions. [2024-11-24 00:12:48,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 99 transitions, 1260 flow [2024-11-24 00:12:48,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 99 transitions, 1180 flow, removed 36 selfloop flow, removed 5 redundant places. [2024-11-24 00:12:48,857 INFO L231 Difference]: Finished difference. Result has 85 places, 70 transitions, 726 flow [2024-11-24 00:12:48,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=726, PETRI_PLACES=85, PETRI_TRANSITIONS=70} [2024-11-24 00:12:48,859 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 40 predicate places. [2024-11-24 00:12:48,859 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 70 transitions, 726 flow [2024-11-24 00:12:48,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:12:48,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:12:48,859 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:12:48,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-24 00:12:48,860 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-24 00:12:48,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:12:48,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1023790037, now seen corresponding path program 1 times [2024-11-24 00:12:48,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:12:48,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45511603] [2024-11-24 00:12:48,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:12:48,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:12:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:12:49,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:12:49,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:12:49,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45511603] [2024-11-24 00:12:49,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45511603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:12:49,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:12:49,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-24 00:12:49,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862253917] [2024-11-24 00:12:49,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:12:49,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-24 00:12:49,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:12:49,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-24 00:12:49,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-24 00:12:49,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-11-24 00:12:49,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 70 transitions, 726 flow. Second operand has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:12:49,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:12:49,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-11-24 00:12:49,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:12:50,452 INFO L124 PetriNetUnfolderBase]: 1369/2412 cut-off events. [2024-11-24 00:12:50,453 INFO L125 PetriNetUnfolderBase]: For 23480/23845 co-relation queries the response was YES. [2024-11-24 00:12:50,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13239 conditions, 2412 events. 1369/2412 cut-off events. For 23480/23845 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 14544 event pairs, 645 based on Foata normal form. 286/2577 useless extension candidates. Maximal degree in co-relation 13208. Up to 1652 conditions per place. [2024-11-24 00:12:50,486 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 48 selfloop transitions, 15 changer transitions 27/117 dead transitions. [2024-11-24 00:12:50,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 117 transitions, 1360 flow [2024-11-24 00:12:50,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 00:12:50,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-24 00:12:50,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 185 transitions. [2024-11-24 00:12:50,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.592948717948718 [2024-11-24 00:12:50,489 INFO L175 Difference]: Start difference. First operand has 85 places, 70 transitions, 726 flow. Second operand 8 states and 185 transitions. [2024-11-24 00:12:50,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 117 transitions, 1360 flow [2024-11-24 00:12:50,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 117 transitions, 1294 flow, removed 32 selfloop flow, removed 5 redundant places. [2024-11-24 00:12:50,517 INFO L231 Difference]: Finished difference. Result has 92 places, 73 transitions, 806 flow [2024-11-24 00:12:50,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=806, PETRI_PLACES=92, PETRI_TRANSITIONS=73} [2024-11-24 00:12:50,518 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 47 predicate places. [2024-11-24 00:12:50,518 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 73 transitions, 806 flow [2024-11-24 00:12:50,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:12:50,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:12:50,519 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:12:50,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-24 00:12:50,519 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-24 00:12:50,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:12:50,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1011134156, now seen corresponding path program 1 times [2024-11-24 00:12:50,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:12:50,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706182235] [2024-11-24 00:12:50,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:12:50,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:12:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:12:50,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:12:50,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:12:50,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706182235] [2024-11-24 00:12:50,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706182235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:12:50,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:12:50,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 00:12:50,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425362802] [2024-11-24 00:12:50,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:12:50,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 00:12:50,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:12:50,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 00:12:50,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:12:50,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-11-24 00:12:50,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 73 transitions, 806 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:12:50,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:12:50,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-11-24 00:12:50,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:12:51,290 INFO L124 PetriNetUnfolderBase]: 1628/2568 cut-off events. [2024-11-24 00:12:51,290 INFO L125 PetriNetUnfolderBase]: For 35616/36343 co-relation queries the response was YES. [2024-11-24 00:12:51,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14956 conditions, 2568 events. 1628/2568 cut-off events. For 35616/36343 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 13283 event pairs, 213 based on Foata normal form. 323/2722 useless extension candidates. Maximal degree in co-relation 14924. Up to 997 conditions per place. [2024-11-24 00:12:51,309 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 81 selfloop transitions, 8 changer transitions 0/114 dead transitions. [2024-11-24 00:12:51,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 114 transitions, 1416 flow [2024-11-24 00:12:51,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 00:12:51,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-24 00:12:51,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2024-11-24 00:12:51,311 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6717948717948717 [2024-11-24 00:12:51,311 INFO L175 Difference]: Start difference. First operand has 92 places, 73 transitions, 806 flow. Second operand 5 states and 131 transitions. [2024-11-24 00:12:51,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 114 transitions, 1416 flow [2024-11-24 00:12:51,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 114 transitions, 1362 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-11-24 00:12:51,337 INFO L231 Difference]: Finished difference. Result has 90 places, 76 transitions, 804 flow [2024-11-24 00:12:51,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=804, PETRI_PLACES=90, PETRI_TRANSITIONS=76} [2024-11-24 00:12:51,337 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 45 predicate places. [2024-11-24 00:12:51,338 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 76 transitions, 804 flow [2024-11-24 00:12:51,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:12:51,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:12:51,338 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:12:51,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-24 00:12:51,338 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-24 00:12:51,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:12:51,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1423838541, now seen corresponding path program 1 times [2024-11-24 00:12:51,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:12:51,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882348576] [2024-11-24 00:12:51,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:12:51,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:12:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:12:51,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:12:51,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:12:51,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882348576] [2024-11-24 00:12:51,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882348576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:12:51,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:12:51,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:12:51,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307818845] [2024-11-24 00:12:51,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:12:51,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:12:51,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:12:51,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:12:51,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:12:51,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-11-24 00:12:51,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 76 transitions, 804 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:12:51,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:12:51,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-11-24 00:12:51,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:12:52,085 INFO L124 PetriNetUnfolderBase]: 1324/2056 cut-off events. [2024-11-24 00:12:52,086 INFO L125 PetriNetUnfolderBase]: For 30392/31079 co-relation queries the response was YES. [2024-11-24 00:12:52,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12383 conditions, 2056 events. 1324/2056 cut-off events. For 30392/31079 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 10308 event pairs, 197 based on Foata normal form. 233/2124 useless extension candidates. Maximal degree in co-relation 12351. Up to 813 conditions per place. [2024-11-24 00:12:52,098 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 73 selfloop transitions, 11 changer transitions 1/110 dead transitions. [2024-11-24 00:12:52,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 110 transitions, 1285 flow [2024-11-24 00:12:52,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:12:52,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 00:12:52,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2024-11-24 00:12:52,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-11-24 00:12:52,100 INFO L175 Difference]: Start difference. First operand has 90 places, 76 transitions, 804 flow. Second operand 6 states and 143 transitions. [2024-11-24 00:12:52,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 110 transitions, 1285 flow [2024-11-24 00:12:52,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 110 transitions, 1172 flow, removed 51 selfloop flow, removed 7 redundant places. [2024-11-24 00:12:52,124 INFO L231 Difference]: Finished difference. Result has 90 places, 75 transitions, 728 flow [2024-11-24 00:12:52,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=728, PETRI_PLACES=90, PETRI_TRANSITIONS=75} [2024-11-24 00:12:52,125 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 45 predicate places. [2024-11-24 00:12:52,125 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 75 transitions, 728 flow [2024-11-24 00:12:52,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:12:52,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:12:52,125 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:12:52,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-24 00:12:52,126 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-24 00:12:52,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:12:52,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1932628143, now seen corresponding path program 1 times [2024-11-24 00:12:52,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:12:52,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417573205] [2024-11-24 00:12:52,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:12:52,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:12:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:12:53,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:12:53,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:12:53,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417573205] [2024-11-24 00:12:53,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417573205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:12:53,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:12:53,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-24 00:12:53,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715687678] [2024-11-24 00:12:53,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:12:53,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-24 00:12:53,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:12:53,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-24 00:12:53,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-24 00:12:53,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-11-24 00:12:53,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 75 transitions, 728 flow. Second operand has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:12:53,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:12:53,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-11-24 00:12:53,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:12:54,081 INFO L124 PetriNetUnfolderBase]: 854/1697 cut-off events. [2024-11-24 00:12:54,082 INFO L125 PetriNetUnfolderBase]: For 11918/12239 co-relation queries the response was YES. [2024-11-24 00:12:54,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7944 conditions, 1697 events. 854/1697 cut-off events. For 11918/12239 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 10580 event pairs, 189 based on Foata normal form. 127/1694 useless extension candidates. Maximal degree in co-relation 7915. Up to 793 conditions per place. [2024-11-24 00:12:54,096 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 46 selfloop transitions, 21 changer transitions 13/111 dead transitions. [2024-11-24 00:12:54,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 111 transitions, 1160 flow [2024-11-24 00:12:54,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 00:12:54,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-24 00:12:54,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 173 transitions. [2024-11-24 00:12:54,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5544871794871795 [2024-11-24 00:12:54,098 INFO L175 Difference]: Start difference. First operand has 90 places, 75 transitions, 728 flow. Second operand 8 states and 173 transitions. [2024-11-24 00:12:54,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 111 transitions, 1160 flow [2024-11-24 00:12:54,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 111 transitions, 1010 flow, removed 62 selfloop flow, removed 10 redundant places. [2024-11-24 00:12:54,124 INFO L231 Difference]: Finished difference. Result has 91 places, 82 transitions, 807 flow [2024-11-24 00:12:54,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=807, PETRI_PLACES=91, PETRI_TRANSITIONS=82} [2024-11-24 00:12:54,125 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 46 predicate places. [2024-11-24 00:12:54,125 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 82 transitions, 807 flow [2024-11-24 00:12:54,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:12:54,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:12:54,125 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:12:54,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-24 00:12:54,125 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-24 00:12:54,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:12:54,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1683085337, now seen corresponding path program 2 times [2024-11-24 00:12:54,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:12:54,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255533279] [2024-11-24 00:12:54,126 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 00:12:54,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:12:54,171 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-24 00:12:54,172 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 00:12:55,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:12:55,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:12:55,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255533279] [2024-11-24 00:12:55,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255533279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:12:55,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:12:55,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 00:12:55,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285894240] [2024-11-24 00:12:55,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:12:55,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-24 00:12:55,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:12:55,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-24 00:12:55,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-24 00:12:55,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-11-24 00:12:55,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 82 transitions, 807 flow. Second operand has 11 states, 11 states have (on average 16.545454545454547) internal successors, (182), 11 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:12:55,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:12:55,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-11-24 00:12:55,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:12:56,765 INFO L124 PetriNetUnfolderBase]: 1184/2379 cut-off events. [2024-11-24 00:12:56,765 INFO L125 PetriNetUnfolderBase]: For 8523/8810 co-relation queries the response was YES. [2024-11-24 00:12:56,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9112 conditions, 2379 events. 1184/2379 cut-off events. For 8523/8810 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 16259 event pairs, 282 based on Foata normal form. 88/2275 useless extension candidates. Maximal degree in co-relation 9085. Up to 508 conditions per place. [2024-11-24 00:12:56,783 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 57 selfloop transitions, 19 changer transitions 31/137 dead transitions. [2024-11-24 00:12:56,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 137 transitions, 1310 flow [2024-11-24 00:12:56,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 00:12:56,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-24 00:12:56,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 226 transitions. [2024-11-24 00:12:56,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5794871794871795 [2024-11-24 00:12:56,785 INFO L175 Difference]: Start difference. First operand has 91 places, 82 transitions, 807 flow. Second operand 10 states and 226 transitions. [2024-11-24 00:12:56,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 137 transitions, 1310 flow [2024-11-24 00:12:56,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 137 transitions, 1275 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-11-24 00:12:56,804 INFO L231 Difference]: Finished difference. Result has 98 places, 80 transitions, 829 flow [2024-11-24 00:12:56,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=829, PETRI_PLACES=98, PETRI_TRANSITIONS=80} [2024-11-24 00:12:56,805 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 53 predicate places. [2024-11-24 00:12:56,805 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 80 transitions, 829 flow [2024-11-24 00:12:56,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.545454545454547) internal successors, (182), 11 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:12:56,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:12:56,805 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:12:56,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-24 00:12:56,806 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-24 00:12:56,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:12:56,806 INFO L85 PathProgramCache]: Analyzing trace with hash 430773529, now seen corresponding path program 3 times [2024-11-24 00:12:56,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:12:56,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655690543] [2024-11-24 00:12:56,807 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-24 00:12:56,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:12:56,892 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-24 00:12:56,892 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-24 00:12:56,892 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 00:12:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 00:12:57,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-24 00:12:57,029 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-24 00:12:57,030 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-24 00:12:57,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-24 00:12:57,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-24 00:12:57,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-24 00:12:57,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-24 00:12:57,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-24 00:12:57,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-24 00:12:57,033 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:12:57,130 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-24 00:12:57,130 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-24 00:12:57,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 12:12:57 BasicIcfg [2024-11-24 00:12:57,136 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-24 00:12:57,136 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-24 00:12:57,136 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-24 00:12:57,137 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-24 00:12:57,137 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:12:29" (3/4) ... [2024-11-24 00:12:57,139 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-24 00:12:57,259 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 9. [2024-11-24 00:12:57,313 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5280cf6f-b2b3-4674-9850-89915beda763/bin/uautomizer-verify-LYvppIcaGC/witness.graphml [2024-11-24 00:12:57,313 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5280cf6f-b2b3-4674-9850-89915beda763/bin/uautomizer-verify-LYvppIcaGC/witness.yml [2024-11-24 00:12:57,313 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-24 00:12:57,314 INFO L158 Benchmark]: Toolchain (without parser) took 29380.23ms. Allocated memory was 117.4MB in the beginning and 629.1MB in the end (delta: 511.7MB). Free memory was 92.9MB in the beginning and 526.0MB in the end (delta: -433.1MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2024-11-24 00:12:57,315 INFO L158 Benchmark]: CDTParser took 0.77ms. Allocated memory is still 167.8MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:12:57,316 INFO L158 Benchmark]: CACSL2BoogieTranslator took 673.41ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 69.2MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-24 00:12:57,316 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.28ms. Allocated memory is still 117.4MB. Free memory was 69.2MB in the beginning and 66.6MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:12:57,317 INFO L158 Benchmark]: Boogie Preprocessor took 73.75ms. Allocated memory is still 117.4MB. Free memory was 66.6MB in the beginning and 63.7MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:12:57,317 INFO L158 Benchmark]: RCFGBuilder took 1105.89ms. Allocated memory is still 117.4MB. Free memory was 63.4MB in the beginning and 66.3MB in the end (delta: -2.9MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2024-11-24 00:12:57,317 INFO L158 Benchmark]: TraceAbstraction took 27253.38ms. Allocated memory was 117.4MB in the beginning and 629.1MB in the end (delta: 511.7MB). Free memory was 65.3MB in the beginning and 538.6MB in the end (delta: -473.3MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2024-11-24 00:12:57,318 INFO L158 Benchmark]: Witness Printer took 176.84ms. Allocated memory is still 629.1MB. Free memory was 538.6MB in the beginning and 526.0MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-24 00:12:57,320 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.77ms. Allocated memory is still 167.8MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 673.41ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 69.2MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.28ms. Allocated memory is still 117.4MB. Free memory was 69.2MB in the beginning and 66.6MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 73.75ms. Allocated memory is still 117.4MB. Free memory was 66.6MB in the beginning and 63.7MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1105.89ms. Allocated memory is still 117.4MB. Free memory was 63.4MB in the beginning and 66.3MB in the end (delta: -2.9MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. * TraceAbstraction took 27253.38ms. Allocated memory was 117.4MB in the beginning and 629.1MB in the end (delta: 511.7MB). Free memory was 65.3MB in the beginning and 538.6MB in the end (delta: -473.3MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. * Witness Printer took 176.84ms. Allocated memory is still 629.1MB. Free memory was 538.6MB in the beginning and 526.0MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2025; [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 0 pthread_t t2026; [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025=-3, t2026=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L822] 0 pthread_t t2027; [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025=-3, t2026=-2, t2027=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L793] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025=-3, t2026=-2, t2027=-1, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025=-3, t2026=-2, t2027=-1, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025=-3, t2026=-2, t2027=-1, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: 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: 821]: 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: 823]: 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: 819]: 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, 64 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: 27.0s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 14.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 815 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 772 mSDsluCounter, 399 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 306 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2222 IncrementalHoareTripleChecker+Invalid, 2317 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 93 mSDtfsCounter, 2222 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=911occurred in iteration=8, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 311 NumberOfCodeBlocks, 311 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 268 ConstructedInterpolants, 0 QuantifiedInterpolants, 2709 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-24 00:12:57,344 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5280cf6f-b2b3-4674-9850-89915beda763/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE