./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 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_cdf90414-2185-4b35-8e0e-fbb5ad24035d/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdf90414-2185-4b35-8e0e-fbb5ad24035d/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdf90414-2185-4b35-8e0e-fbb5ad24035d/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdf90414-2185-4b35-8e0e-fbb5ad24035d/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdf90414-2185-4b35-8e0e-fbb5ad24035d/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdf90414-2185-4b35-8e0e-fbb5ad24035d/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:18:37,457 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:18:37,573 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdf90414-2185-4b35-8e0e-fbb5ad24035d/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:18:37,581 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:18:37,582 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:18:37,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:18:37,620 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:18:37,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:18:37,622 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:18:37,627 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:18:37,628 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:18:37,629 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:18:37,629 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:18:37,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:18:37,632 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:18:37,632 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:18:37,633 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:18:37,633 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:18:37,633 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:18:37,634 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:18:37,634 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:18:37,635 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:18:37,635 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:18:37,636 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:18:37,636 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:18:37,637 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:18:37,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:18:37,638 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:18:37,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:18:37,639 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:18:37,640 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:18:37,640 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:18:37,654 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:18:37,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:18:37,656 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:18:37,656 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:18:37,657 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:18:37,657 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:18:37,657 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:18:37,657 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_cdf90414-2185-4b35-8e0e-fbb5ad24035d/bin/uautomizer-verify-uTZkv6EMXl/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_cdf90414-2185-4b35-8e0e-fbb5ad24035d/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 [2023-11-12 02:18:37,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:18:37,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:18:37,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:18:37,975 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:18:37,975 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:18:37,977 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdf90414-2185-4b35-8e0e-fbb5ad24035d/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2023-11-12 02:18:41,138 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:18:41,420 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:18:41,421 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdf90414-2185-4b35-8e0e-fbb5ad24035d/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2023-11-12 02:18:41,446 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdf90414-2185-4b35-8e0e-fbb5ad24035d/bin/uautomizer-verify-uTZkv6EMXl/data/c2471aeca/ea125c5bbe6847d3a6c44ee5262d419d/FLAG10a8d6847 [2023-11-12 02:18:41,467 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdf90414-2185-4b35-8e0e-fbb5ad24035d/bin/uautomizer-verify-uTZkv6EMXl/data/c2471aeca/ea125c5bbe6847d3a6c44ee5262d419d [2023-11-12 02:18:41,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:18:41,477 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:18:41,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:18:41,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:18:41,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:18:41,489 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:18:41" (1/1) ... [2023-11-12 02:18:41,490 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71d64223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:41, skipping insertion in model container [2023-11-12 02:18:41,490 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:18:41" (1/1) ... [2023-11-12 02:18:41,543 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:18:41,719 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_cdf90414-2185-4b35-8e0e-fbb5ad24035d/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2023-11-12 02:18:41,931 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:18:41,943 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:18:41,956 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_cdf90414-2185-4b35-8e0e-fbb5ad24035d/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2023-11-12 02:18:42,001 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:18:42,037 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:18:42,037 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:18:42,045 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:18:42,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:42 WrapperNode [2023-11-12 02:18:42,046 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:18:42,048 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:18:42,048 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:18:42,048 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:18:42,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:42" (1/1) ... [2023-11-12 02:18:42,072 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:42" (1/1) ... [2023-11-12 02:18:42,105 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2023-11-12 02:18:42,105 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:18:42,106 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:18:42,106 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:18:42,107 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:18:42,117 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:42" (1/1) ... [2023-11-12 02:18:42,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:42" (1/1) ... [2023-11-12 02:18:42,121 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:42" (1/1) ... [2023-11-12 02:18:42,121 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:42" (1/1) ... [2023-11-12 02:18:42,131 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:42" (1/1) ... [2023-11-12 02:18:42,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:42" (1/1) ... [2023-11-12 02:18:42,136 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:42" (1/1) ... [2023-11-12 02:18:42,138 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:42" (1/1) ... [2023-11-12 02:18:42,142 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:18:42,143 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:18:42,143 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:18:42,143 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:18:42,144 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:42" (1/1) ... [2023-11-12 02:18:42,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:18:42,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdf90414-2185-4b35-8e0e-fbb5ad24035d/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:18:42,189 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdf90414-2185-4b35-8e0e-fbb5ad24035d/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:18:42,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdf90414-2185-4b35-8e0e-fbb5ad24035d/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:18:42,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:18:42,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 02:18:42,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:18:42,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:18:42,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:18:42,243 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-12 02:18:42,243 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-12 02:18:42,244 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-12 02:18:42,244 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-12 02:18:42,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:18:42,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 02:18:42,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:18:42,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:18:42,249 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 02:18:42,501 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:18:42,502 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:18:42,883 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:18:43,110 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:18:43,110 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:18:43,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:18:43 BoogieIcfgContainer [2023-11-12 02:18:43,114 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:18:43,118 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:18:43,119 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:18:43,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:18:43,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:18:41" (1/3) ... [2023-11-12 02:18:43,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e9730bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:18:43, skipping insertion in model container [2023-11-12 02:18:43,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:42" (2/3) ... [2023-11-12 02:18:43,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e9730bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:18:43, skipping insertion in model container [2023-11-12 02:18:43,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:18:43" (3/3) ... [2023-11-12 02:18:43,128 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2023-11-12 02:18:43,137 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-12 02:18:43,150 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:18:43,150 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-12 02:18:43,150 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:18:43,218 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-12 02:18:43,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 186 flow [2023-11-12 02:18:43,333 INFO L124 PetriNetUnfolderBase]: 2/87 cut-off events. [2023-11-12 02:18:43,334 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:18:43,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2023-11-12 02:18:43,340 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 89 transitions, 186 flow [2023-11-12 02:18:43,345 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 87 transitions, 180 flow [2023-11-12 02:18:43,350 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:18:43,370 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 87 transitions, 180 flow [2023-11-12 02:18:43,380 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 87 transitions, 180 flow [2023-11-12 02:18:43,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 180 flow [2023-11-12 02:18:43,431 INFO L124 PetriNetUnfolderBase]: 2/87 cut-off events. [2023-11-12 02:18:43,432 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:18:43,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2023-11-12 02:18:43,434 INFO L119 LiptonReduction]: Number of co-enabled transitions 1140 [2023-11-12 02:18:47,444 INFO L134 LiptonReduction]: Checked pairs total: 2918 [2023-11-12 02:18:47,445 INFO L136 LiptonReduction]: Total number of compositions: 79 [2023-11-12 02:18:47,461 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:18:47,468 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6c5d8710, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:18:47,468 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-12 02:18:47,472 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-12 02:18:47,473 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-11-12 02:18:47,473 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:18:47,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:18:47,474 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 02:18:47,474 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:18:47,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:47,480 INFO L85 PathProgramCache]: Analyzing trace with hash 390806069, now seen corresponding path program 1 times [2023-11-12 02:18:47,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:47,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731304546] [2023-11-12 02:18:47,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:47,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:48,015 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-12 02:18:48,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:48,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731304546] [2023-11-12 02:18:48,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731304546] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:48,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:48,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:18:48,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152825129] [2023-11-12 02:18:48,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:48,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:18:48,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:48,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:18:48,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:18:48,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 168 [2023-11-12 02:18:48,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:48,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:18:48,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 168 [2023-11-12 02:18:48,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:18:48,303 INFO L124 PetriNetUnfolderBase]: 135/265 cut-off events. [2023-11-12 02:18:48,304 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-12 02:18:48,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 265 events. 135/265 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1114 event pairs, 21 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 509. Up to 187 conditions per place. [2023-11-12 02:18:48,311 INFO L140 encePairwiseOnDemand]: 164/168 looper letters, 19 selfloop transitions, 2 changer transitions 2/25 dead transitions. [2023-11-12 02:18:48,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 25 transitions, 102 flow [2023-11-12 02:18:48,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:18:48,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:18:48,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2023-11-12 02:18:48,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5099206349206349 [2023-11-12 02:18:48,338 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 257 transitions. [2023-11-12 02:18:48,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 257 transitions. [2023-11-12 02:18:48,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:18:48,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 257 transitions. [2023-11-12 02:18:48,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:48,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:48,357 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:48,359 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 44 flow. Second operand 3 states and 257 transitions. [2023-11-12 02:18:48,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 25 transitions, 102 flow [2023-11-12 02:18:48,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 25 transitions, 100 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:18:48,365 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 40 flow [2023-11-12 02:18:48,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2023-11-12 02:18:48,371 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2023-11-12 02:18:48,372 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 40 flow [2023-11-12 02:18:48,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:48,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:18:48,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:18:48,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:18:48,373 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:18:48,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:48,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1151048877, now seen corresponding path program 1 times [2023-11-12 02:18:48,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:48,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522347134] [2023-11-12 02:18:48,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:48,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:49,096 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-12 02:18:49,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:49,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522347134] [2023-11-12 02:18:49,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522347134] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:49,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:49,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:18:49,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461439414] [2023-11-12 02:18:49,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:49,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:18:49,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:49,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:18:49,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:18:49,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 168 [2023-11-12 02:18:49,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 40 flow. Second operand has 5 states, 5 states have (on average 70.6) internal successors, (353), 5 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:49,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:18:49,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 168 [2023-11-12 02:18:49,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:18:49,543 INFO L124 PetriNetUnfolderBase]: 173/330 cut-off events. [2023-11-12 02:18:49,543 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-12 02:18:49,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 330 events. 173/330 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1373 event pairs, 50 based on Foata normal form. 23/353 useless extension candidates. Maximal degree in co-relation 673. Up to 235 conditions per place. [2023-11-12 02:18:49,553 INFO L140 encePairwiseOnDemand]: 160/168 looper letters, 21 selfloop transitions, 8 changer transitions 16/46 dead transitions. [2023-11-12 02:18:49,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 46 transitions, 198 flow [2023-11-12 02:18:49,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:18:49,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:18:49,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 531 transitions. [2023-11-12 02:18:49,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45153061224489793 [2023-11-12 02:18:49,560 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 531 transitions. [2023-11-12 02:18:49,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 531 transitions. [2023-11-12 02:18:49,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:18:49,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 531 transitions. [2023-11-12 02:18:49,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 75.85714285714286) internal successors, (531), 7 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:49,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 168.0) internal successors, (1344), 8 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:49,574 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 168.0) internal successors, (1344), 8 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:49,575 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 40 flow. Second operand 7 states and 531 transitions. [2023-11-12 02:18:49,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 46 transitions, 198 flow [2023-11-12 02:18:49,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 46 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:18:49,578 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 95 flow [2023-11-12 02:18:49,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=95, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-11-12 02:18:49,580 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 7 predicate places. [2023-11-12 02:18:49,581 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 95 flow [2023-11-12 02:18:49,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.6) internal successors, (353), 5 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:49,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:18:49,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:18:49,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:18:49,588 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:18:49,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:49,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1322755991, now seen corresponding path program 1 times [2023-11-12 02:18:49,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:49,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976567356] [2023-11-12 02:18:49,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:49,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:50,003 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-12 02:18:50,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:50,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976567356] [2023-11-12 02:18:50,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976567356] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:50,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:50,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:18:50,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034801025] [2023-11-12 02:18:50,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:50,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:18:50,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:50,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:18:50,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:18:50,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 168 [2023-11-12 02:18:50,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:50,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:18:50,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 168 [2023-11-12 02:18:50,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:18:50,225 INFO L124 PetriNetUnfolderBase]: 192/359 cut-off events. [2023-11-12 02:18:50,225 INFO L125 PetriNetUnfolderBase]: For 351/357 co-relation queries the response was YES. [2023-11-12 02:18:50,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1101 conditions, 359 events. 192/359 cut-off events. For 351/357 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1427 event pairs, 74 based on Foata normal form. 24/383 useless extension candidates. Maximal degree in co-relation 1086. Up to 295 conditions per place. [2023-11-12 02:18:50,231 INFO L140 encePairwiseOnDemand]: 163/168 looper letters, 24 selfloop transitions, 3 changer transitions 11/40 dead transitions. [2023-11-12 02:18:50,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 40 transitions, 232 flow [2023-11-12 02:18:50,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:18:50,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:18:50,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 403 transitions. [2023-11-12 02:18:50,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4797619047619048 [2023-11-12 02:18:50,234 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 403 transitions. [2023-11-12 02:18:50,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 403 transitions. [2023-11-12 02:18:50,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:18:50,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 403 transitions. [2023-11-12 02:18:50,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 80.6) internal successors, (403), 5 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:50,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 168.0) internal successors, (1008), 6 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:50,240 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 168.0) internal successors, (1008), 6 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:50,240 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 95 flow. Second operand 5 states and 403 transitions. [2023-11-12 02:18:50,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 40 transitions, 232 flow [2023-11-12 02:18:50,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 40 transitions, 228 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-12 02:18:50,246 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 118 flow [2023-11-12 02:18:50,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2023-11-12 02:18:50,248 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 9 predicate places. [2023-11-12 02:18:50,252 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 118 flow [2023-11-12 02:18:50,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:50,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:18:50,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:18:50,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:18:50,254 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:18:50,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:50,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1241810952, now seen corresponding path program 1 times [2023-11-12 02:18:50,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:50,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087717233] [2023-11-12 02:18:50,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:50,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:50,534 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-12 02:18:50,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:50,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087717233] [2023-11-12 02:18:50,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087717233] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:50,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:50,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:18:50,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774393999] [2023-11-12 02:18:50,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:50,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:18:50,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:50,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:18:50,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:18:50,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 168 [2023-11-12 02:18:50,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 76.0) internal successors, (380), 5 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:50,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:18:50,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 168 [2023-11-12 02:18:50,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:18:50,744 INFO L124 PetriNetUnfolderBase]: 190/357 cut-off events. [2023-11-12 02:18:50,744 INFO L125 PetriNetUnfolderBase]: For 445/447 co-relation queries the response was YES. [2023-11-12 02:18:50,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 357 events. 190/357 cut-off events. For 445/447 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1413 event pairs, 24 based on Foata normal form. 16/373 useless extension candidates. Maximal degree in co-relation 1205. Up to 259 conditions per place. [2023-11-12 02:18:50,748 INFO L140 encePairwiseOnDemand]: 161/168 looper letters, 28 selfloop transitions, 7 changer transitions 10/47 dead transitions. [2023-11-12 02:18:50,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 315 flow [2023-11-12 02:18:50,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:18:50,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-12 02:18:50,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 483 transitions. [2023-11-12 02:18:50,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2023-11-12 02:18:50,752 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 483 transitions. [2023-11-12 02:18:50,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 483 transitions. [2023-11-12 02:18:50,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:18:50,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 483 transitions. [2023-11-12 02:18:50,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 80.5) internal successors, (483), 6 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:50,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 168.0) internal successors, (1176), 7 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:50,759 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 168.0) internal successors, (1176), 7 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:50,759 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 118 flow. Second operand 6 states and 483 transitions. [2023-11-12 02:18:50,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 315 flow [2023-11-12 02:18:50,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 47 transitions, 308 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-12 02:18:50,768 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 157 flow [2023-11-12 02:18:50,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=157, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2023-11-12 02:18:50,770 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 13 predicate places. [2023-11-12 02:18:50,771 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 157 flow [2023-11-12 02:18:50,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.0) internal successors, (380), 5 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:50,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:18:50,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:18:50,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:18:50,772 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:18:50,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:50,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1239937002, now seen corresponding path program 2 times [2023-11-12 02:18:50,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:50,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560934705] [2023-11-12 02:18:50,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:50,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:51,397 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-12 02:18:51,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:51,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560934705] [2023-11-12 02:18:51,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560934705] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:51,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:51,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:18:51,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868431273] [2023-11-12 02:18:51,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:51,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:18:51,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:51,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:18:51,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:18:51,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 168 [2023-11-12 02:18:51,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 76.0) internal successors, (380), 5 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:51,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:18:51,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 168 [2023-11-12 02:18:51,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:18:51,636 INFO L124 PetriNetUnfolderBase]: 201/373 cut-off events. [2023-11-12 02:18:51,636 INFO L125 PetriNetUnfolderBase]: For 808/816 co-relation queries the response was YES. [2023-11-12 02:18:51,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1427 conditions, 373 events. 201/373 cut-off events. For 808/816 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1521 event pairs, 88 based on Foata normal form. 23/393 useless extension candidates. Maximal degree in co-relation 1406. Up to 273 conditions per place. [2023-11-12 02:18:51,640 INFO L140 encePairwiseOnDemand]: 162/168 looper letters, 28 selfloop transitions, 8 changer transitions 13/51 dead transitions. [2023-11-12 02:18:51,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 51 transitions, 388 flow [2023-11-12 02:18:51,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:18:51,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-12 02:18:51,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 480 transitions. [2023-11-12 02:18:51,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2023-11-12 02:18:51,643 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 480 transitions. [2023-11-12 02:18:51,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 480 transitions. [2023-11-12 02:18:51,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:18:51,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 480 transitions. [2023-11-12 02:18:51,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:51,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 168.0) internal successors, (1176), 7 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:51,648 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 168.0) internal successors, (1176), 7 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:51,649 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 157 flow. Second operand 6 states and 480 transitions. [2023-11-12 02:18:51,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 51 transitions, 388 flow [2023-11-12 02:18:51,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 51 transitions, 363 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-11-12 02:18:51,653 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 199 flow [2023-11-12 02:18:51,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=199, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2023-11-12 02:18:51,656 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 16 predicate places. [2023-11-12 02:18:51,656 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 199 flow [2023-11-12 02:18:51,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.0) internal successors, (380), 5 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:51,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:18:51,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:18:51,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:18:51,657 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:18:51,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:51,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1201685358, now seen corresponding path program 1 times [2023-11-12 02:18:51,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:51,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852544666] [2023-11-12 02:18:51,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:51,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:52,238 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-12 02:18:52,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:52,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852544666] [2023-11-12 02:18:52,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852544666] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:52,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:52,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:18:52,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560861089] [2023-11-12 02:18:52,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:52,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:18:52,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:52,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:18:52,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:18:52,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 168 [2023-11-12 02:18:52,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 76.0) internal successors, (380), 5 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:52,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:18:52,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 168 [2023-11-12 02:18:52,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:18:52,500 INFO L124 PetriNetUnfolderBase]: 212/398 cut-off events. [2023-11-12 02:18:52,500 INFO L125 PetriNetUnfolderBase]: For 1226/1235 co-relation queries the response was YES. [2023-11-12 02:18:52,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1753 conditions, 398 events. 212/398 cut-off events. For 1226/1235 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1653 event pairs, 64 based on Foata normal form. 30/428 useless extension candidates. Maximal degree in co-relation 1730. Up to 298 conditions per place. [2023-11-12 02:18:52,505 INFO L140 encePairwiseOnDemand]: 160/168 looper letters, 38 selfloop transitions, 10 changer transitions 17/67 dead transitions. [2023-11-12 02:18:52,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 67 transitions, 593 flow [2023-11-12 02:18:52,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:18:52,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-12 02:18:52,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 485 transitions. [2023-11-12 02:18:52,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48115079365079366 [2023-11-12 02:18:52,509 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 485 transitions. [2023-11-12 02:18:52,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 485 transitions. [2023-11-12 02:18:52,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:18:52,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 485 transitions. [2023-11-12 02:18:52,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 80.83333333333333) internal successors, (485), 6 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:52,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 168.0) internal successors, (1176), 7 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:52,514 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 168.0) internal successors, (1176), 7 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:52,514 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 199 flow. Second operand 6 states and 485 transitions. [2023-11-12 02:18:52,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 67 transitions, 593 flow [2023-11-12 02:18:52,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 67 transitions, 569 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-12 02:18:52,522 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 326 flow [2023-11-12 02:18:52,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2023-11-12 02:18:52,524 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 20 predicate places. [2023-11-12 02:18:52,525 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 326 flow [2023-11-12 02:18:52,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.0) internal successors, (380), 5 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:52,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:18:52,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:18:52,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:18:52,526 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:18:52,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:52,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1241845548, now seen corresponding path program 2 times [2023-11-12 02:18:52,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:52,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198033558] [2023-11-12 02:18:52,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:52,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:53,114 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-12 02:18:53,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:53,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198033558] [2023-11-12 02:18:53,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198033558] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:53,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:53,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:18:53,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7026362] [2023-11-12 02:18:53,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:53,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:18:53,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:53,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:18:53,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:18:53,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 168 [2023-11-12 02:18:53,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 326 flow. Second operand has 6 states, 6 states have (on average 71.66666666666667) internal successors, (430), 6 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:53,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:18:53,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 168 [2023-11-12 02:18:53,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:18:53,446 INFO L124 PetriNetUnfolderBase]: 199/378 cut-off events. [2023-11-12 02:18:53,446 INFO L125 PetriNetUnfolderBase]: For 1825/1832 co-relation queries the response was YES. [2023-11-12 02:18:53,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1860 conditions, 378 events. 199/378 cut-off events. For 1825/1832 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1562 event pairs, 67 based on Foata normal form. 25/403 useless extension candidates. Maximal degree in co-relation 1834. Up to 266 conditions per place. [2023-11-12 02:18:53,451 INFO L140 encePairwiseOnDemand]: 161/168 looper letters, 39 selfloop transitions, 20 changer transitions 15/76 dead transitions. [2023-11-12 02:18:53,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 76 transitions, 809 flow [2023-11-12 02:18:53,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:18:53,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:18:53,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 533 transitions. [2023-11-12 02:18:53,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4532312925170068 [2023-11-12 02:18:53,455 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 533 transitions. [2023-11-12 02:18:53,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 533 transitions. [2023-11-12 02:18:53,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:18:53,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 533 transitions. [2023-11-12 02:18:53,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 76.14285714285714) internal successors, (533), 7 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:53,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 168.0) internal successors, (1344), 8 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:53,461 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 168.0) internal successors, (1344), 8 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:53,461 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 326 flow. Second operand 7 states and 533 transitions. [2023-11-12 02:18:53,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 76 transitions, 809 flow [2023-11-12 02:18:53,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 76 transitions, 776 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-11-12 02:18:53,469 INFO L231 Difference]: Finished difference. Result has 52 places, 52 transitions, 544 flow [2023-11-12 02:18:53,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=544, PETRI_PLACES=52, PETRI_TRANSITIONS=52} [2023-11-12 02:18:53,470 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 27 predicate places. [2023-11-12 02:18:53,470 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 52 transitions, 544 flow [2023-11-12 02:18:53,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.66666666666667) internal successors, (430), 6 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:53,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:18:53,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:18:53,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:18:53,472 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:18:53,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:53,472 INFO L85 PathProgramCache]: Analyzing trace with hash -218530944, now seen corresponding path program 1 times [2023-11-12 02:18:53,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:53,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743680982] [2023-11-12 02:18:53,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:53,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:54,165 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-12 02:18:54,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:54,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743680982] [2023-11-12 02:18:54,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743680982] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:54,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:54,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:18:54,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728289972] [2023-11-12 02:18:54,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:54,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:18:54,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:54,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:18:54,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:18:54,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 168 [2023-11-12 02:18:54,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 52 transitions, 544 flow. Second operand has 7 states, 7 states have (on average 74.57142857142857) internal successors, (522), 7 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:54,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:18:54,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 168 [2023-11-12 02:18:54,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:18:54,500 INFO L124 PetriNetUnfolderBase]: 200/379 cut-off events. [2023-11-12 02:18:54,501 INFO L125 PetriNetUnfolderBase]: For 2838/2845 co-relation queries the response was YES. [2023-11-12 02:18:54,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2112 conditions, 379 events. 200/379 cut-off events. For 2838/2845 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1552 event pairs, 34 based on Foata normal form. 17/396 useless extension candidates. Maximal degree in co-relation 2081. Up to 232 conditions per place. [2023-11-12 02:18:54,507 INFO L140 encePairwiseOnDemand]: 161/168 looper letters, 35 selfloop transitions, 32 changer transitions 9/78 dead transitions. [2023-11-12 02:18:54,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 78 transitions, 908 flow [2023-11-12 02:18:54,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:18:54,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-12 02:18:54,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 628 transitions. [2023-11-12 02:18:54,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46726190476190477 [2023-11-12 02:18:54,511 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 628 transitions. [2023-11-12 02:18:54,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 628 transitions. [2023-11-12 02:18:54,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:18:54,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 628 transitions. [2023-11-12 02:18:54,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 78.5) internal successors, (628), 8 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:54,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 168.0) internal successors, (1512), 9 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:54,518 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 168.0) internal successors, (1512), 9 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:54,518 INFO L175 Difference]: Start difference. First operand has 52 places, 52 transitions, 544 flow. Second operand 8 states and 628 transitions. [2023-11-12 02:18:54,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 78 transitions, 908 flow [2023-11-12 02:18:54,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 78 transitions, 825 flow, removed 31 selfloop flow, removed 4 redundant places. [2023-11-12 02:18:54,530 INFO L231 Difference]: Finished difference. Result has 57 places, 57 transitions, 665 flow [2023-11-12 02:18:54,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=665, PETRI_PLACES=57, PETRI_TRANSITIONS=57} [2023-11-12 02:18:54,531 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 32 predicate places. [2023-11-12 02:18:54,532 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 57 transitions, 665 flow [2023-11-12 02:18:54,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.57142857142857) internal successors, (522), 7 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:54,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:18:54,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:18:54,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:18:54,533 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:18:54,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:54,534 INFO L85 PathProgramCache]: Analyzing trace with hash -676158699, now seen corresponding path program 1 times [2023-11-12 02:18:54,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:54,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970457052] [2023-11-12 02:18:54,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:54,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:54,679 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-12 02:18:54,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:54,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970457052] [2023-11-12 02:18:54,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970457052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:54,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:54,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:18:54,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444022970] [2023-11-12 02:18:54,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:54,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:18:54,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:54,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:18:54,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:18:54,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 168 [2023-11-12 02:18:54,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 665 flow. Second operand has 4 states, 4 states have (on average 75.75) internal successors, (303), 4 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:54,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:18:54,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 168 [2023-11-12 02:18:54,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:18:54,921 INFO L124 PetriNetUnfolderBase]: 242/469 cut-off events. [2023-11-12 02:18:54,922 INFO L125 PetriNetUnfolderBase]: For 4762/4796 co-relation queries the response was YES. [2023-11-12 02:18:54,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2697 conditions, 469 events. 242/469 cut-off events. For 4762/4796 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2112 event pairs, 79 based on Foata normal form. 54/519 useless extension candidates. Maximal degree in co-relation 2663. Up to 227 conditions per place. [2023-11-12 02:18:54,929 INFO L140 encePairwiseOnDemand]: 164/168 looper letters, 40 selfloop transitions, 4 changer transitions 33/81 dead transitions. [2023-11-12 02:18:54,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 81 transitions, 1091 flow [2023-11-12 02:18:54,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:18:54,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:18:54,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 399 transitions. [2023-11-12 02:18:54,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2023-11-12 02:18:54,932 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 399 transitions. [2023-11-12 02:18:54,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 399 transitions. [2023-11-12 02:18:54,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:18:54,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 399 transitions. [2023-11-12 02:18:54,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 79.8) internal successors, (399), 5 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:54,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 168.0) internal successors, (1008), 6 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:54,938 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 168.0) internal successors, (1008), 6 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:54,938 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 665 flow. Second operand 5 states and 399 transitions. [2023-11-12 02:18:54,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 81 transitions, 1091 flow [2023-11-12 02:18:54,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 81 transitions, 1025 flow, removed 33 selfloop flow, removed 4 redundant places. [2023-11-12 02:18:54,957 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 442 flow [2023-11-12 02:18:54,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=442, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2023-11-12 02:18:54,958 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 32 predicate places. [2023-11-12 02:18:54,958 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 442 flow [2023-11-12 02:18:54,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.75) internal successors, (303), 4 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:54,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:18:54,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:18:54,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:18:54,960 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:18:54,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:54,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1845926221, now seen corresponding path program 1 times [2023-11-12 02:18:54,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:54,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233843464] [2023-11-12 02:18:54,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:54,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:55,568 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-12 02:18:55,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:55,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233843464] [2023-11-12 02:18:55,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233843464] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:55,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:55,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:18:55,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040173464] [2023-11-12 02:18:55,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:55,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:18:55,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:55,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:18:55,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:18:55,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 168 [2023-11-12 02:18:55,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 442 flow. Second operand has 8 states, 8 states have (on average 72.5) internal successors, (580), 8 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:55,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:18:55,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 168 [2023-11-12 02:18:55,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:18:55,932 INFO L124 PetriNetUnfolderBase]: 184/382 cut-off events. [2023-11-12 02:18:55,932 INFO L125 PetriNetUnfolderBase]: For 3196/3207 co-relation queries the response was YES. [2023-11-12 02:18:55,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2130 conditions, 382 events. 184/382 cut-off events. For 3196/3207 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1713 event pairs, 73 based on Foata normal form. 17/399 useless extension candidates. Maximal degree in co-relation 2096. Up to 306 conditions per place. [2023-11-12 02:18:55,938 INFO L140 encePairwiseOnDemand]: 161/168 looper letters, 37 selfloop transitions, 6 changer transitions 16/61 dead transitions. [2023-11-12 02:18:55,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 61 transitions, 717 flow [2023-11-12 02:18:55,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:18:55,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:18:55,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 533 transitions. [2023-11-12 02:18:55,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4532312925170068 [2023-11-12 02:18:55,942 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 533 transitions. [2023-11-12 02:18:55,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 533 transitions. [2023-11-12 02:18:55,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:18:55,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 533 transitions. [2023-11-12 02:18:55,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 76.14285714285714) internal successors, (533), 7 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:55,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 168.0) internal successors, (1344), 8 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:55,948 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 168.0) internal successors, (1344), 8 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:55,948 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 442 flow. Second operand 7 states and 533 transitions. [2023-11-12 02:18:55,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 61 transitions, 717 flow [2023-11-12 02:18:55,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 61 transitions, 689 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-11-12 02:18:55,963 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 419 flow [2023-11-12 02:18:55,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=419, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2023-11-12 02:18:55,965 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 34 predicate places. [2023-11-12 02:18:55,966 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 419 flow [2023-11-12 02:18:55,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 72.5) internal successors, (580), 8 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:55,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:18:55,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:18:55,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:18:55,967 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:18:55,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:55,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1873689511, now seen corresponding path program 2 times [2023-11-12 02:18:55,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:55,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643136969] [2023-11-12 02:18:55,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:55,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:56,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:18:56,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:56,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643136969] [2023-11-12 02:18:56,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643136969] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:56,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:56,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:18:56,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315454519] [2023-11-12 02:18:56,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:56,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:18:56,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:56,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:18:56,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:18:56,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 168 [2023-11-12 02:18:56,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 40 transitions, 419 flow. Second operand has 8 states, 8 states have (on average 70.5) internal successors, (564), 8 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:56,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:18:56,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 168 [2023-11-12 02:18:56,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:18:57,207 INFO L124 PetriNetUnfolderBase]: 156/321 cut-off events. [2023-11-12 02:18:57,208 INFO L125 PetriNetUnfolderBase]: For 2605/2612 co-relation queries the response was YES. [2023-11-12 02:18:57,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1736 conditions, 321 events. 156/321 cut-off events. For 2605/2612 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1333 event pairs, 27 based on Foata normal form. 19/340 useless extension candidates. Maximal degree in co-relation 1702. Up to 200 conditions per place. [2023-11-12 02:18:57,212 INFO L140 encePairwiseOnDemand]: 161/168 looper letters, 26 selfloop transitions, 11 changer transitions 17/55 dead transitions. [2023-11-12 02:18:57,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 55 transitions, 628 flow [2023-11-12 02:18:57,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:18:57,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:18:57,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 519 transitions. [2023-11-12 02:18:57,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4413265306122449 [2023-11-12 02:18:57,215 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 519 transitions. [2023-11-12 02:18:57,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 519 transitions. [2023-11-12 02:18:57,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:18:57,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 519 transitions. [2023-11-12 02:18:57,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 74.14285714285714) internal successors, (519), 7 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:57,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 168.0) internal successors, (1344), 8 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:57,221 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 168.0) internal successors, (1344), 8 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:57,221 INFO L175 Difference]: Start difference. First operand has 59 places, 40 transitions, 419 flow. Second operand 7 states and 519 transitions. [2023-11-12 02:18:57,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 55 transitions, 628 flow [2023-11-12 02:18:57,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 568 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-11-12 02:18:57,231 INFO L231 Difference]: Finished difference. Result has 59 places, 33 transitions, 351 flow [2023-11-12 02:18:57,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=351, PETRI_PLACES=59, PETRI_TRANSITIONS=33} [2023-11-12 02:18:57,232 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 34 predicate places. [2023-11-12 02:18:57,232 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 33 transitions, 351 flow [2023-11-12 02:18:57,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 70.5) internal successors, (564), 8 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:57,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:18:57,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:18:57,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:18:57,233 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:18:57,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:57,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1076584631, now seen corresponding path program 1 times [2023-11-12 02:18:57,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:57,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586699996] [2023-11-12 02:18:57,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:57,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:57,370 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-12 02:18:57,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:57,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586699996] [2023-11-12 02:18:57,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586699996] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:57,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:57,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:18:57,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772194643] [2023-11-12 02:18:57,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:57,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:18:57,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:57,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:18:57,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:18:57,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 168 [2023-11-12 02:18:57,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 33 transitions, 351 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:57,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:18:57,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 168 [2023-11-12 02:18:57,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:18:57,438 INFO L124 PetriNetUnfolderBase]: 29/76 cut-off events. [2023-11-12 02:18:57,439 INFO L125 PetriNetUnfolderBase]: For 608/611 co-relation queries the response was YES. [2023-11-12 02:18:57,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 76 events. 29/76 cut-off events. For 608/611 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 185 event pairs, 9 based on Foata normal form. 10/86 useless extension candidates. Maximal degree in co-relation 416. Up to 58 conditions per place. [2023-11-12 02:18:57,440 INFO L140 encePairwiseOnDemand]: 164/168 looper letters, 23 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2023-11-12 02:18:57,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 29 transitions, 336 flow [2023-11-12 02:18:57,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:18:57,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:18:57,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2023-11-12 02:18:57,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2023-11-12 02:18:57,442 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 245 transitions. [2023-11-12 02:18:57,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 245 transitions. [2023-11-12 02:18:57,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:18:57,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 245 transitions. [2023-11-12 02:18:57,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:57,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:57,446 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:57,446 INFO L175 Difference]: Start difference. First operand has 59 places, 33 transitions, 351 flow. Second operand 3 states and 245 transitions. [2023-11-12 02:18:57,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 29 transitions, 336 flow [2023-11-12 02:18:57,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 252 flow, removed 22 selfloop flow, removed 17 redundant places. [2023-11-12 02:18:57,450 INFO L231 Difference]: Finished difference. Result has 40 places, 25 transitions, 177 flow [2023-11-12 02:18:57,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=40, PETRI_TRANSITIONS=25} [2023-11-12 02:18:57,451 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 15 predicate places. [2023-11-12 02:18:57,451 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 25 transitions, 177 flow [2023-11-12 02:18:57,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:57,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:18:57,452 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:18:57,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 02:18:57,452 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:18:57,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:57,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1750545840, now seen corresponding path program 1 times [2023-11-12 02:18:57,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:57,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359585056] [2023-11-12 02:18:57,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:57,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:57,595 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-12 02:18:57,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:57,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359585056] [2023-11-12 02:18:57,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359585056] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:57,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:57,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:18:57,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592885603] [2023-11-12 02:18:57,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:57,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:18:57,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:57,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:18:57,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:18:57,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 168 [2023-11-12 02:18:57,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 25 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:57,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:18:57,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 168 [2023-11-12 02:18:57,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:18:57,654 INFO L124 PetriNetUnfolderBase]: 8/33 cut-off events. [2023-11-12 02:18:57,655 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2023-11-12 02:18:57,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 33 events. 8/33 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 6/39 useless extension candidates. Maximal degree in co-relation 150. Up to 14 conditions per place. [2023-11-12 02:18:57,655 INFO L140 encePairwiseOnDemand]: 164/168 looper letters, 21 selfloop transitions, 5 changer transitions 0/29 dead transitions. [2023-11-12 02:18:57,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 267 flow [2023-11-12 02:18:57,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:18:57,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:18:57,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 320 transitions. [2023-11-12 02:18:57,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2023-11-12 02:18:57,658 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 320 transitions. [2023-11-12 02:18:57,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 320 transitions. [2023-11-12 02:18:57,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:18:57,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 320 transitions. [2023-11-12 02:18:57,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:57,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 168.0) internal successors, (840), 5 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:57,662 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 168.0) internal successors, (840), 5 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:57,662 INFO L175 Difference]: Start difference. First operand has 40 places, 25 transitions, 177 flow. Second operand 4 states and 320 transitions. [2023-11-12 02:18:57,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 267 flow [2023-11-12 02:18:57,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 29 transitions, 216 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-11-12 02:18:57,664 INFO L231 Difference]: Finished difference. Result has 39 places, 25 transitions, 152 flow [2023-11-12 02:18:57,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2023-11-12 02:18:57,665 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 14 predicate places. [2023-11-12 02:18:57,666 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 25 transitions, 152 flow [2023-11-12 02:18:57,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:57,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:18:57,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:18:57,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 02:18:57,667 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:18:57,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:57,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1141857709, now seen corresponding path program 1 times [2023-11-12 02:18:57,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:57,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156689444] [2023-11-12 02:18:57,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:57,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:18:57,745 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:18:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:18:57,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:18:57,872 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:18:57,873 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-12 02:18:57,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-12 02:18:57,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-12 02:18:57,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-12 02:18:57,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-12 02:18:57,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 02:18:57,877 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:18:57,885 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-12 02:18:57,886 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:18:57,947 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-12 02:18:57,949 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-12 02:18:57,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:18:57 BasicIcfg [2023-11-12 02:18:57,984 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:18:57,985 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:18:57,985 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:18:57,985 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:18:57,986 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:18:43" (3/4) ... [2023-11-12 02:18:57,987 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-12 02:18:58,007 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-12 02:18:58,008 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-12 02:18:58,068 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdf90414-2185-4b35-8e0e-fbb5ad24035d/bin/uautomizer-verify-uTZkv6EMXl/witness.graphml [2023-11-12 02:18:58,069 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:18:58,069 INFO L158 Benchmark]: Toolchain (without parser) took 16592.71ms. Allocated memory was 130.0MB in the beginning and 323.0MB in the end (delta: 192.9MB). Free memory was 83.5MB in the beginning and 263.5MB in the end (delta: -180.0MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2023-11-12 02:18:58,070 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 130.0MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:18:58,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 566.28ms. Allocated memory is still 130.0MB. Free memory was 83.3MB in the beginning and 60.7MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-12 02:18:58,071 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.93ms. Allocated memory is still 130.0MB. Free memory was 60.7MB in the beginning and 57.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-12 02:18:58,071 INFO L158 Benchmark]: Boogie Preprocessor took 35.94ms. Allocated memory is still 130.0MB. Free memory was 57.9MB in the beginning and 56.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:18:58,072 INFO L158 Benchmark]: RCFGBuilder took 971.90ms. Allocated memory was 130.0MB in the beginning and 184.5MB in the end (delta: 54.5MB). Free memory was 56.3MB in the beginning and 130.8MB in the end (delta: -74.6MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2023-11-12 02:18:58,072 INFO L158 Benchmark]: TraceAbstraction took 14866.31ms. Allocated memory was 184.5MB in the beginning and 323.0MB in the end (delta: 138.4MB). Free memory was 130.5MB in the beginning and 269.8MB in the end (delta: -139.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:18:58,072 INFO L158 Benchmark]: Witness Printer took 83.95ms. Allocated memory is still 323.0MB. Free memory was 269.8MB in the beginning and 263.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-12 02:18:58,074 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.27ms. Allocated memory is still 130.0MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 566.28ms. Allocated memory is still 130.0MB. Free memory was 83.3MB in the beginning and 60.7MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.93ms. Allocated memory is still 130.0MB. Free memory was 60.7MB in the beginning and 57.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.94ms. Allocated memory is still 130.0MB. Free memory was 57.9MB in the beginning and 56.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 971.90ms. Allocated memory was 130.0MB in the beginning and 184.5MB in the end (delta: 54.5MB). Free memory was 56.3MB in the beginning and 130.8MB in the end (delta: -74.6MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * TraceAbstraction took 14866.31ms. Allocated memory was 184.5MB in the beginning and 323.0MB in the end (delta: 138.4MB). Free memory was 130.5MB in the beginning and 269.8MB in the end (delta: -139.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 83.95ms. Allocated memory is still 323.0MB. Free memory was 269.8MB in the beginning and 263.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 92 PlacesBefore, 25 PlacesAfterwards, 87 TransitionsBefore, 19 TransitionsAfterwards, 1140 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 79 TotalNumberOfCompositions, 2918 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1292, independent: 1174, independent conditional: 0, independent unconditional: 1174, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 610, independent: 588, independent conditional: 0, independent unconditional: 588, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1292, independent: 586, independent conditional: 0, independent unconditional: 586, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 610, unknown conditional: 0, unknown unconditional: 610] , Statistics on independence cache: Total cache size (in pairs): 35, Positive cache size: 25, Positive conditional cache size: 0, Positive unconditional cache size: 25, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, 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: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2475; [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L792] 0 pthread_t t2476; [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L758] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L758] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L734] 1 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 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: 793]: 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: 791]: 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 5 procedures, 107 locations, 5 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: 14.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 479 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 317 mSDsluCounter, 411 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 284 mSDsCounter, 146 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1330 IncrementalHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 146 mSolverCounterUnsat, 127 mSDtfsCounter, 1330 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=665occurred in iteration=8, InterpolantAutomatonStates: 74, 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.4s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 1134 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-12 02:18:58,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdf90414-2185-4b35-8e0e-fbb5ad24035d/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE