./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix035_pso.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff 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_a5d40a34-7d30-4463-9eb2-c2b65f02ffca/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5d40a34-7d30-4463-9eb2-c2b65f02ffca/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5d40a34-7d30-4463-9eb2-c2b65f02ffca/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5d40a34-7d30-4463-9eb2-c2b65f02ffca/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix035_pso.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5d40a34-7d30-4463-9eb2-c2b65f02ffca/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5d40a34-7d30-4463-9eb2-c2b65f02ffca/bin/uautomizer-verify-uCwYo4JHxu --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 08616d057728e0055484e74bd2f5263dad899fb9ef1c1289b69e87b2c2f7002b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:45:41,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:45:41,225 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5d40a34-7d30-4463-9eb2-c2b65f02ffca/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:45:41,238 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:45:41,239 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:45:41,280 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:45:41,282 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:45:41,283 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:45:41,284 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:45:41,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:45:41,290 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:45:41,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:45:41,292 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:45:41,294 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:45:41,294 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:45:41,295 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:45:41,295 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:45:41,296 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:45:41,296 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:45:41,297 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:45:41,298 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:45:41,298 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:45:41,299 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:45:41,299 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:45:41,300 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:45:41,301 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:45:41,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:45:41,302 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:45:41,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:45:41,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:45:41,304 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:45:41,305 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:45:41,305 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:45:41,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:45:41,306 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:45:41,306 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:45:41,306 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:45:41,306 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:45:41,307 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:45:41,307 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_a5d40a34-7d30-4463-9eb2-c2b65f02ffca/bin/uautomizer-verify-uCwYo4JHxu/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_a5d40a34-7d30-4463-9eb2-c2b65f02ffca/bin/uautomizer-verify-uCwYo4JHxu 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 -> 08616d057728e0055484e74bd2f5263dad899fb9ef1c1289b69e87b2c2f7002b [2023-11-19 07:45:41,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:45:41,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:45:41,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:45:41,617 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:45:41,618 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:45:41,619 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5d40a34-7d30-4463-9eb2-c2b65f02ffca/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix035_pso.opt_tso.opt.i [2023-11-19 07:45:44,712 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:45:45,120 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:45:45,125 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5d40a34-7d30-4463-9eb2-c2b65f02ffca/sv-benchmarks/c/pthread-wmm/mix035_pso.opt_tso.opt.i [2023-11-19 07:45:45,148 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5d40a34-7d30-4463-9eb2-c2b65f02ffca/bin/uautomizer-verify-uCwYo4JHxu/data/97409be02/047dc31d062a49c78515f7a04a1fc5f0/FLAG3e9eb3a1e [2023-11-19 07:45:45,172 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5d40a34-7d30-4463-9eb2-c2b65f02ffca/bin/uautomizer-verify-uCwYo4JHxu/data/97409be02/047dc31d062a49c78515f7a04a1fc5f0 [2023-11-19 07:45:45,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:45:45,177 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:45:45,178 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:45:45,179 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:45:45,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:45:45,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:45:45" (1/1) ... [2023-11-19 07:45:45,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46394ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:45, skipping insertion in model container [2023-11-19 07:45:45,188 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:45:45" (1/1) ... [2023-11-19 07:45:45,264 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:45:45,425 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_a5d40a34-7d30-4463-9eb2-c2b65f02ffca/sv-benchmarks/c/pthread-wmm/mix035_pso.opt_tso.opt.i[956,969] [2023-11-19 07:45:45,698 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:45:45,711 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:45:45,730 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_a5d40a34-7d30-4463-9eb2-c2b65f02ffca/sv-benchmarks/c/pthread-wmm/mix035_pso.opt_tso.opt.i[956,969] [2023-11-19 07:45:45,803 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:45:45,860 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:45:45,860 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:45:45,869 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:45:45,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:45 WrapperNode [2023-11-19 07:45:45,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:45:45,871 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:45:45,871 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:45:45,872 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:45:45,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:45" (1/1) ... [2023-11-19 07:45:45,916 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:45" (1/1) ... [2023-11-19 07:45:45,972 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 136 [2023-11-19 07:45:45,973 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:45:45,973 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:45:45,974 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:45:45,974 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:45:45,986 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:45" (1/1) ... [2023-11-19 07:45:45,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:45" (1/1) ... [2023-11-19 07:45:46,009 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:45" (1/1) ... [2023-11-19 07:45:46,010 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:45" (1/1) ... [2023-11-19 07:45:46,019 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:45" (1/1) ... [2023-11-19 07:45:46,021 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:45" (1/1) ... [2023-11-19 07:45:46,040 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:45" (1/1) ... [2023-11-19 07:45:46,042 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:45" (1/1) ... [2023-11-19 07:45:46,046 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:45:46,047 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:45:46,047 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:45:46,048 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:45:46,049 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:45" (1/1) ... [2023-11-19 07:45:46,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:45:46,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5d40a34-7d30-4463-9eb2-c2b65f02ffca/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:45:46,153 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5d40a34-7d30-4463-9eb2-c2b65f02ffca/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:45:46,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5d40a34-7d30-4463-9eb2-c2b65f02ffca/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:45:46,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:45:46,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:45:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:45:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:45:46,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:45:46,235 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:45:46,235 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:45:46,236 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:45:46,236 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:45:46,236 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 07:45:46,238 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 07:45:46,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:45:46,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:45:46,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:45:46,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:45:46,241 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:45:46,449 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:45:46,451 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:45:46,820 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:45:47,063 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:45:47,063 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:45:47,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:45:47 BoogieIcfgContainer [2023-11-19 07:45:47,068 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:45:47,072 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:45:47,072 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:45:47,077 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:45:47,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:45:45" (1/3) ... [2023-11-19 07:45:47,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb4badf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:45:47, skipping insertion in model container [2023-11-19 07:45:47,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:45" (2/3) ... [2023-11-19 07:45:47,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb4badf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:45:47, skipping insertion in model container [2023-11-19 07:45:47,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:45:47" (3/3) ... [2023-11-19 07:45:47,081 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_pso.opt_tso.opt.i [2023-11-19 07:45:47,093 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 07:45:47,104 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:45:47,105 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 07:45:47,105 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:45:47,185 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:45:47,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 244 flow [2023-11-19 07:45:47,352 INFO L124 PetriNetUnfolderBase]: 2/113 cut-off events. [2023-11-19 07:45:47,353 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:45:47,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-11-19 07:45:47,363 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 116 transitions, 244 flow [2023-11-19 07:45:47,369 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 113 transitions, 235 flow [2023-11-19 07:45:47,373 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:45:47,402 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 113 transitions, 235 flow [2023-11-19 07:45:47,405 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 113 transitions, 235 flow [2023-11-19 07:45:47,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 235 flow [2023-11-19 07:45:47,474 INFO L124 PetriNetUnfolderBase]: 2/113 cut-off events. [2023-11-19 07:45:47,474 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:45:47,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-11-19 07:45:47,479 INFO L119 LiptonReduction]: Number of co-enabled transitions 2256 [2023-11-19 07:45:52,404 INFO L134 LiptonReduction]: Checked pairs total: 4456 [2023-11-19 07:45:52,405 INFO L136 LiptonReduction]: Total number of compositions: 103 [2023-11-19 07:45:52,439 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:45:52,450 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;@66d1591d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:45:52,450 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-19 07:45:52,459 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:45:52,459 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-11-19 07:45:52,459 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:45:52,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:52,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:52,461 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:45:52,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:52,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1563489317, now seen corresponding path program 1 times [2023-11-19 07:45:52,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:52,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257877414] [2023-11-19 07:45:52,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:52,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:53,217 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-19 07:45:53,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:53,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257877414] [2023-11-19 07:45:53,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257877414] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:53,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:53,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:45:53,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434982909] [2023-11-19 07:45:53,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:53,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:45:53,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:53,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:45:53,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:45:53,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 219 [2023-11-19 07:45:53,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:53,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:53,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 219 [2023-11-19 07:45:53,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:53,690 INFO L124 PetriNetUnfolderBase]: 644/1036 cut-off events. [2023-11-19 07:45:53,690 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-19 07:45:53,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2048 conditions, 1036 events. 644/1036 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4798 event pairs, 112 based on Foata normal form. 0/975 useless extension candidates. Maximal degree in co-relation 2037. Up to 773 conditions per place. [2023-11-19 07:45:53,711 INFO L140 encePairwiseOnDemand]: 215/219 looper letters, 24 selfloop transitions, 2 changer transitions 2/30 dead transitions. [2023-11-19 07:45:53,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 125 flow [2023-11-19 07:45:53,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:45:53,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:45:53,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2023-11-19 07:45:53,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5220700152207002 [2023-11-19 07:45:53,743 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 343 transitions. [2023-11-19 07:45:53,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 343 transitions. [2023-11-19 07:45:53,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:53,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 343 transitions. [2023-11-19 07:45:53,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:53,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:53,768 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:53,771 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 55 flow. Second operand 3 states and 343 transitions. [2023-11-19 07:45:53,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 125 flow [2023-11-19 07:45:53,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 122 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-19 07:45:53,779 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2023-11-19 07:45:53,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-11-19 07:45:53,788 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-11-19 07:45:53,788 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2023-11-19 07:45:53,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:53,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:53,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:53,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:45:53,791 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:45:53,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:53,792 INFO L85 PathProgramCache]: Analyzing trace with hash -725250765, now seen corresponding path program 1 times [2023-11-19 07:45:53,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:53,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069137934] [2023-11-19 07:45:53,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:53,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:54,187 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-19 07:45:54,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:54,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069137934] [2023-11-19 07:45:54,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069137934] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:54,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:54,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:45:54,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576250355] [2023-11-19 07:45:54,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:54,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:45:54,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:54,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:45:54,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:45:54,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 219 [2023-11-19 07:45:54,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 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-19 07:45:54,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:54,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 219 [2023-11-19 07:45:54,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:54,608 INFO L124 PetriNetUnfolderBase]: 831/1248 cut-off events. [2023-11-19 07:45:54,608 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-19 07:45:54,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2602 conditions, 1248 events. 831/1248 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4835 event pairs, 295 based on Foata normal form. 8/1256 useless extension candidates. Maximal degree in co-relation 2592. Up to 1173 conditions per place. [2023-11-19 07:45:54,624 INFO L140 encePairwiseOnDemand]: 214/219 looper letters, 28 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2023-11-19 07:45:54,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 32 transitions, 144 flow [2023-11-19 07:45:54,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:45:54,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:45:54,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2023-11-19 07:45:54,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4977168949771689 [2023-11-19 07:45:54,629 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 327 transitions. [2023-11-19 07:45:54,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 327 transitions. [2023-11-19 07:45:54,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:54,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 327 transitions. [2023-11-19 07:45:54,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:54,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:54,647 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:54,648 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 3 states and 327 transitions. [2023-11-19 07:45:54,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 32 transitions, 144 flow [2023-11-19 07:45:54,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:45:54,654 INFO L231 Difference]: Finished difference. Result has 30 places, 23 transitions, 72 flow [2023-11-19 07:45:54,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=30, PETRI_TRANSITIONS=23} [2023-11-19 07:45:54,656 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-11-19 07:45:54,664 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 72 flow [2023-11-19 07:45:54,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 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-19 07:45:54,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:54,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:54,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:45:54,668 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:45:54,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:54,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1095146395, now seen corresponding path program 1 times [2023-11-19 07:45:54,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:54,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588286196] [2023-11-19 07:45:54,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:54,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:54,917 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-19 07:45:54,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:54,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588286196] [2023-11-19 07:45:54,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588286196] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:54,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:54,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:45:54,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880319737] [2023-11-19 07:45:54,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:54,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:45:54,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:54,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:45:54,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:45:54,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 219 [2023-11-19 07:45:54,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 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-19 07:45:54,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:54,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 219 [2023-11-19 07:45:54,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:55,240 INFO L124 PetriNetUnfolderBase]: 775/1168 cut-off events. [2023-11-19 07:45:55,240 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2023-11-19 07:45:55,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2735 conditions, 1168 events. 775/1168 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4344 event pairs, 247 based on Foata normal form. 24/1192 useless extension candidates. Maximal degree in co-relation 2724. Up to 817 conditions per place. [2023-11-19 07:45:55,254 INFO L140 encePairwiseOnDemand]: 216/219 looper letters, 28 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2023-11-19 07:45:55,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 31 transitions, 154 flow [2023-11-19 07:45:55,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:45:55,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:45:55,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2023-11-19 07:45:55,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4916286149162861 [2023-11-19 07:45:55,257 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2023-11-19 07:45:55,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2023-11-19 07:45:55,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:55,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2023-11-19 07:45:55,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:55,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:55,262 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:55,263 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 72 flow. Second operand 3 states and 323 transitions. [2023-11-19 07:45:55,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 31 transitions, 154 flow [2023-11-19 07:45:55,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 31 transitions, 150 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:45:55,265 INFO L231 Difference]: Finished difference. Result has 32 places, 23 transitions, 79 flow [2023-11-19 07:45:55,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=79, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2023-11-19 07:45:55,266 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2023-11-19 07:45:55,266 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 79 flow [2023-11-19 07:45:55,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 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-19 07:45:55,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:55,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:55,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:45:55,268 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:45:55,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:55,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1233007048, now seen corresponding path program 1 times [2023-11-19 07:45:55,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:55,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94188621] [2023-11-19 07:45:55,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:55,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:55,469 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-19 07:45:55,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:55,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94188621] [2023-11-19 07:45:55,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94188621] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:55,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:55,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:45:55,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748397822] [2023-11-19 07:45:55,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:55,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:45:55,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:55,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:45:55,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:45:55,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 219 [2023-11-19 07:45:55,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 79 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:55,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:55,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 219 [2023-11-19 07:45:55,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:55,662 INFO L124 PetriNetUnfolderBase]: 318/557 cut-off events. [2023-11-19 07:45:55,662 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2023-11-19 07:45:55,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1348 conditions, 557 events. 318/557 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2240 event pairs, 77 based on Foata normal form. 32/587 useless extension candidates. Maximal degree in co-relation 1335. Up to 440 conditions per place. [2023-11-19 07:45:55,669 INFO L140 encePairwiseOnDemand]: 214/219 looper letters, 29 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2023-11-19 07:45:55,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 182 flow [2023-11-19 07:45:55,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:45:55,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:45:55,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2023-11-19 07:45:55,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5098934550989346 [2023-11-19 07:45:55,672 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 335 transitions. [2023-11-19 07:45:55,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions. [2023-11-19 07:45:55,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:55,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions. [2023-11-19 07:45:55,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:55,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:55,678 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:55,679 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 79 flow. Second operand 3 states and 335 transitions. [2023-11-19 07:45:55,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 182 flow [2023-11-19 07:45:55,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:45:55,682 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 99 flow [2023-11-19 07:45:55,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2023-11-19 07:45:55,683 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2023-11-19 07:45:55,683 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 99 flow [2023-11-19 07:45:55,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:55,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:55,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:55,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:45:55,685 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:45:55,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:55,685 INFO L85 PathProgramCache]: Analyzing trace with hash -887648981, now seen corresponding path program 1 times [2023-11-19 07:45:55,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:55,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216792389] [2023-11-19 07:45:55,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:55,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:55,941 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-19 07:45:55,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:55,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216792389] [2023-11-19 07:45:55,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216792389] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:55,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:55,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:45:55,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608649206] [2023-11-19 07:45:55,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:55,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:45:55,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:55,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:45:55,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:45:55,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 219 [2023-11-19 07:45:55,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:55,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:55,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 219 [2023-11-19 07:45:55,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:56,121 INFO L124 PetriNetUnfolderBase]: 158/310 cut-off events. [2023-11-19 07:45:56,121 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2023-11-19 07:45:56,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 881 conditions, 310 events. 158/310 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1122 event pairs, 45 based on Foata normal form. 33/341 useless extension candidates. Maximal degree in co-relation 867. Up to 106 conditions per place. [2023-11-19 07:45:56,139 INFO L140 encePairwiseOnDemand]: 214/219 looper letters, 37 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2023-11-19 07:45:56,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 251 flow [2023-11-19 07:45:56,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:45:56,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:45:56,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 447 transitions. [2023-11-19 07:45:56,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102739726027398 [2023-11-19 07:45:56,142 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 447 transitions. [2023-11-19 07:45:56,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 447 transitions. [2023-11-19 07:45:56,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:56,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 447 transitions. [2023-11-19 07:45:56,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:56,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:56,148 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:56,148 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 99 flow. Second operand 4 states and 447 transitions. [2023-11-19 07:45:56,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 251 flow [2023-11-19 07:45:56,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 47 transitions, 247 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:45:56,151 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 135 flow [2023-11-19 07:45:56,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2023-11-19 07:45:56,152 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2023-11-19 07:45:56,153 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 135 flow [2023-11-19 07:45:56,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:56,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:56,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:56,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:45:56,154 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:45:56,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:56,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1011575409, now seen corresponding path program 1 times [2023-11-19 07:45:56,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:56,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457364675] [2023-11-19 07:45:56,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:56,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:56,550 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-19 07:45:56,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:56,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457364675] [2023-11-19 07:45:56,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457364675] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:56,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:56,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:45:56,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632731496] [2023-11-19 07:45:56,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:56,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:45:56,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:56,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:45:56,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:45:56,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 219 [2023-11-19 07:45:56,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:56,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:56,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 219 [2023-11-19 07:45:56,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:56,873 INFO L124 PetriNetUnfolderBase]: 279/518 cut-off events. [2023-11-19 07:45:56,873 INFO L125 PetriNetUnfolderBase]: For 496/496 co-relation queries the response was YES. [2023-11-19 07:45:56,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1638 conditions, 518 events. 279/518 cut-off events. For 496/496 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2098 event pairs, 25 based on Foata normal form. 7/525 useless extension candidates. Maximal degree in co-relation 1622. Up to 269 conditions per place. [2023-11-19 07:45:56,880 INFO L140 encePairwiseOnDemand]: 213/219 looper letters, 49 selfloop transitions, 8 changer transitions 18/75 dead transitions. [2023-11-19 07:45:56,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 75 transitions, 476 flow [2023-11-19 07:45:56,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:45:56,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:45:56,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 638 transitions. [2023-11-19 07:45:56,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4855403348554033 [2023-11-19 07:45:56,885 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 638 transitions. [2023-11-19 07:45:56,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 638 transitions. [2023-11-19 07:45:56,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:56,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 638 transitions. [2023-11-19 07:45:56,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.33333333333333) internal successors, (638), 6 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:56,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:56,897 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:56,897 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 135 flow. Second operand 6 states and 638 transitions. [2023-11-19 07:45:56,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 75 transitions, 476 flow [2023-11-19 07:45:56,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 75 transitions, 442 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-11-19 07:45:56,907 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 157 flow [2023-11-19 07:45:56,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=157, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2023-11-19 07:45:56,911 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2023-11-19 07:45:56,911 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 157 flow [2023-11-19 07:45:56,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:56,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:56,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:56,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:45:56,913 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:45:56,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:56,914 INFO L85 PathProgramCache]: Analyzing trace with hash 482085653, now seen corresponding path program 2 times [2023-11-19 07:45:56,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:56,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200346884] [2023-11-19 07:45:56,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:56,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:57,283 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-19 07:45:57,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:57,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200346884] [2023-11-19 07:45:57,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200346884] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:57,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:57,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:45:57,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597128658] [2023-11-19 07:45:57,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:57,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:45:57,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:57,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:45:57,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:45:57,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 219 [2023-11-19 07:45:57,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:57,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:57,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 219 [2023-11-19 07:45:57,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:57,465 INFO L124 PetriNetUnfolderBase]: 165/322 cut-off events. [2023-11-19 07:45:57,465 INFO L125 PetriNetUnfolderBase]: For 319/333 co-relation queries the response was YES. [2023-11-19 07:45:57,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 994 conditions, 322 events. 165/322 cut-off events. For 319/333 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1291 event pairs, 42 based on Foata normal form. 29/344 useless extension candidates. Maximal degree in co-relation 976. Up to 128 conditions per place. [2023-11-19 07:45:57,469 INFO L140 encePairwiseOnDemand]: 214/219 looper letters, 32 selfloop transitions, 10 changer transitions 5/50 dead transitions. [2023-11-19 07:45:57,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 307 flow [2023-11-19 07:45:57,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:45:57,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:45:57,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 548 transitions. [2023-11-19 07:45:57,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5004566210045662 [2023-11-19 07:45:57,474 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 548 transitions. [2023-11-19 07:45:57,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 548 transitions. [2023-11-19 07:45:57,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:57,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 548 transitions. [2023-11-19 07:45:57,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:57,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:57,481 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:57,481 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 157 flow. Second operand 5 states and 548 transitions. [2023-11-19 07:45:57,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 307 flow [2023-11-19 07:45:57,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 50 transitions, 292 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-19 07:45:57,487 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 148 flow [2023-11-19 07:45:57,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2023-11-19 07:45:57,489 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2023-11-19 07:45:57,489 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 148 flow [2023-11-19 07:45:57,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:57,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:57,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:57,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:45:57,491 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:45:57,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:57,492 INFO L85 PathProgramCache]: Analyzing trace with hash -173783268, now seen corresponding path program 1 times [2023-11-19 07:45:57,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:57,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260420431] [2023-11-19 07:45:57,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:57,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:57,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:45:57,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:57,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260420431] [2023-11-19 07:45:57,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260420431] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:57,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:57,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:45:57,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516384990] [2023-11-19 07:45:57,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:57,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:45:57,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:57,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:45:57,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:45:57,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 219 [2023-11-19 07:45:57,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:57,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:57,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 219 [2023-11-19 07:45:57,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:58,021 INFO L124 PetriNetUnfolderBase]: 153/307 cut-off events. [2023-11-19 07:45:58,021 INFO L125 PetriNetUnfolderBase]: For 523/523 co-relation queries the response was YES. [2023-11-19 07:45:58,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1055 conditions, 307 events. 153/307 cut-off events. For 523/523 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1176 event pairs, 30 based on Foata normal form. 1/308 useless extension candidates. Maximal degree in co-relation 1042. Up to 196 conditions per place. [2023-11-19 07:45:58,025 INFO L140 encePairwiseOnDemand]: 212/219 looper letters, 42 selfloop transitions, 9 changer transitions 12/63 dead transitions. [2023-11-19 07:45:58,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 63 transitions, 451 flow [2023-11-19 07:45:58,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:45:58,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:45:58,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 529 transitions. [2023-11-19 07:45:58,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4831050228310502 [2023-11-19 07:45:58,029 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 529 transitions. [2023-11-19 07:45:58,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 529 transitions. [2023-11-19 07:45:58,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:58,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 529 transitions. [2023-11-19 07:45:58,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:58,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:58,036 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:58,036 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 148 flow. Second operand 5 states and 529 transitions. [2023-11-19 07:45:58,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 63 transitions, 451 flow [2023-11-19 07:45:58,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 63 transitions, 393 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-11-19 07:45:58,041 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 177 flow [2023-11-19 07:45:58,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=177, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2023-11-19 07:45:58,043 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2023-11-19 07:45:58,043 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 177 flow [2023-11-19 07:45:58,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:58,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:58,044 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:58,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:45:58,044 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:45:58,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:58,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1411015448, now seen corresponding path program 2 times [2023-11-19 07:45:58,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:58,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891087510] [2023-11-19 07:45:58,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:58,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:58,316 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-19 07:45:58,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:58,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891087510] [2023-11-19 07:45:58,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891087510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:58,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:58,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:45:58,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548009655] [2023-11-19 07:45:58,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:58,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:45:58,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:58,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:45:58,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:45:58,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 219 [2023-11-19 07:45:58,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:58,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:58,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 219 [2023-11-19 07:45:58,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:58,539 INFO L124 PetriNetUnfolderBase]: 167/351 cut-off events. [2023-11-19 07:45:58,540 INFO L125 PetriNetUnfolderBase]: For 559/559 co-relation queries the response was YES. [2023-11-19 07:45:58,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1235 conditions, 351 events. 167/351 cut-off events. For 559/559 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1473 event pairs, 47 based on Foata normal form. 1/350 useless extension candidates. Maximal degree in co-relation 1215. Up to 178 conditions per place. [2023-11-19 07:45:58,543 INFO L140 encePairwiseOnDemand]: 216/219 looper letters, 26 selfloop transitions, 1 changer transitions 31/59 dead transitions. [2023-11-19 07:45:58,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 59 transitions, 411 flow [2023-11-19 07:45:58,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:45:58,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:45:58,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 444 transitions. [2023-11-19 07:45:58,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5068493150684932 [2023-11-19 07:45:58,548 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 444 transitions. [2023-11-19 07:45:58,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 444 transitions. [2023-11-19 07:45:58,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:58,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 444 transitions. [2023-11-19 07:45:58,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:58,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:58,556 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:58,556 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 177 flow. Second operand 4 states and 444 transitions. [2023-11-19 07:45:58,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 59 transitions, 411 flow [2023-11-19 07:45:58,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 411 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:45:58,562 INFO L231 Difference]: Finished difference. Result has 48 places, 26 transitions, 130 flow [2023-11-19 07:45:58,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=48, PETRI_TRANSITIONS=26} [2023-11-19 07:45:58,564 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 16 predicate places. [2023-11-19 07:45:58,564 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 26 transitions, 130 flow [2023-11-19 07:45:58,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:58,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:58,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:58,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:45:58,566 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:45:58,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:58,567 INFO L85 PathProgramCache]: Analyzing trace with hash -26622244, now seen corresponding path program 3 times [2023-11-19 07:45:58,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:58,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387731532] [2023-11-19 07:45:58,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:58,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:59,309 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-19 07:45:59,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:59,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387731532] [2023-11-19 07:45:59,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387731532] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:59,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:59,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:45:59,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260297816] [2023-11-19 07:45:59,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:59,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:45:59,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:59,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:45:59,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:45:59,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 219 [2023-11-19 07:45:59,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 26 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:59,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:59,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 219 [2023-11-19 07:45:59,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:59,496 INFO L124 PetriNetUnfolderBase]: 60/147 cut-off events. [2023-11-19 07:45:59,497 INFO L125 PetriNetUnfolderBase]: For 309/309 co-relation queries the response was YES. [2023-11-19 07:45:59,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 542 conditions, 147 events. 60/147 cut-off events. For 309/309 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 540 event pairs, 8 based on Foata normal form. 1/143 useless extension candidates. Maximal degree in co-relation 525. Up to 64 conditions per place. [2023-11-19 07:45:59,499 INFO L140 encePairwiseOnDemand]: 214/219 looper letters, 23 selfloop transitions, 2 changer transitions 21/48 dead transitions. [2023-11-19 07:45:59,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 48 transitions, 344 flow [2023-11-19 07:45:59,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:45:59,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:45:59,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 633 transitions. [2023-11-19 07:45:59,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4817351598173516 [2023-11-19 07:45:59,503 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 633 transitions. [2023-11-19 07:45:59,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 633 transitions. [2023-11-19 07:45:59,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:59,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 633 transitions. [2023-11-19 07:45:59,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:59,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:59,512 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:59,512 INFO L175 Difference]: Start difference. First operand has 48 places, 26 transitions, 130 flow. Second operand 6 states and 633 transitions. [2023-11-19 07:45:59,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 48 transitions, 344 flow [2023-11-19 07:45:59,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 48 transitions, 322 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-11-19 07:45:59,516 INFO L231 Difference]: Finished difference. Result has 49 places, 26 transitions, 127 flow [2023-11-19 07:45:59,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=127, PETRI_PLACES=49, PETRI_TRANSITIONS=26} [2023-11-19 07:45:59,517 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 17 predicate places. [2023-11-19 07:45:59,517 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 26 transitions, 127 flow [2023-11-19 07:45:59,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:59,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:59,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:59,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:45:59,519 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:45:59,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:59,519 INFO L85 PathProgramCache]: Analyzing trace with hash 880907228, now seen corresponding path program 4 times [2023-11-19 07:45:59,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:59,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873332193] [2023-11-19 07:45:59,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:59,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:45:59,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:45:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:45:59,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:45:59,644 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:45:59,645 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-19 07:45:59,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-19 07:45:59,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-19 07:45:59,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-19 07:45:59,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-19 07:45:59,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-19 07:45:59,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:45:59,649 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1] [2023-11-19 07:45:59,656 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 07:45:59,656 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:45:59,703 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:45:59,713 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:45:59,714 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 07:45:59,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:45:59 BasicIcfg [2023-11-19 07:45:59,748 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:45:59,749 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:45:59,749 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:45:59,749 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:45:59,750 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:45:47" (3/4) ... [2023-11-19 07:45:59,751 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 07:45:59,792 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:45:59,796 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:45:59,797 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 07:45:59,898 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5d40a34-7d30-4463-9eb2-c2b65f02ffca/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:45:59,898 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:45:59,899 INFO L158 Benchmark]: Toolchain (without parser) took 14722.42ms. Allocated memory was 144.7MB in the beginning and 272.6MB in the end (delta: 127.9MB). Free memory was 104.0MB in the beginning and 159.6MB in the end (delta: -55.5MB). Peak memory consumption was 73.0MB. Max. memory is 16.1GB. [2023-11-19 07:45:59,899 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 144.7MB. Free memory is still 90.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:45:59,900 INFO L158 Benchmark]: CACSL2BoogieTranslator took 691.56ms. Allocated memory is still 144.7MB. Free memory was 103.8MB in the beginning and 80.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-19 07:45:59,900 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.95ms. Allocated memory is still 144.7MB. Free memory was 80.7MB in the beginning and 78.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:45:59,901 INFO L158 Benchmark]: Boogie Preprocessor took 72.91ms. Allocated memory is still 144.7MB. Free memory was 78.4MB in the beginning and 76.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:45:59,901 INFO L158 Benchmark]: RCFGBuilder took 1021.42ms. Allocated memory was 144.7MB in the beginning and 188.7MB in the end (delta: 44.0MB). Free memory was 76.3MB in the beginning and 130.6MB in the end (delta: -54.4MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2023-11-19 07:45:59,903 INFO L158 Benchmark]: TraceAbstraction took 12676.49ms. Allocated memory was 188.7MB in the beginning and 272.6MB in the end (delta: 83.9MB). Free memory was 130.3MB in the beginning and 170.0MB in the end (delta: -39.8MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. [2023-11-19 07:45:59,904 INFO L158 Benchmark]: Witness Printer took 149.53ms. Allocated memory is still 272.6MB. Free memory was 169.0MB in the beginning and 159.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-19 07:45:59,907 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.21ms. Allocated memory is still 144.7MB. Free memory is still 90.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 691.56ms. Allocated memory is still 144.7MB. Free memory was 103.8MB in the beginning and 80.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.95ms. Allocated memory is still 144.7MB. Free memory was 80.7MB in the beginning and 78.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.91ms. Allocated memory is still 144.7MB. Free memory was 78.4MB in the beginning and 76.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1021.42ms. Allocated memory was 144.7MB in the beginning and 188.7MB in the end (delta: 44.0MB). Free memory was 76.3MB in the beginning and 130.6MB in the end (delta: -54.4MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12676.49ms. Allocated memory was 188.7MB in the beginning and 272.6MB in the end (delta: 83.9MB). Free memory was 130.3MB in the beginning and 170.0MB in the end (delta: -39.8MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. * Witness Printer took 149.53ms. Allocated memory is still 272.6MB. Free memory was 169.0MB in the beginning and 159.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 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: 5.0s, 121 PlacesBefore, 32 PlacesAfterwards, 113 TransitionsBefore, 23 TransitionsAfterwards, 2256 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 103 TotalNumberOfCompositions, 4456 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2339, independent: 2180, independent conditional: 0, independent unconditional: 2180, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1238, independent: 1208, independent conditional: 0, independent unconditional: 1208, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2339, independent: 972, independent conditional: 0, independent unconditional: 972, dependent: 129, dependent conditional: 0, dependent unconditional: 129, unknown: 1238, unknown conditional: 0, unknown unconditional: 1238] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 67, Positive conditional cache size: 0, Positive unconditional cache size: 67, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff0_thd3; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$read_delayed; [L737] 0 int *y$read_delayed_var; [L738] 0 int y$w_buff0; [L739] 0 _Bool y$w_buff0_used; [L740] 0 int y$w_buff1; [L741] 0 _Bool y$w_buff1_used; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L835] 0 pthread_t t922; [L836] FCALL, FORK 0 pthread_create(&t922, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t922={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t923; [L838] FCALL, FORK 0 pthread_create(&t923, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t922={5:0}, t923={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L839] 0 pthread_t t924; [L840] FCALL, FORK 0 pthread_create(&t924, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t922={5:0}, t923={6:0}, t924={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L792] 3 y$w_buff1 = y$w_buff0 [L793] 3 y$w_buff0 = 1 [L794] 3 y$w_buff1_used = y$w_buff0_used [L795] 3 y$w_buff0_used = (_Bool)1 [L796] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L796] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L797] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L798] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L799] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L800] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L801] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L804] 3 z = 1 [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L810] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L752] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L764] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y [L771] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L772] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L777] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 __unbuffered_p1_EAX = y [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L847] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L848] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L849] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L850] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t922={5:0}, t923={6:0}, t924={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L853] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 838]: 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: 840]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 145 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 268 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 188 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 669 IncrementalHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 35 mSDtfsCounter, 669 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=8, InterpolantAutomatonStates: 42, 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, 3.2s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 714 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-19 07:45:59,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5d40a34-7d30-4463-9eb2-c2b65f02ffca/bin/uautomizer-verify-uCwYo4JHxu/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