./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 527bcce2 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_c84caabe-a960-4495-89fe-893fe070551c/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c84caabe-a960-4495-89fe-893fe070551c/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c84caabe-a960-4495-89fe-893fe070551c/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c84caabe-a960-4495-89fe-893fe070551c/bin/uautomizer-verify-bycVGegfSx/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c84caabe-a960-4495-89fe-893fe070551c/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c84caabe-a960-4495-89fe-893fe070551c/bin/uautomizer-verify-bycVGegfSx --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 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 21:04:29,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 21:04:29,903 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c84caabe-a960-4495-89fe-893fe070551c/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-21 21:04:29,909 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 21:04:29,910 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 21:04:29,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 21:04:29,939 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 21:04:29,940 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 21:04:29,941 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 21:04:29,941 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 21:04:29,942 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 21:04:29,943 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 21:04:29,944 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 21:04:29,947 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 21:04:29,948 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 21:04:29,949 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 21:04:29,952 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 21:04:29,953 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 21:04:29,953 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 21:04:29,954 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 21:04:29,959 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 21:04:29,960 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 21:04:29,961 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 21:04:29,961 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 21:04:29,962 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 21:04:29,962 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 21:04:29,963 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 21:04:29,963 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 21:04:29,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 21:04:29,964 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 21:04:29,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 21:04:29,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 21:04:29,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 21:04:29,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 21:04:29,967 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 21:04:29,967 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 21:04:29,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 21:04:29,968 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 21:04:29,968 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 21:04:29,968 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 21:04:29,968 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 21:04:29,969 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 21:04:29,969 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_c84caabe-a960-4495-89fe-893fe070551c/bin/uautomizer-verify-bycVGegfSx/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_c84caabe-a960-4495-89fe-893fe070551c/bin/uautomizer-verify-bycVGegfSx 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 -> 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 [2023-11-21 21:04:30,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 21:04:30,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 21:04:30,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 21:04:30,297 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 21:04:30,297 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 21:04:30,299 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c84caabe-a960-4495-89fe-893fe070551c/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2023-11-21 21:04:33,487 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 21:04:33,869 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 21:04:33,870 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c84caabe-a960-4495-89fe-893fe070551c/sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2023-11-21 21:04:33,889 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c84caabe-a960-4495-89fe-893fe070551c/bin/uautomizer-verify-bycVGegfSx/data/cbd0dcd32/565d6267bd0141f8abd5023f9ff46c7d/FLAGf8d9360fc [2023-11-21 21:04:33,913 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c84caabe-a960-4495-89fe-893fe070551c/bin/uautomizer-verify-bycVGegfSx/data/cbd0dcd32/565d6267bd0141f8abd5023f9ff46c7d [2023-11-21 21:04:33,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 21:04:33,923 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 21:04:33,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 21:04:33,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 21:04:33,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 21:04:33,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:04:33" (1/1) ... [2023-11-21 21:04:33,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e8b070c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:33, skipping insertion in model container [2023-11-21 21:04:33,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:04:33" (1/1) ... [2023-11-21 21:04:34,018 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 21:04:34,284 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_c84caabe-a960-4495-89fe-893fe070551c/sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i[949,962] [2023-11-21 21:04:34,646 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:04:34,662 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 21:04:34,678 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_c84caabe-a960-4495-89fe-893fe070551c/sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i[949,962] [2023-11-21 21:04:34,761 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:04:34,818 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 21:04:34,818 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 21:04:34,825 INFO L206 MainTranslator]: Completed translation [2023-11-21 21:04:34,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:34 WrapperNode [2023-11-21 21:04:34,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 21:04:34,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 21:04:34,828 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 21:04:34,828 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 21:04:34,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:34" (1/1) ... [2023-11-21 21:04:34,861 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:34" (1/1) ... [2023-11-21 21:04:34,919 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2023-11-21 21:04:34,932 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 21:04:34,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 21:04:34,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 21:04:34,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 21:04:34,971 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:34" (1/1) ... [2023-11-21 21:04:34,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:34" (1/1) ... [2023-11-21 21:04:34,977 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:34" (1/1) ... [2023-11-21 21:04:35,002 INFO L187 HeapSplitter]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1] [2023-11-21 21:04:35,003 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:34" (1/1) ... [2023-11-21 21:04:35,003 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:34" (1/1) ... [2023-11-21 21:04:35,014 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:34" (1/1) ... [2023-11-21 21:04:35,016 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:34" (1/1) ... [2023-11-21 21:04:35,019 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:34" (1/1) ... [2023-11-21 21:04:35,022 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:34" (1/1) ... [2023-11-21 21:04:35,027 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 21:04:35,028 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 21:04:35,028 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 21:04:35,028 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 21:04:35,029 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:34" (1/1) ... [2023-11-21 21:04:35,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 21:04:35,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c84caabe-a960-4495-89fe-893fe070551c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:04:35,067 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c84caabe-a960-4495-89fe-893fe070551c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 21:04:35,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c84caabe-a960-4495-89fe-893fe070551c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 21:04:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-21 21:04:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-21 21:04:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-21 21:04:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-21 21:04:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-21 21:04:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-21 21:04:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 21:04:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 21:04:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 21:04:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-21 21:04:35,118 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-21 21:04:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-21 21:04:35,118 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-21 21:04:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-21 21:04:35,118 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-21 21:04:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-21 21:04:35,119 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-21 21:04:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 21:04:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-21 21:04:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-21 21:04:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-21 21:04:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-21 21:04:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-21 21:04:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 21:04:35,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 21:04:35,124 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 21:04:35,370 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 21:04:35,373 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 21:04:35,776 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 21:04:36,121 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 21:04:36,121 INFO L308 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-21 21:04:36,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:04:36 BoogieIcfgContainer [2023-11-21 21:04:36,123 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 21:04:36,127 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 21:04:36,127 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 21:04:36,131 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 21:04:36,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:04:33" (1/3) ... [2023-11-21 21:04:36,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b570e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:04:36, skipping insertion in model container [2023-11-21 21:04:36,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:04:34" (2/3) ... [2023-11-21 21:04:36,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b570e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:04:36, skipping insertion in model container [2023-11-21 21:04:36,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:04:36" (3/3) ... [2023-11-21 21:04:36,137 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_tso.oepc.i [2023-11-21 21:04:36,149 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 21:04:36,160 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 21:04:36,160 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-21 21:04:36,160 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 21:04:36,229 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-21 21:04:36,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 48 transitions, 112 flow [2023-11-21 21:04:36,310 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2023-11-21 21:04:36,310 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 21:04:36,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 44 events. 1/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 94 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2023-11-21 21:04:36,316 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 48 transitions, 112 flow [2023-11-21 21:04:36,320 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 44 transitions, 100 flow [2023-11-21 21:04:36,330 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 21:04:36,337 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;@78091a45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 21:04:36,338 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-21 21:04:36,344 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-21 21:04:36,344 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2023-11-21 21:04:36,344 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 21:04:36,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:04:36,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-21 21:04:36,346 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 21:04:36,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:04:36,351 INFO L85 PathProgramCache]: Analyzing trace with hash -669762493, now seen corresponding path program 1 times [2023-11-21 21:04:36,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:04:36,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399059634] [2023-11-21 21:04:36,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:04:36,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:04:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:04:36,906 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-21 21:04:36,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:04:36,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399059634] [2023-11-21 21:04:36,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399059634] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:04:36,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:04:36,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 21:04:36,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824928556] [2023-11-21 21:04:36,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:04:36,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:04:36,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:04:36,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:04:36,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:04:36,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 48 [2023-11-21 21:04:36,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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-21 21:04:36,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:04:36,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 48 [2023-11-21 21:04:36,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:04:38,036 INFO L124 PetriNetUnfolderBase]: 2160/3608 cut-off events. [2023-11-21 21:04:38,037 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-11-21 21:04:38,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6737 conditions, 3608 events. 2160/3608 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 24783 event pairs, 384 based on Foata normal form. 108/3631 useless extension candidates. Maximal degree in co-relation 6725. Up to 2416 conditions per place. [2023-11-21 21:04:38,082 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 35 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2023-11-21 21:04:38,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 58 transitions, 212 flow [2023-11-21 21:04:38,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:04:38,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:04:38,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2023-11-21 21:04:38,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2023-11-21 21:04:38,097 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 111 transitions. [2023-11-21 21:04:38,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 111 transitions. [2023-11-21 21:04:38,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:04:38,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 111 transitions. [2023-11-21 21:04:38,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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-21 21:04:38,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 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-21 21:04:38,112 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 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-21 21:04:38,114 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 111 transitions. [2023-11-21 21:04:38,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 58 transitions, 212 flow [2023-11-21 21:04:38,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 58 transitions, 206 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-21 21:04:38,128 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 94 flow [2023-11-21 21:04:38,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-11-21 21:04:38,136 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, -3 predicate places. [2023-11-21 21:04:38,137 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 94 flow [2023-11-21 21:04:38,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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-21 21:04:38,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:04:38,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:04:38,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 21:04:38,139 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 21:04:38,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:04:38,141 INFO L85 PathProgramCache]: Analyzing trace with hash -116259748, now seen corresponding path program 1 times [2023-11-21 21:04:38,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:04:38,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929481447] [2023-11-21 21:04:38,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:04:38,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:04:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:04:39,304 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-21 21:04:39,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:04:39,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929481447] [2023-11-21 21:04:39,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929481447] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:04:39,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:04:39,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:04:39,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382971595] [2023-11-21 21:04:39,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:04:39,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:04:39,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:04:39,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:04:39,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:04:39,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2023-11-21 21:04:39,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:04:39,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:04:39,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2023-11-21 21:04:39,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:04:41,071 INFO L124 PetriNetUnfolderBase]: 4540/6921 cut-off events. [2023-11-21 21:04:41,071 INFO L125 PetriNetUnfolderBase]: For 392/392 co-relation queries the response was YES. [2023-11-21 21:04:41,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13745 conditions, 6921 events. 4540/6921 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 48059 event pairs, 830 based on Foata normal form. 0/6766 useless extension candidates. Maximal degree in co-relation 13735. Up to 3963 conditions per place. [2023-11-21 21:04:41,133 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 44 selfloop transitions, 8 changer transitions 63/131 dead transitions. [2023-11-21 21:04:41,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 131 transitions, 526 flow [2023-11-21 21:04:41,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-21 21:04:41,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-21 21:04:41,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 338 transitions. [2023-11-21 21:04:41,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6401515151515151 [2023-11-21 21:04:41,147 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 338 transitions. [2023-11-21 21:04:41,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 338 transitions. [2023-11-21 21:04:41,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:04:41,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 338 transitions. [2023-11-21 21:04:41,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 30.727272727272727) internal successors, (338), 11 states have internal predecessors, (338), 0 states have call successors, (0), 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-21 21:04:41,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 48.0) internal successors, (576), 12 states have internal predecessors, (576), 0 states have call successors, (0), 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-21 21:04:41,160 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 48.0) internal successors, (576), 12 states have internal predecessors, (576), 0 states have call successors, (0), 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-21 21:04:41,160 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 11 states and 338 transitions. [2023-11-21 21:04:41,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 131 transitions, 526 flow [2023-11-21 21:04:41,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 131 transitions, 510 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 21:04:41,170 INFO L231 Difference]: Finished difference. Result has 68 places, 47 transitions, 171 flow [2023-11-21 21:04:41,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=171, PETRI_PLACES=68, PETRI_TRANSITIONS=47} [2023-11-21 21:04:41,171 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 12 predicate places. [2023-11-21 21:04:41,171 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 47 transitions, 171 flow [2023-11-21 21:04:41,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:04:41,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:04:41,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:04:41,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 21:04:41,173 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 21:04:41,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:04:41,176 INFO L85 PathProgramCache]: Analyzing trace with hash 392117452, now seen corresponding path program 1 times [2023-11-21 21:04:41,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:04:41,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453441288] [2023-11-21 21:04:41,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:04:41,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:04:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:04:41,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:04:41,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:04:41,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453441288] [2023-11-21 21:04:41,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453441288] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:04:41,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:04:41,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:04:41,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622790008] [2023-11-21 21:04:41,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:04:41,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 21:04:41,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:04:41,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 21:04:41,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 21:04:41,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2023-11-21 21:04:41,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 47 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:04:41,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:04:41,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2023-11-21 21:04:41,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:04:43,831 INFO L124 PetriNetUnfolderBase]: 8702/12752 cut-off events. [2023-11-21 21:04:43,831 INFO L125 PetriNetUnfolderBase]: For 17008/17010 co-relation queries the response was YES. [2023-11-21 21:04:43,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37137 conditions, 12752 events. 8702/12752 cut-off events. For 17008/17010 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 84302 event pairs, 1004 based on Foata normal form. 399/12931 useless extension candidates. Maximal degree in co-relation 37119. Up to 7201 conditions per place. [2023-11-21 21:04:44,004 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 64 selfloop transitions, 6 changer transitions 0/85 dead transitions. [2023-11-21 21:04:44,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 85 transitions, 467 flow [2023-11-21 21:04:44,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 21:04:44,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-21 21:04:44,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2023-11-21 21:04:44,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6822916666666666 [2023-11-21 21:04:44,006 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 131 transitions. [2023-11-21 21:04:44,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 131 transitions. [2023-11-21 21:04:44,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:04:44,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 131 transitions. [2023-11-21 21:04:44,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 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-21 21:04:44,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 0 states have call successors, (0), 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-21 21:04:44,009 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 0 states have call successors, (0), 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-21 21:04:44,010 INFO L175 Difference]: Start difference. First operand has 68 places, 47 transitions, 171 flow. Second operand 4 states and 131 transitions. [2023-11-21 21:04:44,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 85 transitions, 467 flow [2023-11-21 21:04:44,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 85 transitions, 463 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-21 21:04:44,105 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 213 flow [2023-11-21 21:04:44,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=213, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-11-21 21:04:44,107 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 7 predicate places. [2023-11-21 21:04:44,107 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 213 flow [2023-11-21 21:04:44,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:04:44,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:04:44,108 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-21 21:04:44,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 21:04:44,108 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 21:04:44,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:04:44,109 INFO L85 PathProgramCache]: Analyzing trace with hash 188641132, now seen corresponding path program 1 times [2023-11-21 21:04:44,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:04:44,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414020043] [2023-11-21 21:04:44,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:04:44,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:04:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:04:45,143 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-21 21:04:45,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:04:45,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414020043] [2023-11-21 21:04:45,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414020043] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:04:45,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:04:45,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-21 21:04:45,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763267392] [2023-11-21 21:04:45,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:04:45,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-21 21:04:45,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:04:45,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-21 21:04:45,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-21 21:04:45,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2023-11-21 21:04:45,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 213 flow. Second operand has 8 states, 8 states have (on average 22.0) internal successors, (176), 8 states have internal predecessors, (176), 0 states have call successors, (0), 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-21 21:04:45,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:04:45,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2023-11-21 21:04:45,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:04:47,189 INFO L124 PetriNetUnfolderBase]: 6326/9920 cut-off events. [2023-11-21 21:04:47,189 INFO L125 PetriNetUnfolderBase]: For 11384/11786 co-relation queries the response was YES. [2023-11-21 21:04:47,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29666 conditions, 9920 events. 6326/9920 cut-off events. For 11384/11786 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 72366 event pairs, 1569 based on Foata normal form. 217/9553 useless extension candidates. Maximal degree in co-relation 29646. Up to 6376 conditions per place. [2023-11-21 21:04:47,300 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 78 selfloop transitions, 15 changer transitions 0/114 dead transitions. [2023-11-21 21:04:47,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 114 transitions, 663 flow [2023-11-21 21:04:47,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 21:04:47,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-21 21:04:47,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 249 transitions. [2023-11-21 21:04:47,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6484375 [2023-11-21 21:04:47,303 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 249 transitions. [2023-11-21 21:04:47,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 249 transitions. [2023-11-21 21:04:47,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:04:47,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 249 transitions. [2023-11-21 21:04:47,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 31.125) internal successors, (249), 8 states have internal predecessors, (249), 0 states have call successors, (0), 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-21 21:04:47,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 48.0) internal successors, (432), 9 states have internal predecessors, (432), 0 states have call successors, (0), 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-21 21:04:47,307 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 48.0) internal successors, (432), 9 states have internal predecessors, (432), 0 states have call successors, (0), 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-21 21:04:47,308 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 213 flow. Second operand 8 states and 249 transitions. [2023-11-21 21:04:47,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 114 transitions, 663 flow [2023-11-21 21:04:47,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 114 transitions, 653 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-21 21:04:47,315 INFO L231 Difference]: Finished difference. Result has 72 places, 63 transitions, 330 flow [2023-11-21 21:04:47,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=330, PETRI_PLACES=72, PETRI_TRANSITIONS=63} [2023-11-21 21:04:47,318 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 16 predicate places. [2023-11-21 21:04:47,318 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 63 transitions, 330 flow [2023-11-21 21:04:47,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.0) internal successors, (176), 8 states have internal predecessors, (176), 0 states have call successors, (0), 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-21 21:04:47,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:04:47,319 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-21 21:04:47,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 21:04:47,319 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 21:04:47,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:04:47,320 INFO L85 PathProgramCache]: Analyzing trace with hash 866773930, now seen corresponding path program 1 times [2023-11-21 21:04:47,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:04:47,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654803087] [2023-11-21 21:04:47,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:04:47,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:04:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:04:47,586 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-21 21:04:47,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:04:47,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654803087] [2023-11-21 21:04:47,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654803087] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:04:47,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:04:47,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 21:04:47,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516648104] [2023-11-21 21:04:47,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:04:47,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 21:04:47,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:04:47,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 21:04:47,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-21 21:04:47,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2023-11-21 21:04:47,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 330 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 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-21 21:04:47,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:04:47,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2023-11-21 21:04:47,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:04:49,721 INFO L124 PetriNetUnfolderBase]: 8181/12103 cut-off events. [2023-11-21 21:04:49,721 INFO L125 PetriNetUnfolderBase]: For 25562/25895 co-relation queries the response was YES. [2023-11-21 21:04:49,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41040 conditions, 12103 events. 8181/12103 cut-off events. For 25562/25895 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 77918 event pairs, 563 based on Foata normal form. 484/12351 useless extension candidates. Maximal degree in co-relation 41016. Up to 5373 conditions per place. [2023-11-21 21:04:49,843 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 92 selfloop transitions, 10 changer transitions 6/123 dead transitions. [2023-11-21 21:04:49,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 123 transitions, 865 flow [2023-11-21 21:04:49,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 21:04:49,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-21 21:04:49,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2023-11-21 21:04:49,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2023-11-21 21:04:49,847 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 168 transitions. [2023-11-21 21:04:49,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 168 transitions. [2023-11-21 21:04:49,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:04:49,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 168 transitions. [2023-11-21 21:04:49,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 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-21 21:04:49,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 48.0) internal successors, (288), 6 states have internal predecessors, (288), 0 states have call successors, (0), 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-21 21:04:49,850 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 48.0) internal successors, (288), 6 states have internal predecessors, (288), 0 states have call successors, (0), 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-21 21:04:49,850 INFO L175 Difference]: Start difference. First operand has 72 places, 63 transitions, 330 flow. Second operand 5 states and 168 transitions. [2023-11-21 21:04:49,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 123 transitions, 865 flow [2023-11-21 21:04:49,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 123 transitions, 793 flow, removed 36 selfloop flow, removed 2 redundant places. [2023-11-21 21:04:49,943 INFO L231 Difference]: Finished difference. Result has 76 places, 62 transitions, 318 flow [2023-11-21 21:04:49,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=318, PETRI_PLACES=76, PETRI_TRANSITIONS=62} [2023-11-21 21:04:49,947 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 20 predicate places. [2023-11-21 21:04:49,947 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 62 transitions, 318 flow [2023-11-21 21:04:49,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 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-21 21:04:49,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:04:49,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:04:49,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 21:04:49,948 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 21:04:49,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:04:49,950 INFO L85 PathProgramCache]: Analyzing trace with hash 21032832, now seen corresponding path program 1 times [2023-11-21 21:04:49,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:04:49,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419331918] [2023-11-21 21:04:49,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:04:49,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:04:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:04:50,258 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-21 21:04:50,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:04:50,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419331918] [2023-11-21 21:04:50,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419331918] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:04:50,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:04:50,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:04:50,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85732423] [2023-11-21 21:04:50,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:04:50,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:04:50,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:04:50,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:04:50,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:04:50,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2023-11-21 21:04:50,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 62 transitions, 318 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 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-21 21:04:50,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:04:50,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2023-11-21 21:04:50,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:04:51,418 INFO L124 PetriNetUnfolderBase]: 5945/8806 cut-off events. [2023-11-21 21:04:51,418 INFO L125 PetriNetUnfolderBase]: For 22392/22494 co-relation queries the response was YES. [2023-11-21 21:04:51,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31640 conditions, 8806 events. 5945/8806 cut-off events. For 22392/22494 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 53498 event pairs, 397 based on Foata normal form. 348/8874 useless extension candidates. Maximal degree in co-relation 31614. Up to 2720 conditions per place. [2023-11-21 21:04:51,482 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 99 selfloop transitions, 14 changer transitions 0/128 dead transitions. [2023-11-21 21:04:51,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 128 transitions, 873 flow [2023-11-21 21:04:51,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:04:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 21:04:51,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 203 transitions. [2023-11-21 21:04:51,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7048611111111112 [2023-11-21 21:04:51,485 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 203 transitions. [2023-11-21 21:04:51,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 203 transitions. [2023-11-21 21:04:51,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:04:51,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 203 transitions. [2023-11-21 21:04:51,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 33.833333333333336) internal successors, (203), 6 states have internal predecessors, (203), 0 states have call successors, (0), 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-21 21:04:51,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 48.0) internal successors, (336), 7 states have internal predecessors, (336), 0 states have call successors, (0), 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-21 21:04:51,488 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 48.0) internal successors, (336), 7 states have internal predecessors, (336), 0 states have call successors, (0), 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-21 21:04:51,488 INFO L175 Difference]: Start difference. First operand has 76 places, 62 transitions, 318 flow. Second operand 6 states and 203 transitions. [2023-11-21 21:04:51,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 128 transitions, 873 flow [2023-11-21 21:04:51,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 128 transitions, 851 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-11-21 21:04:51,505 INFO L231 Difference]: Finished difference. Result has 75 places, 65 transitions, 372 flow [2023-11-21 21:04:51,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=372, PETRI_PLACES=75, PETRI_TRANSITIONS=65} [2023-11-21 21:04:51,506 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 19 predicate places. [2023-11-21 21:04:51,507 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 65 transitions, 372 flow [2023-11-21 21:04:51,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 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-21 21:04:51,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:04:51,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:04:51,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 21:04:51,508 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 21:04:51,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:04:51,508 INFO L85 PathProgramCache]: Analyzing trace with hash 690516033, now seen corresponding path program 1 times [2023-11-21 21:04:51,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:04:51,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309700098] [2023-11-21 21:04:51,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:04:51,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:04:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:04:51,794 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-21 21:04:51,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:04:51,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309700098] [2023-11-21 21:04:51,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309700098] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:04:51,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:04:51,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 21:04:51,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159945661] [2023-11-21 21:04:51,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:04:51,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 21:04:51,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:04:51,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 21:04:51,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-21 21:04:51,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2023-11-21 21:04:51,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 372 flow. Second operand has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 0 states have call successors, (0), 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-21 21:04:51,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:04:51,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2023-11-21 21:04:51,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:04:52,856 INFO L124 PetriNetUnfolderBase]: 5209/7638 cut-off events. [2023-11-21 21:04:52,856 INFO L125 PetriNetUnfolderBase]: For 26396/26498 co-relation queries the response was YES. [2023-11-21 21:04:52,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29474 conditions, 7638 events. 5209/7638 cut-off events. For 26396/26498 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 45576 event pairs, 397 based on Foata normal form. 196/7554 useless extension candidates. Maximal degree in co-relation 29448. Up to 2720 conditions per place. [2023-11-21 21:04:52,914 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 92 selfloop transitions, 18 changer transitions 0/125 dead transitions. [2023-11-21 21:04:52,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 125 transitions, 857 flow [2023-11-21 21:04:52,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:04:52,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-21 21:04:52,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 218 transitions. [2023-11-21 21:04:52,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6488095238095238 [2023-11-21 21:04:52,917 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 218 transitions. [2023-11-21 21:04:52,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 218 transitions. [2023-11-21 21:04:52,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:04:52,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 218 transitions. [2023-11-21 21:04:52,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 31.142857142857142) internal successors, (218), 7 states have internal predecessors, (218), 0 states have call successors, (0), 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-21 21:04:52,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 48.0) internal successors, (384), 8 states have internal predecessors, (384), 0 states have call successors, (0), 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-21 21:04:52,920 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 48.0) internal successors, (384), 8 states have internal predecessors, (384), 0 states have call successors, (0), 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-21 21:04:52,920 INFO L175 Difference]: Start difference. First operand has 75 places, 65 transitions, 372 flow. Second operand 7 states and 218 transitions. [2023-11-21 21:04:52,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 125 transitions, 857 flow [2023-11-21 21:04:52,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 125 transitions, 802 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-11-21 21:04:52,985 INFO L231 Difference]: Finished difference. Result has 79 places, 66 transitions, 388 flow [2023-11-21 21:04:52,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=388, PETRI_PLACES=79, PETRI_TRANSITIONS=66} [2023-11-21 21:04:52,986 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 23 predicate places. [2023-11-21 21:04:52,986 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 66 transitions, 388 flow [2023-11-21 21:04:52,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 0 states have call successors, (0), 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-21 21:04:52,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:04:52,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:04:52,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 21:04:52,987 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 21:04:52,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:04:52,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1162677048, now seen corresponding path program 1 times [2023-11-21 21:04:52,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:04:52,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522777496] [2023-11-21 21:04:52,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:04:52,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:04:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:04:53,585 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-21 21:04:53,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:04:53,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522777496] [2023-11-21 21:04:53,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522777496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:04:53,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:04:53,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-21 21:04:53,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126830342] [2023-11-21 21:04:53,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:04:53,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 21:04:53,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:04:53,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 21:04:53,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-21 21:04:53,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 48 [2023-11-21 21:04:53,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 66 transitions, 388 flow. Second operand has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 0 states have call successors, (0), 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-21 21:04:53,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:04:53,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 48 [2023-11-21 21:04:53,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:04:55,354 INFO L124 PetriNetUnfolderBase]: 8632/13961 cut-off events. [2023-11-21 21:04:55,355 INFO L125 PetriNetUnfolderBase]: For 39211/42834 co-relation queries the response was YES. [2023-11-21 21:04:55,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44029 conditions, 13961 events. 8632/13961 cut-off events. For 39211/42834 co-relation queries the response was YES. Maximal size of possible extension queue 945. Compared 104719 event pairs, 1901 based on Foata normal form. 295/13007 useless extension candidates. Maximal degree in co-relation 44002. Up to 5691 conditions per place. [2023-11-21 21:04:55,491 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 51 selfloop transitions, 5 changer transitions 52/139 dead transitions. [2023-11-21 21:04:55,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 139 transitions, 885 flow [2023-11-21 21:04:55,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 21:04:55,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-21 21:04:55,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 225 transitions. [2023-11-21 21:04:55,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5859375 [2023-11-21 21:04:55,493 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 225 transitions. [2023-11-21 21:04:55,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 225 transitions. [2023-11-21 21:04:55,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:04:55,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 225 transitions. [2023-11-21 21:04:55,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 28.125) internal successors, (225), 8 states have internal predecessors, (225), 0 states have call successors, (0), 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-21 21:04:55,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 48.0) internal successors, (432), 9 states have internal predecessors, (432), 0 states have call successors, (0), 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-21 21:04:55,498 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 48.0) internal successors, (432), 9 states have internal predecessors, (432), 0 states have call successors, (0), 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-21 21:04:55,498 INFO L175 Difference]: Start difference. First operand has 79 places, 66 transitions, 388 flow. Second operand 8 states and 225 transitions. [2023-11-21 21:04:55,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 139 transitions, 885 flow [2023-11-21 21:04:55,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 139 transitions, 802 flow, removed 30 selfloop flow, removed 6 redundant places. [2023-11-21 21:04:55,793 INFO L231 Difference]: Finished difference. Result has 86 places, 69 transitions, 379 flow [2023-11-21 21:04:55,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=379, PETRI_PLACES=86, PETRI_TRANSITIONS=69} [2023-11-21 21:04:55,794 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 30 predicate places. [2023-11-21 21:04:55,794 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 69 transitions, 379 flow [2023-11-21 21:04:55,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 0 states have call successors, (0), 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-21 21:04:55,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:04:55,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:04:55,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 21:04:55,795 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 21:04:55,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:04:55,796 INFO L85 PathProgramCache]: Analyzing trace with hash 875461576, now seen corresponding path program 2 times [2023-11-21 21:04:55,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:04:55,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098676692] [2023-11-21 21:04:55,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:04:55,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:04:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:04:56,327 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-21 21:04:56,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:04:56,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098676692] [2023-11-21 21:04:56,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098676692] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:04:56,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:04:56,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-21 21:04:56,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700155604] [2023-11-21 21:04:56,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:04:56,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 21:04:56,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:04:56,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 21:04:56,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-21 21:04:56,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 48 [2023-11-21 21:04:56,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 69 transitions, 379 flow. Second operand has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 0 states have call successors, (0), 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-21 21:04:56,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:04:56,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 48 [2023-11-21 21:04:56,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:04:58,399 INFO L124 PetriNetUnfolderBase]: 7480/12235 cut-off events. [2023-11-21 21:04:58,400 INFO L125 PetriNetUnfolderBase]: For 22698/24962 co-relation queries the response was YES. [2023-11-21 21:04:58,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35760 conditions, 12235 events. 7480/12235 cut-off events. For 22698/24962 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 93312 event pairs, 958 based on Foata normal form. 221/11151 useless extension candidates. Maximal degree in co-relation 35729. Up to 5072 conditions per place. [2023-11-21 21:04:58,495 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 74 selfloop transitions, 9 changer transitions 12/126 dead transitions. [2023-11-21 21:04:58,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 126 transitions, 799 flow [2023-11-21 21:04:58,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 21:04:58,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-21 21:04:58,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 215 transitions. [2023-11-21 21:04:58,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5598958333333334 [2023-11-21 21:04:58,498 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 215 transitions. [2023-11-21 21:04:58,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 215 transitions. [2023-11-21 21:04:58,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:04:58,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 215 transitions. [2023-11-21 21:04:58,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 26.875) internal successors, (215), 8 states have internal predecessors, (215), 0 states have call successors, (0), 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-21 21:04:58,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 48.0) internal successors, (432), 9 states have internal predecessors, (432), 0 states have call successors, (0), 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-21 21:04:58,501 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 48.0) internal successors, (432), 9 states have internal predecessors, (432), 0 states have call successors, (0), 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-21 21:04:58,501 INFO L175 Difference]: Start difference. First operand has 86 places, 69 transitions, 379 flow. Second operand 8 states and 215 transitions. [2023-11-21 21:04:58,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 126 transitions, 799 flow [2023-11-21 21:04:58,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 126 transitions, 789 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-11-21 21:04:58,682 INFO L231 Difference]: Finished difference. Result has 90 places, 73 transitions, 424 flow [2023-11-21 21:04:58,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=424, PETRI_PLACES=90, PETRI_TRANSITIONS=73} [2023-11-21 21:04:58,683 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 34 predicate places. [2023-11-21 21:04:58,683 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 73 transitions, 424 flow [2023-11-21 21:04:58,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 0 states have call successors, (0), 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-21 21:04:58,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:04:58,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:04:58,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 21:04:58,684 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 21:04:58,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:04:58,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1093727076, now seen corresponding path program 3 times [2023-11-21 21:04:58,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:04:58,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325087786] [2023-11-21 21:04:58,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:04:58,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:04:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:04:59,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-21 21:04:59,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:04:59,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325087786] [2023-11-21 21:04:59,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325087786] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:04:59,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:04:59,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 21:04:59,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261111899] [2023-11-21 21:04:59,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:04:59,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:04:59,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:04:59,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:04:59,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:04:59,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2023-11-21 21:04:59,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 73 transitions, 424 flow. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 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-21 21:04:59,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:04:59,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2023-11-21 21:04:59,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:05:01,537 INFO L124 PetriNetUnfolderBase]: 10949/18719 cut-off events. [2023-11-21 21:05:01,537 INFO L125 PetriNetUnfolderBase]: For 34635/37700 co-relation queries the response was YES. [2023-11-21 21:05:01,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55272 conditions, 18719 events. 10949/18719 cut-off events. For 34635/37700 co-relation queries the response was YES. Maximal size of possible extension queue 1463. Compared 163738 event pairs, 2121 based on Foata normal form. 309/16957 useless extension candidates. Maximal degree in co-relation 55238. Up to 6478 conditions per place. [2023-11-21 21:05:01,693 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 35 selfloop transitions, 1 changer transitions 53/121 dead transitions. [2023-11-21 21:05:01,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 121 transitions, 825 flow [2023-11-21 21:05:01,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:05:01,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 21:05:01,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 171 transitions. [2023-11-21 21:05:01,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.59375 [2023-11-21 21:05:01,695 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 171 transitions. [2023-11-21 21:05:01,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 171 transitions. [2023-11-21 21:05:01,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:05:01,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 171 transitions. [2023-11-21 21:05:01,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 0 states have call successors, (0), 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-21 21:05:01,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 48.0) internal successors, (336), 7 states have internal predecessors, (336), 0 states have call successors, (0), 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-21 21:05:01,698 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 48.0) internal successors, (336), 7 states have internal predecessors, (336), 0 states have call successors, (0), 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-21 21:05:01,698 INFO L175 Difference]: Start difference. First operand has 90 places, 73 transitions, 424 flow. Second operand 6 states and 171 transitions. [2023-11-21 21:05:01,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 121 transitions, 825 flow [2023-11-21 21:05:02,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 121 transitions, 810 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-21 21:05:02,202 INFO L231 Difference]: Finished difference. Result has 94 places, 60 transitions, 336 flow [2023-11-21 21:05:02,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=336, PETRI_PLACES=94, PETRI_TRANSITIONS=60} [2023-11-21 21:05:02,203 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 38 predicate places. [2023-11-21 21:05:02,204 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 60 transitions, 336 flow [2023-11-21 21:05:02,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 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-21 21:05:02,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:05:02,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:05:02,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 21:05:02,205 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 21:05:02,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:05:02,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1087872608, now seen corresponding path program 4 times [2023-11-21 21:05:02,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:05:02,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090360815] [2023-11-21 21:05:02,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:05:02,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:05:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:04,024 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-21 21:05:04,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:05:04,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090360815] [2023-11-21 21:05:04,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090360815] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:05:04,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:05:04,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-21 21:05:04,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614736043] [2023-11-21 21:05:04,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:05:04,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-21 21:05:04,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:05:04,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-21 21:05:04,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-11-21 21:05:04,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 48 [2023-11-21 21:05:04,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 60 transitions, 336 flow. Second operand has 11 states, 11 states have (on average 19.09090909090909) internal successors, (210), 11 states have internal predecessors, (210), 0 states have call successors, (0), 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-21 21:05:04,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:05:04,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 48 [2023-11-21 21:05:04,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:05:05,750 INFO L124 PetriNetUnfolderBase]: 6314/11208 cut-off events. [2023-11-21 21:05:05,750 INFO L125 PetriNetUnfolderBase]: For 18309/19663 co-relation queries the response was YES. [2023-11-21 21:05:05,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32845 conditions, 11208 events. 6314/11208 cut-off events. For 18309/19663 co-relation queries the response was YES. Maximal size of possible extension queue 767. Compared 90649 event pairs, 1709 based on Foata normal form. 137/10284 useless extension candidates. Maximal degree in co-relation 32809. Up to 2626 conditions per place. [2023-11-21 21:05:05,821 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 56 selfloop transitions, 9 changer transitions 53/147 dead transitions. [2023-11-21 21:05:05,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 147 transitions, 915 flow [2023-11-21 21:05:05,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 21:05:05,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-21 21:05:05,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 285 transitions. [2023-11-21 21:05:05,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.59375 [2023-11-21 21:05:05,824 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 285 transitions. [2023-11-21 21:05:05,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 285 transitions. [2023-11-21 21:05:05,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:05:05,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 285 transitions. [2023-11-21 21:05:05,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 28.5) internal successors, (285), 10 states have internal predecessors, (285), 0 states have call successors, (0), 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-21 21:05:05,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 48.0) internal successors, (528), 11 states have internal predecessors, (528), 0 states have call successors, (0), 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-21 21:05:05,829 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 48.0) internal successors, (528), 11 states have internal predecessors, (528), 0 states have call successors, (0), 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-21 21:05:05,829 INFO L175 Difference]: Start difference. First operand has 94 places, 60 transitions, 336 flow. Second operand 10 states and 285 transitions. [2023-11-21 21:05:05,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 147 transitions, 915 flow [2023-11-21 21:05:06,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 147 transitions, 866 flow, removed 20 selfloop flow, removed 10 redundant places. [2023-11-21 21:05:06,056 INFO L231 Difference]: Finished difference. Result has 94 places, 63 transitions, 384 flow [2023-11-21 21:05:06,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=384, PETRI_PLACES=94, PETRI_TRANSITIONS=63} [2023-11-21 21:05:06,056 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 38 predicate places. [2023-11-21 21:05:06,057 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 63 transitions, 384 flow [2023-11-21 21:05:06,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 19.09090909090909) internal successors, (210), 11 states have internal predecessors, (210), 0 states have call successors, (0), 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-21 21:05:06,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:05:06,057 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:05:06,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 21:05:06,057 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 21:05:06,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:05:06,057 INFO L85 PathProgramCache]: Analyzing trace with hash -623495066, now seen corresponding path program 5 times [2023-11-21 21:05:06,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:05:06,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659441238] [2023-11-21 21:05:06,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:05:06,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:05:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:05:06,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:05:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:05:06,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:05:06,255 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 21:05:06,256 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-21 21:05:06,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-21 21:05:06,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-21 21:05:06,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-21 21:05:06,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-21 21:05:06,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-21 21:05:06,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-21 21:05:06,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 21:05:06,261 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:05:06,267 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-21 21:05:06,268 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-21 21:05:06,359 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-21 21:05:06,363 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-21 21:05:06,365 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-21 21:05:06,366 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-21 21:05:06,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 09:05:06 BasicIcfg [2023-11-21 21:05:06,417 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-21 21:05:06,418 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 21:05:06,418 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 21:05:06,418 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 21:05:06,419 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:04:36" (3/4) ... [2023-11-21 21:05:06,419 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-21 21:05:06,457 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-21 21:05:06,459 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-21 21:05:06,459 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-21 21:05:06,460 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-21 21:05:06,534 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c84caabe-a960-4495-89fe-893fe070551c/bin/uautomizer-verify-bycVGegfSx/witness.graphml [2023-11-21 21:05:06,534 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 21:05:06,535 INFO L158 Benchmark]: Toolchain (without parser) took 32612.75ms. Allocated memory was 142.6MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 96.6MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 753.3MB. Max. memory is 16.1GB. [2023-11-21 21:05:06,536 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 96.5MB. Free memory is still 46.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 21:05:06,536 INFO L158 Benchmark]: CACSL2BoogieTranslator took 901.09ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 72.1MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-21 21:05:06,537 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.74ms. Allocated memory is still 142.6MB. Free memory was 72.1MB in the beginning and 69.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 21:05:06,537 INFO L158 Benchmark]: Boogie Preprocessor took 93.94ms. Allocated memory is still 142.6MB. Free memory was 69.5MB in the beginning and 110.2MB in the end (delta: -40.8MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2023-11-21 21:05:06,537 INFO L158 Benchmark]: RCFGBuilder took 1095.67ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 107.1MB in the end (delta: 3.2MB). Peak memory consumption was 55.7MB. Max. memory is 16.1GB. [2023-11-21 21:05:06,538 INFO L158 Benchmark]: TraceAbstraction took 30290.37ms. Allocated memory was 142.6MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 105.8MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 740.6MB. Max. memory is 16.1GB. [2023-11-21 21:05:06,538 INFO L158 Benchmark]: Witness Printer took 116.76ms. Allocated memory is still 2.2GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-21 21:05:06,540 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.22ms. Allocated memory is still 96.5MB. Free memory is still 46.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 901.09ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 72.1MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.74ms. Allocated memory is still 142.6MB. Free memory was 72.1MB in the beginning and 69.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.94ms. Allocated memory is still 142.6MB. Free memory was 69.5MB in the beginning and 110.2MB in the end (delta: -40.8MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1095.67ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 107.1MB in the end (delta: 3.2MB). Peak memory consumption was 55.7MB. Max. memory is 16.1GB. * TraceAbstraction took 30290.37ms. Allocated memory was 142.6MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 105.8MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 740.6MB. Max. memory is 16.1GB. * Witness Printer took 116.76ms. Allocated memory is still 2.2GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation 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~pre3 could not be translated - 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: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1377; [L849] FCALL, FORK 0 pthread_create(&t1377, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1377={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L850] 0 pthread_t t1378; [L851] FCALL, FORK 0 pthread_create(&t1378, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1377={5:0}, t1378={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L852] 0 pthread_t t1379; [L853] FCALL, FORK 0 pthread_create(&t1379, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1377={5:0}, t1378={6:0}, t1379={7: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L854] 0 pthread_t t1380; [L855] FCALL, FORK 0 pthread_create(&t1380, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1377={5:0}, t1378={6:0}, t1379={7:0}, t1380={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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$$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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$$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L820] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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$$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L823] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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$$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L786] 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) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 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 [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L806] 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) [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 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 [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 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=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L826] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L827] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L828] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L829] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L830] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377={5:0}, t1378={6:0}, t1379={7:0}, t1380={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 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) [L862] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L863] 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 [L864] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L865] 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 [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377={5:0}, t1378={6:0}, t1379={7:0}, t1380={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 x$flush_delayed = weak$$choice2 [L871] 0 x$mem_tmp = x [L872] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L873] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L874] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L875] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L876] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L878] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L880] 0 x = x$flush_delayed ? x$mem_tmp : x [L881] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377={5:0}, t1378={6:0}, t1379={7:0}, t1380={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 855]: 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: 853]: 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: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 81 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 30.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 22.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 819 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 791 mSDsluCounter, 298 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 252 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1946 IncrementalHoareTripleChecker+Invalid, 2036 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 46 mSDtfsCounter, 1946 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=424occurred in iteration=9, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 319 NumberOfCodeBlocks, 319 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 2081 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-21 21:05:06,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c84caabe-a960-4495-89fe-893fe070551c/bin/uautomizer-verify-bycVGegfSx/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