./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix020.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_6044cd8b-1faa-498d-b60c-a9e363c64042/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6044cd8b-1faa-498d-b60c-a9e363c64042/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_6044cd8b-1faa-498d-b60c-a9e363c64042/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6044cd8b-1faa-498d-b60c-a9e363c64042/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix020.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6044cd8b-1faa-498d-b60c-a9e363c64042/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_6044cd8b-1faa-498d-b60c-a9e363c64042/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 b3c17f675455332f72f7dc385a60a0aa293a9aeb1dd45189023ae89322443476 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:24:54,777 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:24:54,834 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6044cd8b-1faa-498d-b60c-a9e363c64042/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 05:24:54,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:24:54,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:24:54,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:24:54,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:24:54,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:24:54,863 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:24:54,863 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:24:54,864 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:24:54,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:24:54,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:24:54,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:24:54,866 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:24:54,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:24:54,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:24:54,868 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:24:54,868 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:24:54,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:24:54,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:24:54,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:24:54,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:24:54,872 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:24:54,872 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:24:54,872 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:24:54,873 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:24:54,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:24:54,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:24:54,874 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:24:54,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:24:54,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:24:54,875 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:24:54,875 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:24:54,875 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:24:54,876 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:24:54,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:24:54,877 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:24:54,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:24:54,877 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:24:54,878 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:24:54,878 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:24:54,879 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_6044cd8b-1faa-498d-b60c-a9e363c64042/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_6044cd8b-1faa-498d-b60c-a9e363c64042/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 -> b3c17f675455332f72f7dc385a60a0aa293a9aeb1dd45189023ae89322443476 [2023-11-29 05:24:55,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:24:55,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:24:55,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:24:55,101 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:24:55,102 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:24:55,103 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6044cd8b-1faa-498d-b60c-a9e363c64042/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix020.opt.i [2023-11-29 05:24:57,846 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:24:58,117 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:24:58,118 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6044cd8b-1faa-498d-b60c-a9e363c64042/sv-benchmarks/c/pthread-wmm/mix020.opt.i [2023-11-29 05:24:58,134 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6044cd8b-1faa-498d-b60c-a9e363c64042/bin/uautomizer-verify-BQ2R08f2Ya/data/6f3f68d22/7423ef4a79af4585b4acf0a4ee42e0f7/FLAGcae324b26 [2023-11-29 05:24:58,149 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6044cd8b-1faa-498d-b60c-a9e363c64042/bin/uautomizer-verify-BQ2R08f2Ya/data/6f3f68d22/7423ef4a79af4585b4acf0a4ee42e0f7 [2023-11-29 05:24:58,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:24:58,154 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:24:58,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:24:58,155 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:24:58,160 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:24:58,161 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:24:58" (1/1) ... [2023-11-29 05:24:58,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f662e54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:24:58, skipping insertion in model container [2023-11-29 05:24:58,162 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:24:58" (1/1) ... [2023-11-29 05:24:58,213 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:24:58,367 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_6044cd8b-1faa-498d-b60c-a9e363c64042/sv-benchmarks/c/pthread-wmm/mix020.opt.i[944,957] [2023-11-29 05:24:58,534 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:24:58,545 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:24:58,554 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_6044cd8b-1faa-498d-b60c-a9e363c64042/sv-benchmarks/c/pthread-wmm/mix020.opt.i[944,957] [2023-11-29 05:24:58,615 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:24:58,645 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:24:58,645 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:24:58,651 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:24:58,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:24:58 WrapperNode [2023-11-29 05:24:58,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:24:58,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:24:58,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:24:58,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:24:58,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:24:58" (1/1) ... [2023-11-29 05:24:58,676 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:24:58" (1/1) ... [2023-11-29 05:24:58,707 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2023-11-29 05:24:58,707 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:24:58,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:24:58,708 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:24:58,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:24:58,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:24:58" (1/1) ... [2023-11-29 05:24:58,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:24:58" (1/1) ... [2023-11-29 05:24:58,723 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:24:58" (1/1) ... [2023-11-29 05:24:58,737 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-29 05:24:58,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:24:58" (1/1) ... [2023-11-29 05:24:58,738 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:24:58" (1/1) ... [2023-11-29 05:24:58,747 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:24:58" (1/1) ... [2023-11-29 05:24:58,749 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:24:58" (1/1) ... [2023-11-29 05:24:58,751 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:24:58" (1/1) ... [2023-11-29 05:24:58,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:24:58" (1/1) ... [2023-11-29 05:24:58,756 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:24:58,757 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:24:58,757 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:24:58,757 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:24:58,758 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:24:58" (1/1) ... [2023-11-29 05:24:58,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:24:58,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6044cd8b-1faa-498d-b60c-a9e363c64042/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:24:58,791 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6044cd8b-1faa-498d-b60c-a9e363c64042/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:24:58,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6044cd8b-1faa-498d-b60c-a9e363c64042/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:24:58,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 05:24:58,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 05:24:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 05:24:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 05:24:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 05:24:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 05:24:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:24:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:24:58,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:24:58,832 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 05:24:58,832 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 05:24:58,832 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 05:24:58,832 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 05:24:58,832 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 05:24:58,832 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 05:24:58,833 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 05:24:58,833 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 05:24:58,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:24:58,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 05:24:58,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 05:24:58,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 05:24:58,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 05:24:58,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 05:24:58,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:24:58,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:24:58,836 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 05:24:58,992 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:24:58,995 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:24:59,297 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:24:59,483 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:24:59,483 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 05:24:59,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:24:59 BoogieIcfgContainer [2023-11-29 05:24:59,484 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:24:59,487 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:24:59,487 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:24:59,489 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:24:59,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:24:58" (1/3) ... [2023-11-29 05:24:59,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec9e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:24:59, skipping insertion in model container [2023-11-29 05:24:59,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:24:58" (2/3) ... [2023-11-29 05:24:59,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec9e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:24:59, skipping insertion in model container [2023-11-29 05:24:59,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:24:59" (3/3) ... [2023-11-29 05:24:59,492 INFO L112 eAbstractionObserver]: Analyzing ICFG mix020.opt.i [2023-11-29 05:24:59,499 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 05:24:59,507 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:24:59,508 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-29 05:24:59,508 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 05:24:59,551 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 05:24:59,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 49 transitions, 114 flow [2023-11-29 05:24:59,605 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2023-11-29 05:24:59,606 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:24:59,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 88 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2023-11-29 05:24:59,609 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 49 transitions, 114 flow [2023-11-29 05:24:59,613 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 45 transitions, 102 flow [2023-11-29 05:24:59,623 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:24:59,629 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;@4a82ca2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:24:59,629 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-29 05:24:59,640 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 05:24:59,640 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2023-11-29 05:24:59,640 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:24:59,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:24:59,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:24:59,641 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 05:24:59,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:24:59,645 INFO L85 PathProgramCache]: Analyzing trace with hash 396149237, now seen corresponding path program 1 times [2023-11-29 05:24:59,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:24:59,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151020304] [2023-11-29 05:24:59,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:24:59,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:24:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:00,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:25:00,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:00,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151020304] [2023-11-29 05:25:00,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151020304] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:00,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:00,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:25:00,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931325891] [2023-11-29 05:25:00,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:00,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:25:00,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:00,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:25:00,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:25:00,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 49 [2023-11-29 05:25:00,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:00,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:25:00,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 49 [2023-11-29 05:25:00,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:25:00,514 INFO L124 PetriNetUnfolderBase]: 879/1523 cut-off events. [2023-11-29 05:25:00,514 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:25:00,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2843 conditions, 1523 events. 879/1523 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 10500 event pairs, 159 based on Foata normal form. 60/1530 useless extension candidates. Maximal degree in co-relation 2831. Up to 1009 conditions per place. [2023-11-29 05:25:00,535 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 26 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2023-11-29 05:25:00,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 52 transitions, 176 flow [2023-11-29 05:25:00,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:25:00,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:25:00,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2023-11-29 05:25:00,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7551020408163265 [2023-11-29 05:25:00,551 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 111 transitions. [2023-11-29 05:25:00,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 111 transitions. [2023-11-29 05:25:00,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:25:00,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 111 transitions. [2023-11-29 05:25:00,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:00,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 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-29 05:25:00,562 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 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-29 05:25:00,564 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 111 transitions. [2023-11-29 05:25:00,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 52 transitions, 176 flow [2023-11-29 05:25:00,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 52 transitions, 172 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:25:00,571 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 96 flow [2023-11-29 05:25:00,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2023-11-29 05:25:00,577 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2023-11-29 05:25:00,577 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 96 flow [2023-11-29 05:25:00,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:00,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:25:00,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:25:00,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:25:00,578 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 05:25:00,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:00,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1192277587, now seen corresponding path program 1 times [2023-11-29 05:25:00,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:00,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352299776] [2023-11-29 05:25:00,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:00,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:00,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:25:00,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:00,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352299776] [2023-11-29 05:25:00,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352299776] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:00,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:00,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:25:00,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745728623] [2023-11-29 05:25:00,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:00,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:25:00,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:00,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:25:00,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:25:00,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2023-11-29 05:25:00,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:00,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:25:00,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2023-11-29 05:25:00,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:25:03,546 INFO L124 PetriNetUnfolderBase]: 10607/16150 cut-off events. [2023-11-29 05:25:03,546 INFO L125 PetriNetUnfolderBase]: For 626/626 co-relation queries the response was YES. [2023-11-29 05:25:03,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31578 conditions, 16150 events. 10607/16150 cut-off events. For 626/626 co-relation queries the response was YES. Maximal size of possible extension queue 980. Compared 120808 event pairs, 2534 based on Foata normal form. 0/15645 useless extension candidates. Maximal degree in co-relation 31568. Up to 6451 conditions per place. [2023-11-29 05:25:03,669 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 42 selfloop transitions, 7 changer transitions 78/142 dead transitions. [2023-11-29 05:25:03,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 142 transitions, 570 flow [2023-11-29 05:25:03,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:25:03,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 05:25:03,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 300 transitions. [2023-11-29 05:25:03,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6802721088435374 [2023-11-29 05:25:03,674 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 300 transitions. [2023-11-29 05:25:03,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 300 transitions. [2023-11-29 05:25:03,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:25:03,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 300 transitions. [2023-11-29 05:25:03,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 33.333333333333336) internal successors, (300), 9 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:03,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 49.0) internal successors, (490), 10 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:03,681 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 49.0) internal successors, (490), 10 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:03,681 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 9 states and 300 transitions. [2023-11-29 05:25:03,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 142 transitions, 570 flow [2023-11-29 05:25:03,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 142 transitions, 552 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:25:03,699 INFO L231 Difference]: Finished difference. Result has 67 places, 47 transitions, 188 flow [2023-11-29 05:25:03,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=188, PETRI_PLACES=67, PETRI_TRANSITIONS=47} [2023-11-29 05:25:03,701 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places. [2023-11-29 05:25:03,701 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 47 transitions, 188 flow [2023-11-29 05:25:03,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:03,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:25:03,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:25:03,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:25:03,702 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 05:25:03,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:03,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1853710190, now seen corresponding path program 1 times [2023-11-29 05:25:03,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:03,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752790621] [2023-11-29 05:25:03,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:03,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:03,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:25:03,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:03,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752790621] [2023-11-29 05:25:03,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752790621] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:03,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:03,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:25:03,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779236391] [2023-11-29 05:25:03,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:03,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:25:03,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:03,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:25:03,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:25:03,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 49 [2023-11-29 05:25:03,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 47 transitions, 188 flow. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:03,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:25:03,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 49 [2023-11-29 05:25:03,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:25:05,309 INFO L124 PetriNetUnfolderBase]: 4974/8523 cut-off events. [2023-11-29 05:25:05,309 INFO L125 PetriNetUnfolderBase]: For 12301/13128 co-relation queries the response was YES. [2023-11-29 05:25:05,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24341 conditions, 8523 events. 4974/8523 cut-off events. For 12301/13128 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 69328 event pairs, 1737 based on Foata normal form. 314/8238 useless extension candidates. Maximal degree in co-relation 24323. Up to 3617 conditions per place. [2023-11-29 05:25:05,381 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 29 selfloop transitions, 3 changer transitions 33/88 dead transitions. [2023-11-29 05:25:05,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 88 transitions, 494 flow [2023-11-29 05:25:05,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:25:05,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:25:05,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 219 transitions. [2023-11-29 05:25:05,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6384839650145773 [2023-11-29 05:25:05,385 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 219 transitions. [2023-11-29 05:25:05,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 219 transitions. [2023-11-29 05:25:05,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:25:05,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 219 transitions. [2023-11-29 05:25:05,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 31.285714285714285) internal successors, (219), 7 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:05,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 49.0) internal successors, (392), 8 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:05,390 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 49.0) internal successors, (392), 8 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:05,390 INFO L175 Difference]: Start difference. First operand has 67 places, 47 transitions, 188 flow. Second operand 7 states and 219 transitions. [2023-11-29 05:25:05,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 88 transitions, 494 flow [2023-11-29 05:25:05,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 88 transitions, 432 flow, removed 17 selfloop flow, removed 4 redundant places. [2023-11-29 05:25:05,461 INFO L231 Difference]: Finished difference. Result has 67 places, 47 transitions, 177 flow [2023-11-29 05:25:05,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=177, PETRI_PLACES=67, PETRI_TRANSITIONS=47} [2023-11-29 05:25:05,462 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places. [2023-11-29 05:25:05,463 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 47 transitions, 177 flow [2023-11-29 05:25:05,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:05,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:25:05,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:25:05,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:25:05,464 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 05:25:05,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:05,465 INFO L85 PathProgramCache]: Analyzing trace with hash -890580954, now seen corresponding path program 1 times [2023-11-29 05:25:05,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:05,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256686805] [2023-11-29 05:25:05,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:05,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:05,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:25:05,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:05,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256686805] [2023-11-29 05:25:05,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256686805] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:05,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:05,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:25:05,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956116367] [2023-11-29 05:25:05,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:05,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:25:05,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:05,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:25:05,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:25:05,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2023-11-29 05:25:05,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 47 transitions, 177 flow. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:05,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:25:05,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2023-11-29 05:25:05,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:25:07,234 INFO L124 PetriNetUnfolderBase]: 6636/10913 cut-off events. [2023-11-29 05:25:07,234 INFO L125 PetriNetUnfolderBase]: For 11107/11107 co-relation queries the response was YES. [2023-11-29 05:25:07,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29882 conditions, 10913 events. 6636/10913 cut-off events. For 11107/11107 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 82979 event pairs, 821 based on Foata normal form. 238/11097 useless extension candidates. Maximal degree in co-relation 29861. Up to 5144 conditions per place. [2023-11-29 05:25:07,298 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 55 selfloop transitions, 11 changer transitions 56/137 dead transitions. [2023-11-29 05:25:07,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 137 transitions, 789 flow [2023-11-29 05:25:07,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:25:07,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 05:25:07,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 311 transitions. [2023-11-29 05:25:07,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6346938775510204 [2023-11-29 05:25:07,301 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 311 transitions. [2023-11-29 05:25:07,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 311 transitions. [2023-11-29 05:25:07,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:25:07,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 311 transitions. [2023-11-29 05:25:07,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 31.1) internal successors, (311), 10 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:07,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 49.0) internal successors, (539), 11 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:07,305 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 49.0) internal successors, (539), 11 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:07,306 INFO L175 Difference]: Start difference. First operand has 67 places, 47 transitions, 177 flow. Second operand 10 states and 311 transitions. [2023-11-29 05:25:07,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 137 transitions, 789 flow [2023-11-29 05:25:07,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 137 transitions, 747 flow, removed 16 selfloop flow, removed 8 redundant places. [2023-11-29 05:25:07,429 INFO L231 Difference]: Finished difference. Result has 72 places, 52 transitions, 247 flow [2023-11-29 05:25:07,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=247, PETRI_PLACES=72, PETRI_TRANSITIONS=52} [2023-11-29 05:25:07,430 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 15 predicate places. [2023-11-29 05:25:07,430 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 52 transitions, 247 flow [2023-11-29 05:25:07,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:07,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:25:07,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:25:07,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:25:07,431 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 05:25:07,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:07,432 INFO L85 PathProgramCache]: Analyzing trace with hash 364817157, now seen corresponding path program 1 times [2023-11-29 05:25:07,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:07,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918127657] [2023-11-29 05:25:07,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:07,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:07,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:25:07,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:07,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918127657] [2023-11-29 05:25:07,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918127657] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:07,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:07,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:25:07,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517100535] [2023-11-29 05:25:07,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:07,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:25:07,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:07,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:25:07,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:25:07,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2023-11-29 05:25:07,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 52 transitions, 247 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:07,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:25:07,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2023-11-29 05:25:07,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:25:09,871 INFO L124 PetriNetUnfolderBase]: 13537/20482 cut-off events. [2023-11-29 05:25:09,871 INFO L125 PetriNetUnfolderBase]: For 23862/25721 co-relation queries the response was YES. [2023-11-29 05:25:09,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55040 conditions, 20482 events. 13537/20482 cut-off events. For 23862/25721 co-relation queries the response was YES. Maximal size of possible extension queue 1146. Compared 148948 event pairs, 2080 based on Foata normal form. 1060/20762 useless extension candidates. Maximal degree in co-relation 55017. Up to 10222 conditions per place. [2023-11-29 05:25:09,991 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 54 selfloop transitions, 6 changer transitions 0/84 dead transitions. [2023-11-29 05:25:09,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 84 transitions, 485 flow [2023-11-29 05:25:09,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:25:09,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 05:25:09,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2023-11-29 05:25:09,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7091836734693877 [2023-11-29 05:25:09,992 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 139 transitions. [2023-11-29 05:25:09,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 139 transitions. [2023-11-29 05:25:09,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:25:09,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 139 transitions. [2023-11-29 05:25:09,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:09,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 49.0) internal successors, (245), 5 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:09,995 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 49.0) internal successors, (245), 5 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:09,995 INFO L175 Difference]: Start difference. First operand has 72 places, 52 transitions, 247 flow. Second operand 4 states and 139 transitions. [2023-11-29 05:25:09,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 84 transitions, 485 flow [2023-11-29 05:25:10,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 84 transitions, 469 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-11-29 05:25:10,163 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 277 flow [2023-11-29 05:25:10,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=277, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2023-11-29 05:25:10,164 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places. [2023-11-29 05:25:10,165 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 277 flow [2023-11-29 05:25:10,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:10,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:25:10,165 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] [2023-11-29 05:25:10,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:25:10,166 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 05:25:10,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:10,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1289466270, now seen corresponding path program 1 times [2023-11-29 05:25:10,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:10,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879041411] [2023-11-29 05:25:10,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:10,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:10,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:25:10,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:10,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879041411] [2023-11-29 05:25:10,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879041411] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:10,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:10,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:25:10,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131667193] [2023-11-29 05:25:10,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:10,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:25:10,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:10,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:25:10,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:25:10,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2023-11-29 05:25:10,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 277 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 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-29 05:25:10,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:25:10,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2023-11-29 05:25:10,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:25:13,062 INFO L124 PetriNetUnfolderBase]: 14272/23479 cut-off events. [2023-11-29 05:25:13,062 INFO L125 PetriNetUnfolderBase]: For 22293/23018 co-relation queries the response was YES. [2023-11-29 05:25:13,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64301 conditions, 23479 events. 14272/23479 cut-off events. For 22293/23018 co-relation queries the response was YES. Maximal size of possible extension queue 1348. Compared 198046 event pairs, 5206 based on Foata normal form. 424/21776 useless extension candidates. Maximal degree in co-relation 64278. Up to 8782 conditions per place. [2023-11-29 05:25:13,221 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 68 selfloop transitions, 10 changer transitions 0/103 dead transitions. [2023-11-29 05:25:13,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 103 transitions, 600 flow [2023-11-29 05:25:13,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:25:13,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:25:13,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 220 transitions. [2023-11-29 05:25:13,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.641399416909621 [2023-11-29 05:25:13,223 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 220 transitions. [2023-11-29 05:25:13,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 220 transitions. [2023-11-29 05:25:13,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:25:13,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 220 transitions. [2023-11-29 05:25:13,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 31.428571428571427) internal successors, (220), 7 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:13,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 49.0) internal successors, (392), 8 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:13,225 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 49.0) internal successors, (392), 8 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:13,225 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 277 flow. Second operand 7 states and 220 transitions. [2023-11-29 05:25:13,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 103 transitions, 600 flow [2023-11-29 05:25:13,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 103 transitions, 594 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-29 05:25:13,253 INFO L231 Difference]: Finished difference. Result has 75 places, 62 transitions, 352 flow [2023-11-29 05:25:13,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=352, PETRI_PLACES=75, PETRI_TRANSITIONS=62} [2023-11-29 05:25:13,254 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 18 predicate places. [2023-11-29 05:25:13,255 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 62 transitions, 352 flow [2023-11-29 05:25:13,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 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-29 05:25:13,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:25:13,255 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] [2023-11-29 05:25:13,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:25:13,256 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 05:25:13,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:13,256 INFO L85 PathProgramCache]: Analyzing trace with hash 314666524, now seen corresponding path program 1 times [2023-11-29 05:25:13,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:13,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081923136] [2023-11-29 05:25:13,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:13,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:13,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:25:13,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:13,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081923136] [2023-11-29 05:25:13,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081923136] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:13,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:13,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:25:13,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804507608] [2023-11-29 05:25:13,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:13,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:25:13,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:13,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:25:13,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:25:13,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2023-11-29 05:25:13,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 62 transitions, 352 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 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-29 05:25:13,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:25:13,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2023-11-29 05:25:13,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:25:16,261 INFO L124 PetriNetUnfolderBase]: 17699/26793 cut-off events. [2023-11-29 05:25:16,262 INFO L125 PetriNetUnfolderBase]: For 32465/35003 co-relation queries the response was YES. [2023-11-29 05:25:16,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78555 conditions, 26793 events. 17699/26793 cut-off events. For 32465/35003 co-relation queries the response was YES. Maximal size of possible extension queue 1333. Compared 197715 event pairs, 1472 based on Foata normal form. 1440/27538 useless extension candidates. Maximal degree in co-relation 78529. Up to 10737 conditions per place. [2023-11-29 05:25:16,396 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 70 selfloop transitions, 10 changer transitions 3/109 dead transitions. [2023-11-29 05:25:16,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 109 transitions, 710 flow [2023-11-29 05:25:16,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:25:16,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:25:16,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 178 transitions. [2023-11-29 05:25:16,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.726530612244898 [2023-11-29 05:25:16,398 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 178 transitions. [2023-11-29 05:25:16,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 178 transitions. [2023-11-29 05:25:16,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:25:16,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 178 transitions. [2023-11-29 05:25:16,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:16,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 49.0) internal successors, (294), 6 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-29 05:25:16,401 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 49.0) internal successors, (294), 6 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-29 05:25:16,401 INFO L175 Difference]: Start difference. First operand has 75 places, 62 transitions, 352 flow. Second operand 5 states and 178 transitions. [2023-11-29 05:25:16,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 109 transitions, 710 flow [2023-11-29 05:25:16,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 109 transitions, 697 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-29 05:25:16,557 INFO L231 Difference]: Finished difference. Result has 80 places, 64 transitions, 378 flow [2023-11-29 05:25:16,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=378, PETRI_PLACES=80, PETRI_TRANSITIONS=64} [2023-11-29 05:25:16,558 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 23 predicate places. [2023-11-29 05:25:16,558 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 64 transitions, 378 flow [2023-11-29 05:25:16,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 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-29 05:25:16,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:25:16,558 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] [2023-11-29 05:25:16,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 05:25:16,559 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 05:25:16,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:16,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1778897847, now seen corresponding path program 1 times [2023-11-29 05:25:16,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:16,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289055128] [2023-11-29 05:25:16,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:16,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:16,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:25:16,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:16,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289055128] [2023-11-29 05:25:16,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289055128] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:16,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:16,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:25:16,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528484727] [2023-11-29 05:25:16,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:16,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:25:16,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:16,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:25:16,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:25:16,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2023-11-29 05:25:16,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 64 transitions, 378 flow. Second operand has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:16,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:25:16,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2023-11-29 05:25:16,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:25:19,316 INFO L124 PetriNetUnfolderBase]: 13600/20579 cut-off events. [2023-11-29 05:25:19,317 INFO L125 PetriNetUnfolderBase]: For 36760/40394 co-relation queries the response was YES. [2023-11-29 05:25:19,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67697 conditions, 20579 events. 13600/20579 cut-off events. For 36760/40394 co-relation queries the response was YES. Maximal size of possible extension queue 1107. Compared 145905 event pairs, 745 based on Foata normal form. 1143/21148 useless extension candidates. Maximal degree in co-relation 67668. Up to 7024 conditions per place. [2023-11-29 05:25:19,423 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 82 selfloop transitions, 14 changer transitions 2/124 dead transitions. [2023-11-29 05:25:19,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 124 transitions, 839 flow [2023-11-29 05:25:19,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:25:19,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:25:19,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 215 transitions. [2023-11-29 05:25:19,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7312925170068028 [2023-11-29 05:25:19,425 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 215 transitions. [2023-11-29 05:25:19,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 215 transitions. [2023-11-29 05:25:19,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:25:19,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 215 transitions. [2023-11-29 05:25:19,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 35.833333333333336) internal successors, (215), 6 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:19,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 49.0) internal successors, (343), 7 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:19,426 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 49.0) internal successors, (343), 7 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:19,427 INFO L175 Difference]: Start difference. First operand has 80 places, 64 transitions, 378 flow. Second operand 6 states and 215 transitions. [2023-11-29 05:25:19,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 124 transitions, 839 flow [2023-11-29 05:25:19,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 124 transitions, 812 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-11-29 05:25:19,469 INFO L231 Difference]: Finished difference. Result has 80 places, 69 transitions, 437 flow [2023-11-29 05:25:19,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=437, PETRI_PLACES=80, PETRI_TRANSITIONS=69} [2023-11-29 05:25:19,470 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 23 predicate places. [2023-11-29 05:25:19,470 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 69 transitions, 437 flow [2023-11-29 05:25:19,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:19,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:25:19,470 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-29 05:25:19,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 05:25:19,471 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 05:25:19,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:19,471 INFO L85 PathProgramCache]: Analyzing trace with hash -176699395, now seen corresponding path program 1 times [2023-11-29 05:25:19,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:19,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48475560] [2023-11-29 05:25:19,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:19,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:19,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:25:19,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:19,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48475560] [2023-11-29 05:25:19,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48475560] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:19,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:19,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:25:19,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737132401] [2023-11-29 05:25:19,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:19,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:25:19,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:19,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:25:19,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:25:19,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2023-11-29 05:25:19,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 69 transitions, 437 flow. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:19,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:25:19,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2023-11-29 05:25:19,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:25:22,187 INFO L124 PetriNetUnfolderBase]: 12894/22507 cut-off events. [2023-11-29 05:25:22,187 INFO L125 PetriNetUnfolderBase]: For 39702/44901 co-relation queries the response was YES. [2023-11-29 05:25:22,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69722 conditions, 22507 events. 12894/22507 cut-off events. For 39702/44901 co-relation queries the response was YES. Maximal size of possible extension queue 1424. Compared 200905 event pairs, 4155 based on Foata normal form. 680/20959 useless extension candidates. Maximal degree in co-relation 69694. Up to 9143 conditions per place. [2023-11-29 05:25:22,308 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 61 selfloop transitions, 3 changer transitions 18/121 dead transitions. [2023-11-29 05:25:22,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 121 transitions, 846 flow [2023-11-29 05:25:22,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:25:22,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:25:22,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2023-11-29 05:25:22,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-29 05:25:22,310 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 196 transitions. [2023-11-29 05:25:22,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 196 transitions. [2023-11-29 05:25:22,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:25:22,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 196 transitions. [2023-11-29 05:25:22,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 32.666666666666664) internal successors, (196), 6 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-29 05:25:22,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 49.0) internal successors, (343), 7 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:22,311 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 49.0) internal successors, (343), 7 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:22,311 INFO L175 Difference]: Start difference. First operand has 80 places, 69 transitions, 437 flow. Second operand 6 states and 196 transitions. [2023-11-29 05:25:22,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 121 transitions, 846 flow [2023-11-29 05:25:22,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 121 transitions, 815 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-11-29 05:25:22,449 INFO L231 Difference]: Finished difference. Result has 86 places, 69 transitions, 420 flow [2023-11-29 05:25:22,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=420, PETRI_PLACES=86, PETRI_TRANSITIONS=69} [2023-11-29 05:25:22,450 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 29 predicate places. [2023-11-29 05:25:22,450 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 69 transitions, 420 flow [2023-11-29 05:25:22,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:22,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:25:22,451 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-29 05:25:22,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 05:25:22,451 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 05:25:22,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:22,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1195756189, now seen corresponding path program 2 times [2023-11-29 05:25:22,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:22,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333782421] [2023-11-29 05:25:22,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:22,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:22,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:25:22,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:22,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333782421] [2023-11-29 05:25:22,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333782421] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:22,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:22,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:25:22,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841325448] [2023-11-29 05:25:22,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:22,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:25:22,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:22,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:25:22,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:25:22,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2023-11-29 05:25:22,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 69 transitions, 420 flow. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:22,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:25:22,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2023-11-29 05:25:22,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:25:26,340 INFO L124 PetriNetUnfolderBase]: 19117/28541 cut-off events. [2023-11-29 05:25:26,340 INFO L125 PetriNetUnfolderBase]: For 58067/66516 co-relation queries the response was YES. [2023-11-29 05:25:26,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94617 conditions, 28541 events. 19117/28541 cut-off events. For 58067/66516 co-relation queries the response was YES. Maximal size of possible extension queue 1940. Compared 214224 event pairs, 1226 based on Foata normal form. 1182/28695 useless extension candidates. Maximal degree in co-relation 94586. Up to 10472 conditions per place. [2023-11-29 05:25:26,446 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 64 selfloop transitions, 18 changer transitions 12/120 dead transitions. [2023-11-29 05:25:26,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 120 transitions, 800 flow [2023-11-29 05:25:26,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:25:26,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:25:26,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 234 transitions. [2023-11-29 05:25:26,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6822157434402333 [2023-11-29 05:25:26,447 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 234 transitions. [2023-11-29 05:25:26,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 234 transitions. [2023-11-29 05:25:26,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:25:26,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 234 transitions. [2023-11-29 05:25:26,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 33.42857142857143) internal successors, (234), 7 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:26,449 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 49.0) internal successors, (392), 8 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:26,449 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 49.0) internal successors, (392), 8 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:26,449 INFO L175 Difference]: Start difference. First operand has 86 places, 69 transitions, 420 flow. Second operand 7 states and 234 transitions. [2023-11-29 05:25:26,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 120 transitions, 800 flow [2023-11-29 05:25:26,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 120 transitions, 775 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-11-29 05:25:26,760 INFO L231 Difference]: Finished difference. Result has 84 places, 69 transitions, 457 flow [2023-11-29 05:25:26,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=457, PETRI_PLACES=84, PETRI_TRANSITIONS=69} [2023-11-29 05:25:26,761 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 27 predicate places. [2023-11-29 05:25:26,761 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 69 transitions, 457 flow [2023-11-29 05:25:26,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:26,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:25:26,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:25:26,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:25:26,761 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 05:25:26,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:26,762 INFO L85 PathProgramCache]: Analyzing trace with hash 697139627, now seen corresponding path program 1 times [2023-11-29 05:25:26,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:26,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27021714] [2023-11-29 05:25:26,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:26,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:27,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:25:27,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:27,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27021714] [2023-11-29 05:25:27,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27021714] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:27,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:27,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:25:27,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681781394] [2023-11-29 05:25:27,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:27,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:25:27,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:27,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:25:27,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:25:27,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2023-11-29 05:25:27,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 69 transitions, 457 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:27,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:25:27,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2023-11-29 05:25:27,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:25:30,134 INFO L124 PetriNetUnfolderBase]: 16478/28538 cut-off events. [2023-11-29 05:25:30,134 INFO L125 PetriNetUnfolderBase]: For 70153/74848 co-relation queries the response was YES. [2023-11-29 05:25:30,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92339 conditions, 28538 events. 16478/28538 cut-off events. For 70153/74848 co-relation queries the response was YES. Maximal size of possible extension queue 2128. Compared 266400 event pairs, 3892 based on Foata normal form. 345/25499 useless extension candidates. Maximal degree in co-relation 92310. Up to 10589 conditions per place. [2023-11-29 05:25:30,278 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 53 selfloop transitions, 15 changer transitions 29/127 dead transitions. [2023-11-29 05:25:30,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 127 transitions, 911 flow [2023-11-29 05:25:30,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:25:30,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:25:30,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 210 transitions. [2023-11-29 05:25:30,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6122448979591837 [2023-11-29 05:25:30,279 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 210 transitions. [2023-11-29 05:25:30,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 210 transitions. [2023-11-29 05:25:30,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:25:30,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 210 transitions. [2023-11-29 05:25:30,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 30.0) internal successors, (210), 7 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-29 05:25:30,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 49.0) internal successors, (392), 8 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:30,282 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 49.0) internal successors, (392), 8 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:30,282 INFO L175 Difference]: Start difference. First operand has 84 places, 69 transitions, 457 flow. Second operand 7 states and 210 transitions. [2023-11-29 05:25:30,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 127 transitions, 911 flow [2023-11-29 05:25:31,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 127 transitions, 792 flow, removed 48 selfloop flow, removed 6 redundant places. [2023-11-29 05:25:31,229 INFO L231 Difference]: Finished difference. Result has 88 places, 73 transitions, 464 flow [2023-11-29 05:25:31,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=464, PETRI_PLACES=88, PETRI_TRANSITIONS=73} [2023-11-29 05:25:31,230 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 31 predicate places. [2023-11-29 05:25:31,230 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 73 transitions, 464 flow [2023-11-29 05:25:31,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:31,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:25:31,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:25:31,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 05:25:31,231 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 05:25:31,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:31,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1981214067, now seen corresponding path program 2 times [2023-11-29 05:25:31,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:31,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679907794] [2023-11-29 05:25:31,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:31,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:31,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:25:31,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:31,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679907794] [2023-11-29 05:25:31,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679907794] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:31,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:31,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:25:31,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016541042] [2023-11-29 05:25:31,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:31,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:25:31,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:31,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:25:31,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:25:31,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2023-11-29 05:25:31,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 73 transitions, 464 flow. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:31,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:25:31,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2023-11-29 05:25:31,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:25:33,667 INFO L124 PetriNetUnfolderBase]: 10150/19183 cut-off events. [2023-11-29 05:25:33,667 INFO L125 PetriNetUnfolderBase]: For 29070/31726 co-relation queries the response was YES. [2023-11-29 05:25:33,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54592 conditions, 19183 events. 10150/19183 cut-off events. For 29070/31726 co-relation queries the response was YES. Maximal size of possible extension queue 1558. Compared 187875 event pairs, 3225 based on Foata normal form. 471/17259 useless extension candidates. Maximal degree in co-relation 54561. Up to 8145 conditions per place. [2023-11-29 05:25:33,748 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 27 selfloop transitions, 1 changer transitions 48/111 dead transitions. [2023-11-29 05:25:33,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 111 transitions, 737 flow [2023-11-29 05:25:33,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:25:33,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:25:33,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 189 transitions. [2023-11-29 05:25:33,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2023-11-29 05:25:33,750 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 189 transitions. [2023-11-29 05:25:33,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 189 transitions. [2023-11-29 05:25:33,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:25:33,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 189 transitions. [2023-11-29 05:25:33,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:33,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 49.0) internal successors, (343), 7 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:33,752 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 49.0) internal successors, (343), 7 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:33,752 INFO L175 Difference]: Start difference. First operand has 88 places, 73 transitions, 464 flow. Second operand 6 states and 189 transitions. [2023-11-29 05:25:33,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 111 transitions, 737 flow [2023-11-29 05:25:34,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 111 transitions, 725 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-29 05:25:34,248 INFO L231 Difference]: Finished difference. Result has 90 places, 59 transitions, 335 flow [2023-11-29 05:25:34,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=90, PETRI_TRANSITIONS=59} [2023-11-29 05:25:34,249 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 33 predicate places. [2023-11-29 05:25:34,249 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 59 transitions, 335 flow [2023-11-29 05:25:34,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:34,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:25:34,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:25:34,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 05:25:34,250 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 05:25:34,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:34,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1350948501, now seen corresponding path program 3 times [2023-11-29 05:25:34,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:34,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895968684] [2023-11-29 05:25:34,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:34,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:35,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:25:35,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:35,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895968684] [2023-11-29 05:25:35,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895968684] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:35,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:35,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:25:35,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129161776] [2023-11-29 05:25:35,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:35,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:25:35,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:35,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:25:35,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:25:35,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 49 [2023-11-29 05:25:35,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 59 transitions, 335 flow. Second operand has 9 states, 9 states have (on average 25.0) internal successors, (225), 9 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:35,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:25:35,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 49 [2023-11-29 05:25:35,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:25:35,831 INFO L124 PetriNetUnfolderBase]: 2111/4131 cut-off events. [2023-11-29 05:25:35,831 INFO L125 PetriNetUnfolderBase]: For 5203/5783 co-relation queries the response was YES. [2023-11-29 05:25:35,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11242 conditions, 4131 events. 2111/4131 cut-off events. For 5203/5783 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 32534 event pairs, 472 based on Foata normal form. 58/3634 useless extension candidates. Maximal degree in co-relation 11210. Up to 930 conditions per place. [2023-11-29 05:25:35,848 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 32 selfloop transitions, 6 changer transitions 23/97 dead transitions. [2023-11-29 05:25:35,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 97 transitions, 569 flow [2023-11-29 05:25:35,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:25:35,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 05:25:35,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 291 transitions. [2023-11-29 05:25:35,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5938775510204082 [2023-11-29 05:25:35,850 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 291 transitions. [2023-11-29 05:25:35,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 291 transitions. [2023-11-29 05:25:35,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:25:35,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 291 transitions. [2023-11-29 05:25:35,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 29.1) internal successors, (291), 10 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:35,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 49.0) internal successors, (539), 11 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:35,853 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 49.0) internal successors, (539), 11 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:35,853 INFO L175 Difference]: Start difference. First operand has 90 places, 59 transitions, 335 flow. Second operand 10 states and 291 transitions. [2023-11-29 05:25:35,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 97 transitions, 569 flow [2023-11-29 05:25:35,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 97 transitions, 514 flow, removed 16 selfloop flow, removed 12 redundant places. [2023-11-29 05:25:35,900 INFO L231 Difference]: Finished difference. Result has 88 places, 59 transitions, 319 flow [2023-11-29 05:25:35,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=319, PETRI_PLACES=88, PETRI_TRANSITIONS=59} [2023-11-29 05:25:35,901 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 31 predicate places. [2023-11-29 05:25:35,901 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 59 transitions, 319 flow [2023-11-29 05:25:35,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 25.0) internal successors, (225), 9 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:25:35,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:25:35,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:25:35,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 05:25:35,902 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 05:25:35,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:35,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1289553119, now seen corresponding path program 4 times [2023-11-29 05:25:35,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:35,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036326400] [2023-11-29 05:25:35,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:35,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:25:35,944 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:25:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:25:36,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:25:36,026 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:25:36,027 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-29 05:25:36,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-29 05:25:36,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-29 05:25:36,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-29 05:25:36,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-29 05:25:36,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-29 05:25:36,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-29 05:25:36,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 05:25:36,031 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:25:36,037 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 05:25:36,037 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:25:36,100 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 05:25:36,102 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 05:25:36,103 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 05:25:36,104 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated [2023-11-29 05:25:36,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:25:36 BasicIcfg [2023-11-29 05:25:36,133 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:25:36,133 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:25:36,133 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:25:36,134 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:25:36,134 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:24:59" (3/4) ... [2023-11-29 05:25:36,135 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 05:25:36,166 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 05:25:36,166 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 05:25:36,167 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 05:25:36,168 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated [2023-11-29 05:25:36,236 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6044cd8b-1faa-498d-b60c-a9e363c64042/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 05:25:36,236 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:25:36,237 INFO L158 Benchmark]: Toolchain (without parser) took 38083.69ms. Allocated memory was 178.3MB in the beginning and 8.2GB in the end (delta: 8.0GB). Free memory was 141.4MB in the beginning and 6.3GB in the end (delta: -6.2GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2023-11-29 05:25:36,237 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:25:36,238 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.85ms. Allocated memory is still 178.3MB. Free memory was 140.8MB in the beginning and 116.2MB in the end (delta: 24.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 05:25:36,238 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.89ms. Allocated memory is still 178.3MB. Free memory was 116.2MB in the beginning and 113.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:25:36,238 INFO L158 Benchmark]: Boogie Preprocessor took 48.40ms. Allocated memory is still 178.3MB. Free memory was 113.6MB in the beginning and 109.9MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:25:36,239 INFO L158 Benchmark]: RCFGBuilder took 727.28ms. Allocated memory is still 178.3MB. Free memory was 109.9MB in the beginning and 118.7MB in the end (delta: -8.7MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. [2023-11-29 05:25:36,239 INFO L158 Benchmark]: TraceAbstraction took 36646.19ms. Allocated memory was 178.3MB in the beginning and 8.2GB in the end (delta: 8.0GB). Free memory was 117.8MB in the beginning and 6.4GB in the end (delta: -6.3GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2023-11-29 05:25:36,240 INFO L158 Benchmark]: Witness Printer took 103.29ms. Allocated memory is still 8.2GB. Free memory was 6.4GB in the beginning and 6.3GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 05:25:36,241 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.21ms. Allocated memory is still 117.4MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 496.85ms. Allocated memory is still 178.3MB. Free memory was 140.8MB in the beginning and 116.2MB in the end (delta: 24.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.89ms. Allocated memory is still 178.3MB. Free memory was 116.2MB in the beginning and 113.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.40ms. Allocated memory is still 178.3MB. Free memory was 113.6MB in the beginning and 109.9MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 727.28ms. Allocated memory is still 178.3MB. Free memory was 109.9MB in the beginning and 118.7MB in the end (delta: -8.7MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. * TraceAbstraction took 36646.19ms. Allocated memory was 178.3MB in the beginning and 8.2GB in the end (delta: 8.0GB). Free memory was 117.8MB in the beginning and 6.4GB in the end (delta: -6.3GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 103.29ms. Allocated memory is still 8.2GB. Free memory was 6.4GB in the beginning and 6.3GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~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 Unfinished Backtranslation: IdentifierExpression #t~pre13 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 Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L864] 0 pthread_t t525; [L865] FCALL, FORK 0 pthread_create(&t525, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t525={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L866] 0 pthread_t t526; [L867] FCALL, FORK 0 pthread_create(&t526, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t525={5:0}, t526={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L868] 0 pthread_t t527; [L869] FCALL, FORK 0 pthread_create(&t527, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t525={5:0}, t526={6:0}, t527={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L870] 0 pthread_t t528; [L871] FCALL, FORK 0 pthread_create(&t528, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t525={5:0}, t526={6:0}, t527={7:0}, t528={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L814] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L814] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, 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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 z$flush_delayed = weak$$choice2 [L826] 4 z$mem_tmp = z [L827] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L828] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L829] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L830] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L831] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L833] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = z [L835] 4 z = z$flush_delayed ? z$mem_tmp : z [L836] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L839] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 __unbuffered_p2_EAX = z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L843] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L844] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L845] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L846] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t525={5:0}, t526={6:0}, t527={7:0}, t528={3:0}, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L878] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L879] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L880] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L881] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t525={5:0}, t526={6:0}, t527={7:0}, t528={3:0}, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L884] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t525={5:0}, t526={6:0}, t527={7:0}, t528={3:0}, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 865]: 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: 867]: 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: 871]: 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: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 83 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 36.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 32.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 779 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 738 mSDsluCounter, 212 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 159 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1920 IncrementalHoareTripleChecker+Invalid, 1975 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 53 mSDtfsCounter, 1920 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=464occurred in iteration=11, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 371 NumberOfCodeBlocks, 371 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 321 ConstructedInterpolants, 0 QuantifiedInterpolants, 1866 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-29 05:25:36,273 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6044cd8b-1faa-498d-b60c-a9e363c64042/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