./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix001.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19190a32-163c-4fb0-a686-678d2750a12b/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19190a32-163c-4fb0-a686-678d2750a12b/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_19190a32-163c-4fb0-a686-678d2750a12b/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19190a32-163c-4fb0-a686-678d2750a12b/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix001.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19190a32-163c-4fb0-a686-678d2750a12b/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_19190a32-163c-4fb0-a686-678d2750a12b/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 21c0308f80ae5e3a4b410ebaece3730b9f788bd0cc89fb6ef65f8dd9f7120f36 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:39:26,197 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:39:26,281 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19190a32-163c-4fb0-a686-678d2750a12b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-28 20:39:26,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:39:26,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:39:26,316 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:39:26,317 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:39:26,317 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:39:26,318 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:39:26,319 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:39:26,320 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:39:26,320 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:39:26,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:39:26,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:39:26,323 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:39:26,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:39:26,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 20:39:26,324 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:39:26,325 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:39:26,325 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:39:26,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:39:26,327 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 20:39:26,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:39:26,328 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 20:39:26,328 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:39:26,329 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:39:26,329 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:39:26,330 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:39:26,330 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:39:26,331 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:39:26,331 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:39:26,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:39:26,332 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:39:26,332 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:39:26,332 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 20:39:26,332 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 20:39:26,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 20:39:26,333 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:39:26,333 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:39:26,333 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 20:39:26,333 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:39:26,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:39:26,334 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_19190a32-163c-4fb0-a686-678d2750a12b/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_19190a32-163c-4fb0-a686-678d2750a12b/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 -> 21c0308f80ae5e3a4b410ebaece3730b9f788bd0cc89fb6ef65f8dd9f7120f36 [2023-11-28 20:39:26,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:39:26,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:39:26,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:39:26,617 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:39:26,617 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:39:26,619 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19190a32-163c-4fb0-a686-678d2750a12b/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix001.opt.i [2023-11-28 20:39:29,379 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:39:29,661 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:39:29,662 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19190a32-163c-4fb0-a686-678d2750a12b/sv-benchmarks/c/pthread-wmm/mix001.opt.i [2023-11-28 20:39:29,680 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19190a32-163c-4fb0-a686-678d2750a12b/bin/uautomizer-verify-BQ2R08f2Ya/data/256ee646e/4e365b1386ca4cc58e6aafd97983502c/FLAG70a6f6c8b [2023-11-28 20:39:29,976 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19190a32-163c-4fb0-a686-678d2750a12b/bin/uautomizer-verify-BQ2R08f2Ya/data/256ee646e/4e365b1386ca4cc58e6aafd97983502c [2023-11-28 20:39:29,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:39:29,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:39:29,980 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:39:29,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:39:29,985 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:39:29,985 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:39:29" (1/1) ... [2023-11-28 20:39:29,986 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f7706d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:29, skipping insertion in model container [2023-11-28 20:39:29,987 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:39:29" (1/1) ... [2023-11-28 20:39:30,037 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:39:30,189 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_19190a32-163c-4fb0-a686-678d2750a12b/sv-benchmarks/c/pthread-wmm/mix001.opt.i[944,957] [2023-11-28 20:39:30,409 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:39:30,422 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:39:30,436 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_19190a32-163c-4fb0-a686-678d2750a12b/sv-benchmarks/c/pthread-wmm/mix001.opt.i[944,957] [2023-11-28 20:39:30,487 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:39:30,522 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:39:30,522 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:39:30,530 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:39:30,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:30 WrapperNode [2023-11-28 20:39:30,531 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:39:30,532 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:39:30,532 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:39:30,532 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:39:30,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:30" (1/1) ... [2023-11-28 20:39:30,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:30" (1/1) ... [2023-11-28 20:39:30,587 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2023-11-28 20:39:30,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:39:30,588 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:39:30,588 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:39:30,588 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:39:30,600 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:30" (1/1) ... [2023-11-28 20:39:30,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:30" (1/1) ... [2023-11-28 20:39:30,605 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:30" (1/1) ... [2023-11-28 20:39:30,625 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-28 20:39:30,625 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:30" (1/1) ... [2023-11-28 20:39:30,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:30" (1/1) ... [2023-11-28 20:39:30,636 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:30" (1/1) ... [2023-11-28 20:39:30,639 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:30" (1/1) ... [2023-11-28 20:39:30,641 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:30" (1/1) ... [2023-11-28 20:39:30,643 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:30" (1/1) ... [2023-11-28 20:39:30,648 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:39:30,649 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:39:30,649 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:39:30,649 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:39:30,650 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:30" (1/1) ... [2023-11-28 20:39:30,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:39:30,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19190a32-163c-4fb0-a686-678d2750a12b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:39:30,686 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19190a32-163c-4fb0-a686-678d2750a12b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:39:30,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19190a32-163c-4fb0-a686-678d2750a12b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:39:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-28 20:39:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-28 20:39:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-28 20:39:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-28 20:39:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-28 20:39:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:39:30,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 20:39:30,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 20:39:30,729 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-28 20:39:30,729 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-28 20:39:30,729 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-28 20:39:30,729 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-28 20:39:30,729 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-28 20:39:30,730 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-28 20:39:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 20:39:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-28 20:39:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-28 20:39:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-28 20:39:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-28 20:39:30,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:39:30,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:39:30,732 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-28 20:39:30,871 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:39:30,872 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:39:31,156 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:39:31,343 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:39:31,343 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-28 20:39:31,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:39:31 BoogieIcfgContainer [2023-11-28 20:39:31,344 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:39:31,347 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:39:31,347 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:39:31,351 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:39:31,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:39:29" (1/3) ... [2023-11-28 20:39:31,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe2a9d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:39:31, skipping insertion in model container [2023-11-28 20:39:31,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:30" (2/3) ... [2023-11-28 20:39:31,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe2a9d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:39:31, skipping insertion in model container [2023-11-28 20:39:31,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:39:31" (3/3) ... [2023-11-28 20:39:31,354 INFO L112 eAbstractionObserver]: Analyzing ICFG mix001.opt.i [2023-11-28 20:39:31,364 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-28 20:39:31,375 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:39:31,375 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-28 20:39:31,375 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-28 20:39:31,424 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-28 20:39:31,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 42 transitions, 96 flow [2023-11-28 20:39:31,517 INFO L124 PetriNetUnfolderBase]: 1/39 cut-off events. [2023-11-28 20:39:31,517 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 20:39:31,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 1/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 78 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2023-11-28 20:39:31,521 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 42 transitions, 96 flow [2023-11-28 20:39:31,525 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 39 transitions, 87 flow [2023-11-28 20:39:31,537 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:39:31,544 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;@1b1d9100, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:39:31,545 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-28 20:39:31,553 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-28 20:39:31,553 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-11-28 20:39:31,554 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 20:39:31,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:31,555 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:39:31,555 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-28 20:39:31,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:31,561 INFO L85 PathProgramCache]: Analyzing trace with hash 712656984, now seen corresponding path program 1 times [2023-11-28 20:39:31,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:39:31,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819961693] [2023-11-28 20:39:31,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:31,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:39:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:32,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:39:32,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:39:32,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819961693] [2023-11-28 20:39:32,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819961693] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:32,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:32,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 20:39:32,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082845758] [2023-11-28 20:39:32,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:32,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:39:32,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:39:32,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:39:32,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:39:32,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 42 [2023-11-28 20:39:32,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:32,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:39:32,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 42 [2023-11-28 20:39:32,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:32,327 INFO L124 PetriNetUnfolderBase]: 341/662 cut-off events. [2023-11-28 20:39:32,328 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 20:39:32,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 662 events. 341/662 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4375 event pairs, 53 based on Foata normal form. 30/672 useless extension candidates. Maximal degree in co-relation 1212. Up to 433 conditions per place. [2023-11-28 20:39:32,339 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 22 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2023-11-28 20:39:32,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 151 flow [2023-11-28 20:39:32,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:39:32,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:39:32,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2023-11-28 20:39:32,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.753968253968254 [2023-11-28 20:39:32,354 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 95 transitions. [2023-11-28 20:39:32,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 95 transitions. [2023-11-28 20:39:32,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:39:32,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 95 transitions. [2023-11-28 20:39:32,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:32,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:32,366 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:32,368 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 87 flow. Second operand 3 states and 95 transitions. [2023-11-28 20:39:32,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 151 flow [2023-11-28 20:39:32,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 148 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-28 20:39:32,374 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2023-11-28 20:39:32,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-11-28 20:39:32,380 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2023-11-28 20:39:32,381 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2023-11-28 20:39:32,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:32,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:32,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:39:32,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 20:39:32,382 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-28 20:39:32,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:32,383 INFO L85 PathProgramCache]: Analyzing trace with hash 621392567, now seen corresponding path program 1 times [2023-11-28 20:39:32,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:39:32,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684327172] [2023-11-28 20:39:32,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:32,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:39:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:32,610 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-28 20:39:32,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:39:32,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684327172] [2023-11-28 20:39:32,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684327172] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:32,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:32,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:39:32,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136819462] [2023-11-28 20:39:32,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:32,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:39:32,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:39:32,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:39:32,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:39:32,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-28 20:39:32,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:32,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:39:32,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-28 20:39:32,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:32,994 INFO L124 PetriNetUnfolderBase]: 941/1717 cut-off events. [2023-11-28 20:39:32,994 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2023-11-28 20:39:32,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3273 conditions, 1717 events. 941/1717 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 11140 event pairs, 107 based on Foata normal form. 72/1717 useless extension candidates. Maximal degree in co-relation 3263. Up to 809 conditions per place. [2023-11-28 20:39:33,011 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 38 selfloop transitions, 5 changer transitions 1/59 dead transitions. [2023-11-28 20:39:33,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 59 transitions, 224 flow [2023-11-28 20:39:33,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:39:33,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-28 20:39:33,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2023-11-28 20:39:33,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7023809523809523 [2023-11-28 20:39:33,014 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 118 transitions. [2023-11-28 20:39:33,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 118 transitions. [2023-11-28 20:39:33,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:39:33,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 118 transitions. [2023-11-28 20:39:33,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:33,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:33,018 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:33,018 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 4 states and 118 transitions. [2023-11-28 20:39:33,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 59 transitions, 224 flow [2023-11-28 20:39:33,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:39:33,022 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 112 flow [2023-11-28 20:39:33,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2023-11-28 20:39:33,023 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2023-11-28 20:39:33,023 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 112 flow [2023-11-28 20:39:33,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:33,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:33,024 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-28 20:39:33,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 20:39:33,024 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-28 20:39:33,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:33,025 INFO L85 PathProgramCache]: Analyzing trace with hash 41486942, now seen corresponding path program 1 times [2023-11-28 20:39:33,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:39:33,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743704680] [2023-11-28 20:39:33,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:33,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:39:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:33,204 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-28 20:39:33,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:39:33,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743704680] [2023-11-28 20:39:33,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743704680] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:33,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:33,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:39:33,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459649182] [2023-11-28 20:39:33,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:33,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:39:33,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:39:33,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:39:33,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:39:33,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-28 20:39:33,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:33,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:39:33,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-28 20:39:33,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:33,538 INFO L124 PetriNetUnfolderBase]: 665/1207 cut-off events. [2023-11-28 20:39:33,539 INFO L125 PetriNetUnfolderBase]: For 336/336 co-relation queries the response was YES. [2023-11-28 20:39:33,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2741 conditions, 1207 events. 665/1207 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6835 event pairs, 41 based on Foata normal form. 64/1227 useless extension candidates. Maximal degree in co-relation 2729. Up to 417 conditions per place. [2023-11-28 20:39:33,548 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 48 selfloop transitions, 8 changer transitions 1/72 dead transitions. [2023-11-28 20:39:33,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 72 transitions, 313 flow [2023-11-28 20:39:33,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 20:39:33,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 20:39:33,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2023-11-28 20:39:33,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7095238095238096 [2023-11-28 20:39:33,550 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 149 transitions. [2023-11-28 20:39:33,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 149 transitions. [2023-11-28 20:39:33,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:39:33,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 149 transitions. [2023-11-28 20:39:33,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:33,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:33,554 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:33,554 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 112 flow. Second operand 5 states and 149 transitions. [2023-11-28 20:39:33,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 72 transitions, 313 flow [2023-11-28 20:39:33,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 72 transitions, 303 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-28 20:39:33,558 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 152 flow [2023-11-28 20:39:33,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2023-11-28 20:39:33,559 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2023-11-28 20:39:33,560 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 152 flow [2023-11-28 20:39:33,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:33,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:33,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:39:33,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-28 20:39:33,561 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-28 20:39:33,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:33,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1325590675, now seen corresponding path program 1 times [2023-11-28 20:39:33,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:39:33,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420035107] [2023-11-28 20:39:33,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:33,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:39:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:33,803 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-28 20:39:33,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:39:33,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420035107] [2023-11-28 20:39:33,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420035107] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:33,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:33,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:39:33,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241070146] [2023-11-28 20:39:33,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:33,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:39:33,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:39:33,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:39:33,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:39:33,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-28 20:39:33,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:33,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:39:33,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-28 20:39:33,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:34,088 INFO L124 PetriNetUnfolderBase]: 399/689 cut-off events. [2023-11-28 20:39:34,088 INFO L125 PetriNetUnfolderBase]: For 644/644 co-relation queries the response was YES. [2023-11-28 20:39:34,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1839 conditions, 689 events. 399/689 cut-off events. For 644/644 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3128 event pairs, 29 based on Foata normal form. 36/709 useless extension candidates. Maximal degree in co-relation 1825. Up to 268 conditions per place. [2023-11-28 20:39:34,095 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 42 selfloop transitions, 11 changer transitions 1/69 dead transitions. [2023-11-28 20:39:34,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 69 transitions, 324 flow [2023-11-28 20:39:34,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:39:34,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:39:34,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 164 transitions. [2023-11-28 20:39:34,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6507936507936508 [2023-11-28 20:39:34,098 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 164 transitions. [2023-11-28 20:39:34,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 164 transitions. [2023-11-28 20:39:34,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:39:34,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 164 transitions. [2023-11-28 20:39:34,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:34,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 42.0) internal successors, (294), 7 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:34,102 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 42.0) internal successors, (294), 7 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:34,102 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 152 flow. Second operand 6 states and 164 transitions. [2023-11-28 20:39:34,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 69 transitions, 324 flow [2023-11-28 20:39:34,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 69 transitions, 299 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-28 20:39:34,108 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 166 flow [2023-11-28 20:39:34,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2023-11-28 20:39:34,110 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2023-11-28 20:39:34,110 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 166 flow [2023-11-28 20:39:34,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:34,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:34,111 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] [2023-11-28 20:39:34,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-28 20:39:34,111 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-28 20:39:34,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:34,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1150632503, now seen corresponding path program 1 times [2023-11-28 20:39:34,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:39:34,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724896649] [2023-11-28 20:39:34,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:34,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:39:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,477 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-28 20:39:34,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:39:34,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724896649] [2023-11-28 20:39:34,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724896649] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:34,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:34,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:39:34,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068541344] [2023-11-28 20:39:34,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:34,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:39:34,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:39:34,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:39:34,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:39:34,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-28 20:39:34,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 166 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:34,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:39:34,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-28 20:39:34,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:34,847 INFO L124 PetriNetUnfolderBase]: 455/943 cut-off events. [2023-11-28 20:39:34,848 INFO L125 PetriNetUnfolderBase]: For 501/509 co-relation queries the response was YES. [2023-11-28 20:39:34,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2183 conditions, 943 events. 455/943 cut-off events. For 501/509 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5111 event pairs, 152 based on Foata normal form. 8/907 useless extension candidates. Maximal degree in co-relation 2168. Up to 395 conditions per place. [2023-11-28 20:39:34,854 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 25 selfloop transitions, 1 changer transitions 23/70 dead transitions. [2023-11-28 20:39:34,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 70 transitions, 332 flow [2023-11-28 20:39:34,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:39:34,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:39:34,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2023-11-28 20:39:34,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.626984126984127 [2023-11-28 20:39:34,856 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 158 transitions. [2023-11-28 20:39:34,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 158 transitions. [2023-11-28 20:39:34,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:39:34,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 158 transitions. [2023-11-28 20:39:34,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:34,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 42.0) internal successors, (294), 7 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:34,860 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 42.0) internal successors, (294), 7 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:34,860 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 166 flow. Second operand 6 states and 158 transitions. [2023-11-28 20:39:34,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 70 transitions, 332 flow [2023-11-28 20:39:34,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 70 transitions, 268 flow, removed 14 selfloop flow, removed 8 redundant places. [2023-11-28 20:39:34,866 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 121 flow [2023-11-28 20:39:34,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=121, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2023-11-28 20:39:34,867 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 8 predicate places. [2023-11-28 20:39:34,868 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 121 flow [2023-11-28 20:39:34,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:34,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:34,868 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] [2023-11-28 20:39:34,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-28 20:39:34,869 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-28 20:39:34,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:34,869 INFO L85 PathProgramCache]: Analyzing trace with hash -331728837, now seen corresponding path program 2 times [2023-11-28 20:39:34,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:39:34,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906398729] [2023-11-28 20:39:34,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:34,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:39:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:35,173 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-28 20:39:35,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:39:35,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906398729] [2023-11-28 20:39:35,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906398729] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:35,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:35,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:39:35,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502804045] [2023-11-28 20:39:35,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:35,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:39:35,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:39:35,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:39:35,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:39:35,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-28 20:39:35,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:35,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:39:35,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-28 20:39:35,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:35,539 INFO L124 PetriNetUnfolderBase]: 612/1274 cut-off events. [2023-11-28 20:39:35,540 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-28 20:39:35,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2473 conditions, 1274 events. 612/1274 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7622 event pairs, 113 based on Foata normal form. 8/1224 useless extension candidates. Maximal degree in co-relation 2459. Up to 453 conditions per place. [2023-11-28 20:39:35,546 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 24 selfloop transitions, 1 changer transitions 25/71 dead transitions. [2023-11-28 20:39:35,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 71 transitions, 287 flow [2023-11-28 20:39:35,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:39:35,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:39:35,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2023-11-28 20:39:35,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2023-11-28 20:39:35,548 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 159 transitions. [2023-11-28 20:39:35,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 159 transitions. [2023-11-28 20:39:35,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:39:35,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 159 transitions. [2023-11-28 20:39:35,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:35,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 42.0) internal successors, (294), 7 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:35,551 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 42.0) internal successors, (294), 7 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:35,551 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 121 flow. Second operand 6 states and 159 transitions. [2023-11-28 20:39:35,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 71 transitions, 287 flow [2023-11-28 20:39:35,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 71 transitions, 276 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-28 20:39:35,554 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 125 flow [2023-11-28 20:39:35,554 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=125, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2023-11-28 20:39:35,555 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 10 predicate places. [2023-11-28 20:39:35,555 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 125 flow [2023-11-28 20:39:35,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:35,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:35,556 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] [2023-11-28 20:39:35,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-28 20:39:35,556 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-28 20:39:35,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:35,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1297380287, now seen corresponding path program 3 times [2023-11-28 20:39:35,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:39:35,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128219700] [2023-11-28 20:39:35,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:35,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:39:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:36,883 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-28 20:39:36,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:39:36,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128219700] [2023-11-28 20:39:36,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128219700] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:36,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:36,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-28 20:39:36,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438405513] [2023-11-28 20:39:36,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:36,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 20:39:36,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:39:36,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 20:39:36,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:39:36,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2023-11-28 20:39:36,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 125 flow. Second operand has 9 states, 9 states have (on average 21.77777777777778) internal successors, (196), 9 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:36,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:39:36,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2023-11-28 20:39:36,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:37,309 INFO L124 PetriNetUnfolderBase]: 381/858 cut-off events. [2023-11-28 20:39:37,310 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-28 20:39:37,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1699 conditions, 858 events. 381/858 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4915 event pairs, 94 based on Foata normal form. 8/816 useless extension candidates. Maximal degree in co-relation 1684. Up to 242 conditions per place. [2023-11-28 20:39:37,314 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 19 selfloop transitions, 4 changer transitions 31/77 dead transitions. [2023-11-28 20:39:37,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 77 transitions, 307 flow [2023-11-28 20:39:37,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-28 20:39:37,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-28 20:39:37,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 255 transitions. [2023-11-28 20:39:37,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2023-11-28 20:39:37,317 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 255 transitions. [2023-11-28 20:39:37,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 255 transitions. [2023-11-28 20:39:37,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:39:37,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 255 transitions. [2023-11-28 20:39:37,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 25.5) internal successors, (255), 10 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-28 20:39:37,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 42.0) internal successors, (462), 11 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:37,320 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 42.0) internal successors, (462), 11 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:37,320 INFO L175 Difference]: Start difference. First operand has 58 places, 42 transitions, 125 flow. Second operand 10 states and 255 transitions. [2023-11-28 20:39:37,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 77 transitions, 307 flow [2023-11-28 20:39:37,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 77 transitions, 296 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-28 20:39:37,323 INFO L231 Difference]: Finished difference. Result has 65 places, 42 transitions, 138 flow [2023-11-28 20:39:37,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=138, PETRI_PLACES=65, PETRI_TRANSITIONS=42} [2023-11-28 20:39:37,324 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 17 predicate places. [2023-11-28 20:39:37,324 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 42 transitions, 138 flow [2023-11-28 20:39:37,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.77777777777778) internal successors, (196), 9 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:37,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:39:37,325 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] [2023-11-28 20:39:37,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-28 20:39:37,325 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-28 20:39:37,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:37,326 INFO L85 PathProgramCache]: Analyzing trace with hash 2018973645, now seen corresponding path program 4 times [2023-11-28 20:39:37,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:39:37,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039877835] [2023-11-28 20:39:37,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:37,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:39:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:39:37,373 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 20:39:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:39:37,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 20:39:37,458 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 20:39:37,459 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-28 20:39:37,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-28 20:39:37,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-28 20:39:37,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-28 20:39:37,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-28 20:39:37,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-28 20:39:37,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-28 20:39:37,462 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2023-11-28 20:39:37,469 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-28 20:39:37,469 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 20:39:37,524 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-28 20:39:37,526 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-28 20:39:37,527 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-28 20:39:37,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:39:37 BasicIcfg [2023-11-28 20:39:37,555 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 20:39:37,556 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 20:39:37,556 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 20:39:37,556 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 20:39:37,557 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:39:31" (3/4) ... [2023-11-28 20:39:37,558 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-28 20:39:37,584 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-28 20:39:37,585 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-28 20:39:37,586 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-28 20:39:37,659 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19190a32-163c-4fb0-a686-678d2750a12b/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-28 20:39:37,659 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 20:39:37,660 INFO L158 Benchmark]: Toolchain (without parser) took 7680.80ms. Allocated memory was 146.8MB in the beginning and 211.8MB in the end (delta: 65.0MB). Free memory was 111.9MB in the beginning and 95.9MB in the end (delta: 16.0MB). Peak memory consumption was 83.7MB. Max. memory is 16.1GB. [2023-11-28 20:39:37,660 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 104.9MB. Free memory is still 52.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:39:37,661 INFO L158 Benchmark]: CACSL2BoogieTranslator took 551.43ms. Allocated memory is still 146.8MB. Free memory was 111.5MB in the beginning and 87.1MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-28 20:39:37,661 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.32ms. Allocated memory is still 146.8MB. Free memory was 87.1MB in the beginning and 84.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 20:39:37,661 INFO L158 Benchmark]: Boogie Preprocessor took 60.17ms. Allocated memory is still 146.8MB. Free memory was 84.2MB in the beginning and 80.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-28 20:39:37,662 INFO L158 Benchmark]: RCFGBuilder took 695.32ms. Allocated memory is still 146.8MB. Free memory was 80.5MB in the beginning and 70.0MB in the end (delta: 10.5MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2023-11-28 20:39:37,662 INFO L158 Benchmark]: TraceAbstraction took 6208.48ms. Allocated memory was 146.8MB in the beginning and 211.8MB in the end (delta: 65.0MB). Free memory was 69.2MB in the beginning and 109.5MB in the end (delta: -40.3MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2023-11-28 20:39:37,663 INFO L158 Benchmark]: Witness Printer took 103.24ms. Allocated memory is still 211.8MB. Free memory was 109.5MB in the beginning and 95.9MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-28 20:39:37,665 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 104.9MB. Free memory is still 52.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 551.43ms. Allocated memory is still 146.8MB. Free memory was 111.5MB in the beginning and 87.1MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.32ms. Allocated memory is still 146.8MB. Free memory was 87.1MB in the beginning and 84.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.17ms. Allocated memory is still 146.8MB. Free memory was 84.2MB in the beginning and 80.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 695.32ms. Allocated memory is still 146.8MB. Free memory was 80.5MB in the beginning and 70.0MB in the end (delta: 10.5MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * TraceAbstraction took 6208.48ms. Allocated memory was 146.8MB in the beginning and 211.8MB in the end (delta: 65.0MB). Free memory was 69.2MB in the beginning and 109.5MB in the end (delta: -40.3MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. * Witness Printer took 103.24ms. Allocated memory is still 211.8MB. Free memory was 109.5MB in the beginning and 95.9MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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~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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int __unbuffered_p2_EAX = 0; [L721] 0 int __unbuffered_p2_EBX = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L728] 0 _Bool y$flush_delayed; [L729] 0 int y$mem_tmp; [L730] 0 _Bool y$r_buff0_thd0; [L731] 0 _Bool y$r_buff0_thd1; [L732] 0 _Bool y$r_buff0_thd2; [L733] 0 _Bool y$r_buff0_thd3; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$read_delayed; [L739] 0 int *y$read_delayed_var; [L740] 0 int y$w_buff0; [L741] 0 _Bool y$w_buff0_used; [L742] 0 int y$w_buff1; [L743] 0 _Bool y$w_buff1_used; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t17; [L854] FCALL, FORK 0 pthread_create(&t17, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t17={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L855] 0 pthread_t t18; [L856] FCALL, FORK 0 pthread_create(&t18, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t17={5:0}, t18={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L857] 0 pthread_t t19; [L858] FCALL, FORK 0 pthread_create(&t19, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t17={5:0}, t18={6:0}, t19={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L800] 3 y$w_buff1 = y$w_buff0 [L801] 3 y$w_buff0 = 1 [L802] 3 y$w_buff1_used = y$w_buff0_used [L803] 3 y$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L805] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L806] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L807] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L808] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L809] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 y$flush_delayed = weak$$choice2 [L815] 3 y$mem_tmp = y [L816] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L817] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L818] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L819] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L820] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L822] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EAX = y [L824] 3 y = y$flush_delayed ? y$mem_tmp : y [L825] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L828] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L751] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L754] 1 __unbuffered_p0_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L757] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 y$flush_delayed = weak$$choice2 [L778] 2 y$mem_tmp = y [L779] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L780] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L781] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L782] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L783] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L785] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = y [L787] 2 y = y$flush_delayed ? y$mem_tmp : y [L788] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L831] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L833] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L834] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L835] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t17={5:0}, t18={6:0}, t19={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t17={5:0}, t18={6:0}, t19={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t17={5:0}, t18={6:0}, t19={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 856]: 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: 858]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 70 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.0s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 311 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 300 mSDsluCounter, 94 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 89 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 867 IncrementalHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 5 mSDtfsCounter, 867 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=4, InterpolantAutomatonStates: 40, 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.6s InterpolantComputationTime, 196 NumberOfCodeBlocks, 196 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 157 ConstructedInterpolants, 0 QuantifiedInterpolants, 913 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-28 20:39:37,685 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19190a32-163c-4fb0-a686-678d2750a12b/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