./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50f69ee3-f425-466c-8270-c4c34cfbc670/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50f69ee3-f425-466c-8270-c4c34cfbc670/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50f69ee3-f425-466c-8270-c4c34cfbc670/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50f69ee3-f425-466c-8270-c4c34cfbc670/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50f69ee3-f425-466c-8270-c4c34cfbc670/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50f69ee3-f425-466c-8270-c4c34cfbc670/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0c5111fe11e917830ff927fef759eebec65ab7406e64ef6d78fce931b0e70c57 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:25:05,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:25:05,098 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50f69ee3-f425-466c-8270-c4c34cfbc670/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:25:05,107 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:25:05,108 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:25:05,141 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:25:05,142 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:25:05,143 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:25:05,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:25:05,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:25:05,148 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:25:05,149 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:25:05,149 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:25:05,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:25:05,155 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:25:05,155 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:25:05,156 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:25:05,156 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:25:05,157 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:25:05,157 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:25:05,157 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:25:05,159 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:25:05,160 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:25:05,160 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:25:05,160 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:25:05,161 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:25:05,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:25:05,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:25:05,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:25:05,163 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:25:05,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:25:05,165 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:25:05,183 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:25:05,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:25:05,185 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:25:05,185 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:25:05,186 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:25:05,186 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:25:05,186 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:25:05,187 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_50f69ee3-f425-466c-8270-c4c34cfbc670/bin/uautomizer-verify-uTZkv6EMXl/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50f69ee3-f425-466c-8270-c4c34cfbc670/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0c5111fe11e917830ff927fef759eebec65ab7406e64ef6d78fce931b0e70c57 [2023-11-12 02:25:05,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:25:05,498 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:25:05,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:25:05,503 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:25:05,504 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:25:05,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50f69ee3-f425-466c-8270-c4c34cfbc670/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i [2023-11-12 02:25:08,691 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:25:08,991 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:25:08,992 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50f69ee3-f425-466c-8270-c4c34cfbc670/sv-benchmarks/c/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i [2023-11-12 02:25:09,012 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50f69ee3-f425-466c-8270-c4c34cfbc670/bin/uautomizer-verify-uTZkv6EMXl/data/b92e6a405/4a230413b1034777851a26efea0d4f92/FLAG0c75c7a4d [2023-11-12 02:25:09,027 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50f69ee3-f425-466c-8270-c4c34cfbc670/bin/uautomizer-verify-uTZkv6EMXl/data/b92e6a405/4a230413b1034777851a26efea0d4f92 [2023-11-12 02:25:09,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:25:09,031 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:25:09,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:25:09,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:25:09,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:25:09,042 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:25:09" (1/1) ... [2023-11-12 02:25:09,043 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@672e7a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:09, skipping insertion in model container [2023-11-12 02:25:09,043 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:25:09" (1/1) ... [2023-11-12 02:25:09,098 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:25:09,277 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_50f69ee3-f425-466c-8270-c4c34cfbc670/sv-benchmarks/c/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i[1013,1026] [2023-11-12 02:25:09,495 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:25:09,513 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:25:09,528 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_50f69ee3-f425-466c-8270-c4c34cfbc670/sv-benchmarks/c/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i[1013,1026] [2023-11-12 02:25:09,577 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:25:09,618 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:25:09,618 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:25:09,624 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:25:09,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:09 WrapperNode [2023-11-12 02:25:09,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:25:09,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:25:09,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:25:09,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:25:09,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:09" (1/1) ... [2023-11-12 02:25:09,652 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:09" (1/1) ... [2023-11-12 02:25:09,679 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 126 [2023-11-12 02:25:09,680 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:25:09,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:25:09,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:25:09,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:25:09,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:09" (1/1) ... [2023-11-12 02:25:09,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:09" (1/1) ... [2023-11-12 02:25:09,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:09" (1/1) ... [2023-11-12 02:25:09,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:09" (1/1) ... [2023-11-12 02:25:09,708 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:09" (1/1) ... [2023-11-12 02:25:09,710 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:09" (1/1) ... [2023-11-12 02:25:09,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:09" (1/1) ... [2023-11-12 02:25:09,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:09" (1/1) ... [2023-11-12 02:25:09,719 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:25:09,721 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:25:09,727 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:25:09,727 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:25:09,728 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:09" (1/1) ... [2023-11-12 02:25:09,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:25:09,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50f69ee3-f425-466c-8270-c4c34cfbc670/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:25:09,766 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50f69ee3-f425-466c-8270-c4c34cfbc670/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:25:09,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50f69ee3-f425-466c-8270-c4c34cfbc670/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:25:09,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:25:09,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 02:25:09,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:25:09,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:25:09,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:25:09,811 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-12 02:25:09,811 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-12 02:25:09,811 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-12 02:25:09,811 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-12 02:25:09,811 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-12 02:25:09,813 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-12 02:25:09,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:25:09,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 02:25:09,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:25:09,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:25:09,816 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 02:25:09,964 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:25:09,966 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:25:10,285 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:25:10,537 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:25:10,537 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:25:10,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:25:10 BoogieIcfgContainer [2023-11-12 02:25:10,543 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:25:10,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:25:10,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:25:10,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:25:10,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:25:09" (1/3) ... [2023-11-12 02:25:10,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d2f58eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:25:10, skipping insertion in model container [2023-11-12 02:25:10,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:09" (2/3) ... [2023-11-12 02:25:10,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d2f58eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:25:10, skipping insertion in model container [2023-11-12 02:25:10,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:25:10" (3/3) ... [2023-11-12 02:25:10,558 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_power.oepc_pso.oepc_rmo.oepc.i [2023-11-12 02:25:10,567 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-12 02:25:10,576 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:25:10,576 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-12 02:25:10,576 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:25:10,656 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-12 02:25:10,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 230 flow [2023-11-12 02:25:10,771 INFO L124 PetriNetUnfolderBase]: 2/106 cut-off events. [2023-11-12 02:25:10,771 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:25:10,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-11-12 02:25:10,778 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 109 transitions, 230 flow [2023-11-12 02:25:10,783 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 106 transitions, 221 flow [2023-11-12 02:25:10,787 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:25:10,799 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 106 transitions, 221 flow [2023-11-12 02:25:10,803 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 106 transitions, 221 flow [2023-11-12 02:25:10,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 221 flow [2023-11-12 02:25:10,839 INFO L124 PetriNetUnfolderBase]: 2/106 cut-off events. [2023-11-12 02:25:10,839 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:25:10,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-11-12 02:25:10,843 INFO L119 LiptonReduction]: Number of co-enabled transitions 1958 [2023-11-12 02:25:15,333 INFO L134 LiptonReduction]: Checked pairs total: 4916 [2023-11-12 02:25:15,333 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-11-12 02:25:15,367 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:25:15,381 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;@7717bfc8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:25:15,382 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-12 02:25:15,390 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-12 02:25:15,390 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-11-12 02:25:15,391 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:25:15,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:25:15,392 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 02:25:15,393 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:25:15,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:15,398 INFO L85 PathProgramCache]: Analyzing trace with hash 447672779, now seen corresponding path program 1 times [2023-11-12 02:25:15,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:15,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496718810] [2023-11-12 02:25:15,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:15,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:16,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:16,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:16,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496718810] [2023-11-12 02:25:16,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496718810] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:16,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:16,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:25:16,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440682202] [2023-11-12 02:25:16,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:16,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:25:16,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:16,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:25:16,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:25:16,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 201 [2023-11-12 02:25:16,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:16,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:25:16,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 201 [2023-11-12 02:25:16,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:25:16,478 INFO L124 PetriNetUnfolderBase]: 999/1564 cut-off events. [2023-11-12 02:25:16,479 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-12 02:25:16,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3099 conditions, 1564 events. 999/1564 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7268 event pairs, 277 based on Foata normal form. 64/1496 useless extension candidates. Maximal degree in co-relation 3088. Up to 1195 conditions per place. [2023-11-12 02:25:16,498 INFO L140 encePairwiseOnDemand]: 197/201 looper letters, 29 selfloop transitions, 2 changer transitions 4/37 dead transitions. [2023-11-12 02:25:16,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 156 flow [2023-11-12 02:25:16,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:25:16,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:25:16,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 326 transitions. [2023-11-12 02:25:16,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5406301824212272 [2023-11-12 02:25:16,514 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 326 transitions. [2023-11-12 02:25:16,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 326 transitions. [2023-11-12 02:25:16,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:25:16,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 326 transitions. [2023-11-12 02:25:16,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:16,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:16,530 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:16,532 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 326 transitions. [2023-11-12 02:25:16,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 156 flow [2023-11-12 02:25:16,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 152 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-12 02:25:16,537 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2023-11-12 02:25:16,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-11-12 02:25:16,543 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-11-12 02:25:16,543 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 52 flow [2023-11-12 02:25:16,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:16,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:25:16,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:16,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:25:16,545 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:25:16,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:16,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1533907329, now seen corresponding path program 1 times [2023-11-12 02:25:16,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:16,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246583972] [2023-11-12 02:25:16,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:16,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:16,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:16,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:16,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246583972] [2023-11-12 02:25:16,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246583972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:16,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:16,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:25:16,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135157374] [2023-11-12 02:25:16,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:16,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:25:16,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:16,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:25:16,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:25:16,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 201 [2023-11-12 02:25:16,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:16,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:25:16,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 201 [2023-11-12 02:25:16,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:25:17,286 INFO L124 PetriNetUnfolderBase]: 977/1558 cut-off events. [2023-11-12 02:25:17,287 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2023-11-12 02:25:17,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3198 conditions, 1558 events. 977/1558 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7180 event pairs, 313 based on Foata normal form. 80/1638 useless extension candidates. Maximal degree in co-relation 3188. Up to 1201 conditions per place. [2023-11-12 02:25:17,299 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 27 selfloop transitions, 3 changer transitions 17/48 dead transitions. [2023-11-12 02:25:17,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 48 transitions, 208 flow [2023-11-12 02:25:17,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:25:17,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:25:17,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2023-11-12 02:25:17,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5064676616915423 [2023-11-12 02:25:17,308 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2023-11-12 02:25:17,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2023-11-12 02:25:17,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:25:17,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2023-11-12 02:25:17,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:17,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:17,322 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:17,322 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 52 flow. Second operand 5 states and 509 transitions. [2023-11-12 02:25:17,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 48 transitions, 208 flow [2023-11-12 02:25:17,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 48 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:25:17,327 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 75 flow [2023-11-12 02:25:17,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=75, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2023-11-12 02:25:17,329 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2023-11-12 02:25:17,335 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 75 flow [2023-11-12 02:25:17,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:17,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:25:17,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:17,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:25:17,336 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:25:17,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:17,337 INFO L85 PathProgramCache]: Analyzing trace with hash 306465154, now seen corresponding path program 1 times [2023-11-12 02:25:17,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:17,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092447389] [2023-11-12 02:25:17,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:17,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:17,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:17,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:17,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092447389] [2023-11-12 02:25:17,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092447389] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:17,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:17,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:25:17,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047394993] [2023-11-12 02:25:17,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:17,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:25:17,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:17,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:25:17,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:25:17,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 201 [2023-11-12 02:25:17,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 75 flow. Second operand has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:17,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:25:17,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 201 [2023-11-12 02:25:17,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:25:18,308 INFO L124 PetriNetUnfolderBase]: 1819/2776 cut-off events. [2023-11-12 02:25:18,308 INFO L125 PetriNetUnfolderBase]: For 1256/1256 co-relation queries the response was YES. [2023-11-12 02:25:18,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6604 conditions, 2776 events. 1819/2776 cut-off events. For 1256/1256 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 13577 event pairs, 127 based on Foata normal form. 155/2931 useless extension candidates. Maximal degree in co-relation 6591. Up to 1260 conditions per place. [2023-11-12 02:25:18,330 INFO L140 encePairwiseOnDemand]: 193/201 looper letters, 44 selfloop transitions, 9 changer transitions 30/83 dead transitions. [2023-11-12 02:25:18,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 83 transitions, 421 flow [2023-11-12 02:25:18,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:25:18,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:25:18,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 698 transitions. [2023-11-12 02:25:18,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.496090973702914 [2023-11-12 02:25:18,334 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 698 transitions. [2023-11-12 02:25:18,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 698 transitions. [2023-11-12 02:25:18,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:25:18,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 698 transitions. [2023-11-12 02:25:18,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.71428571428571) internal successors, (698), 7 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:18,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:18,343 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:18,343 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 75 flow. Second operand 7 states and 698 transitions. [2023-11-12 02:25:18,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 83 transitions, 421 flow [2023-11-12 02:25:18,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 83 transitions, 412 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-12 02:25:18,353 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 156 flow [2023-11-12 02:25:18,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=156, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-11-12 02:25:18,355 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2023-11-12 02:25:18,358 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 156 flow [2023-11-12 02:25:18,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:18,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:25:18,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:18,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:25:18,360 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:25:18,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:18,361 INFO L85 PathProgramCache]: Analyzing trace with hash 930124492, now seen corresponding path program 1 times [2023-11-12 02:25:18,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:18,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077721926] [2023-11-12 02:25:18,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:18,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:18,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:18,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:18,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077721926] [2023-11-12 02:25:18,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077721926] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:18,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:18,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:25:18,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178225333] [2023-11-12 02:25:18,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:18,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:25:18,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:18,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:25:18,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:25:18,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 201 [2023-11-12 02:25:18,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:18,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:25:18,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 201 [2023-11-12 02:25:18,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:25:18,795 INFO L124 PetriNetUnfolderBase]: 684/1195 cut-off events. [2023-11-12 02:25:18,796 INFO L125 PetriNetUnfolderBase]: For 1663/1673 co-relation queries the response was YES. [2023-11-12 02:25:18,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3522 conditions, 1195 events. 684/1195 cut-off events. For 1663/1673 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5832 event pairs, 175 based on Foata normal form. 61/1250 useless extension candidates. Maximal degree in co-relation 3503. Up to 961 conditions per place. [2023-11-12 02:25:18,809 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 36 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2023-11-12 02:25:18,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 308 flow [2023-11-12 02:25:18,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:25:18,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:25:18,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 312 transitions. [2023-11-12 02:25:18,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5174129353233831 [2023-11-12 02:25:18,811 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 312 transitions. [2023-11-12 02:25:18,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 312 transitions. [2023-11-12 02:25:18,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:25:18,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 312 transitions. [2023-11-12 02:25:18,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:18,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:18,816 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:18,817 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 156 flow. Second operand 3 states and 312 transitions. [2023-11-12 02:25:18,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 308 flow [2023-11-12 02:25:18,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 47 transitions, 302 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-12 02:25:18,824 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 176 flow [2023-11-12 02:25:18,824 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2023-11-12 02:25:18,825 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2023-11-12 02:25:18,826 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 176 flow [2023-11-12 02:25:18,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:18,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:25:18,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:18,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:25:18,827 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:25:18,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:18,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1809638787, now seen corresponding path program 1 times [2023-11-12 02:25:18,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:18,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833460602] [2023-11-12 02:25:18,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:18,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:19,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:19,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:19,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833460602] [2023-11-12 02:25:19,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833460602] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:19,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:19,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:25:19,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743506723] [2023-11-12 02:25:19,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:19,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:25:19,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:19,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:25:19,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:25:19,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 201 [2023-11-12 02:25:19,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:19,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:25:19,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 201 [2023-11-12 02:25:19,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:25:19,280 INFO L124 PetriNetUnfolderBase]: 306/596 cut-off events. [2023-11-12 02:25:19,281 INFO L125 PetriNetUnfolderBase]: For 679/684 co-relation queries the response was YES. [2023-11-12 02:25:19,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1970 conditions, 596 events. 306/596 cut-off events. For 679/684 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2643 event pairs, 86 based on Foata normal form. 61/651 useless extension candidates. Maximal degree in co-relation 1950. Up to 198 conditions per place. [2023-11-12 02:25:19,287 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 46 selfloop transitions, 7 changer transitions 0/60 dead transitions. [2023-11-12 02:25:19,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 60 transitions, 410 flow [2023-11-12 02:25:19,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:25:19,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:25:19,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 416 transitions. [2023-11-12 02:25:19,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5174129353233831 [2023-11-12 02:25:19,291 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 416 transitions. [2023-11-12 02:25:19,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 416 transitions. [2023-11-12 02:25:19,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:25:19,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 416 transitions. [2023-11-12 02:25:19,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:19,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:19,298 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:19,298 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 176 flow. Second operand 4 states and 416 transitions. [2023-11-12 02:25:19,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 60 transitions, 410 flow [2023-11-12 02:25:19,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 400 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-12 02:25:19,304 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 207 flow [2023-11-12 02:25:19,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=207, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-11-12 02:25:19,305 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2023-11-12 02:25:19,305 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 207 flow [2023-11-12 02:25:19,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:19,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:25:19,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:19,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:25:19,307 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:25:19,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:19,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1470161418, now seen corresponding path program 1 times [2023-11-12 02:25:19,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:19,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089542912] [2023-11-12 02:25:19,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:19,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:19,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:19,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:19,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089542912] [2023-11-12 02:25:19,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089542912] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:19,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:19,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:25:19,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211390327] [2023-11-12 02:25:19,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:19,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:25:19,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:19,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:25:19,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:25:19,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 201 [2023-11-12 02:25:19,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 207 flow. Second operand has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:19,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:25:19,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 201 [2023-11-12 02:25:19,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:25:19,991 INFO L124 PetriNetUnfolderBase]: 482/913 cut-off events. [2023-11-12 02:25:19,991 INFO L125 PetriNetUnfolderBase]: For 1575/1575 co-relation queries the response was YES. [2023-11-12 02:25:19,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3253 conditions, 913 events. 482/913 cut-off events. For 1575/1575 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4440 event pairs, 76 based on Foata normal form. 16/929 useless extension candidates. Maximal degree in co-relation 3232. Up to 426 conditions per place. [2023-11-12 02:25:19,999 INFO L140 encePairwiseOnDemand]: 193/201 looper letters, 53 selfloop transitions, 12 changer transitions 27/92 dead transitions. [2023-11-12 02:25:20,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 92 transitions, 682 flow [2023-11-12 02:25:20,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:25:20,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:25:20,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 683 transitions. [2023-11-12 02:25:20,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48542999289267946 [2023-11-12 02:25:20,004 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 683 transitions. [2023-11-12 02:25:20,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 683 transitions. [2023-11-12 02:25:20,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:25:20,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 683 transitions. [2023-11-12 02:25:20,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.57142857142857) internal successors, (683), 7 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:20,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:20,012 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:20,013 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 207 flow. Second operand 7 states and 683 transitions. [2023-11-12 02:25:20,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 92 transitions, 682 flow [2023-11-12 02:25:20,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 92 transitions, 638 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-11-12 02:25:20,020 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 243 flow [2023-11-12 02:25:20,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=243, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2023-11-12 02:25:20,023 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 18 predicate places. [2023-11-12 02:25:20,023 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 243 flow [2023-11-12 02:25:20,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:20,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:25:20,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:20,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:25:20,025 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:25:20,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:20,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1955757260, now seen corresponding path program 1 times [2023-11-12 02:25:20,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:20,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582577926] [2023-11-12 02:25:20,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:20,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:20,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:20,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:20,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582577926] [2023-11-12 02:25:20,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582577926] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:20,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:20,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:25:20,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351738308] [2023-11-12 02:25:20,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:20,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:25:20,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:20,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:25:20,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:25:20,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 201 [2023-11-12 02:25:20,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 243 flow. Second operand has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:20,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:25:20,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 201 [2023-11-12 02:25:20,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:25:20,807 INFO L124 PetriNetUnfolderBase]: 478/952 cut-off events. [2023-11-12 02:25:20,807 INFO L125 PetriNetUnfolderBase]: For 1990/1990 co-relation queries the response was YES. [2023-11-12 02:25:20,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3458 conditions, 952 events. 478/952 cut-off events. For 1990/1990 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4978 event pairs, 90 based on Foata normal form. 11/963 useless extension candidates. Maximal degree in co-relation 3432. Up to 436 conditions per place. [2023-11-12 02:25:20,816 INFO L140 encePairwiseOnDemand]: 193/201 looper letters, 50 selfloop transitions, 12 changer transitions 20/82 dead transitions. [2023-11-12 02:25:20,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 82 transitions, 643 flow [2023-11-12 02:25:20,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:25:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:25:20,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 499 transitions. [2023-11-12 02:25:20,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49651741293532337 [2023-11-12 02:25:20,820 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 499 transitions. [2023-11-12 02:25:20,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 499 transitions. [2023-11-12 02:25:20,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:25:20,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 499 transitions. [2023-11-12 02:25:20,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:20,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:20,826 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:20,827 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 243 flow. Second operand 5 states and 499 transitions. [2023-11-12 02:25:20,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 82 transitions, 643 flow [2023-11-12 02:25:20,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 82 transitions, 617 flow, removed 13 selfloop flow, removed 3 redundant places. [2023-11-12 02:25:20,834 INFO L231 Difference]: Finished difference. Result has 53 places, 37 transitions, 276 flow [2023-11-12 02:25:20,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=276, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2023-11-12 02:25:20,835 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 19 predicate places. [2023-11-12 02:25:20,835 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 37 transitions, 276 flow [2023-11-12 02:25:20,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:20,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:25:20,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:20,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:25:20,837 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:25:20,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:20,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1363564176, now seen corresponding path program 2 times [2023-11-12 02:25:20,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:20,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529015780] [2023-11-12 02:25:20,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:20,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:21,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:21,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529015780] [2023-11-12 02:25:21,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529015780] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:21,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:21,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:25:21,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743292862] [2023-11-12 02:25:21,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:21,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:25:21,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:21,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:25:21,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:25:21,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 201 [2023-11-12 02:25:21,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 37 transitions, 276 flow. Second operand has 5 states, 5 states have (on average 96.2) internal successors, (481), 5 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:21,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:25:21,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 201 [2023-11-12 02:25:21,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:25:21,279 INFO L124 PetriNetUnfolderBase]: 265/536 cut-off events. [2023-11-12 02:25:21,279 INFO L125 PetriNetUnfolderBase]: For 1260/1266 co-relation queries the response was YES. [2023-11-12 02:25:21,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2032 conditions, 536 events. 265/536 cut-off events. For 1260/1266 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2565 event pairs, 77 based on Foata normal form. 34/564 useless extension candidates. Maximal degree in co-relation 2011. Up to 214 conditions per place. [2023-11-12 02:25:21,283 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 26 selfloop transitions, 10 changer transitions 24/62 dead transitions. [2023-11-12 02:25:21,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 62 transitions, 555 flow [2023-11-12 02:25:21,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:25:21,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:25:21,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2023-11-12 02:25:21,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5064676616915423 [2023-11-12 02:25:21,287 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2023-11-12 02:25:21,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2023-11-12 02:25:21,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:25:21,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2023-11-12 02:25:21,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:21,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:21,292 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:21,293 INFO L175 Difference]: Start difference. First operand has 53 places, 37 transitions, 276 flow. Second operand 5 states and 509 transitions. [2023-11-12 02:25:21,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 62 transitions, 555 flow [2023-11-12 02:25:21,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 62 transitions, 496 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-11-12 02:25:21,299 INFO L231 Difference]: Finished difference. Result has 52 places, 27 transitions, 168 flow [2023-11-12 02:25:21,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=52, PETRI_TRANSITIONS=27} [2023-11-12 02:25:21,300 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 18 predicate places. [2023-11-12 02:25:21,300 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 27 transitions, 168 flow [2023-11-12 02:25:21,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.2) internal successors, (481), 5 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:21,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:25:21,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:21,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:25:21,302 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:25:21,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:21,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1414086476, now seen corresponding path program 1 times [2023-11-12 02:25:21,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:21,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356099411] [2023-11-12 02:25:21,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:21,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:22,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:22,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356099411] [2023-11-12 02:25:22,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356099411] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:22,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:22,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:25:22,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421653478] [2023-11-12 02:25:22,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:22,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:25:22,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:22,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:25:22,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:25:22,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 201 [2023-11-12 02:25:22,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 27 transitions, 168 flow. Second operand has 8 states, 8 states have (on average 91.375) internal successors, (731), 8 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:22,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:25:22,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 201 [2023-11-12 02:25:22,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:25:22,463 INFO L124 PetriNetUnfolderBase]: 56/130 cut-off events. [2023-11-12 02:25:22,463 INFO L125 PetriNetUnfolderBase]: For 253/253 co-relation queries the response was YES. [2023-11-12 02:25:22,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 130 events. 56/130 cut-off events. For 253/253 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 340 event pairs, 12 based on Foata normal form. 1/131 useless extension candidates. Maximal degree in co-relation 490. Up to 46 conditions per place. [2023-11-12 02:25:22,465 INFO L140 encePairwiseOnDemand]: 194/201 looper letters, 26 selfloop transitions, 3 changer transitions 24/55 dead transitions. [2023-11-12 02:25:22,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 55 transitions, 444 flow [2023-11-12 02:25:22,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:25:22,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-12 02:25:22,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 752 transitions. [2023-11-12 02:25:22,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46766169154228854 [2023-11-12 02:25:22,469 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 752 transitions. [2023-11-12 02:25:22,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 752 transitions. [2023-11-12 02:25:22,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:25:22,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 752 transitions. [2023-11-12 02:25:22,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.0) internal successors, (752), 8 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:22,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 201.0) internal successors, (1809), 9 states have internal predecessors, (1809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:22,477 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 201.0) internal successors, (1809), 9 states have internal predecessors, (1809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:22,477 INFO L175 Difference]: Start difference. First operand has 52 places, 27 transitions, 168 flow. Second operand 8 states and 752 transitions. [2023-11-12 02:25:22,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 55 transitions, 444 flow [2023-11-12 02:25:22,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 323 flow, removed 22 selfloop flow, removed 17 redundant places. [2023-11-12 02:25:22,481 INFO L231 Difference]: Finished difference. Result has 46 places, 27 transitions, 116 flow [2023-11-12 02:25:22,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=116, PETRI_PLACES=46, PETRI_TRANSITIONS=27} [2023-11-12 02:25:22,482 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2023-11-12 02:25:22,482 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 27 transitions, 116 flow [2023-11-12 02:25:22,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.375) internal successors, (731), 8 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:22,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:25:22,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:22,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:25:22,483 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:25:22,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:22,484 INFO L85 PathProgramCache]: Analyzing trace with hash 290287712, now seen corresponding path program 2 times [2023-11-12 02:25:22,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:22,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951801802] [2023-11-12 02:25:22,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:22,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:25:22,548 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:25:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:25:22,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:25:22,630 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:25:22,632 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-12 02:25:22,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-12 02:25:22,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-12 02:25:22,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-12 02:25:22,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-12 02:25:22,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-12 02:25:22,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:25:22,637 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:22,644 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-12 02:25:22,644 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:25:22,717 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-12 02:25:22,719 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-12 02:25:22,721 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-12 02:25:22,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:25:22 BasicIcfg [2023-11-12 02:25:22,761 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:25:22,762 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:25:22,762 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:25:22,762 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:25:22,763 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:25:10" (3/4) ... [2023-11-12 02:25:22,764 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-12 02:25:22,794 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-12 02:25:22,798 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-12 02:25:22,801 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-12 02:25:22,880 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50f69ee3-f425-466c-8270-c4c34cfbc670/bin/uautomizer-verify-uTZkv6EMXl/witness.graphml [2023-11-12 02:25:22,880 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:25:22,881 INFO L158 Benchmark]: Toolchain (without parser) took 13849.80ms. Allocated memory was 163.6MB in the beginning and 268.4MB in the end (delta: 104.9MB). Free memory was 114.3MB in the beginning and 145.5MB in the end (delta: -31.2MB). Peak memory consumption was 74.3MB. Max. memory is 16.1GB. [2023-11-12 02:25:22,881 INFO L158 Benchmark]: CDTParser took 0.65ms. Allocated memory is still 163.6MB. Free memory is still 131.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:25:22,882 INFO L158 Benchmark]: CACSL2BoogieTranslator took 593.03ms. Allocated memory is still 163.6MB. Free memory was 114.3MB in the beginning and 90.7MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-12 02:25:22,882 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.92ms. Allocated memory is still 163.6MB. Free memory was 90.7MB in the beginning and 88.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:25:22,882 INFO L158 Benchmark]: Boogie Preprocessor took 39.19ms. Allocated memory is still 163.6MB. Free memory was 88.6MB in the beginning and 86.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:25:22,883 INFO L158 Benchmark]: RCFGBuilder took 822.74ms. Allocated memory was 163.6MB in the beginning and 222.3MB in the end (delta: 58.7MB). Free memory was 86.5MB in the beginning and 181.3MB in the end (delta: -94.8MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. [2023-11-12 02:25:22,883 INFO L158 Benchmark]: TraceAbstraction took 12212.06ms. Allocated memory was 222.3MB in the beginning and 268.4MB in the end (delta: 46.1MB). Free memory was 180.2MB in the beginning and 154.9MB in the end (delta: 25.3MB). Peak memory consumption was 72.5MB. Max. memory is 16.1GB. [2023-11-12 02:25:22,884 INFO L158 Benchmark]: Witness Printer took 118.31ms. Allocated memory is still 268.4MB. Free memory was 154.9MB in the beginning and 145.5MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-12 02:25:22,888 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.65ms. Allocated memory is still 163.6MB. Free memory is still 131.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 593.03ms. Allocated memory is still 163.6MB. Free memory was 114.3MB in the beginning and 90.7MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.92ms. Allocated memory is still 163.6MB. Free memory was 90.7MB in the beginning and 88.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.19ms. Allocated memory is still 163.6MB. Free memory was 88.6MB in the beginning and 86.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 822.74ms. Allocated memory was 163.6MB in the beginning and 222.3MB in the end (delta: 58.7MB). Free memory was 86.5MB in the beginning and 181.3MB in the end (delta: -94.8MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12212.06ms. Allocated memory was 222.3MB in the beginning and 268.4MB in the end (delta: 46.1MB). Free memory was 180.2MB in the beginning and 154.9MB in the end (delta: 25.3MB). Peak memory consumption was 72.5MB. Max. memory is 16.1GB. * Witness Printer took 118.31ms. Allocated memory is still 268.4MB. Free memory was 154.9MB in the beginning and 145.5MB 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: 4.5s, 114 PlacesBefore, 34 PlacesAfterwards, 106 TransitionsBefore, 25 TransitionsAfterwards, 1958 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 92 TotalNumberOfCompositions, 4916 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2050, independent: 1877, independent conditional: 0, independent unconditional: 1877, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1056, independent: 1022, independent conditional: 0, independent unconditional: 1022, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2050, independent: 855, independent conditional: 0, independent unconditional: 855, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 1056, unknown conditional: 0, unknown unconditional: 1056] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 50, Positive conditional cache size: 0, Positive unconditional cache size: 50, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff0_thd3; [L723] 0 _Bool x$r_buff1_thd0; [L724] 0 _Bool x$r_buff1_thd1; [L725] 0 _Bool x$r_buff1_thd2; [L726] 0 _Bool x$r_buff1_thd3; [L727] 0 _Bool x$read_delayed; [L728] 0 int *x$read_delayed_var; [L729] 0 int x$w_buff0; [L730] 0 _Bool x$w_buff0_used; [L731] 0 int x$w_buff1; [L732] 0 _Bool x$w_buff1_used; [L734] 0 int y = 0; [L736] 0 int z = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L829] 0 pthread_t t2513; [L830] FCALL, FORK 0 pthread_create(&t2513, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2513={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L831] 0 pthread_t t2514; [L832] FCALL, FORK 0 pthread_create(&t2514, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2513={5:0}, t2514={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L833] 0 pthread_t t2515; [L834] FCALL, FORK 0 pthread_create(&t2515, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2513={5:0}, t2514={6:0}, t2515={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L801] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L742] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=2] [L807] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=2] [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L816] 3 return 0; [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=2] [L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2513={5:0}, t2514={6:0}, t2515={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L847] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 834]: 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: 830]: 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: 832]: 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, 135 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: 11.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 363 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 288 mSDsluCounter, 200 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 160 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 868 IncrementalHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 40 mSDtfsCounter, 868 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=276occurred in iteration=7, InterpolantAutomatonStates: 47, 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.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 539 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-12 02:25:22,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50f69ee3-f425-466c-8270-c4c34cfbc670/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE