./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbe6ba1f-8f51-4dbb-b820-c70912138468/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbe6ba1f-8f51-4dbb-b820-c70912138468/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbe6ba1f-8f51-4dbb-b820-c70912138468/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbe6ba1f-8f51-4dbb-b820-c70912138468/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbe6ba1f-8f51-4dbb-b820-c70912138468/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbe6ba1f-8f51-4dbb-b820-c70912138468/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 82646a2180350347ed217a12e2836ec5fdce4b0371f5e0f7afa776fd6812fa0f --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:23:34,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:23:35,020 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbe6ba1f-8f51-4dbb-b820-c70912138468/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:23:35,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:23:35,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:23:35,055 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:23:35,056 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:23:35,057 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:23:35,058 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:23:35,058 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:23:35,060 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:23:35,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:23:35,061 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:23:35,062 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:23:35,062 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:23:35,063 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:23:35,064 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:23:35,064 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:23:35,065 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:23:35,065 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:23:35,066 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:23:35,067 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:23:35,067 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:23:35,068 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:23:35,068 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:23:35,069 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:23:35,069 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:23:35,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:23:35,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:23:35,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:23:35,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:23:35,072 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:23:35,073 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:23:35,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:23:35,074 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:23:35,074 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:23:35,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:23:35,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:23:35,076 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:23:35,076 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbe6ba1f-8f51-4dbb-b820-c70912138468/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbe6ba1f-8f51-4dbb-b820-c70912138468/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 82646a2180350347ed217a12e2836ec5fdce4b0371f5e0f7afa776fd6812fa0f [2023-11-06 22:23:35,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:23:35,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:23:35,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:23:35,490 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:23:35,492 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:23:35,494 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbe6ba1f-8f51-4dbb-b820-c70912138468/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 22:23:38,720 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:23:39,063 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:23:39,063 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbe6ba1f-8f51-4dbb-b820-c70912138468/sv-benchmarks/c/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 22:23:39,080 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbe6ba1f-8f51-4dbb-b820-c70912138468/bin/uautomizer-verify-WvqO1wxjHP/data/c8f7ceaa7/a265ac7d332b4bc888d2677481940f6f/FLAGea3d41840 [2023-11-06 22:23:39,095 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbe6ba1f-8f51-4dbb-b820-c70912138468/bin/uautomizer-verify-WvqO1wxjHP/data/c8f7ceaa7/a265ac7d332b4bc888d2677481940f6f [2023-11-06 22:23:39,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:23:39,099 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:23:39,101 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:23:39,101 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:23:39,107 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:23:39,108 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:23:39" (1/1) ... [2023-11-06 22:23:39,109 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71a5fef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:39, skipping insertion in model container [2023-11-06 22:23:39,110 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:23:39" (1/1) ... [2023-11-06 22:23:39,162 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:23:39,382 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbe6ba1f-8f51-4dbb-b820-c70912138468/sv-benchmarks/c/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-06 22:23:39,664 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:23:39,681 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:23:39,697 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbe6ba1f-8f51-4dbb-b820-c70912138468/sv-benchmarks/c/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-06 22:23:39,791 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:23:39,831 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:23:39,831 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:23:39,839 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:23:39,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:39 WrapperNode [2023-11-06 22:23:39,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:23:39,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:23:39,842 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:23:39,842 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:23:39,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:39" (1/1) ... [2023-11-06 22:23:39,890 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:39" (1/1) ... [2023-11-06 22:23:39,922 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-11-06 22:23:39,926 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:23:39,927 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:23:39,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:23:39,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:23:39,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:39" (1/1) ... [2023-11-06 22:23:39,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:39" (1/1) ... [2023-11-06 22:23:39,954 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:39" (1/1) ... [2023-11-06 22:23:39,955 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:39" (1/1) ... [2023-11-06 22:23:39,970 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:39" (1/1) ... [2023-11-06 22:23:39,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:39" (1/1) ... [2023-11-06 22:23:39,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:39" (1/1) ... [2023-11-06 22:23:39,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:39" (1/1) ... [2023-11-06 22:23:40,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:23:40,003 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:23:40,003 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:23:40,003 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:23:40,004 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:39" (1/1) ... [2023-11-06 22:23:40,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:23:40,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbe6ba1f-8f51-4dbb-b820-c70912138468/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:23:40,044 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbe6ba1f-8f51-4dbb-b820-c70912138468/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:23:40,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbe6ba1f-8f51-4dbb-b820-c70912138468/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:23:40,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:23:40,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:23:40,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:23:40,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:23:40,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:23:40,089 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:23:40,089 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:23:40,089 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:23:40,089 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:23:40,090 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:23:40,091 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:23:40,092 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 22:23:40,092 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 22:23:40,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:23:40,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:23:40,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:23:40,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:23:40,095 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:23:40,264 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:23:40,267 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:23:40,732 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:23:40,930 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:23:40,931 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:23:40,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:23:40 BoogieIcfgContainer [2023-11-06 22:23:40,935 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:23:40,940 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:23:40,940 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:23:40,944 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:23:40,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:23:39" (1/3) ... [2023-11-06 22:23:40,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420af659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:23:40, skipping insertion in model container [2023-11-06 22:23:40,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:39" (2/3) ... [2023-11-06 22:23:40,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420af659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:23:40, skipping insertion in model container [2023-11-06 22:23:40,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:23:40" (3/3) ... [2023-11-06 22:23:40,951 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 22:23:40,962 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 22:23:40,974 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:23:40,974 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-06 22:23:40,975 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:23:41,106 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:23:41,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 288 flow [2023-11-06 22:23:41,250 INFO L124 PetriNetUnfolderBase]: 2/132 cut-off events. [2023-11-06 22:23:41,251 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:23:41,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-11-06 22:23:41,258 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 136 transitions, 288 flow [2023-11-06 22:23:41,264 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 132 transitions, 276 flow [2023-11-06 22:23:41,268 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:23:41,278 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 132 transitions, 276 flow [2023-11-06 22:23:41,281 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 132 transitions, 276 flow [2023-11-06 22:23:41,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 276 flow [2023-11-06 22:23:41,315 INFO L124 PetriNetUnfolderBase]: 2/132 cut-off events. [2023-11-06 22:23:41,316 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:23:41,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-11-06 22:23:41,321 INFO L119 LiptonReduction]: Number of co-enabled transitions 3518 [2023-11-06 22:23:46,591 INFO L134 LiptonReduction]: Checked pairs total: 9381 [2023-11-06 22:23:46,591 INFO L136 LiptonReduction]: Total number of compositions: 113 [2023-11-06 22:23:46,612 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:23:46,619 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@444c8b22, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:23:46,621 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-06 22:23:46,624 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:23:46,625 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-11-06 22:23:46,625 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:23:46,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:46,626 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:23:46,626 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:23:46,630 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:46,630 INFO L85 PathProgramCache]: Analyzing trace with hash 568268, now seen corresponding path program 1 times [2023-11-06 22:23:46,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:46,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631741753] [2023-11-06 22:23:46,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:46,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:47,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:47,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:47,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631741753] [2023-11-06 22:23:47,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631741753] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:47,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:47,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:23:47,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484363005] [2023-11-06 22:23:47,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:47,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:23:47,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:47,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:23:47,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:23:47,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 249 [2023-11-06 22:23:47,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:47,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:47,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 249 [2023-11-06 22:23:47,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:48,851 INFO L124 PetriNetUnfolderBase]: 5879/8497 cut-off events. [2023-11-06 22:23:48,851 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-11-06 22:23:48,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16641 conditions, 8497 events. 5879/8497 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 50100 event pairs, 1079 based on Foata normal form. 0/8107 useless extension candidates. Maximal degree in co-relation 16629. Up to 6367 conditions per place. [2023-11-06 22:23:48,932 INFO L140 encePairwiseOnDemand]: 245/249 looper letters, 43 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2023-11-06 22:23:48,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 215 flow [2023-11-06 22:23:48,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:23:48,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:23:48,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-11-06 22:23:48,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5488621151271754 [2023-11-06 22:23:48,949 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-11-06 22:23:48,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-11-06 22:23:48,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:48,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-11-06 22:23:48,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:48,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:48,965 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:48,967 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 410 transitions. [2023-11-06 22:23:48,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 215 flow [2023-11-06 22:23:48,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 208 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:23:48,975 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-11-06 22:23:48,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-11-06 22:23:48,981 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-11-06 22:23:48,981 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-11-06 22:23:48,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:48,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:48,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:48,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:23:48,983 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:23:48,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:48,984 INFO L85 PathProgramCache]: Analyzing trace with hash -2075769954, now seen corresponding path program 1 times [2023-11-06 22:23:48,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:48,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409610871] [2023-11-06 22:23:48,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:48,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:49,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:49,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:49,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409610871] [2023-11-06 22:23:49,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409610871] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:49,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:49,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:23:49,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53525141] [2023-11-06 22:23:49,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:49,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:23:49,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:49,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:23:49,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:23:49,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 249 [2023-11-06 22:23:49,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:49,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:49,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 249 [2023-11-06 22:23:49,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:52,328 INFO L124 PetriNetUnfolderBase]: 14433/19638 cut-off events. [2023-11-06 22:23:52,329 INFO L125 PetriNetUnfolderBase]: For 657/657 co-relation queries the response was YES. [2023-11-06 22:23:52,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40412 conditions, 19638 events. 14433/19638 cut-off events. For 657/657 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 101965 event pairs, 5265 based on Foata normal form. 458/20096 useless extension candidates. Maximal degree in co-relation 40402. Up to 13647 conditions per place. [2023-11-06 22:23:52,500 INFO L140 encePairwiseOnDemand]: 241/249 looper letters, 44 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2023-11-06 22:23:52,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 51 transitions, 222 flow [2023-11-06 22:23:52,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:23:52,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:23:52,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2023-11-06 22:23:52,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5153949129852744 [2023-11-06 22:23:52,507 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2023-11-06 22:23:52,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2023-11-06 22:23:52,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:52,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2023-11-06 22:23:52,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:52,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:52,520 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:52,520 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 385 transitions. [2023-11-06 22:23:52,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 51 transitions, 222 flow [2023-11-06 22:23:52,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:23:52,525 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 118 flow [2023-11-06 22:23:52,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-11-06 22:23:52,532 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2023-11-06 22:23:52,533 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 118 flow [2023-11-06 22:23:52,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:52,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:52,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:52,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:23:52,534 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:23:52,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:52,538 INFO L85 PathProgramCache]: Analyzing trace with hash 75638730, now seen corresponding path program 1 times [2023-11-06 22:23:52,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:52,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88525124] [2023-11-06 22:23:52,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:52,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:52,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:52,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:52,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88525124] [2023-11-06 22:23:52,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88525124] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:52,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:52,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:23:52,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988115165] [2023-11-06 22:23:52,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:52,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:23:52,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:52,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:23:52,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:23:52,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 249 [2023-11-06 22:23:52,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:52,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:52,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 249 [2023-11-06 22:23:52,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:55,674 INFO L124 PetriNetUnfolderBase]: 13351/18188 cut-off events. [2023-11-06 22:23:55,674 INFO L125 PetriNetUnfolderBase]: For 6666/6666 co-relation queries the response was YES. [2023-11-06 22:23:55,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44457 conditions, 18188 events. 13351/18188 cut-off events. For 6666/6666 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 90137 event pairs, 3910 based on Foata normal form. 230/18418 useless extension candidates. Maximal degree in co-relation 44445. Up to 9003 conditions per place. [2023-11-06 22:23:55,813 INFO L140 encePairwiseOnDemand]: 241/249 looper letters, 54 selfloop transitions, 8 changer transitions 0/62 dead transitions. [2023-11-06 22:23:55,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 320 flow [2023-11-06 22:23:55,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:23:55,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:23:55,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 502 transitions. [2023-11-06 22:23:55,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5040160642570282 [2023-11-06 22:23:55,817 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 502 transitions. [2023-11-06 22:23:55,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 502 transitions. [2023-11-06 22:23:55,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:55,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 502 transitions. [2023-11-06 22:23:55,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:55,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:55,824 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:55,824 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 118 flow. Second operand 4 states and 502 transitions. [2023-11-06 22:23:55,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 320 flow [2023-11-06 22:23:55,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:23:55,883 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 162 flow [2023-11-06 22:23:55,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2023-11-06 22:23:55,885 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-11-06 22:23:55,889 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 162 flow [2023-11-06 22:23:55,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:55,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:55,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:55,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:23:55,891 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:23:55,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:55,891 INFO L85 PathProgramCache]: Analyzing trace with hash -2023104021, now seen corresponding path program 1 times [2023-11-06 22:23:55,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:55,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624948955] [2023-11-06 22:23:55,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:55,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:56,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:56,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:56,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624948955] [2023-11-06 22:23:56,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624948955] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:56,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:56,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:23:56,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405398834] [2023-11-06 22:23:56,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:56,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:23:56,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:56,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:23:56,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:23:56,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 249 [2023-11-06 22:23:56,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:56,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:56,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 249 [2023-11-06 22:23:56,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:59,043 INFO L124 PetriNetUnfolderBase]: 13076/17813 cut-off events. [2023-11-06 22:23:59,043 INFO L125 PetriNetUnfolderBase]: For 11334/11334 co-relation queries the response was YES. [2023-11-06 22:23:59,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46098 conditions, 17813 events. 13076/17813 cut-off events. For 11334/11334 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 91421 event pairs, 3313 based on Foata normal form. 40/17853 useless extension candidates. Maximal degree in co-relation 46083. Up to 11817 conditions per place. [2023-11-06 22:23:59,160 INFO L140 encePairwiseOnDemand]: 241/249 looper letters, 62 selfloop transitions, 16 changer transitions 0/78 dead transitions. [2023-11-06 22:23:59,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 78 transitions, 444 flow [2023-11-06 22:23:59,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:23:59,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:23:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 514 transitions. [2023-11-06 22:23:59,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5160642570281124 [2023-11-06 22:23:59,164 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 514 transitions. [2023-11-06 22:23:59,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 514 transitions. [2023-11-06 22:23:59,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:59,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 514 transitions. [2023-11-06 22:23:59,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:59,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:59,171 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:59,171 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 162 flow. Second operand 4 states and 514 transitions. [2023-11-06 22:23:59,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 78 transitions, 444 flow [2023-11-06 22:23:59,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 78 transitions, 439 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:23:59,192 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 255 flow [2023-11-06 22:23:59,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=255, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2023-11-06 22:23:59,195 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2023-11-06 22:23:59,196 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 255 flow [2023-11-06 22:23:59,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:59,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:59,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:59,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:23:59,198 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:23:59,199 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:59,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1708257543, now seen corresponding path program 1 times [2023-11-06 22:23:59,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:59,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233310345] [2023-11-06 22:23:59,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:59,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:59,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:59,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:59,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233310345] [2023-11-06 22:23:59,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233310345] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:59,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:59,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:23:59,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574887928] [2023-11-06 22:23:59,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:59,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:23:59,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:59,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:23:59,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:23:59,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 249 [2023-11-06 22:23:59,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 255 flow. Second operand has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:59,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:59,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 249 [2023-11-06 22:23:59,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:01,449 INFO L124 PetriNetUnfolderBase]: 8950/12999 cut-off events. [2023-11-06 22:24:01,449 INFO L125 PetriNetUnfolderBase]: For 11163/11762 co-relation queries the response was YES. [2023-11-06 22:24:01,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34625 conditions, 12999 events. 8950/12999 cut-off events. For 11163/11762 co-relation queries the response was YES. Maximal size of possible extension queue 611. Compared 77253 event pairs, 1594 based on Foata normal form. 1185/13832 useless extension candidates. Maximal degree in co-relation 34607. Up to 7989 conditions per place. [2023-11-06 22:24:01,543 INFO L140 encePairwiseOnDemand]: 242/249 looper letters, 88 selfloop transitions, 10 changer transitions 0/110 dead transitions. [2023-11-06 22:24:01,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 110 transitions, 750 flow [2023-11-06 22:24:01,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:24:01,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:24:01,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 631 transitions. [2023-11-06 22:24:01,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5068273092369477 [2023-11-06 22:24:01,550 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 631 transitions. [2023-11-06 22:24:01,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 631 transitions. [2023-11-06 22:24:01,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:01,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 631 transitions. [2023-11-06 22:24:01,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:01,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:01,563 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:01,563 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 255 flow. Second operand 5 states and 631 transitions. [2023-11-06 22:24:01,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 110 transitions, 750 flow [2023-11-06 22:24:01,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 110 transitions, 750 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:24:01,589 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 330 flow [2023-11-06 22:24:01,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=330, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2023-11-06 22:24:01,592 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places. [2023-11-06 22:24:01,593 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 330 flow [2023-11-06 22:24:01,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:01,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:01,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:01,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:24:01,595 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:24:01,596 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:01,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1589289167, now seen corresponding path program 1 times [2023-11-06 22:24:01,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:01,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673118853] [2023-11-06 22:24:01,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:01,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:01,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:01,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:01,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673118853] [2023-11-06 22:24:01,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673118853] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:01,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:01,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:24:01,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791450042] [2023-11-06 22:24:01,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:01,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:24:01,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:01,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:24:01,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:24:01,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 249 [2023-11-06 22:24:01,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 330 flow. Second operand has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:01,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:01,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 249 [2023-11-06 22:24:01,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:04,673 INFO L124 PetriNetUnfolderBase]: 14456/20536 cut-off events. [2023-11-06 22:24:04,673 INFO L125 PetriNetUnfolderBase]: For 31227/31227 co-relation queries the response was YES. [2023-11-06 22:24:04,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70113 conditions, 20536 events. 14456/20536 cut-off events. For 31227/31227 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 117210 event pairs, 4456 based on Foata normal form. 204/20740 useless extension candidates. Maximal degree in co-relation 70090. Up to 11398 conditions per place. [2023-11-06 22:24:04,796 INFO L140 encePairwiseOnDemand]: 243/249 looper letters, 67 selfloop transitions, 11 changer transitions 14/92 dead transitions. [2023-11-06 22:24:04,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 92 transitions, 671 flow [2023-11-06 22:24:04,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:24:04,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:24:04,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 508 transitions. [2023-11-06 22:24:04,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5100401606425703 [2023-11-06 22:24:04,804 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 508 transitions. [2023-11-06 22:24:04,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 508 transitions. [2023-11-06 22:24:04,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:04,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 508 transitions. [2023-11-06 22:24:04,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:04,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:04,816 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:04,816 INFO L175 Difference]: Start difference. First operand has 56 places, 53 transitions, 330 flow. Second operand 4 states and 508 transitions. [2023-11-06 22:24:04,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 92 transitions, 671 flow [2023-11-06 22:24:05,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 92 transitions, 662 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:24:05,062 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 308 flow [2023-11-06 22:24:05,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=308, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2023-11-06 22:24:05,063 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2023-11-06 22:24:05,063 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 308 flow [2023-11-06 22:24:05,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:05,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:05,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:05,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:24:05,065 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:24:05,065 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:05,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1560319193, now seen corresponding path program 1 times [2023-11-06 22:24:05,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:05,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751571937] [2023-11-06 22:24:05,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:05,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:05,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:05,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:05,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751571937] [2023-11-06 22:24:05,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751571937] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:05,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:05,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:24:05,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910696229] [2023-11-06 22:24:05,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:05,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:24:05,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:05,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:24:05,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:24:05,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 249 [2023-11-06 22:24:05,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 308 flow. Second operand has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:05,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:05,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 249 [2023-11-06 22:24:05,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:06,783 INFO L124 PetriNetUnfolderBase]: 5127/7924 cut-off events. [2023-11-06 22:24:06,783 INFO L125 PetriNetUnfolderBase]: For 10057/10163 co-relation queries the response was YES. [2023-11-06 22:24:06,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25789 conditions, 7924 events. 5127/7924 cut-off events. For 10057/10163 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 47779 event pairs, 896 based on Foata normal form. 777/8522 useless extension candidates. Maximal degree in co-relation 25764. Up to 2801 conditions per place. [2023-11-06 22:24:06,833 INFO L140 encePairwiseOnDemand]: 242/249 looper letters, 105 selfloop transitions, 14 changer transitions 0/129 dead transitions. [2023-11-06 22:24:06,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 129 transitions, 1004 flow [2023-11-06 22:24:06,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:24:06,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:24:06,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 760 transitions. [2023-11-06 22:24:06,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5087014725568942 [2023-11-06 22:24:06,838 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 760 transitions. [2023-11-06 22:24:06,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 760 transitions. [2023-11-06 22:24:06,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:06,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 760 transitions. [2023-11-06 22:24:06,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:06,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:06,848 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:06,848 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 308 flow. Second operand 6 states and 760 transitions. [2023-11-06 22:24:06,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 129 transitions, 1004 flow [2023-11-06 22:24:06,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 129 transitions, 925 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-11-06 22:24:06,909 INFO L231 Difference]: Finished difference. Result has 62 places, 55 transitions, 389 flow [2023-11-06 22:24:06,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=389, PETRI_PLACES=62, PETRI_TRANSITIONS=55} [2023-11-06 22:24:06,910 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2023-11-06 22:24:06,910 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 389 flow [2023-11-06 22:24:06,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:06,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:06,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:06,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:24:06,912 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:24:06,912 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:06,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1326392412, now seen corresponding path program 1 times [2023-11-06 22:24:06,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:06,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659193396] [2023-11-06 22:24:06,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:06,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:07,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:07,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:07,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659193396] [2023-11-06 22:24:07,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659193396] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:07,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:07,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:24:07,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914207709] [2023-11-06 22:24:07,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:07,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:24:07,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:07,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:24:07,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:24:07,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 249 [2023-11-06 22:24:07,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 389 flow. Second operand has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:07,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:07,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 249 [2023-11-06 22:24:07,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:08,778 INFO L124 PetriNetUnfolderBase]: 4576/7087 cut-off events. [2023-11-06 22:24:08,778 INFO L125 PetriNetUnfolderBase]: For 10756/10824 co-relation queries the response was YES. [2023-11-06 22:24:08,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26617 conditions, 7087 events. 4576/7087 cut-off events. For 10756/10824 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 42427 event pairs, 753 based on Foata normal form. 301/7216 useless extension candidates. Maximal degree in co-relation 26590. Up to 2618 conditions per place. [2023-11-06 22:24:08,820 INFO L140 encePairwiseOnDemand]: 242/249 looper letters, 117 selfloop transitions, 23 changer transitions 14/164 dead transitions. [2023-11-06 22:24:08,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 164 transitions, 1277 flow [2023-11-06 22:24:08,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:24:08,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:24:08,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1013 transitions. [2023-11-06 22:24:08,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5085341365461847 [2023-11-06 22:24:08,826 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1013 transitions. [2023-11-06 22:24:08,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1013 transitions. [2023-11-06 22:24:08,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:08,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1013 transitions. [2023-11-06 22:24:08,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.625) internal successors, (1013), 8 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:08,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 249.0) internal successors, (2241), 9 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:08,837 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 249.0) internal successors, (2241), 9 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:08,837 INFO L175 Difference]: Start difference. First operand has 62 places, 55 transitions, 389 flow. Second operand 8 states and 1013 transitions. [2023-11-06 22:24:08,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 164 transitions, 1277 flow [2023-11-06 22:24:09,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 164 transitions, 1221 flow, removed 18 selfloop flow, removed 3 redundant places. [2023-11-06 22:24:09,298 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 505 flow [2023-11-06 22:24:09,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=505, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2023-11-06 22:24:09,299 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places. [2023-11-06 22:24:09,300 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 505 flow [2023-11-06 22:24:09,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:09,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:09,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:09,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:24:09,301 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:24:09,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:09,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1791544964, now seen corresponding path program 1 times [2023-11-06 22:24:09,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:09,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634942833] [2023-11-06 22:24:09,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:09,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:10,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:10,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:10,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634942833] [2023-11-06 22:24:10,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634942833] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:10,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:10,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:24:10,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375576416] [2023-11-06 22:24:10,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:10,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:24:10,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:10,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:24:10,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:24:10,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 249 [2023-11-06 22:24:10,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 505 flow. Second operand has 7 states, 7 states have (on average 118.14285714285714) internal successors, (827), 7 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:10,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:10,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 249 [2023-11-06 22:24:10,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:12,135 INFO L124 PetriNetUnfolderBase]: 7317/11723 cut-off events. [2023-11-06 22:24:12,135 INFO L125 PetriNetUnfolderBase]: For 34699/34741 co-relation queries the response was YES. [2023-11-06 22:24:12,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47672 conditions, 11723 events. 7317/11723 cut-off events. For 34699/34741 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 81108 event pairs, 1170 based on Foata normal form. 41/11625 useless extension candidates. Maximal degree in co-relation 47643. Up to 3898 conditions per place. [2023-11-06 22:24:12,213 INFO L140 encePairwiseOnDemand]: 242/249 looper letters, 128 selfloop transitions, 7 changer transitions 73/218 dead transitions. [2023-11-06 22:24:12,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 218 transitions, 2213 flow [2023-11-06 22:24:12,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:24:12,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:24:12,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 894 transitions. [2023-11-06 22:24:12,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5129087779690189 [2023-11-06 22:24:12,218 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 894 transitions. [2023-11-06 22:24:12,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 894 transitions. [2023-11-06 22:24:12,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:12,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 894 transitions. [2023-11-06 22:24:12,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.71428571428571) internal successors, (894), 7 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:12,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:12,227 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:12,227 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 505 flow. Second operand 7 states and 894 transitions. [2023-11-06 22:24:12,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 218 transitions, 2213 flow [2023-11-06 22:24:13,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 218 transitions, 1760 flow, removed 183 selfloop flow, removed 4 redundant places. [2023-11-06 22:24:13,679 INFO L231 Difference]: Finished difference. Result has 74 places, 69 transitions, 467 flow [2023-11-06 22:24:13,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=467, PETRI_PLACES=74, PETRI_TRANSITIONS=69} [2023-11-06 22:24:13,680 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places. [2023-11-06 22:24:13,680 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 69 transitions, 467 flow [2023-11-06 22:24:13,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 118.14285714285714) internal successors, (827), 7 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:13,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:13,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:13,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:24:13,682 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:24:13,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:13,682 INFO L85 PathProgramCache]: Analyzing trace with hash 953437698, now seen corresponding path program 2 times [2023-11-06 22:24:13,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:13,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513162582] [2023-11-06 22:24:13,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:13,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:14,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:14,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:14,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513162582] [2023-11-06 22:24:14,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513162582] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:14,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:14,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:24:14,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477546310] [2023-11-06 22:24:14,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:14,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:24:14,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:14,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:24:14,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:24:14,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 249 [2023-11-06 22:24:14,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 69 transitions, 467 flow. Second operand has 7 states, 7 states have (on average 114.14285714285714) internal successors, (799), 7 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:14,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:14,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 249 [2023-11-06 22:24:14,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:15,414 INFO L124 PetriNetUnfolderBase]: 5749/9138 cut-off events. [2023-11-06 22:24:15,414 INFO L125 PetriNetUnfolderBase]: For 16021/16145 co-relation queries the response was YES. [2023-11-06 22:24:15,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34376 conditions, 9138 events. 5749/9138 cut-off events. For 16021/16145 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 60097 event pairs, 722 based on Foata normal form. 157/9128 useless extension candidates. Maximal degree in co-relation 34349. Up to 2083 conditions per place. [2023-11-06 22:24:15,487 INFO L140 encePairwiseOnDemand]: 242/249 looper letters, 120 selfloop transitions, 28 changer transitions 27/183 dead transitions. [2023-11-06 22:24:15,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 183 transitions, 1442 flow [2023-11-06 22:24:15,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:24:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 22:24:15,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1236 transitions. [2023-11-06 22:24:15,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4963855421686747 [2023-11-06 22:24:15,493 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1236 transitions. [2023-11-06 22:24:15,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1236 transitions. [2023-11-06 22:24:15,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:15,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1236 transitions. [2023-11-06 22:24:15,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 123.6) internal successors, (1236), 10 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:15,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 249.0) internal successors, (2739), 11 states have internal predecessors, (2739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:15,505 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 249.0) internal successors, (2739), 11 states have internal predecessors, (2739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:15,505 INFO L175 Difference]: Start difference. First operand has 74 places, 69 transitions, 467 flow. Second operand 10 states and 1236 transitions. [2023-11-06 22:24:15,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 183 transitions, 1442 flow [2023-11-06 22:24:16,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 183 transitions, 1423 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-06 22:24:16,091 INFO L231 Difference]: Finished difference. Result has 81 places, 65 transitions, 499 flow [2023-11-06 22:24:16,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=499, PETRI_PLACES=81, PETRI_TRANSITIONS=65} [2023-11-06 22:24:16,092 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places. [2023-11-06 22:24:16,092 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 65 transitions, 499 flow [2023-11-06 22:24:16,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.14285714285714) internal successors, (799), 7 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:16,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:16,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:16,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:24:16,093 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:24:16,094 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:16,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1736655694, now seen corresponding path program 1 times [2023-11-06 22:24:16,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:16,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713759516] [2023-11-06 22:24:16,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:16,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:16,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:16,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:16,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713759516] [2023-11-06 22:24:16,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713759516] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:16,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:16,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:24:16,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998016790] [2023-11-06 22:24:16,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:16,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:24:16,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:16,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:24:16,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:24:16,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 249 [2023-11-06 22:24:16,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 65 transitions, 499 flow. Second operand has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:16,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:16,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 249 [2023-11-06 22:24:16,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:17,526 INFO L124 PetriNetUnfolderBase]: 5300/8125 cut-off events. [2023-11-06 22:24:17,526 INFO L125 PetriNetUnfolderBase]: For 23134/23134 co-relation queries the response was YES. [2023-11-06 22:24:17,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34852 conditions, 8125 events. 5300/8125 cut-off events. For 23134/23134 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 46703 event pairs, 739 based on Foata normal form. 1/8126 useless extension candidates. Maximal degree in co-relation 34818. Up to 3407 conditions per place. [2023-11-06 22:24:17,573 INFO L140 encePairwiseOnDemand]: 241/249 looper letters, 88 selfloop transitions, 13 changer transitions 90/191 dead transitions. [2023-11-06 22:24:17,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 191 transitions, 1833 flow [2023-11-06 22:24:17,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:24:17,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:24:17,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 741 transitions. [2023-11-06 22:24:17,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4959839357429719 [2023-11-06 22:24:17,577 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 741 transitions. [2023-11-06 22:24:17,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 741 transitions. [2023-11-06 22:24:17,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:17,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 741 transitions. [2023-11-06 22:24:17,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.5) internal successors, (741), 6 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:17,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:17,584 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:17,584 INFO L175 Difference]: Start difference. First operand has 81 places, 65 transitions, 499 flow. Second operand 6 states and 741 transitions. [2023-11-06 22:24:17,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 191 transitions, 1833 flow [2023-11-06 22:24:17,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 191 transitions, 1506 flow, removed 54 selfloop flow, removed 12 redundant places. [2023-11-06 22:24:17,822 INFO L231 Difference]: Finished difference. Result has 75 places, 55 transitions, 343 flow [2023-11-06 22:24:17,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=343, PETRI_PLACES=75, PETRI_TRANSITIONS=55} [2023-11-06 22:24:17,822 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places. [2023-11-06 22:24:17,823 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 55 transitions, 343 flow [2023-11-06 22:24:17,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:17,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:17,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:17,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:24:17,824 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:24:17,824 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:17,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1123303096, now seen corresponding path program 2 times [2023-11-06 22:24:17,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:17,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670853802] [2023-11-06 22:24:17,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:17,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:19,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:19,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:19,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670853802] [2023-11-06 22:24:19,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670853802] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:19,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:19,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:24:19,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384432009] [2023-11-06 22:24:19,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:19,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:24:19,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:19,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:24:19,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:24:19,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 249 [2023-11-06 22:24:19,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 55 transitions, 343 flow. Second operand has 8 states, 8 states have (on average 118.125) internal successors, (945), 8 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:19,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:19,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 249 [2023-11-06 22:24:19,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:20,347 INFO L124 PetriNetUnfolderBase]: 2060/3337 cut-off events. [2023-11-06 22:24:20,347 INFO L125 PetriNetUnfolderBase]: For 6521/6582 co-relation queries the response was YES. [2023-11-06 22:24:20,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12147 conditions, 3337 events. 2060/3337 cut-off events. For 6521/6582 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 18576 event pairs, 264 based on Foata normal form. 46/3340 useless extension candidates. Maximal degree in co-relation 12122. Up to 1722 conditions per place. [2023-11-06 22:24:20,372 INFO L140 encePairwiseOnDemand]: 243/249 looper letters, 111 selfloop transitions, 5 changer transitions 24/148 dead transitions. [2023-11-06 22:24:20,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 148 transitions, 1121 flow [2023-11-06 22:24:20,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:24:20,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:24:20,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 773 transitions. [2023-11-06 22:24:20,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5174029451137885 [2023-11-06 22:24:20,376 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 773 transitions. [2023-11-06 22:24:20,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 773 transitions. [2023-11-06 22:24:20,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:20,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 773 transitions. [2023-11-06 22:24:20,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:20,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:20,383 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:20,383 INFO L175 Difference]: Start difference. First operand has 75 places, 55 transitions, 343 flow. Second operand 6 states and 773 transitions. [2023-11-06 22:24:20,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 148 transitions, 1121 flow [2023-11-06 22:24:20,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 148 transitions, 1071 flow, removed 25 selfloop flow, removed 5 redundant places. [2023-11-06 22:24:20,455 INFO L231 Difference]: Finished difference. Result has 72 places, 58 transitions, 361 flow [2023-11-06 22:24:20,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=361, PETRI_PLACES=72, PETRI_TRANSITIONS=58} [2023-11-06 22:24:20,456 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places. [2023-11-06 22:24:20,456 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 58 transitions, 361 flow [2023-11-06 22:24:20,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 118.125) internal successors, (945), 8 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:20,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:20,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:20,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:24:20,457 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:24:20,458 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:20,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1686830604, now seen corresponding path program 3 times [2023-11-06 22:24:20,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:20,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609568807] [2023-11-06 22:24:20,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:20,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:20,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:20,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:20,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609568807] [2023-11-06 22:24:20,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609568807] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:20,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:20,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:24:20,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231276756] [2023-11-06 22:24:20,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:20,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:24:20,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:20,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:24:20,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:24:20,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 249 [2023-11-06 22:24:20,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 58 transitions, 361 flow. Second operand has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:20,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:20,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 249 [2023-11-06 22:24:20,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:21,403 INFO L124 PetriNetUnfolderBase]: 2723/4384 cut-off events. [2023-11-06 22:24:21,403 INFO L125 PetriNetUnfolderBase]: For 9991/10023 co-relation queries the response was YES. [2023-11-06 22:24:21,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16752 conditions, 4384 events. 2723/4384 cut-off events. For 9991/10023 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 24856 event pairs, 567 based on Foata normal form. 28/4397 useless extension candidates. Maximal degree in co-relation 16728. Up to 2194 conditions per place. [2023-11-06 22:24:21,433 INFO L140 encePairwiseOnDemand]: 246/249 looper letters, 50 selfloop transitions, 1 changer transitions 63/116 dead transitions. [2023-11-06 22:24:21,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 116 transitions, 917 flow [2023-11-06 22:24:21,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:24:21,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:24:21,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 524 transitions. [2023-11-06 22:24:21,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5261044176706827 [2023-11-06 22:24:21,436 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 524 transitions. [2023-11-06 22:24:21,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 524 transitions. [2023-11-06 22:24:21,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:21,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 524 transitions. [2023-11-06 22:24:21,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:21,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:21,441 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:21,441 INFO L175 Difference]: Start difference. First operand has 72 places, 58 transitions, 361 flow. Second operand 4 states and 524 transitions. [2023-11-06 22:24:21,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 116 transitions, 917 flow [2023-11-06 22:24:21,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 116 transitions, 908 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-06 22:24:21,516 INFO L231 Difference]: Finished difference. Result has 73 places, 45 transitions, 248 flow [2023-11-06 22:24:21,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=248, PETRI_PLACES=73, PETRI_TRANSITIONS=45} [2023-11-06 22:24:21,517 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places. [2023-11-06 22:24:21,517 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 45 transitions, 248 flow [2023-11-06 22:24:21,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:21,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:21,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:21,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:24:21,518 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:24:21,519 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:21,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1424641770, now seen corresponding path program 4 times [2023-11-06 22:24:21,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:21,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552417380] [2023-11-06 22:24:21,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:21,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:22,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:22,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:22,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552417380] [2023-11-06 22:24:22,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552417380] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:22,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:22,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:24:22,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749219335] [2023-11-06 22:24:22,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:22,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:24:22,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:22,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:24:22,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:24:22,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 249 [2023-11-06 22:24:22,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 45 transitions, 248 flow. Second operand has 8 states, 8 states have (on average 110.5) internal successors, (884), 8 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:22,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:22,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 249 [2023-11-06 22:24:22,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:23,709 INFO L124 PetriNetUnfolderBase]: 1353/2237 cut-off events. [2023-11-06 22:24:23,709 INFO L125 PetriNetUnfolderBase]: For 4072/4072 co-relation queries the response was YES. [2023-11-06 22:24:23,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8355 conditions, 2237 events. 1353/2237 cut-off events. For 4072/4072 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 11258 event pairs, 144 based on Foata normal form. 1/2238 useless extension candidates. Maximal degree in co-relation 8336. Up to 1008 conditions per place. [2023-11-06 22:24:23,725 INFO L140 encePairwiseOnDemand]: 240/249 looper letters, 79 selfloop transitions, 8 changer transitions 44/131 dead transitions. [2023-11-06 22:24:23,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 131 transitions, 928 flow [2023-11-06 22:24:23,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:24:23,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:24:23,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 947 transitions. [2023-11-06 22:24:23,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47540160642570284 [2023-11-06 22:24:23,729 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 947 transitions. [2023-11-06 22:24:23,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 947 transitions. [2023-11-06 22:24:23,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:23,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 947 transitions. [2023-11-06 22:24:23,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 118.375) internal successors, (947), 8 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:23,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 249.0) internal successors, (2241), 9 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:23,738 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 249.0) internal successors, (2241), 9 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:23,738 INFO L175 Difference]: Start difference. First operand has 73 places, 45 transitions, 248 flow. Second operand 8 states and 947 transitions. [2023-11-06 22:24:23,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 131 transitions, 928 flow [2023-11-06 22:24:23,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 131 transitions, 890 flow, removed 4 selfloop flow, removed 9 redundant places. [2023-11-06 22:24:23,772 INFO L231 Difference]: Finished difference. Result has 71 places, 47 transitions, 263 flow [2023-11-06 22:24:23,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=263, PETRI_PLACES=71, PETRI_TRANSITIONS=47} [2023-11-06 22:24:23,773 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2023-11-06 22:24:23,773 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 47 transitions, 263 flow [2023-11-06 22:24:23,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 110.5) internal successors, (884), 8 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:23,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:23,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:23,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:24:23,775 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:24:23,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:23,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1995015468, now seen corresponding path program 5 times [2023-11-06 22:24:23,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:23,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113651512] [2023-11-06 22:24:23,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:23,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:24:23,857 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:24:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:24:23,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:24:23,995 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:24:23,996 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-06 22:24:23,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-06 22:24:23,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-06 22:24:24,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-06 22:24:24,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-06 22:24:24,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-06 22:24:24,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-06 22:24:24,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:24:24,001 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:24,013 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:24:24,013 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:24:24,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:24:24 BasicIcfg [2023-11-06 22:24:24,151 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:24:24,152 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:24:24,152 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:24:24,152 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:24:24,153 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:23:40" (3/4) ... [2023-11-06 22:24:24,154 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 22:24:24,286 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbe6ba1f-8f51-4dbb-b820-c70912138468/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:24:24,286 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:24:24,287 INFO L158 Benchmark]: Toolchain (without parser) took 45187.71ms. Allocated memory was 138.4MB in the beginning and 4.6GB in the end (delta: 4.5GB). Free memory was 77.3MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2023-11-06 22:24:24,287 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 138.4MB. Free memory is still 113.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:24:24,290 INFO L158 Benchmark]: CACSL2BoogieTranslator took 739.35ms. Allocated memory was 138.4MB in the beginning and 203.4MB in the end (delta: 65.0MB). Free memory was 77.1MB in the beginning and 160.5MB in the end (delta: -83.3MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2023-11-06 22:24:24,291 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.14ms. Allocated memory is still 203.4MB. Free memory was 160.5MB in the beginning and 157.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:24:24,291 INFO L158 Benchmark]: Boogie Preprocessor took 75.23ms. Allocated memory is still 203.4MB. Free memory was 157.6MB in the beginning and 155.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:24:24,292 INFO L158 Benchmark]: RCFGBuilder took 932.14ms. Allocated memory is still 203.4MB. Free memory was 155.3MB in the beginning and 114.8MB in the end (delta: 40.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2023-11-06 22:24:24,292 INFO L158 Benchmark]: TraceAbstraction took 43211.69ms. Allocated memory was 203.4MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 114.3MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2023-11-06 22:24:24,293 INFO L158 Benchmark]: Witness Printer took 134.38ms. Allocated memory is still 4.6GB. Free memory was 2.8GB in the beginning and 2.8GB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:24:24,296 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.32ms. Allocated memory is still 138.4MB. Free memory is still 113.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 739.35ms. Allocated memory was 138.4MB in the beginning and 203.4MB in the end (delta: 65.0MB). Free memory was 77.1MB in the beginning and 160.5MB in the end (delta: -83.3MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.14ms. Allocated memory is still 203.4MB. Free memory was 160.5MB in the beginning and 157.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.23ms. Allocated memory is still 203.4MB. Free memory was 157.6MB in the beginning and 155.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 932.14ms. Allocated memory is still 203.4MB. Free memory was 155.3MB in the beginning and 114.8MB in the end (delta: 40.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 43211.69ms. Allocated memory was 203.4MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 114.3MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 134.38ms. Allocated memory is still 4.6GB. Free memory was 2.8GB in the beginning and 2.8GB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 143 PlacesBefore, 43 PlacesAfterwards, 132 TransitionsBefore, 31 TransitionsAfterwards, 3518 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 113 TotalNumberOfCompositions, 9381 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3815, independent: 3567, independent conditional: 0, independent unconditional: 3567, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1897, independent: 1846, independent conditional: 0, independent unconditional: 1846, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3815, independent: 1721, independent conditional: 0, independent unconditional: 1721, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 1897, unknown conditional: 0, unknown unconditional: 1897] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 149, Positive conditional cache size: 0, Positive unconditional cache size: 149, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t969; [L872] FCALL, FORK 0 pthread_create(&t969, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t969, ((void *)0), P0, ((void *)0))=-3, t969={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t970; [L874] FCALL, FORK 0 pthread_create(&t970, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t970, ((void *)0), P1, ((void *)0))=-2, t969={5:0}, t970={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t971; [L876] FCALL, FORK 0 pthread_create(&t971, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t971, ((void *)0), P2, ((void *)0))=-1, t969={5:0}, t970={6:0}, t971={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t972; [L878] FCALL, FORK 0 pthread_create(&t972, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t972, ((void *)0), P3, ((void *)0))=0, t969={5:0}, t970={6:0}, t971={7:0}, t972={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L824] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t969={5:0}, t970={6:0}, t971={7:0}, t972={3:0}, weak$$choice2=0, x=2, y=1, z=1] [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] - 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: 876]: 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: 872]: 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: 878]: 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: 874]: 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 9 procedures, 174 locations, 7 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: 42.8s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 29.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 964 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 816 mSDsluCounter, 424 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 379 mSDsCounter, 148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2408 IncrementalHoareTripleChecker+Invalid, 2556 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 148 mSolverCounterUnsat, 45 mSDtfsCounter, 2408 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=505occurred in iteration=8, InterpolantAutomatonStates: 78, 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, 6.7s InterpolantComputationTime, 295 NumberOfCodeBlocks, 295 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 253 ConstructedInterpolants, 0 QuantifiedInterpolants, 2456 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 RESULT: Ultimate proved your program to be incorrect! [2023-11-06 22:24:24,337 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbe6ba1f-8f51-4dbb-b820-c70912138468/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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