./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix037.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_d869c958-4693-4530-a221-c6bb7082a0a6/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d869c958-4693-4530-a221-c6bb7082a0a6/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d869c958-4693-4530-a221-c6bb7082a0a6/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d869c958-4693-4530-a221-c6bb7082a0a6/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix037.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d869c958-4693-4530-a221-c6bb7082a0a6/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d869c958-4693-4530-a221-c6bb7082a0a6/bin/uautomizer-verify-BQ2R08f2Ya --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 be02b321ccd6bac38d207cd4c595c173c1a2ce3b705272ff0087ad749834a1ef --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:20:41,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:20:41,073 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d869c958-4693-4530-a221-c6bb7082a0a6/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 04:20:41,077 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:20:41,078 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:20:41,102 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:20:41,103 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:20:41,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:20:41,104 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:20:41,105 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:20:41,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:20:41,106 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:20:41,107 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:20:41,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:20:41,108 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:20:41,108 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:20:41,109 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:20:41,109 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:20:41,110 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:20:41,110 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:20:41,111 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:20:41,111 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:20:41,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:20:41,112 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:20:41,113 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:20:41,113 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:20:41,114 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:20:41,114 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:20:41,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:20:41,115 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:20:41,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:20:41,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:20:41,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:20:41,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:20:41,117 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:20:41,117 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:20:41,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:20:41,117 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:20:41,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:20:41,117 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:20:41,118 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:20:41,118 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:20:41,118 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_d869c958-4693-4530-a221-c6bb7082a0a6/bin/uautomizer-verify-BQ2R08f2Ya/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_d869c958-4693-4530-a221-c6bb7082a0a6/bin/uautomizer-verify-BQ2R08f2Ya 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 -> be02b321ccd6bac38d207cd4c595c173c1a2ce3b705272ff0087ad749834a1ef [2023-11-29 04:20:41,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:20:41,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:20:41,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:20:41,361 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:20:41,361 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:20:41,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d869c958-4693-4530-a221-c6bb7082a0a6/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix037.opt.i [2023-11-29 04:20:44,033 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:20:44,272 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:20:44,273 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d869c958-4693-4530-a221-c6bb7082a0a6/sv-benchmarks/c/pthread-wmm/mix037.opt.i [2023-11-29 04:20:44,289 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d869c958-4693-4530-a221-c6bb7082a0a6/bin/uautomizer-verify-BQ2R08f2Ya/data/f12d30606/ff24ff39b41947e9a62989617b25cc45/FLAGf3072c14b [2023-11-29 04:20:44,304 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d869c958-4693-4530-a221-c6bb7082a0a6/bin/uautomizer-verify-BQ2R08f2Ya/data/f12d30606/ff24ff39b41947e9a62989617b25cc45 [2023-11-29 04:20:44,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:20:44,308 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:20:44,309 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:20:44,310 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:20:44,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:20:44,316 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:20:44" (1/1) ... [2023-11-29 04:20:44,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37de06e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:20:44, skipping insertion in model container [2023-11-29 04:20:44,317 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:20:44" (1/1) ... [2023-11-29 04:20:44,371 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:20:44,529 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_d869c958-4693-4530-a221-c6bb7082a0a6/sv-benchmarks/c/pthread-wmm/mix037.opt.i[944,957] [2023-11-29 04:20:44,711 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:20:44,721 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:20:44,731 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_d869c958-4693-4530-a221-c6bb7082a0a6/sv-benchmarks/c/pthread-wmm/mix037.opt.i[944,957] [2023-11-29 04:20:44,776 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:20:44,805 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:20:44,805 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:20:44,811 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:20:44,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:20:44 WrapperNode [2023-11-29 04:20:44,812 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:20:44,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:20:44,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:20:44,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:20:44,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:20:44" (1/1) ... [2023-11-29 04:20:44,835 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:20:44" (1/1) ... [2023-11-29 04:20:44,864 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2023-11-29 04:20:44,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:20:44,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:20:44,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:20:44,865 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:20:44,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:20:44" (1/1) ... [2023-11-29 04:20:44,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:20:44" (1/1) ... [2023-11-29 04:20:44,881 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:20:44" (1/1) ... [2023-11-29 04:20:44,899 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-29 04:20:44,899 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:20:44" (1/1) ... [2023-11-29 04:20:44,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:20:44" (1/1) ... [2023-11-29 04:20:44,908 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:20:44" (1/1) ... [2023-11-29 04:20:44,910 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:20:44" (1/1) ... [2023-11-29 04:20:44,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:20:44" (1/1) ... [2023-11-29 04:20:44,915 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:20:44" (1/1) ... [2023-11-29 04:20:44,919 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:20:44,920 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:20:44,920 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:20:44,920 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:20:44,921 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:20:44" (1/1) ... [2023-11-29 04:20:44,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:20:44,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d869c958-4693-4530-a221-c6bb7082a0a6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:20:44,949 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d869c958-4693-4530-a221-c6bb7082a0a6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:20:44,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d869c958-4693-4530-a221-c6bb7082a0a6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:20:44,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 04:20:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 04:20:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 04:20:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 04:20:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 04:20:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 04:20:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:20:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:20:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:20:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 04:20:44,990 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 04:20:44,991 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 04:20:44,991 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 04:20:44,991 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 04:20:44,991 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 04:20:44,991 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 04:20:44,992 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 04:20:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:20:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 04:20:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 04:20:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 04:20:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 04:20:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 04:20:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:20:44,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:20:44,995 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 04:20:45,147 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:20:45,149 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:20:45,427 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:20:45,636 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:20:45,637 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 04:20:45,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:20:45 BoogieIcfgContainer [2023-11-29 04:20:45,637 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:20:45,640 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:20:45,640 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:20:45,644 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:20:45,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:20:44" (1/3) ... [2023-11-29 04:20:45,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d322309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:20:45, skipping insertion in model container [2023-11-29 04:20:45,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:20:44" (2/3) ... [2023-11-29 04:20:45,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d322309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:20:45, skipping insertion in model container [2023-11-29 04:20:45,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:20:45" (3/3) ... [2023-11-29 04:20:45,646 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037.opt.i [2023-11-29 04:20:45,655 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 04:20:45,665 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:20:45,665 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-29 04:20:45,666 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 04:20:45,713 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 04:20:45,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow [2023-11-29 04:20:45,780 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2023-11-29 04:20:45,780 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:20:45,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 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/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2023-11-29 04:20:45,785 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow [2023-11-29 04:20:45,789 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow [2023-11-29 04:20:45,799 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:20:45,806 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;@75f3f5da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:20:45,806 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-29 04:20:45,818 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 04:20:45,818 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2023-11-29 04:20:45,818 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:20:45,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:20:45,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:20:45,819 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 04:20:45,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:20:45,825 INFO L85 PathProgramCache]: Analyzing trace with hash 53099079, now seen corresponding path program 1 times [2023-11-29 04:20:45,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:20:45,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463964204] [2023-11-29 04:20:45,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:20:45,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:20:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:46,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:20:46,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:20:46,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463964204] [2023-11-29 04:20:46,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463964204] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:20:46,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:20:46,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:20:46,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653792238] [2023-11-29 04:20:46,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:20:46,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:20:46,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:20:46,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:20:46,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:20:46,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 50 [2023-11-29 04:20:46,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:46,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:20:46,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 50 [2023-11-29 04:20:46,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:20:46,660 INFO L124 PetriNetUnfolderBase]: 699/1415 cut-off events. [2023-11-29 04:20:46,660 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:20:46,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2483 conditions, 1415 events. 699/1415 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 10282 event pairs, 159 based on Foata normal form. 48/1422 useless extension candidates. Maximal degree in co-relation 2471. Up to 757 conditions per place. [2023-11-29 04:20:46,680 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 25 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2023-11-29 04:20:46,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 53 transitions, 176 flow [2023-11-29 04:20:46,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:20:46,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:20:46,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2023-11-29 04:20:46,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7733333333333333 [2023-11-29 04:20:46,694 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 116 transitions. [2023-11-29 04:20:46,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 116 transitions. [2023-11-29 04:20:46,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:20:46,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 116 transitions. [2023-11-29 04:20:46,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:46,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:46,704 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:46,706 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 116 transitions. [2023-11-29 04:20:46,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 53 transitions, 176 flow [2023-11-29 04:20:46,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 172 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 04:20:46,714 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow [2023-11-29 04:20:46,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2023-11-29 04:20:46,719 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-11-29 04:20:46,719 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow [2023-11-29 04:20:46,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:46,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:20:46,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:20:46,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:20:46,721 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 04:20:46,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:20:46,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1296408205, now seen corresponding path program 1 times [2023-11-29 04:20:46,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:20:46,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391609555] [2023-11-29 04:20:46,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:20:46,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:20:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:46,995 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-29 04:20:46,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:20:46,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391609555] [2023-11-29 04:20:46,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391609555] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:20:46,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:20:46,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:20:46,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965981756] [2023-11-29 04:20:46,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:20:46,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:20:46,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:20:46,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:20:46,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:20:47,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2023-11-29 04:20:47,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:47,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:20:47,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2023-11-29 04:20:47,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:20:49,426 INFO L124 PetriNetUnfolderBase]: 10623/16411 cut-off events. [2023-11-29 04:20:49,426 INFO L125 PetriNetUnfolderBase]: For 626/626 co-relation queries the response was YES. [2023-11-29 04:20:49,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31875 conditions, 16411 events. 10623/16411 cut-off events. For 626/626 co-relation queries the response was YES. Maximal size of possible extension queue 959. Compared 123821 event pairs, 3116 based on Foata normal form. 0/15850 useless extension candidates. Maximal degree in co-relation 31865. Up to 6461 conditions per place. [2023-11-29 04:20:49,553 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 40 selfloop transitions, 7 changer transitions 78/141 dead transitions. [2023-11-29 04:20:49,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 141 transitions, 562 flow [2023-11-29 04:20:49,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:20:49,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 04:20:49,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 307 transitions. [2023-11-29 04:20:49,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6822222222222222 [2023-11-29 04:20:49,557 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 307 transitions. [2023-11-29 04:20:49,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 307 transitions. [2023-11-29 04:20:49,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:20:49,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 307 transitions. [2023-11-29 04:20:49,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 34.111111111111114) internal successors, (307), 9 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:49,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 50.0) internal successors, (500), 10 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:49,563 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 50.0) internal successors, (500), 10 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:49,563 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 9 states and 307 transitions. [2023-11-29 04:20:49,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 141 transitions, 562 flow [2023-11-29 04:20:49,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 141 transitions, 544 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:20:49,576 INFO L231 Difference]: Finished difference. Result has 68 places, 48 transitions, 190 flow [2023-11-29 04:20:49,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=190, PETRI_PLACES=68, PETRI_TRANSITIONS=48} [2023-11-29 04:20:49,577 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2023-11-29 04:20:49,578 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 48 transitions, 190 flow [2023-11-29 04:20:49,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:49,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:20:49,578 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-29 04:20:49,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:20:49,579 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 04:20:49,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:20:49,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1720686158, now seen corresponding path program 1 times [2023-11-29 04:20:49,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:20:49,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378326139] [2023-11-29 04:20:49,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:20:49,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:20:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:49,802 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-29 04:20:49,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:20:49,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378326139] [2023-11-29 04:20:49,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378326139] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:20:49,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:20:49,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:20:49,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274294997] [2023-11-29 04:20:49,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:20:49,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:20:49,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:20:49,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:20:49,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:20:49,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 50 [2023-11-29 04:20:49,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 48 transitions, 190 flow. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 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-29 04:20:49,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:20:49,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 50 [2023-11-29 04:20:49,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:20:51,076 INFO L124 PetriNetUnfolderBase]: 5130/8854 cut-off events. [2023-11-29 04:20:51,076 INFO L125 PetriNetUnfolderBase]: For 11213/11815 co-relation queries the response was YES. [2023-11-29 04:20:51,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25061 conditions, 8854 events. 5130/8854 cut-off events. For 11213/11815 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 72502 event pairs, 1706 based on Foata normal form. 264/8485 useless extension candidates. Maximal degree in co-relation 25043. Up to 3766 conditions per place. [2023-11-29 04:20:51,185 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 29 selfloop transitions, 3 changer transitions 33/89 dead transitions. [2023-11-29 04:20:51,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 89 transitions, 496 flow [2023-11-29 04:20:51,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:20:51,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:20:51,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 226 transitions. [2023-11-29 04:20:51,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6457142857142857 [2023-11-29 04:20:51,188 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 226 transitions. [2023-11-29 04:20:51,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 226 transitions. [2023-11-29 04:20:51,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:20:51,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 226 transitions. [2023-11-29 04:20:51,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 32.285714285714285) internal successors, (226), 7 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:51,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:51,192 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:51,192 INFO L175 Difference]: Start difference. First operand has 68 places, 48 transitions, 190 flow. Second operand 7 states and 226 transitions. [2023-11-29 04:20:51,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 89 transitions, 496 flow [2023-11-29 04:20:51,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 89 transitions, 434 flow, removed 17 selfloop flow, removed 4 redundant places. [2023-11-29 04:20:51,245 INFO L231 Difference]: Finished difference. Result has 68 places, 48 transitions, 179 flow [2023-11-29 04:20:51,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=179, PETRI_PLACES=68, PETRI_TRANSITIONS=48} [2023-11-29 04:20:51,246 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2023-11-29 04:20:51,246 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 48 transitions, 179 flow [2023-11-29 04:20:51,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 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-29 04:20:51,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:20:51,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:20:51,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:20:51,247 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 04:20:51,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:20:51,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2054735024, now seen corresponding path program 1 times [2023-11-29 04:20:51,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:20:51,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813632942] [2023-11-29 04:20:51,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:20:51,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:20:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:51,387 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-29 04:20:51,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:20:51,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813632942] [2023-11-29 04:20:51,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813632942] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:20:51,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:20:51,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:20:51,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459317017] [2023-11-29 04:20:51,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:20:51,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:20:51,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:20:51,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:20:51,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:20:51,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50 [2023-11-29 04:20:51,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 48 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:51,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:20:51,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50 [2023-11-29 04:20:51,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:20:52,632 INFO L124 PetriNetUnfolderBase]: 5757/9881 cut-off events. [2023-11-29 04:20:52,632 INFO L125 PetriNetUnfolderBase]: For 9579/9731 co-relation queries the response was YES. [2023-11-29 04:20:52,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26076 conditions, 9881 events. 5757/9881 cut-off events. For 9579/9731 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 77753 event pairs, 2676 based on Foata normal form. 244/9832 useless extension candidates. Maximal degree in co-relation 26055. Up to 6110 conditions per place. [2023-11-29 04:20:52,685 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 39 selfloop transitions, 5 changer transitions 35/101 dead transitions. [2023-11-29 04:20:52,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 101 transitions, 547 flow [2023-11-29 04:20:52,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:20:52,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:20:52,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 233 transitions. [2023-11-29 04:20:52,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6657142857142857 [2023-11-29 04:20:52,688 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 233 transitions. [2023-11-29 04:20:52,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 233 transitions. [2023-11-29 04:20:52,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:20:52,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 233 transitions. [2023-11-29 04:20:52,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 33.285714285714285) internal successors, (233), 7 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:52,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:52,692 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:52,692 INFO L175 Difference]: Start difference. First operand has 68 places, 48 transitions, 179 flow. Second operand 7 states and 233 transitions. [2023-11-29 04:20:52,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 101 transitions, 547 flow [2023-11-29 04:20:52,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 101 transitions, 521 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-11-29 04:20:52,900 INFO L231 Difference]: Finished difference. Result has 67 places, 51 transitions, 216 flow [2023-11-29 04:20:52,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=216, PETRI_PLACES=67, PETRI_TRANSITIONS=51} [2023-11-29 04:20:52,901 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2023-11-29 04:20:52,901 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 216 flow [2023-11-29 04:20:52,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:52,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:20:52,902 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] [2023-11-29 04:20:52,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:20:52,902 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 04:20:52,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:20:52,902 INFO L85 PathProgramCache]: Analyzing trace with hash -28395599, now seen corresponding path program 1 times [2023-11-29 04:20:52,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:20:52,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347374801] [2023-11-29 04:20:52,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:20:52,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:20:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:53,059 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-29 04:20:53,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:20:53,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347374801] [2023-11-29 04:20:53,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347374801] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:20:53,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:20:53,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:20:53,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828699781] [2023-11-29 04:20:53,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:20:53,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:20:53,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:20:53,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:20:53,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:20:53,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50 [2023-11-29 04:20:53,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 51 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:53,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:20:53,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50 [2023-11-29 04:20:53,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:20:55,141 INFO L124 PetriNetUnfolderBase]: 13721/20951 cut-off events. [2023-11-29 04:20:55,142 INFO L125 PetriNetUnfolderBase]: For 16434/17638 co-relation queries the response was YES. [2023-11-29 04:20:55,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51320 conditions, 20951 events. 13721/20951 cut-off events. For 16434/17638 co-relation queries the response was YES. Maximal size of possible extension queue 1231. Compared 159291 event pairs, 2839 based on Foata normal form. 802/20853 useless extension candidates. Maximal degree in co-relation 51300. Up to 10468 conditions per place. [2023-11-29 04:20:55,281 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 47 selfloop transitions, 6 changer transitions 0/79 dead transitions. [2023-11-29 04:20:55,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 79 transitions, 400 flow [2023-11-29 04:20:55,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:20:55,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:20:55,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2023-11-29 04:20:55,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.72 [2023-11-29 04:20:55,283 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 144 transitions. [2023-11-29 04:20:55,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 144 transitions. [2023-11-29 04:20:55,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:20:55,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 144 transitions. [2023-11-29 04:20:55,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:55,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:55,285 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:55,285 INFO L175 Difference]: Start difference. First operand has 67 places, 51 transitions, 216 flow. Second operand 4 states and 144 transitions. [2023-11-29 04:20:55,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 79 transitions, 400 flow [2023-11-29 04:20:55,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 79 transitions, 391 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-29 04:20:55,367 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 253 flow [2023-11-29 04:20:55,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2023-11-29 04:20:55,368 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 7 predicate places. [2023-11-29 04:20:55,369 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 253 flow [2023-11-29 04:20:55,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:55,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:20:55,369 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] [2023-11-29 04:20:55,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:20:55,370 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 04:20:55,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:20:55,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1321541226, now seen corresponding path program 1 times [2023-11-29 04:20:55,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:20:55,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303689492] [2023-11-29 04:20:55,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:20:55,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:20:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:55,623 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-29 04:20:55,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:20:55,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303689492] [2023-11-29 04:20:55,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303689492] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:20:55,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:20:55,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:20:55,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036922464] [2023-11-29 04:20:55,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:20:55,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:20:55,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:20:55,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:20:55,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:20:55,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2023-11-29 04:20:55,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 253 flow. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:55,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:20:55,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2023-11-29 04:20:55,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:20:58,496 INFO L124 PetriNetUnfolderBase]: 16352/25598 cut-off events. [2023-11-29 04:20:58,496 INFO L125 PetriNetUnfolderBase]: For 31094/32036 co-relation queries the response was YES. [2023-11-29 04:20:58,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73860 conditions, 25598 events. 16352/25598 cut-off events. For 31094/32036 co-relation queries the response was YES. Maximal size of possible extension queue 1383. Compared 202818 event pairs, 6583 based on Foata normal form. 408/23817 useless extension candidates. Maximal degree in co-relation 73839. Up to 10911 conditions per place. [2023-11-29 04:20:58,655 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 83 selfloop transitions, 14 changer transitions 4/122 dead transitions. [2023-11-29 04:20:58,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 122 transitions, 749 flow [2023-11-29 04:20:58,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:20:58,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 04:20:58,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 257 transitions. [2023-11-29 04:20:58,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6425 [2023-11-29 04:20:58,657 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 257 transitions. [2023-11-29 04:20:58,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 257 transitions. [2023-11-29 04:20:58,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:20:58,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 257 transitions. [2023-11-29 04:20:58,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 32.125) internal successors, (257), 8 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:58,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:58,660 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:58,661 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 253 flow. Second operand 8 states and 257 transitions. [2023-11-29 04:20:58,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 122 transitions, 749 flow [2023-11-29 04:20:58,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 122 transitions, 741 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-29 04:20:58,675 INFO L231 Difference]: Finished difference. Result has 77 places, 63 transitions, 364 flow [2023-11-29 04:20:58,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=364, PETRI_PLACES=77, PETRI_TRANSITIONS=63} [2023-11-29 04:20:58,676 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 19 predicate places. [2023-11-29 04:20:58,676 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 63 transitions, 364 flow [2023-11-29 04:20:58,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:58,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:20:58,677 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] [2023-11-29 04:20:58,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 04:20:58,677 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 04:20:58,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:20:58,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1349581106, now seen corresponding path program 1 times [2023-11-29 04:20:58,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:20:58,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269446269] [2023-11-29 04:20:58,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:20:58,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:20:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:58,832 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-29 04:20:58,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:20:58,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269446269] [2023-11-29 04:20:58,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269446269] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:20:58,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:20:58,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:20:58,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446846870] [2023-11-29 04:20:58,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:20:58,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:20:58,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:20:58,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:20:58,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:20:58,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50 [2023-11-29 04:20:58,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 63 transitions, 364 flow. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:58,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:20:58,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50 [2023-11-29 04:20:58,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:21:01,975 INFO L124 PetriNetUnfolderBase]: 17609/26779 cut-off events. [2023-11-29 04:21:01,975 INFO L125 PetriNetUnfolderBase]: For 33405/36181 co-relation queries the response was YES. [2023-11-29 04:21:02,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76118 conditions, 26779 events. 17609/26779 cut-off events. For 33405/36181 co-relation queries the response was YES. Maximal size of possible extension queue 1458. Compared 205253 event pairs, 2430 based on Foata normal form. 1174/27098 useless extension candidates. Maximal degree in co-relation 76090. Up to 10753 conditions per place. [2023-11-29 04:21:02,118 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 62 selfloop transitions, 10 changer transitions 3/104 dead transitions. [2023-11-29 04:21:02,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 104 transitions, 652 flow [2023-11-29 04:21:02,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:21:02,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:21:02,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 184 transitions. [2023-11-29 04:21:02,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.736 [2023-11-29 04:21:02,120 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 184 transitions. [2023-11-29 04:21:02,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 184 transitions. [2023-11-29 04:21:02,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:21:02,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 184 transitions. [2023-11-29 04:21:02,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:02,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:02,122 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:02,122 INFO L175 Difference]: Start difference. First operand has 77 places, 63 transitions, 364 flow. Second operand 5 states and 184 transitions. [2023-11-29 04:21:02,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 104 transitions, 652 flow [2023-11-29 04:21:02,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 104 transitions, 632 flow, removed 10 selfloop flow, removed 0 redundant places. [2023-11-29 04:21:02,312 INFO L231 Difference]: Finished difference. Result has 83 places, 65 transitions, 383 flow [2023-11-29 04:21:02,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=77, 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=383, PETRI_PLACES=83, PETRI_TRANSITIONS=65} [2023-11-29 04:21:02,313 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 25 predicate places. [2023-11-29 04:21:02,313 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 65 transitions, 383 flow [2023-11-29 04:21:02,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:02,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:21:02,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:21:02,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 04:21:02,313 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 04:21:02,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:02,314 INFO L85 PathProgramCache]: Analyzing trace with hash -2034065708, now seen corresponding path program 1 times [2023-11-29 04:21:02,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:21:02,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309352209] [2023-11-29 04:21:02,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:02,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:21:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:02,474 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-29 04:21:02,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:21:02,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309352209] [2023-11-29 04:21:02,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309352209] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:21:02,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:21:02,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:21:02,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031315233] [2023-11-29 04:21:02,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:21:02,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:21:02,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:21:02,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:21:02,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:21:02,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50 [2023-11-29 04:21:02,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 65 transitions, 383 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:02,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:21:02,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50 [2023-11-29 04:21:02,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:21:04,680 INFO L124 PetriNetUnfolderBase]: 13357/20351 cut-off events. [2023-11-29 04:21:04,680 INFO L125 PetriNetUnfolderBase]: For 34477/38537 co-relation queries the response was YES. [2023-11-29 04:21:04,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64338 conditions, 20351 events. 13357/20351 cut-off events. For 34477/38537 co-relation queries the response was YES. Maximal size of possible extension queue 1179. Compared 150479 event pairs, 1246 based on Foata normal form. 886/20496 useless extension candidates. Maximal degree in co-relation 64306. Up to 6995 conditions per place. [2023-11-29 04:21:04,789 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 72 selfloop transitions, 14 changer transitions 2/117 dead transitions. [2023-11-29 04:21:04,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 117 transitions, 752 flow [2023-11-29 04:21:04,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:21:04,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:21:04,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 222 transitions. [2023-11-29 04:21:04,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.74 [2023-11-29 04:21:04,791 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 222 transitions. [2023-11-29 04:21:04,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 222 transitions. [2023-11-29 04:21:04,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:21:04,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 222 transitions. [2023-11-29 04:21:04,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 37.0) internal successors, (222), 6 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:04,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:04,793 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:04,793 INFO L175 Difference]: Start difference. First operand has 83 places, 65 transitions, 383 flow. Second operand 6 states and 222 transitions. [2023-11-29 04:21:04,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 117 transitions, 752 flow [2023-11-29 04:21:04,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 117 transitions, 730 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-11-29 04:21:04,831 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 447 flow [2023-11-29 04:21:04,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=447, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2023-11-29 04:21:04,832 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 26 predicate places. [2023-11-29 04:21:04,832 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 447 flow [2023-11-29 04:21:04,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:04,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:21:04,833 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] [2023-11-29 04:21:04,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 04:21:04,833 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 04:21:04,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:04,834 INFO L85 PathProgramCache]: Analyzing trace with hash 2013421558, now seen corresponding path program 1 times [2023-11-29 04:21:04,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:21:04,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650332978] [2023-11-29 04:21:04,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:04,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:21:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:05,022 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-29 04:21:05,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:21:05,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650332978] [2023-11-29 04:21:05,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650332978] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:21:05,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:21:05,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:21:05,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035003003] [2023-11-29 04:21:05,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:21:05,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:21:05,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:21:05,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:21:05,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:21:05,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2023-11-29 04:21:05,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 70 transitions, 447 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:05,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:21:05,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2023-11-29 04:21:05,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:21:07,896 INFO L124 PetriNetUnfolderBase]: 13358/22723 cut-off events. [2023-11-29 04:21:07,896 INFO L125 PetriNetUnfolderBase]: For 52574/58630 co-relation queries the response was YES. [2023-11-29 04:21:07,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73997 conditions, 22723 events. 13358/22723 cut-off events. For 52574/58630 co-relation queries the response was YES. Maximal size of possible extension queue 1298. Compared 191253 event pairs, 3849 based on Foata normal form. 529/21395 useless extension candidates. Maximal degree in co-relation 73965. Up to 8943 conditions per place. [2023-11-29 04:21:08,040 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 71 selfloop transitions, 20 changer transitions 32/153 dead transitions. [2023-11-29 04:21:08,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 153 transitions, 1121 flow [2023-11-29 04:21:08,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:21:08,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 04:21:08,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 282 transitions. [2023-11-29 04:21:08,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6266666666666667 [2023-11-29 04:21:08,043 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 282 transitions. [2023-11-29 04:21:08,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 282 transitions. [2023-11-29 04:21:08,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:21:08,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 282 transitions. [2023-11-29 04:21:08,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 31.333333333333332) internal successors, (282), 9 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:08,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 50.0) internal successors, (500), 10 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:08,046 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 50.0) internal successors, (500), 10 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:08,046 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 447 flow. Second operand 9 states and 282 transitions. [2023-11-29 04:21:08,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 153 transitions, 1121 flow [2023-11-29 04:21:08,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 153 transitions, 1090 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-11-29 04:21:08,302 INFO L231 Difference]: Finished difference. Result has 95 places, 79 transitions, 589 flow [2023-11-29 04:21:08,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=589, PETRI_PLACES=95, PETRI_TRANSITIONS=79} [2023-11-29 04:21:08,303 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 37 predicate places. [2023-11-29 04:21:08,303 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 79 transitions, 589 flow [2023-11-29 04:21:08,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:08,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:21:08,303 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] [2023-11-29 04:21:08,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 04:21:08,304 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 04:21:08,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:08,304 INFO L85 PathProgramCache]: Analyzing trace with hash 139851714, now seen corresponding path program 2 times [2023-11-29 04:21:08,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:21:08,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269489887] [2023-11-29 04:21:08,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:08,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:21:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:08,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:21:08,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:21:08,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269489887] [2023-11-29 04:21:08,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269489887] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:21:08,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:21:08,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:21:08,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154350035] [2023-11-29 04:21:08,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:21:08,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:21:08,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:21:08,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:21:08,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:21:08,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50 [2023-11-29 04:21:08,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 79 transitions, 589 flow. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:08,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:21:08,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50 [2023-11-29 04:21:08,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:21:11,413 INFO L124 PetriNetUnfolderBase]: 13943/25335 cut-off events. [2023-11-29 04:21:11,413 INFO L125 PetriNetUnfolderBase]: For 66421/72836 co-relation queries the response was YES. [2023-11-29 04:21:11,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80680 conditions, 25335 events. 13943/25335 cut-off events. For 66421/72836 co-relation queries the response was YES. Maximal size of possible extension queue 1694. Compared 240591 event pairs, 4789 based on Foata normal form. 660/23249 useless extension candidates. Maximal degree in co-relation 80642. Up to 8384 conditions per place. [2023-11-29 04:21:11,574 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 56 selfloop transitions, 4 changer transitions 14/123 dead transitions. [2023-11-29 04:21:11,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 123 transitions, 983 flow [2023-11-29 04:21:11,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:21:11,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:21:11,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2023-11-29 04:21:11,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6866666666666666 [2023-11-29 04:21:11,576 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 206 transitions. [2023-11-29 04:21:11,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 206 transitions. [2023-11-29 04:21:11,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:21:11,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 206 transitions. [2023-11-29 04:21:11,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:11,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:11,578 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:11,578 INFO L175 Difference]: Start difference. First operand has 95 places, 79 transitions, 589 flow. Second operand 6 states and 206 transitions. [2023-11-29 04:21:11,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 123 transitions, 983 flow [2023-11-29 04:21:11,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 123 transitions, 915 flow, removed 34 selfloop flow, removed 6 redundant places. [2023-11-29 04:21:11,958 INFO L231 Difference]: Finished difference. Result has 91 places, 79 transitions, 585 flow [2023-11-29 04:21:11,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=585, PETRI_PLACES=91, PETRI_TRANSITIONS=79} [2023-11-29 04:21:11,959 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 33 predicate places. [2023-11-29 04:21:11,959 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 79 transitions, 585 flow [2023-11-29 04:21:11,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:11,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:21:11,960 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] [2023-11-29 04:21:11,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 04:21:11,960 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 04:21:11,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:11,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1124516574, now seen corresponding path program 3 times [2023-11-29 04:21:11,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:21:11,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129076569] [2023-11-29 04:21:11,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:11,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:21:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:12,286 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-29 04:21:12,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:21:12,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129076569] [2023-11-29 04:21:12,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129076569] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:21:12,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:21:12,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:21:12,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182014724] [2023-11-29 04:21:12,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:21:12,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:21:12,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:21:12,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:21:12,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:21:12,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50 [2023-11-29 04:21:12,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 79 transitions, 585 flow. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:12,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:21:12,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50 [2023-11-29 04:21:12,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:21:16,286 INFO L124 PetriNetUnfolderBase]: 22770/34314 cut-off events. [2023-11-29 04:21:16,286 INFO L125 PetriNetUnfolderBase]: For 82638/90538 co-relation queries the response was YES. [2023-11-29 04:21:16,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114977 conditions, 34314 events. 22770/34314 cut-off events. For 82638/90538 co-relation queries the response was YES. Maximal size of possible extension queue 2198. Compared 269127 event pairs, 1744 based on Foata normal form. 1092/34448 useless extension candidates. Maximal degree in co-relation 114941. Up to 12306 conditions per place. [2023-11-29 04:21:16,471 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 60 selfloop transitions, 18 changer transitions 22/127 dead transitions. [2023-11-29 04:21:16,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 127 transitions, 959 flow [2023-11-29 04:21:16,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:21:16,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:21:16,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 244 transitions. [2023-11-29 04:21:16,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6971428571428572 [2023-11-29 04:21:16,474 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 244 transitions. [2023-11-29 04:21:16,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 244 transitions. [2023-11-29 04:21:16,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:21:16,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 244 transitions. [2023-11-29 04:21:16,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 34.857142857142854) internal successors, (244), 7 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:16,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:16,477 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:16,477 INFO L175 Difference]: Start difference. First operand has 91 places, 79 transitions, 585 flow. Second operand 7 states and 244 transitions. [2023-11-29 04:21:16,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 127 transitions, 959 flow [2023-11-29 04:21:17,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 127 transitions, 900 flow, removed 26 selfloop flow, removed 6 redundant places. [2023-11-29 04:21:17,511 INFO L231 Difference]: Finished difference. Result has 91 places, 69 transitions, 488 flow [2023-11-29 04:21:17,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=488, PETRI_PLACES=91, PETRI_TRANSITIONS=69} [2023-11-29 04:21:17,511 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 33 predicate places. [2023-11-29 04:21:17,511 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 69 transitions, 488 flow [2023-11-29 04:21:17,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:17,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:21:17,512 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, 1, 1] [2023-11-29 04:21:17,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 04:21:17,512 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 04:21:17,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:17,512 INFO L85 PathProgramCache]: Analyzing trace with hash -637985182, now seen corresponding path program 1 times [2023-11-29 04:21:17,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:21:17,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62896134] [2023-11-29 04:21:17,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:17,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:21:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:17,849 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-29 04:21:17,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:21:17,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62896134] [2023-11-29 04:21:17,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62896134] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:21:17,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:21:17,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:21:17,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146022144] [2023-11-29 04:21:17,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:21:17,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:21:17,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:21:17,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:21:17,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:21:17,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2023-11-29 04:21:17,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 69 transitions, 488 flow. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:17,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:21:17,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2023-11-29 04:21:17,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:21:20,236 INFO L124 PetriNetUnfolderBase]: 11461/20673 cut-off events. [2023-11-29 04:21:20,236 INFO L125 PetriNetUnfolderBase]: For 57789/60843 co-relation queries the response was YES. [2023-11-29 04:21:20,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67452 conditions, 20673 events. 11461/20673 cut-off events. For 57789/60843 co-relation queries the response was YES. Maximal size of possible extension queue 1419. Compared 191110 event pairs, 1540 based on Foata normal form. 216/18958 useless extension candidates. Maximal degree in co-relation 67418. Up to 6525 conditions per place. [2023-11-29 04:21:20,339 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 40 selfloop transitions, 12 changer transitions 41/125 dead transitions. [2023-11-29 04:21:20,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 125 transitions, 953 flow [2023-11-29 04:21:20,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:21:20,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:21:20,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 216 transitions. [2023-11-29 04:21:20,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6171428571428571 [2023-11-29 04:21:20,341 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 216 transitions. [2023-11-29 04:21:20,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 216 transitions. [2023-11-29 04:21:20,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:21:20,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 216 transitions. [2023-11-29 04:21:20,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 30.857142857142858) internal successors, (216), 7 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:20,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:20,343 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:20,343 INFO L175 Difference]: Start difference. First operand has 91 places, 69 transitions, 488 flow. Second operand 7 states and 216 transitions. [2023-11-29 04:21:20,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 125 transitions, 953 flow [2023-11-29 04:21:21,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 125 transitions, 801 flow, removed 49 selfloop flow, removed 9 redundant places. [2023-11-29 04:21:21,102 INFO L231 Difference]: Finished difference. Result has 91 places, 66 transitions, 405 flow [2023-11-29 04:21:21,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=405, PETRI_PLACES=91, PETRI_TRANSITIONS=66} [2023-11-29 04:21:21,103 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 33 predicate places. [2023-11-29 04:21:21,103 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 66 transitions, 405 flow [2023-11-29 04:21:21,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:21,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:21:21,103 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, 1, 1] [2023-11-29 04:21:21,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 04:21:21,104 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 04:21:21,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:21,104 INFO L85 PathProgramCache]: Analyzing trace with hash 19573176, now seen corresponding path program 2 times [2023-11-29 04:21:21,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:21:21,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642240208] [2023-11-29 04:21:21,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:21,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:21:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:21,686 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-29 04:21:21,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:21:21,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642240208] [2023-11-29 04:21:21,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642240208] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:21:21,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:21:21,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:21:21,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457312599] [2023-11-29 04:21:21,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:21:21,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:21:21,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:21:21,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:21:21,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:21:21,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50 [2023-11-29 04:21:21,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 66 transitions, 405 flow. Second operand has 7 states, 7 states have (on average 27.428571428571427) internal successors, (192), 7 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-29 04:21:21,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:21:21,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50 [2023-11-29 04:21:21,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:21:22,514 INFO L124 PetriNetUnfolderBase]: 3279/6252 cut-off events. [2023-11-29 04:21:22,515 INFO L125 PetriNetUnfolderBase]: For 8449/9099 co-relation queries the response was YES. [2023-11-29 04:21:22,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17438 conditions, 6252 events. 3279/6252 cut-off events. For 8449/9099 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 51957 event pairs, 1171 based on Foata normal form. 49/5371 useless extension candidates. Maximal degree in co-relation 17405. Up to 2318 conditions per place. [2023-11-29 04:21:22,540 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 31 selfloop transitions, 7 changer transitions 17/98 dead transitions. [2023-11-29 04:21:22,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 98 transitions, 623 flow [2023-11-29 04:21:22,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:21:22,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 04:21:22,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 252 transitions. [2023-11-29 04:21:22,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.63 [2023-11-29 04:21:22,542 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 252 transitions. [2023-11-29 04:21:22,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 252 transitions. [2023-11-29 04:21:22,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:21:22,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 252 transitions. [2023-11-29 04:21:22,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 31.5) internal successors, (252), 8 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:22,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:22,545 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:22,545 INFO L175 Difference]: Start difference. First operand has 91 places, 66 transitions, 405 flow. Second operand 8 states and 252 transitions. [2023-11-29 04:21:22,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 98 transitions, 623 flow [2023-11-29 04:21:22,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 98 transitions, 596 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-11-29 04:21:22,620 INFO L231 Difference]: Finished difference. Result has 95 places, 69 transitions, 431 flow [2023-11-29 04:21:22,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=431, PETRI_PLACES=95, PETRI_TRANSITIONS=69} [2023-11-29 04:21:22,621 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 37 predicate places. [2023-11-29 04:21:22,621 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 69 transitions, 431 flow [2023-11-29 04:21:22,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.428571428571427) internal successors, (192), 7 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-29 04:21:22,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:21:22,621 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, 1, 1] [2023-11-29 04:21:22,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 04:21:22,621 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 04:21:22,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:22,622 INFO L85 PathProgramCache]: Analyzing trace with hash -655992066, now seen corresponding path program 3 times [2023-11-29 04:21:22,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:21:22,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458631336] [2023-11-29 04:21:22,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:22,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:21:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:22,864 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-29 04:21:22,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:21:22,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458631336] [2023-11-29 04:21:22,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458631336] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:21:22,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:21:22,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:21:22,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158504681] [2023-11-29 04:21:22,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:21:22,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:21:22,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:21:22,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:21:22,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:21:22,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2023-11-29 04:21:22,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 69 transitions, 431 flow. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:22,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:21:22,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2023-11-29 04:21:22,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:21:23,878 INFO L124 PetriNetUnfolderBase]: 5020/9438 cut-off events. [2023-11-29 04:21:23,878 INFO L125 PetriNetUnfolderBase]: For 17197/18256 co-relation queries the response was YES. [2023-11-29 04:21:23,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27532 conditions, 9438 events. 5020/9438 cut-off events. For 17197/18256 co-relation queries the response was YES. Maximal size of possible extension queue 850. Compared 83227 event pairs, 1154 based on Foata normal form. 92/8400 useless extension candidates. Maximal degree in co-relation 27499. Up to 2936 conditions per place. [2023-11-29 04:21:23,920 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 29 selfloop transitions, 5 changer transitions 41/107 dead transitions. [2023-11-29 04:21:23,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 107 transitions, 708 flow [2023-11-29 04:21:23,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:21:23,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 04:21:23,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 223 transitions. [2023-11-29 04:21:23,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5575 [2023-11-29 04:21:23,922 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 223 transitions. [2023-11-29 04:21:23,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 223 transitions. [2023-11-29 04:21:23,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:21:23,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 223 transitions. [2023-11-29 04:21:23,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 27.875) internal successors, (223), 8 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:23,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:23,924 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:23,924 INFO L175 Difference]: Start difference. First operand has 95 places, 69 transitions, 431 flow. Second operand 8 states and 223 transitions. [2023-11-29 04:21:23,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 107 transitions, 708 flow [2023-11-29 04:21:24,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 107 transitions, 689 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-11-29 04:21:24,093 INFO L231 Difference]: Finished difference. Result has 97 places, 60 transitions, 343 flow [2023-11-29 04:21:24,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=343, PETRI_PLACES=97, PETRI_TRANSITIONS=60} [2023-11-29 04:21:24,094 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 39 predicate places. [2023-11-29 04:21:24,094 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 60 transitions, 343 flow [2023-11-29 04:21:24,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:24,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:21:24,094 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, 1, 1] [2023-11-29 04:21:24,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 04:21:24,094 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 04:21:24,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:24,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1194666210, now seen corresponding path program 4 times [2023-11-29 04:21:24,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:21:24,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733506012] [2023-11-29 04:21:24,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:24,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:21:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:21:24,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:21:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:21:24,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:21:24,203 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 04:21:24,204 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-29 04:21:24,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-29 04:21:24,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-29 04:21:24,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-29 04:21:24,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-29 04:21:24,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-29 04:21:24,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-29 04:21:24,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 04:21:24,207 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:21:24,213 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 04:21:24,213 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:21:24,265 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 04:21:24,271 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 04:21:24,272 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 04:21:24,273 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 04:21:24,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:21:24 BasicIcfg [2023-11-29 04:21:24,303 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:21:24,304 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:21:24,304 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:21:24,304 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:21:24,305 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:20:45" (3/4) ... [2023-11-29 04:21:24,306 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 04:21:24,338 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 04:21:24,339 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 04:21:24,339 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 04:21:24,340 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 04:21:24,414 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d869c958-4693-4530-a221-c6bb7082a0a6/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 04:21:24,414 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:21:24,415 INFO L158 Benchmark]: Toolchain (without parser) took 40106.85ms. Allocated memory was 159.4MB in the beginning and 7.9GB in the end (delta: 7.7GB). Free memory was 116.0MB in the beginning and 5.6GB in the end (delta: -5.4GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2023-11-29 04:21:24,415 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 111.1MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:21:24,416 INFO L158 Benchmark]: CACSL2BoogieTranslator took 502.42ms. Allocated memory is still 159.4MB. Free memory was 115.3MB in the beginning and 92.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 04:21:24,416 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.81ms. Allocated memory is still 159.4MB. Free memory was 92.3MB in the beginning and 89.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:21:24,416 INFO L158 Benchmark]: Boogie Preprocessor took 54.36ms. Allocated memory is still 159.4MB. Free memory was 89.4MB in the beginning and 86.0MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:21:24,417 INFO L158 Benchmark]: RCFGBuilder took 717.52ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 123.0MB in the end (delta: -37.0MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. [2023-11-29 04:21:24,417 INFO L158 Benchmark]: TraceAbstraction took 38663.42ms. Allocated memory was 159.4MB in the beginning and 7.9GB in the end (delta: 7.7GB). Free memory was 122.1MB in the beginning and 5.6GB in the end (delta: -5.5GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2023-11-29 04:21:24,418 INFO L158 Benchmark]: Witness Printer took 110.28ms. Allocated memory is still 7.9GB. Free memory was 5.6GB in the beginning and 5.6GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 04:21:24,420 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.12ms. Allocated memory is still 111.1MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 502.42ms. Allocated memory is still 159.4MB. Free memory was 115.3MB in the beginning and 92.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.81ms. Allocated memory is still 159.4MB. Free memory was 92.3MB in the beginning and 89.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.36ms. Allocated memory is still 159.4MB. Free memory was 89.4MB in the beginning and 86.0MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 717.52ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 123.0MB in the end (delta: -37.0MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. * TraceAbstraction took 38663.42ms. Allocated memory was 159.4MB in the beginning and 7.9GB in the end (delta: 7.7GB). Free memory was 122.1MB in the beginning and 5.6GB in the end (delta: -5.5GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. * Witness Printer took 110.28ms. Allocated memory is still 7.9GB. Free memory was 5.6GB in the beginning and 5.6GB 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~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 Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 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 __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L856] 0 pthread_t t973; [L857] FCALL, FORK 0 pthread_create(&t973, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t973={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L858] 0 pthread_t t974; [L859] FCALL, FORK 0 pthread_create(&t974, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t973={5:0}, t974={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t975; [L861] FCALL, FORK 0 pthread_create(&t975, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t973={5:0}, t974={6:0}, t975={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L862] 0 pthread_t t976; [L863] FCALL, FORK 0 pthread_create(&t976, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t973={5:0}, t974={6:0}, t975={7:0}, t976={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L825] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L834] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L835] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L836] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L837] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L838] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t973={5:0}, t974={6:0}, t975={7:0}, t976={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t973={5:0}, t974={6:0}, t975={7:0}, t976={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L876] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t973={5:0}, t974={6:0}, t975={7:0}, t976={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L878] 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=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 859]: 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: 857]: 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: 863]: 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: 861]: 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, 85 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: 38.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 34.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 837 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 797 mSDsluCounter, 337 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 267 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2013 IncrementalHoareTripleChecker+Invalid, 2062 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 70 mSDtfsCounter, 2013 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=589occurred in iteration=9, InterpolantAutomatonStates: 94, 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.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 415 NumberOfCodeBlocks, 415 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 363 ConstructedInterpolants, 0 QuantifiedInterpolants, 2142 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-29 04:21:24,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d869c958-4693-4530-a221-c6bb7082a0a6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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