./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix039.oepc.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_92d366cf-5222-4194-bec8-8a29d8022b7b/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d366cf-5222-4194-bec8-8a29d8022b7b/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_92d366cf-5222-4194-bec8-8a29d8022b7b/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d366cf-5222-4194-bec8-8a29d8022b7b/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix039.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d366cf-5222-4194-bec8-8a29d8022b7b/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_92d366cf-5222-4194-bec8-8a29d8022b7b/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 42c5ff0d69642601057eb29fc7d78b67af5ab0b43644460199f4561abe049d3b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:01:35,131 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:01:35,191 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d366cf-5222-4194-bec8-8a29d8022b7b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 00:01:35,194 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:01:35,195 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:01:35,216 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:01:35,217 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:01:35,217 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:01:35,218 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:01:35,218 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:01:35,219 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:01:35,219 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:01:35,220 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:01:35,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:01:35,221 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:01:35,222 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:01:35,222 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:01:35,222 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:01:35,223 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:01:35,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:01:35,224 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:01:35,225 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:01:35,226 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:01:35,226 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:01:35,226 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:01:35,227 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:01:35,227 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:01:35,227 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:01:35,228 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:01:35,228 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:01:35,228 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:01:35,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:01:35,229 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:01:35,229 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:01:35,229 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:01:35,229 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:01:35,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:01:35,230 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:01:35,230 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:01:35,230 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:01:35,230 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:01:35,231 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:01:35,231 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_92d366cf-5222-4194-bec8-8a29d8022b7b/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_92d366cf-5222-4194-bec8-8a29d8022b7b/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 -> 42c5ff0d69642601057eb29fc7d78b67af5ab0b43644460199f4561abe049d3b [2023-11-29 00:01:35,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:01:35,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:01:35,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:01:35,468 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:01:35,469 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:01:35,470 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d366cf-5222-4194-bec8-8a29d8022b7b/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix039.oepc.i [2023-11-29 00:01:38,133 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:01:38,358 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:01:38,358 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d366cf-5222-4194-bec8-8a29d8022b7b/sv-benchmarks/c/pthread-wmm/mix039.oepc.i [2023-11-29 00:01:38,375 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d366cf-5222-4194-bec8-8a29d8022b7b/bin/uautomizer-verify-BQ2R08f2Ya/data/4205e1f80/d19542b141a14d1d93853686af687c89/FLAG36255a173 [2023-11-29 00:01:38,388 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d366cf-5222-4194-bec8-8a29d8022b7b/bin/uautomizer-verify-BQ2R08f2Ya/data/4205e1f80/d19542b141a14d1d93853686af687c89 [2023-11-29 00:01:38,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:01:38,392 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:01:38,393 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:01:38,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:01:38,398 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:01:38,398 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:01:38" (1/1) ... [2023-11-29 00:01:38,399 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cecd07d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:38, skipping insertion in model container [2023-11-29 00:01:38,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:01:38" (1/1) ... [2023-11-29 00:01:38,443 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:01:38,582 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_92d366cf-5222-4194-bec8-8a29d8022b7b/sv-benchmarks/c/pthread-wmm/mix039.oepc.i[945,958] [2023-11-29 00:01:38,770 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:01:38,780 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:01:38,789 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_92d366cf-5222-4194-bec8-8a29d8022b7b/sv-benchmarks/c/pthread-wmm/mix039.oepc.i[945,958] [2023-11-29 00:01:38,836 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:01:38,864 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:01:38,864 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:01:38,870 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:01:38,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:38 WrapperNode [2023-11-29 00:01:38,871 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:01:38,872 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:01:38,872 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:01:38,872 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:01:38,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:38" (1/1) ... [2023-11-29 00:01:38,895 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:38" (1/1) ... [2023-11-29 00:01:38,921 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-11-29 00:01:38,921 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:01:38,922 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:01:38,922 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:01:38,923 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:01:38,934 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:38" (1/1) ... [2023-11-29 00:01:38,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:38" (1/1) ... [2023-11-29 00:01:38,938 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:38" (1/1) ... [2023-11-29 00:01:38,957 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 00:01:38,957 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:38" (1/1) ... [2023-11-29 00:01:38,957 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:38" (1/1) ... [2023-11-29 00:01:38,966 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:38" (1/1) ... [2023-11-29 00:01:38,968 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:38" (1/1) ... [2023-11-29 00:01:38,971 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:38" (1/1) ... [2023-11-29 00:01:38,973 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:38" (1/1) ... [2023-11-29 00:01:38,977 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:01:38,978 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:01:38,978 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:01:38,978 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:01:38,979 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:38" (1/1) ... [2023-11-29 00:01:38,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:01:38,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d366cf-5222-4194-bec8-8a29d8022b7b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:01:39,006 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d366cf-5222-4194-bec8-8a29d8022b7b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:01:39,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d366cf-5222-4194-bec8-8a29d8022b7b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:01:39,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 00:01:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 00:01:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 00:01:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 00:01:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 00:01:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 00:01:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:01:39,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:01:39,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:01:39,041 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 00:01:39,041 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 00:01:39,041 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 00:01:39,042 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 00:01:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 00:01:39,042 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 00:01:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 00:01:39,042 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 00:01:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:01:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 00:01:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 00:01:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 00:01:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 00:01:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 00:01:39,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:01:39,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:01:39,045 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 00:01:39,230 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:01:39,232 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:01:39,534 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:01:39,744 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:01:39,744 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 00:01:39,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:01:39 BoogieIcfgContainer [2023-11-29 00:01:39,745 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:01:39,747 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:01:39,747 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:01:39,750 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:01:39,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:01:38" (1/3) ... [2023-11-29 00:01:39,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b5d606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:01:39, skipping insertion in model container [2023-11-29 00:01:39,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:38" (2/3) ... [2023-11-29 00:01:39,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b5d606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:01:39, skipping insertion in model container [2023-11-29 00:01:39,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:01:39" (3/3) ... [2023-11-29 00:01:39,753 INFO L112 eAbstractionObserver]: Analyzing ICFG mix039.oepc.i [2023-11-29 00:01:39,762 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 00:01:39,772 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:01:39,773 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-29 00:01:39,773 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 00:01:39,824 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 00:01:39,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow [2023-11-29 00:01:39,888 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2023-11-29 00:01:39,888 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:01:39,891 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 96 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 00:01:39,892 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow [2023-11-29 00:01:39,895 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow [2023-11-29 00:01:39,905 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:01:39,911 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;@1db666d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:01:39,912 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-29 00:01:39,916 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:01:39,916 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-11-29 00:01:39,916 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:01:39,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:01:39,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-29 00:01:39,918 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 00:01:39,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:01:39,923 INFO L85 PathProgramCache]: Analyzing trace with hash 12425846, now seen corresponding path program 1 times [2023-11-29 00:01:39,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:01:39,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63549052] [2023-11-29 00:01:39,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:01:39,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:01:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:01:40,292 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 00:01:40,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:01:40,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63549052] [2023-11-29 00:01:40,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63549052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:01:40,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:01:40,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:01:40,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815820023] [2023-11-29 00:01:40,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:01:40,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:01:40,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:01:40,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:01:40,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:01:40,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50 [2023-11-29 00:01:40,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 00:01:40,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:01:40,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50 [2023-11-29 00:01:40,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:01:41,229 INFO L124 PetriNetUnfolderBase]: 2495/3975 cut-off events. [2023-11-29 00:01:41,229 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2023-11-29 00:01:41,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7551 conditions, 3975 events. 2495/3975 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 24948 event pairs, 1647 based on Foata normal form. 135/4035 useless extension candidates. Maximal degree in co-relation 7539. Up to 2779 conditions per place. [2023-11-29 00:01:41,270 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 37 selfloop transitions, 2 changer transitions 2/62 dead transitions. [2023-11-29 00:01:41,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 227 flow [2023-11-29 00:01:41,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:01:41,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:01:41,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-29 00:01:41,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7933333333333333 [2023-11-29 00:01:41,283 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-29 00:01:41,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-29 00:01:41,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:01:41,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-29 00:01:41,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states 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 00:01:41,293 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 00:01:41,293 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 00:01:41,295 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 119 transitions. [2023-11-29 00:01:41,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 227 flow [2023-11-29 00:01:41,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 220 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 00:01:41,302 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow [2023-11-29 00:01:41,304 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 00:01:41,307 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-11-29 00:01:41,307 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow [2023-11-29 00:01:41,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 00:01:41,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:01:41,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:01:41,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:01:41,308 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 00:01:41,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:01:41,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1295638666, now seen corresponding path program 1 times [2023-11-29 00:01:41,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:01:41,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30383750] [2023-11-29 00:01:41,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:01:41,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:01:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:01:41,634 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 00:01:41,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:01:41,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30383750] [2023-11-29 00:01:41,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30383750] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:01:41,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:01:41,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:01:41,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994340131] [2023-11-29 00:01:41,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:01:41,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:01:41,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:01:41,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:01:41,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:01:41,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 50 [2023-11-29 00:01:41,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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 00:01:41,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:01:41,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 50 [2023-11-29 00:01:41,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:01:46,316 INFO L124 PetriNetUnfolderBase]: 28756/41044 cut-off events. [2023-11-29 00:01:46,316 INFO L125 PetriNetUnfolderBase]: For 1950/1950 co-relation queries the response was YES. [2023-11-29 00:01:46,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82096 conditions, 41044 events. 28756/41044 cut-off events. For 1950/1950 co-relation queries the response was YES. Maximal size of possible extension queue 1853. Compared 289779 event pairs, 6904 based on Foata normal form. 0/39793 useless extension candidates. Maximal degree in co-relation 82086. Up to 16239 conditions per place. [2023-11-29 00:01:46,506 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 48 selfloop transitions, 7 changer transitions 96/164 dead transitions. [2023-11-29 00:01:46,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 164 transitions, 662 flow [2023-11-29 00:01:46,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:01:46,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 00:01:46,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 306 transitions. [2023-11-29 00:01:46,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.68 [2023-11-29 00:01:46,511 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 306 transitions. [2023-11-29 00:01:46,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 306 transitions. [2023-11-29 00:01:46,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:01:46,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 306 transitions. [2023-11-29 00:01:46,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 34.0) internal successors, (306), 9 states have internal predecessors, (306), 0 states have call successors, (0), 0 states 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 00:01:46,518 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 00:01:46,519 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 00:01:46,519 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 9 states and 306 transitions. [2023-11-29 00:01:46,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 164 transitions, 662 flow [2023-11-29 00:01:46,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 164 transitions, 644 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:01:46,525 INFO L231 Difference]: Finished difference. Result has 68 places, 48 transitions, 190 flow [2023-11-29 00:01:46,525 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 00:01:46,526 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2023-11-29 00:01:46,526 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 48 transitions, 190 flow [2023-11-29 00:01:46,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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 00:01:46,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:01:46,526 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 00:01:46,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:01:46,527 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 00:01:46,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:01:46,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1220288491, now seen corresponding path program 1 times [2023-11-29 00:01:46,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:01:46,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026706521] [2023-11-29 00:01:46,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:01:46,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:01:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:01:46,729 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 00:01:46,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:01:46,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026706521] [2023-11-29 00:01:46,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026706521] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:01:46,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:01:46,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:01:46,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343984576] [2023-11-29 00:01:46,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:01:46,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:01:46,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:01:46,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:01:46,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:01:46,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2023-11-29 00:01:46,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 48 transitions, 190 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states 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 00:01:46,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:01:46,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2023-11-29 00:01:46,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:01:49,743 INFO L124 PetriNetUnfolderBase]: 15842/24848 cut-off events. [2023-11-29 00:01:49,743 INFO L125 PetriNetUnfolderBase]: For 21028/22607 co-relation queries the response was YES. [2023-11-29 00:01:49,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65295 conditions, 24848 events. 15842/24848 cut-off events. For 21028/22607 co-relation queries the response was YES. Maximal size of possible extension queue 1281. Compared 195245 event pairs, 4163 based on Foata normal form. 690/24466 useless extension candidates. Maximal degree in co-relation 65277. Up to 14194 conditions per place. [2023-11-29 00:01:49,866 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 34 selfloop transitions, 3 changer transitions 43/101 dead transitions. [2023-11-29 00:01:49,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 101 transitions, 514 flow [2023-11-29 00:01:49,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:01:49,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 00:01:49,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 223 transitions. [2023-11-29 00:01:49,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6371428571428571 [2023-11-29 00:01:49,868 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 223 transitions. [2023-11-29 00:01:49,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 223 transitions. [2023-11-29 00:01:49,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:01:49,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 223 transitions. [2023-11-29 00:01:49,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 31.857142857142858) internal successors, (223), 7 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 00:01:49,872 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 00:01:49,872 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 00:01:49,872 INFO L175 Difference]: Start difference. First operand has 68 places, 48 transitions, 190 flow. Second operand 7 states and 223 transitions. [2023-11-29 00:01:49,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 101 transitions, 514 flow [2023-11-29 00:01:50,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 101 transitions, 464 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-11-29 00:01:50,019 INFO L231 Difference]: Finished difference. Result has 68 places, 48 transitions, 179 flow [2023-11-29 00:01:50,020 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 00:01:50,020 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2023-11-29 00:01:50,021 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 48 transitions, 179 flow [2023-11-29 00:01:50,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states 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 00:01:50,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:01:50,021 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 00:01:50,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:01:50,022 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 00:01:50,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:01:50,023 INFO L85 PathProgramCache]: Analyzing trace with hash 661650636, now seen corresponding path program 1 times [2023-11-29 00:01:50,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:01:50,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648884276] [2023-11-29 00:01:50,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:01:50,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:01:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:01:50,170 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 00:01:50,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:01:50,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648884276] [2023-11-29 00:01:50,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648884276] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:01:50,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:01:50,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:01:50,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290511740] [2023-11-29 00:01:50,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:01:50,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:01:50,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:01:50,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:01:50,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:01:50,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2023-11-29 00:01:50,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 48 transitions, 179 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 00:01:50,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:01:50,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2023-11-29 00:01:50,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:01:53,227 INFO L124 PetriNetUnfolderBase]: 17117/26718 cut-off events. [2023-11-29 00:01:53,228 INFO L125 PetriNetUnfolderBase]: For 24392/24610 co-relation queries the response was YES. [2023-11-29 00:01:53,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68340 conditions, 26718 events. 17117/26718 cut-off events. For 24392/24610 co-relation queries the response was YES. Maximal size of possible extension queue 1282. Compared 205721 event pairs, 5763 based on Foata normal form. 688/26914 useless extension candidates. Maximal degree in co-relation 68319. Up to 18045 conditions per place. [2023-11-29 00:01:53,399 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 40 selfloop transitions, 5 changer transitions 47/111 dead transitions. [2023-11-29 00:01:53,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 111 transitions, 589 flow [2023-11-29 00:01:53,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:01:53,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 00:01:53,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 226 transitions. [2023-11-29 00:01:53,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6457142857142857 [2023-11-29 00:01:53,401 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 226 transitions. [2023-11-29 00:01:53,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 226 transitions. [2023-11-29 00:01:53,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:01:53,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 226 transitions. [2023-11-29 00:01:53,403 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 00:01:53,404 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 00:01:53,404 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 00:01:53,405 INFO L175 Difference]: Start difference. First operand has 68 places, 48 transitions, 179 flow. Second operand 7 states and 226 transitions. [2023-11-29 00:01:53,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 111 transitions, 589 flow [2023-11-29 00:01:54,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 111 transitions, 563 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-11-29 00:01:54,140 INFO L231 Difference]: Finished difference. Result has 67 places, 51 transitions, 216 flow [2023-11-29 00:01:54,141 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 00:01:54,141 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2023-11-29 00:01:54,142 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 216 flow [2023-11-29 00:01:54,142 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 00:01:54,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:01:54,142 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 00:01:54,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:01:54,143 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 00:01:54,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:01:54,143 INFO L85 PathProgramCache]: Analyzing trace with hash 252814253, now seen corresponding path program 1 times [2023-11-29 00:01:54,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:01:54,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82399326] [2023-11-29 00:01:54,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:01:54,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:01:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:01:54,324 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 00:01:54,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:01:54,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82399326] [2023-11-29 00:01:54,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82399326] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:01:54,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:01:54,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:01:54,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213427966] [2023-11-29 00:01:54,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:01:54,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:01:54,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:01:54,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:01:54,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:01:54,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2023-11-29 00:01:54,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 51 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 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 00:01:54,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:01:54,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2023-11-29 00:01:54,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:01:58,774 INFO L124 PetriNetUnfolderBase]: 28185/42475 cut-off events. [2023-11-29 00:01:58,775 INFO L125 PetriNetUnfolderBase]: For 29287/32603 co-relation queries the response was YES. [2023-11-29 00:01:58,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103054 conditions, 42475 events. 28185/42475 cut-off events. For 29287/32603 co-relation queries the response was YES. Maximal size of possible extension queue 1897. Compared 321801 event pairs, 4740 based on Foata normal form. 1638/42642 useless extension candidates. Maximal degree in co-relation 103034. Up to 20986 conditions per place. [2023-11-29 00:01:59,025 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 56 selfloop transitions, 6 changer transitions 0/85 dead transitions. [2023-11-29 00:01:59,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 85 transitions, 430 flow [2023-11-29 00:01:59,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:01:59,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 00:01:59,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2023-11-29 00:01:59,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.705 [2023-11-29 00:01:59,026 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 141 transitions. [2023-11-29 00:01:59,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 141 transitions. [2023-11-29 00:01:59,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:01:59,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 141 transitions. [2023-11-29 00:01:59,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states 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 00:01:59,028 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 00:01:59,029 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 00:01:59,029 INFO L175 Difference]: Start difference. First operand has 67 places, 51 transitions, 216 flow. Second operand 4 states and 141 transitions. [2023-11-29 00:01:59,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 85 transitions, 430 flow [2023-11-29 00:01:59,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 85 transitions, 421 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-29 00:01:59,108 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 253 flow [2023-11-29 00:01:59,108 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 00:01:59,109 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 7 predicate places. [2023-11-29 00:01:59,109 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 253 flow [2023-11-29 00:01:59,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 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 00:01:59,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:01:59,110 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 00:01:59,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:01:59,110 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 00:01:59,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:01:59,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1219920307, now seen corresponding path program 1 times [2023-11-29 00:01:59,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:01:59,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180460212] [2023-11-29 00:01:59,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:01:59,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:01:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:01:59,333 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 00:01:59,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:01:59,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180460212] [2023-11-29 00:01:59,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180460212] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:01:59,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:01:59,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:01:59,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822970960] [2023-11-29 00:01:59,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:01:59,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:01:59,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:01:59,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:01:59,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:01:59,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 50 [2023-11-29 00:01:59,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 253 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states 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 00:01:59,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:01:59,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 50 [2023-11-29 00:01:59,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:02:05,166 INFO L124 PetriNetUnfolderBase]: 36813/54295 cut-off events. [2023-11-29 00:02:05,166 INFO L125 PetriNetUnfolderBase]: For 58919/61890 co-relation queries the response was YES. [2023-11-29 00:02:05,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152503 conditions, 54295 events. 36813/54295 cut-off events. For 58919/61890 co-relation queries the response was YES. Maximal size of possible extension queue 2461. Compared 413507 event pairs, 11423 based on Foata normal form. 891/52214 useless extension candidates. Maximal degree in co-relation 152482. Up to 24941 conditions per place. [2023-11-29 00:02:05,500 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 109 selfloop transitions, 14 changer transitions 0/141 dead transitions. [2023-11-29 00:02:05,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 141 transitions, 831 flow [2023-11-29 00:02:05,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:02:05,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 00:02:05,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 255 transitions. [2023-11-29 00:02:05,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6375 [2023-11-29 00:02:05,503 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 255 transitions. [2023-11-29 00:02:05,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 255 transitions. [2023-11-29 00:02:05,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:02:05,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 255 transitions. [2023-11-29 00:02:05,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 31.875) internal successors, (255), 8 states have internal predecessors, (255), 0 states have call successors, (0), 0 states 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 00:02:05,506 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 00:02:05,506 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 00:02:05,507 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 253 flow. Second operand 8 states and 255 transitions. [2023-11-29 00:02:05,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 141 transitions, 831 flow [2023-11-29 00:02:05,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 141 transitions, 823 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-29 00:02:05,521 INFO L231 Difference]: Finished difference. Result has 77 places, 63 transitions, 364 flow [2023-11-29 00:02:05,522 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 00:02:05,522 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 19 predicate places. [2023-11-29 00:02:05,523 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 63 transitions, 364 flow [2023-11-29 00:02:05,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states 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 00:02:05,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:02:05,523 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 00:02:05,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:02:05,523 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 00:02:05,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:05,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1116354433, now seen corresponding path program 1 times [2023-11-29 00:02:05,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:05,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34829972] [2023-11-29 00:02:05,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:05,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:05,789 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 00:02:05,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:02:05,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34829972] [2023-11-29 00:02:05,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34829972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:02:05,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:02:05,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:02:05,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089376000] [2023-11-29 00:02:05,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:02:05,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:02:05,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:02:05,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:02:05,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:02:05,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2023-11-29 00:02:05,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 63 transitions, 364 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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 00:02:05,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:02:05,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2023-11-29 00:02:05,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:02:16,293 INFO L124 PetriNetUnfolderBase]: 65104/97735 cut-off events. [2023-11-29 00:02:16,294 INFO L125 PetriNetUnfolderBase]: For 167104/171831 co-relation queries the response was YES. [2023-11-29 00:02:16,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285631 conditions, 97735 events. 65104/97735 cut-off events. For 167104/171831 co-relation queries the response was YES. Maximal size of possible extension queue 4203. Compared 821559 event pairs, 7477 based on Foata normal form. 1314/94440 useless extension candidates. Maximal degree in co-relation 285603. Up to 36115 conditions per place. [2023-11-29 00:02:17,045 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 124 selfloop transitions, 39 changer transitions 0/180 dead transitions. [2023-11-29 00:02:17,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 180 transitions, 1242 flow [2023-11-29 00:02:17,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:02:17,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 00:02:17,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 282 transitions. [2023-11-29 00:02:17,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6266666666666667 [2023-11-29 00:02:17,048 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 282 transitions. [2023-11-29 00:02:17,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 282 transitions. [2023-11-29 00:02:17,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:02:17,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 282 transitions. [2023-11-29 00:02:17,049 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 00:02:17,050 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 00:02:17,050 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 00:02:17,051 INFO L175 Difference]: Start difference. First operand has 77 places, 63 transitions, 364 flow. Second operand 9 states and 282 transitions. [2023-11-29 00:02:17,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 180 transitions, 1242 flow [2023-11-29 00:02:19,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 180 transitions, 1206 flow, removed 18 selfloop flow, removed 0 redundant places. [2023-11-29 00:02:19,017 INFO L231 Difference]: Finished difference. Result has 92 places, 94 transitions, 794 flow [2023-11-29 00:02:19,017 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=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=794, PETRI_PLACES=92, PETRI_TRANSITIONS=94} [2023-11-29 00:02:19,018 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 34 predicate places. [2023-11-29 00:02:19,018 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 94 transitions, 794 flow [2023-11-29 00:02:19,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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 00:02:19,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:02:19,019 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 00:02:19,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:02:19,019 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 00:02:19,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:19,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1411507853, now seen corresponding path program 2 times [2023-11-29 00:02:19,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:19,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333166300] [2023-11-29 00:02:19,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:19,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:19,211 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 00:02:19,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:02:19,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333166300] [2023-11-29 00:02:19,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333166300] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:02:19,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:02:19,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:02:19,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805061780] [2023-11-29 00:02:19,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:02:19,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:02:19,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:02:19,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:02:19,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:02:19,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2023-11-29 00:02:19,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 94 transitions, 794 flow. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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 00:02:19,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:02:19,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2023-11-29 00:02:19,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:02:27,996 INFO L124 PetriNetUnfolderBase]: 51816/77487 cut-off events. [2023-11-29 00:02:27,997 INFO L125 PetriNetUnfolderBase]: For 155642/160308 co-relation queries the response was YES. [2023-11-29 00:02:28,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231117 conditions, 77487 events. 51816/77487 cut-off events. For 155642/160308 co-relation queries the response was YES. Maximal size of possible extension queue 2894. Compared 609718 event pairs, 5622 based on Foata normal form. 3570/79136 useless extension candidates. Maximal degree in co-relation 231080. Up to 32585 conditions per place. [2023-11-29 00:02:28,440 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 78 selfloop transitions, 10 changer transitions 14/147 dead transitions. [2023-11-29 00:02:28,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 147 transitions, 1206 flow [2023-11-29 00:02:28,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:02:28,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:02:28,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2023-11-29 00:02:28,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.724 [2023-11-29 00:02:28,442 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 181 transitions. [2023-11-29 00:02:28,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 181 transitions. [2023-11-29 00:02:28,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:02:28,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 181 transitions. [2023-11-29 00:02:28,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 0 states have call successors, (0), 0 states 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 00:02:28,444 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 00:02:28,444 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 00:02:28,444 INFO L175 Difference]: Start difference. First operand has 92 places, 94 transitions, 794 flow. Second operand 5 states and 181 transitions. [2023-11-29 00:02:28,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 147 transitions, 1206 flow [2023-11-29 00:02:31,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 147 transitions, 1146 flow, removed 30 selfloop flow, removed 0 redundant places. [2023-11-29 00:02:31,099 INFO L231 Difference]: Finished difference. Result has 98 places, 85 transitions, 669 flow [2023-11-29 00:02:31,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=669, PETRI_PLACES=98, PETRI_TRANSITIONS=85} [2023-11-29 00:02:31,100 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 40 predicate places. [2023-11-29 00:02:31,100 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 85 transitions, 669 flow [2023-11-29 00:02:31,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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 00:02:31,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:02:31,101 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 00:02:31,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:02:31,101 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 00:02:31,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:31,102 INFO L85 PathProgramCache]: Analyzing trace with hash 536735645, now seen corresponding path program 1 times [2023-11-29 00:02:31,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:31,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063418833] [2023-11-29 00:02:31,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:31,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:31,330 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 00:02:31,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:02:31,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063418833] [2023-11-29 00:02:31,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063418833] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:02:31,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:02:31,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:02:31,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728485155] [2023-11-29 00:02:31,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:02:31,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:02:31,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:02:31,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:02:31,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:02:31,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2023-11-29 00:02:31,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 85 transitions, 669 flow. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states 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 00:02:31,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:02:31,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2023-11-29 00:02:31,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:02:37,417 INFO L124 PetriNetUnfolderBase]: 36232/53671 cut-off events. [2023-11-29 00:02:37,417 INFO L125 PetriNetUnfolderBase]: For 100633/102708 co-relation queries the response was YES. [2023-11-29 00:02:37,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167398 conditions, 53671 events. 36232/53671 cut-off events. For 100633/102708 co-relation queries the response was YES. Maximal size of possible extension queue 2448. Compared 401088 event pairs, 3178 based on Foata normal form. 2159/53988 useless extension candidates. Maximal degree in co-relation 167357. Up to 18412 conditions per place. [2023-11-29 00:02:37,709 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 91 selfloop transitions, 14 changer transitions 4/151 dead transitions. [2023-11-29 00:02:37,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 151 transitions, 1163 flow [2023-11-29 00:02:37,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:02:37,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:02:37,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 219 transitions. [2023-11-29 00:02:37,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.73 [2023-11-29 00:02:37,710 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 219 transitions. [2023-11-29 00:02:37,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 219 transitions. [2023-11-29 00:02:37,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:02:37,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 219 transitions. [2023-11-29 00:02:37,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 0 states have call successors, (0), 0 states 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 00:02:37,712 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 00:02:37,712 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 00:02:37,712 INFO L175 Difference]: Start difference. First operand has 98 places, 85 transitions, 669 flow. Second operand 6 states and 219 transitions. [2023-11-29 00:02:37,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 151 transitions, 1163 flow [2023-11-29 00:02:37,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 151 transitions, 1125 flow, removed 15 selfloop flow, removed 6 redundant places. [2023-11-29 00:02:37,864 INFO L231 Difference]: Finished difference. Result has 95 places, 86 transitions, 684 flow [2023-11-29 00:02:37,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=684, PETRI_PLACES=95, PETRI_TRANSITIONS=86} [2023-11-29 00:02:37,864 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 37 predicate places. [2023-11-29 00:02:37,864 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 86 transitions, 684 flow [2023-11-29 00:02:37,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states 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 00:02:37,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:02:37,865 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 00:02:37,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:02:37,865 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 00:02:37,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:37,865 INFO L85 PathProgramCache]: Analyzing trace with hash -2131530633, now seen corresponding path program 1 times [2023-11-29 00:02:37,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:37,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385531122] [2023-11-29 00:02:37,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:37,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:38,671 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 00:02:38,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:02:38,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385531122] [2023-11-29 00:02:38,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385531122] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:02:38,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:02:38,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 00:02:38,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414744045] [2023-11-29 00:02:38,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:02:38,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:02:38,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:02:38,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:02:38,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:02:38,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2023-11-29 00:02:38,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 86 transitions, 684 flow. Second operand has 9 states, 9 states have (on average 24.11111111111111) internal successors, (217), 9 states have internal predecessors, (217), 0 states have call successors, (0), 0 states 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 00:02:38,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:02:38,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2023-11-29 00:02:38,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:02:46,455 INFO L124 PetriNetUnfolderBase]: 37378/64953 cut-off events. [2023-11-29 00:02:46,455 INFO L125 PetriNetUnfolderBase]: For 131985/144469 co-relation queries the response was YES. [2023-11-29 00:02:46,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197872 conditions, 64953 events. 37378/64953 cut-off events. For 131985/144469 co-relation queries the response was YES. Maximal size of possible extension queue 4279. Compared 660111 event pairs, 11203 based on Foata normal form. 1495/60362 useless extension candidates. Maximal degree in co-relation 197833. Up to 19284 conditions per place. [2023-11-29 00:02:46,843 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 75 selfloop transitions, 12 changer transitions 29/171 dead transitions. [2023-11-29 00:02:46,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 171 transitions, 1320 flow [2023-11-29 00:02:46,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:02:46,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 00:02:46,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 299 transitions. [2023-11-29 00:02:46,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6644444444444444 [2023-11-29 00:02:46,845 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 299 transitions. [2023-11-29 00:02:46,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 299 transitions. [2023-11-29 00:02:46,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:02:46,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 299 transitions. [2023-11-29 00:02:46,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 33.22222222222222) internal successors, (299), 9 states have internal predecessors, (299), 0 states have call successors, (0), 0 states 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 00:02:46,847 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 00:02:46,848 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 00:02:46,848 INFO L175 Difference]: Start difference. First operand has 95 places, 86 transitions, 684 flow. Second operand 9 states and 299 transitions. [2023-11-29 00:02:46,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 171 transitions, 1320 flow [2023-11-29 00:02:48,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 171 transitions, 1289 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-11-29 00:02:48,276 INFO L231 Difference]: Finished difference. Result has 105 places, 91 transitions, 698 flow [2023-11-29 00:02:48,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=698, PETRI_PLACES=105, PETRI_TRANSITIONS=91} [2023-11-29 00:02:48,277 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 47 predicate places. [2023-11-29 00:02:48,277 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 91 transitions, 698 flow [2023-11-29 00:02:48,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.11111111111111) internal successors, (217), 9 states have internal predecessors, (217), 0 states have call successors, (0), 0 states 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 00:02:48,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:02:48,277 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 00:02:48,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 00:02:48,278 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 00:02:48,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:48,278 INFO L85 PathProgramCache]: Analyzing trace with hash 430578953, now seen corresponding path program 2 times [2023-11-29 00:02:48,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:48,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446831469] [2023-11-29 00:02:48,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:48,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:48,505 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 00:02:48,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:02:48,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446831469] [2023-11-29 00:02:48,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446831469] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:02:48,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:02:48,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:02:48,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228069612] [2023-11-29 00:02:48,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:02:48,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:02:48,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:02:48,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:02:48,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:02:48,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2023-11-29 00:02:48,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 91 transitions, 698 flow. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 0 states have call successors, (0), 0 states 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 00:02:48,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:02:48,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2023-11-29 00:02:48,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:03:00,615 INFO L124 PetriNetUnfolderBase]: 69398/102037 cut-off events. [2023-11-29 00:03:00,615 INFO L125 PetriNetUnfolderBase]: For 224631/232077 co-relation queries the response was YES. [2023-11-29 00:03:01,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337441 conditions, 102037 events. 69398/102037 cut-off events. For 224631/232077 co-relation queries the response was YES. Maximal size of possible extension queue 4735. Compared 814322 event pairs, 5749 based on Foata normal form. 2204/101623 useless extension candidates. Maximal degree in co-relation 337397. Up to 37654 conditions per place. [2023-11-29 00:03:01,147 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 92 selfloop transitions, 18 changer transitions 18/165 dead transitions. [2023-11-29 00:03:01,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 165 transitions, 1364 flow [2023-11-29 00:03:01,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:03:01,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 00:03:01,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 235 transitions. [2023-11-29 00:03:01,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6714285714285714 [2023-11-29 00:03:01,149 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 235 transitions. [2023-11-29 00:03:01,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 235 transitions. [2023-11-29 00:03:01,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:03:01,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 235 transitions. [2023-11-29 00:03:01,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 0 states have call successors, (0), 0 states 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 00:03:01,150 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 00:03:01,151 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 00:03:01,151 INFO L175 Difference]: Start difference. First operand has 105 places, 91 transitions, 698 flow. Second operand 7 states and 235 transitions. [2023-11-29 00:03:01,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 165 transitions, 1364 flow [2023-11-29 00:03:07,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 165 transitions, 1268 flow, removed 45 selfloop flow, removed 10 redundant places. [2023-11-29 00:03:07,534 INFO L231 Difference]: Finished difference. Result has 97 places, 86 transitions, 651 flow [2023-11-29 00:03:07,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=651, PETRI_PLACES=97, PETRI_TRANSITIONS=86} [2023-11-29 00:03:07,535 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 39 predicate places. [2023-11-29 00:03:07,535 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 86 transitions, 651 flow [2023-11-29 00:03:07,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 0 states have call successors, (0), 0 states 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 00:03:07,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:03:07,536 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 00:03:07,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 00:03:07,536 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 00:03:07,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:07,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1441127660, now seen corresponding path program 1 times [2023-11-29 00:03:07,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:07,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984435859] [2023-11-29 00:03:07,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:07,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:07,589 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:03:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:07,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:03:07,663 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:03:07,664 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-29 00:03:07,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-29 00:03:07,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-29 00:03:07,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-29 00:03:07,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-29 00:03:07,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-29 00:03:07,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-29 00:03:07,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 00:03:07,666 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:07,671 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 00:03:07,671 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:03:07,726 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 00:03:07,729 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 00:03:07,731 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 00:03:07,734 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 00:03:07,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:03:07 BasicIcfg [2023-11-29 00:03:07,758 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:03:07,758 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:03:07,758 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:03:07,758 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:03:07,759 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:01:39" (3/4) ... [2023-11-29 00:03:07,759 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 00:03:07,782 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 00:03:07,783 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 00:03:07,784 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 00:03:07,786 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 00:03:07,848 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d366cf-5222-4194-bec8-8a29d8022b7b/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 00:03:07,849 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:03:07,849 INFO L158 Benchmark]: Toolchain (without parser) took 89457.25ms. Allocated memory was 136.3MB in the beginning and 9.8GB in the end (delta: 9.6GB). Free memory was 87.2MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 4.8GB. Max. memory is 16.1GB. [2023-11-29 00:03:07,850 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 136.3MB. Free memory is still 105.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:03:07,850 INFO L158 Benchmark]: CACSL2BoogieTranslator took 477.71ms. Allocated memory is still 136.3MB. Free memory was 87.2MB in the beginning and 62.6MB in the end (delta: 24.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 00:03:07,851 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.98ms. Allocated memory is still 136.3MB. Free memory was 62.5MB in the beginning and 59.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 00:03:07,851 INFO L158 Benchmark]: Boogie Preprocessor took 55.10ms. Allocated memory is still 136.3MB. Free memory was 59.9MB in the beginning and 56.4MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:03:07,851 INFO L158 Benchmark]: RCFGBuilder took 766.77ms. Allocated memory was 136.3MB in the beginning and 182.5MB in the end (delta: 46.1MB). Free memory was 56.4MB in the beginning and 106.2MB in the end (delta: -49.8MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2023-11-29 00:03:07,852 INFO L158 Benchmark]: TraceAbstraction took 88010.70ms. Allocated memory was 182.5MB in the beginning and 9.8GB in the end (delta: 9.6GB). Free memory was 105.2MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 4.8GB. Max. memory is 16.1GB. [2023-11-29 00:03:07,852 INFO L158 Benchmark]: Witness Printer took 90.58ms. Allocated memory is still 9.8GB. Free memory was 4.9GB in the beginning and 4.9GB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 00:03:07,854 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.17ms. Allocated memory is still 136.3MB. Free memory is still 105.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 477.71ms. Allocated memory is still 136.3MB. Free memory was 87.2MB in the beginning and 62.6MB in the end (delta: 24.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.98ms. Allocated memory is still 136.3MB. Free memory was 62.5MB in the beginning and 59.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.10ms. Allocated memory is still 136.3MB. Free memory was 59.9MB in the beginning and 56.4MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 766.77ms. Allocated memory was 136.3MB in the beginning and 182.5MB in the end (delta: 46.1MB). Free memory was 56.4MB in the beginning and 106.2MB in the end (delta: -49.8MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * TraceAbstraction took 88010.70ms. Allocated memory was 182.5MB in the beginning and 9.8GB in the end (delta: 9.6GB). Free memory was 105.2MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 4.8GB. Max. memory is 16.1GB. * Witness Printer took 90.58ms. Allocated memory is still 9.8GB. Free memory was 4.9GB in the beginning and 4.9GB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. 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_p0_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 b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t1025; [L872] FCALL, FORK 0 pthread_create(&t1025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1025={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1026; [L874] FCALL, FORK 0 pthread_create(&t1026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1025={5:0}, t1026={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L875] 0 pthread_t t1027; [L876] FCALL, FORK 0 pthread_create(&t1027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1025={5:0}, t1026={6:0}, t1027={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L877] 0 pthread_t t1028; [L878] FCALL, FORK 0 pthread_create(&t1028, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1025={5:0}, t1026={6:0}, t1027={7:0}, t1028={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L824] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L827] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1025={5:0}, t1026={6:0}, t1027={7:0}, t1028={3:0}, weak$$choice2=0, x=1, y=2, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1025={5:0}, t1026={6:0}, t1027={7:0}, t1028={3:0}, weak$$choice2=0, x=1, y=2, z=1] [L891] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1025={5:0}, t1026={6:0}, t1027={7:0}, t1028={3:0}, weak$$choice2=0, x=1, y=2, z=1] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, 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: 878]: 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: 874]: 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: 876]: 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: 872]: 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: 87.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 84.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 864 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 828 mSDsluCounter, 240 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 191 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1997 IncrementalHoareTripleChecker+Invalid, 2051 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 49 mSDtfsCounter, 1997 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=794occurred in iteration=7, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 287 NumberOfCodeBlocks, 287 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 238 ConstructedInterpolants, 0 QuantifiedInterpolants, 1395 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-29 00:03:07,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92d366cf-5222-4194-bec8-8a29d8022b7b/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