./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74618d57-27d9-4bc9-97b3-2f0f4bad3757/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74618d57-27d9-4bc9-97b3-2f0f4bad3757/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74618d57-27d9-4bc9-97b3-2f0f4bad3757/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74618d57-27d9-4bc9-97b3-2f0f4bad3757/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74618d57-27d9-4bc9-97b3-2f0f4bad3757/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74618d57-27d9-4bc9-97b3-2f0f4bad3757/bin/uautomizer-verify-zZY32mL2XJ --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 526111e98fa506d5405af18114114ae6aa9ce1a2e8442e7719052c05a249c119 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:44:37,741 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:44:37,854 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74618d57-27d9-4bc9-97b3-2f0f4bad3757/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-23 21:44:37,864 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:44:37,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:44:37,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:44:37,912 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:44:37,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:44:37,913 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 21:44:37,920 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 21:44:37,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:44:37,923 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:44:37,923 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 21:44:37,925 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 21:44:37,926 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 21:44:37,926 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:44:37,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 21:44:37,927 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:44:37,928 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:44:37,928 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:44:37,929 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:44:37,929 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 21:44:37,930 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:44:37,930 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 21:44:37,931 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:44:37,931 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 21:44:37,931 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:44:37,933 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:44:37,933 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 21:44:37,933 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:44:37,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:44:37,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:44:37,935 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:44:37,936 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:44:37,936 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 21:44:37,936 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 21:44:37,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 21:44:37,937 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:44:37,937 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 21:44:37,937 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 21:44:37,938 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 21:44:37,938 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:44:37,938 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_74618d57-27d9-4bc9-97b3-2f0f4bad3757/bin/uautomizer-verify-zZY32mL2XJ/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_74618d57-27d9-4bc9-97b3-2f0f4bad3757/bin/uautomizer-verify-zZY32mL2XJ 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 -> 526111e98fa506d5405af18114114ae6aa9ce1a2e8442e7719052c05a249c119 [2023-11-23 21:44:38,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:44:38,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:44:38,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:44:38,290 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:44:38,290 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:44:38,292 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74618d57-27d9-4bc9-97b3-2f0f4bad3757/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/pthread-wmm/mix031.opt.i [2023-11-23 21:44:41,395 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:44:41,704 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:44:41,704 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74618d57-27d9-4bc9-97b3-2f0f4bad3757/sv-benchmarks/c/pthread-wmm/mix031.opt.i [2023-11-23 21:44:41,741 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74618d57-27d9-4bc9-97b3-2f0f4bad3757/bin/uautomizer-verify-zZY32mL2XJ/data/fea1da278/10e9b95fd57140b39baf96a803d8061b/FLAG0c3463b40 [2023-11-23 21:44:41,757 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74618d57-27d9-4bc9-97b3-2f0f4bad3757/bin/uautomizer-verify-zZY32mL2XJ/data/fea1da278/10e9b95fd57140b39baf96a803d8061b [2023-11-23 21:44:41,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:44:41,761 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:44:41,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:44:41,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:44:41,769 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:44:41,770 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:44:41" (1/1) ... [2023-11-23 21:44:41,774 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5853afdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:44:41, skipping insertion in model container [2023-11-23 21:44:41,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:44:41" (1/1) ... [2023-11-23 21:44:41,858 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:44:42,101 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_74618d57-27d9-4bc9-97b3-2f0f4bad3757/sv-benchmarks/c/pthread-wmm/mix031.opt.i[987,1000] [2023-11-23 21:44:42,464 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:44:42,482 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:44:42,497 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_74618d57-27d9-4bc9-97b3-2f0f4bad3757/sv-benchmarks/c/pthread-wmm/mix031.opt.i[987,1000] [2023-11-23 21:44:42,557 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:44:42,601 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 21:44:42,602 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 21:44:42,610 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:44:42,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:44:42 WrapperNode [2023-11-23 21:44:42,612 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:44:42,613 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:44:42,613 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:44:42,614 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:44:42,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:44:42" (1/1) ... [2023-11-23 21:44:42,653 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:44:42" (1/1) ... [2023-11-23 21:44:42,698 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 122 [2023-11-23 21:44:42,698 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:44:42,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:44:42,700 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:44:42,700 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:44:42,717 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:44:42" (1/1) ... [2023-11-23 21:44:42,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:44:42" (1/1) ... [2023-11-23 21:44:42,737 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:44:42" (1/1) ... [2023-11-23 21:44:42,766 INFO L189 HeapSplitter]: Split 4 memory accesses to 3 slices as follows [2, 1, 1] [2023-11-23 21:44:42,767 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:44:42" (1/1) ... [2023-11-23 21:44:42,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:44:42" (1/1) ... [2023-11-23 21:44:42,797 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:44:42" (1/1) ... [2023-11-23 21:44:42,800 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:44:42" (1/1) ... [2023-11-23 21:44:42,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:44:42" (1/1) ... [2023-11-23 21:44:42,808 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:44:42" (1/1) ... [2023-11-23 21:44:42,819 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:44:42,820 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:44:42,820 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:44:42,820 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:44:42,821 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:44:42" (1/1) ... [2023-11-23 21:44:42,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:44:42,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74618d57-27d9-4bc9-97b3-2f0f4bad3757/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:44:42,859 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74618d57-27d9-4bc9-97b3-2f0f4bad3757/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:44:42,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74618d57-27d9-4bc9-97b3-2f0f4bad3757/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:44:42,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-23 21:44:42,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-23 21:44:42,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-23 21:44:42,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-23 21:44:42,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:44:42,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 21:44:42,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 21:44:42,905 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-23 21:44:42,906 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-23 21:44:42,906 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-23 21:44:42,906 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-23 21:44:42,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 21:44:42,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 21:44:42,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 21:44:42,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-23 21:44:42,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:44:42,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:44:42,912 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-23 21:44:43,137 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:44:43,140 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:44:43,470 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:44:43,805 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:44:43,805 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 21:44:43,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:44:43 BoogieIcfgContainer [2023-11-23 21:44:43,807 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:44:43,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:44:43,811 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:44:43,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:44:43,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:44:41" (1/3) ... [2023-11-23 21:44:43,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b36710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:44:43, skipping insertion in model container [2023-11-23 21:44:43,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:44:42" (2/3) ... [2023-11-23 21:44:43,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b36710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:44:43, skipping insertion in model container [2023-11-23 21:44:43,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:44:43" (3/3) ... [2023-11-23 21:44:43,820 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.opt.i [2023-11-23 21:44:43,830 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-23 21:44:43,842 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:44:43,842 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-23 21:44:43,842 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-23 21:44:43,898 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 21:44:43,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 34 transitions, 76 flow [2023-11-23 21:44:43,990 INFO L124 PetriNetUnfolderBase]: 1/32 cut-off events. [2023-11-23 21:44:43,990 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 21:44:43,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 32 events. 1/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 56 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2023-11-23 21:44:43,999 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 34 transitions, 76 flow [2023-11-23 21:44:44,003 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 32 transitions, 70 flow [2023-11-23 21:44:44,022 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:44:44,031 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;@1bd7ea70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:44:44,031 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-23 21:44:44,038 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-23 21:44:44,039 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2023-11-23 21:44:44,039 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 21:44:44,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:44:44,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-23 21:44:44,041 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 21:44:44,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:44,046 INFO L85 PathProgramCache]: Analyzing trace with hash 955921660, now seen corresponding path program 1 times [2023-11-23 21:44:44,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:44,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025406075] [2023-11-23 21:44:44,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:44,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:44,573 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-23 21:44:44,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:44,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025406075] [2023-11-23 21:44:44,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025406075] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:44:44,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:44:44,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:44:44,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468544675] [2023-11-23 21:44:44,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:44:44,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:44:44,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:44,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:44:44,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:44:44,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 34 [2023-11-23 21:44:44,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:44,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:44:44,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 34 [2023-11-23 21:44:44,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:44:44,771 INFO L124 PetriNetUnfolderBase]: 95/270 cut-off events. [2023-11-23 21:44:44,771 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 21:44:44,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 270 events. 95/270 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1481 event pairs, 14 based on Foata normal form. 12/274 useless extension candidates. Maximal degree in co-relation 446. Up to 136 conditions per place. [2023-11-23 21:44:44,777 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 17 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-11-23 21:44:44,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 122 flow [2023-11-23 21:44:44,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:44:44,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:44:44,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2023-11-23 21:44:44,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7647058823529411 [2023-11-23 21:44:44,792 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 78 transitions. [2023-11-23 21:44:44,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 78 transitions. [2023-11-23 21:44:44,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:44:44,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 78 transitions. [2023-11-23 21:44:44,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:44,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:44,802 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:44,804 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 70 flow. Second operand 3 states and 78 transitions. [2023-11-23 21:44:44,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 122 flow [2023-11-23 21:44:44,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:44:44,810 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 66 flow [2023-11-23 21:44:44,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2023-11-23 21:44:44,817 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2023-11-23 21:44:44,817 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 66 flow [2023-11-23 21:44:44,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:44,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:44:44,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:44:44,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 21:44:44,818 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 21:44:44,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:44,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1368935857, now seen corresponding path program 1 times [2023-11-23 21:44:44,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:44,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433549907] [2023-11-23 21:44:44,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:44,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:45,176 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-23 21:44:45,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:45,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433549907] [2023-11-23 21:44:45,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433549907] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:44:45,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:44:45,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:44:45,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551015352] [2023-11-23 21:44:45,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:44:45,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:44:45,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:45,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:44:45,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:44:45,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2023-11-23 21:44:45,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:45,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:44:45,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2023-11-23 21:44:45,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:44:45,658 INFO L124 PetriNetUnfolderBase]: 363/703 cut-off events. [2023-11-23 21:44:45,659 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-11-23 21:44:45,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1385 conditions, 703 events. 363/703 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3969 event pairs, 130 based on Foata normal form. 0/671 useless extension candidates. Maximal degree in co-relation 1375. Up to 395 conditions per place. [2023-11-23 21:44:45,673 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 23 selfloop transitions, 3 changer transitions 36/72 dead transitions. [2023-11-23 21:44:45,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 72 transitions, 290 flow [2023-11-23 21:44:45,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 21:44:45,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-23 21:44:45,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2023-11-23 21:44:45,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2023-11-23 21:44:45,681 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 160 transitions. [2023-11-23 21:44:45,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 160 transitions. [2023-11-23 21:44:45,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:44:45,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 160 transitions. [2023-11-23 21:44:45,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:45,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 34.0) internal successors, (306), 9 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:45,689 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 34.0) internal successors, (306), 9 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:45,692 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 66 flow. Second operand 8 states and 160 transitions. [2023-11-23 21:44:45,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 72 transitions, 290 flow [2023-11-23 21:44:45,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 72 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:44:45,699 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 95 flow [2023-11-23 21:44:45,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=95, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2023-11-23 21:44:45,701 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2023-11-23 21:44:45,702 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 95 flow [2023-11-23 21:44:45,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:45,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:44:45,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:44:45,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 21:44:45,711 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 21:44:45,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:45,712 INFO L85 PathProgramCache]: Analyzing trace with hash -881050799, now seen corresponding path program 1 times [2023-11-23 21:44:45,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:45,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535967793] [2023-11-23 21:44:45,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:45,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:45,951 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-23 21:44:45,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:45,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535967793] [2023-11-23 21:44:45,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535967793] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:44:45,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:44:45,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:44:45,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714052212] [2023-11-23 21:44:45,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:44:45,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:44:45,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:45,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:44:45,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:44:45,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2023-11-23 21:44:45,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 95 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:45,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:44:45,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2023-11-23 21:44:45,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:44:46,249 INFO L124 PetriNetUnfolderBase]: 249/503 cut-off events. [2023-11-23 21:44:46,249 INFO L125 PetriNetUnfolderBase]: For 340/340 co-relation queries the response was YES. [2023-11-23 21:44:46,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 503 events. 249/503 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2611 event pairs, 75 based on Foata normal form. 18/514 useless extension candidates. Maximal degree in co-relation 1233. Up to 281 conditions per place. [2023-11-23 21:44:46,255 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 22 selfloop transitions, 3 changer transitions 21/56 dead transitions. [2023-11-23 21:44:46,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 261 flow [2023-11-23 21:44:46,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:44:46,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-23 21:44:46,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2023-11-23 21:44:46,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5504201680672269 [2023-11-23 21:44:46,257 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 131 transitions. [2023-11-23 21:44:46,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 131 transitions. [2023-11-23 21:44:46,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:44:46,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 131 transitions. [2023-11-23 21:44:46,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 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-23 21:44:46,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 34.0) internal successors, (272), 8 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:46,261 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 34.0) internal successors, (272), 8 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:46,261 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 95 flow. Second operand 7 states and 131 transitions. [2023-11-23 21:44:46,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 261 flow [2023-11-23 21:44:46,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 244 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-11-23 21:44:46,266 INFO L231 Difference]: Finished difference. Result has 48 places, 30 transitions, 105 flow [2023-11-23 21:44:46,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=105, PETRI_PLACES=48, PETRI_TRANSITIONS=30} [2023-11-23 21:44:46,268 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2023-11-23 21:44:46,268 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 30 transitions, 105 flow [2023-11-23 21:44:46,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:46,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:44:46,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:44:46,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 21:44:46,269 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 21:44:46,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:46,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1832411406, now seen corresponding path program 1 times [2023-11-23 21:44:46,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:46,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110005092] [2023-11-23 21:44:46,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:46,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:46,482 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-23 21:44:46,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:46,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110005092] [2023-11-23 21:44:46,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110005092] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:44:46,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:44:46,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:44:46,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651443550] [2023-11-23 21:44:46,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:44:46,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:44:46,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:46,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:44:46,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:44:46,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2023-11-23 21:44:46,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 30 transitions, 105 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:46,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:44:46,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2023-11-23 21:44:46,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:44:46,693 INFO L124 PetriNetUnfolderBase]: 152/359 cut-off events. [2023-11-23 21:44:46,693 INFO L125 PetriNetUnfolderBase]: For 307/308 co-relation queries the response was YES. [2023-11-23 21:44:46,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 359 events. 152/359 cut-off events. For 307/308 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1899 event pairs, 61 based on Foata normal form. 12/353 useless extension candidates. Maximal degree in co-relation 836. Up to 200 conditions per place. [2023-11-23 21:44:46,697 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 22 selfloop transitions, 3 changer transitions 17/55 dead transitions. [2023-11-23 21:44:46,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 55 transitions, 269 flow [2023-11-23 21:44:46,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:44:46,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-23 21:44:46,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2023-11-23 21:44:46,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.592436974789916 [2023-11-23 21:44:46,699 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 141 transitions. [2023-11-23 21:44:46,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 141 transitions. [2023-11-23 21:44:46,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:44:46,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 141 transitions. [2023-11-23 21:44:46,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:46,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 34.0) internal successors, (272), 8 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:46,703 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 34.0) internal successors, (272), 8 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:46,703 INFO L175 Difference]: Start difference. First operand has 48 places, 30 transitions, 105 flow. Second operand 7 states and 141 transitions. [2023-11-23 21:44:46,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 55 transitions, 269 flow [2023-11-23 21:44:46,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 239 flow, removed 12 selfloop flow, removed 6 redundant places. [2023-11-23 21:44:46,707 INFO L231 Difference]: Finished difference. Result has 49 places, 30 transitions, 106 flow [2023-11-23 21:44:46,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=106, PETRI_PLACES=49, PETRI_TRANSITIONS=30} [2023-11-23 21:44:46,708 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2023-11-23 21:44:46,709 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 30 transitions, 106 flow [2023-11-23 21:44:46,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:46,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:44:46,709 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:44:46,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 21:44:46,710 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 21:44:46,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:46,711 INFO L85 PathProgramCache]: Analyzing trace with hash 449117872, now seen corresponding path program 1 times [2023-11-23 21:44:46,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:46,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361723012] [2023-11-23 21:44:46,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:46,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:46,870 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-23 21:44:46,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:46,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361723012] [2023-11-23 21:44:46,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361723012] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:44:46,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:44:46,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:44:46,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968551597] [2023-11-23 21:44:46,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:44:46,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 21:44:46,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:46,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 21:44:46,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:44:46,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34 [2023-11-23 21:44:46,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 30 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:46,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:44:46,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34 [2023-11-23 21:44:46,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:44:47,053 INFO L124 PetriNetUnfolderBase]: 147/336 cut-off events. [2023-11-23 21:44:47,054 INFO L125 PetriNetUnfolderBase]: For 148/150 co-relation queries the response was YES. [2023-11-23 21:44:47,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 336 events. 147/336 cut-off events. For 148/150 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1518 event pairs, 26 based on Foata normal form. 23/348 useless extension candidates. Maximal degree in co-relation 745. Up to 137 conditions per place. [2023-11-23 21:44:47,059 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 28 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2023-11-23 21:44:47,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 204 flow [2023-11-23 21:44:47,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 21:44:47,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-23 21:44:47,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2023-11-23 21:44:47,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6911764705882353 [2023-11-23 21:44:47,061 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 94 transitions. [2023-11-23 21:44:47,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 94 transitions. [2023-11-23 21:44:47,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:44:47,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 94 transitions. [2023-11-23 21:44:47,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:47,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:47,064 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:47,064 INFO L175 Difference]: Start difference. First operand has 49 places, 30 transitions, 106 flow. Second operand 4 states and 94 transitions. [2023-11-23 21:44:47,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 204 flow [2023-11-23 21:44:47,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 46 transitions, 184 flow, removed 7 selfloop flow, removed 8 redundant places. [2023-11-23 21:44:47,070 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 116 flow [2023-11-23 21:44:47,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2023-11-23 21:44:47,074 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2023-11-23 21:44:47,074 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 116 flow [2023-11-23 21:44:47,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:47,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:44:47,075 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] [2023-11-23 21:44:47,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 21:44:47,076 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 21:44:47,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:47,077 INFO L85 PathProgramCache]: Analyzing trace with hash -81865837, now seen corresponding path program 1 times [2023-11-23 21:44:47,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:47,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387238389] [2023-11-23 21:44:47,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:47,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:47,391 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-23 21:44:47,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:47,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387238389] [2023-11-23 21:44:47,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387238389] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:44:47,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:44:47,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:44:47,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171673188] [2023-11-23 21:44:47,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:44:47,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:44:47,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:47,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:44:47,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:44:47,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34 [2023-11-23 21:44:47,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 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-23 21:44:47,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:44:47,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34 [2023-11-23 21:44:47,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:44:47,536 INFO L124 PetriNetUnfolderBase]: 103/240 cut-off events. [2023-11-23 21:44:47,537 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2023-11-23 21:44:47,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 240 events. 103/240 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 920 event pairs, 26 based on Foata normal form. 16/245 useless extension candidates. Maximal degree in co-relation 581. Up to 98 conditions per place. [2023-11-23 21:44:47,539 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 25 selfloop transitions, 6 changer transitions 0/45 dead transitions. [2023-11-23 21:44:47,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 207 flow [2023-11-23 21:44:47,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:44:47,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-23 21:44:47,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2023-11-23 21:44:47,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6352941176470588 [2023-11-23 21:44:47,542 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 108 transitions. [2023-11-23 21:44:47,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 108 transitions. [2023-11-23 21:44:47,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:44:47,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 108 transitions. [2023-11-23 21:44:47,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:47,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:47,544 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:47,544 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 116 flow. Second operand 5 states and 108 transitions. [2023-11-23 21:44:47,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 207 flow [2023-11-23 21:44:47,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 192 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-23 21:44:47,548 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 131 flow [2023-11-23 21:44:47,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2023-11-23 21:44:47,552 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2023-11-23 21:44:47,552 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 131 flow [2023-11-23 21:44:47,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 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-23 21:44:47,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:44:47,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:44:47,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 21:44:47,553 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 21:44:47,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:47,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1876770449, now seen corresponding path program 1 times [2023-11-23 21:44:47,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:47,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521725846] [2023-11-23 21:44:47,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:47,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:47,893 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-23 21:44:47,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:47,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521725846] [2023-11-23 21:44:47,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521725846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:44:47,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:44:47,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 21:44:47,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357677880] [2023-11-23 21:44:47,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:44:47,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:44:47,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:47,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:44:47,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:44:47,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2023-11-23 21:44:47,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 131 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:47,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:44:47,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2023-11-23 21:44:47,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:44:48,145 INFO L124 PetriNetUnfolderBase]: 159/397 cut-off events. [2023-11-23 21:44:48,145 INFO L125 PetriNetUnfolderBase]: For 281/306 co-relation queries the response was YES. [2023-11-23 21:44:48,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 397 events. 159/397 cut-off events. For 281/306 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1868 event pairs, 34 based on Foata normal form. 9/380 useless extension candidates. Maximal degree in co-relation 941. Up to 185 conditions per place. [2023-11-23 21:44:48,149 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 30 selfloop transitions, 9 changer transitions 9/61 dead transitions. [2023-11-23 21:44:48,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 61 transitions, 297 flow [2023-11-23 21:44:48,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:44:48,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-23 21:44:48,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2023-11-23 21:44:48,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5252100840336135 [2023-11-23 21:44:48,151 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 125 transitions. [2023-11-23 21:44:48,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 125 transitions. [2023-11-23 21:44:48,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:44:48,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 125 transitions. [2023-11-23 21:44:48,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:48,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 34.0) internal successors, (272), 8 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:48,153 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 34.0) internal successors, (272), 8 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:48,153 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 131 flow. Second operand 7 states and 125 transitions. [2023-11-23 21:44:48,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 61 transitions, 297 flow [2023-11-23 21:44:48,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 288 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-23 21:44:48,157 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 178 flow [2023-11-23 21:44:48,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=178, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2023-11-23 21:44:48,158 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2023-11-23 21:44:48,158 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 178 flow [2023-11-23 21:44:48,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:48,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:44:48,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:44:48,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 21:44:48,159 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 21:44:48,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:48,160 INFO L85 PathProgramCache]: Analyzing trace with hash -605552461, now seen corresponding path program 2 times [2023-11-23 21:44:48,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:48,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185393151] [2023-11-23 21:44:48,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:48,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:48,532 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-23 21:44:48,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:48,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185393151] [2023-11-23 21:44:48,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185393151] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:44:48,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:44:48,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 21:44:48,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499760213] [2023-11-23 21:44:48,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:44:48,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 21:44:48,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:48,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 21:44:48,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:44:48,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2023-11-23 21:44:48,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 178 flow. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:48,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:44:48,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2023-11-23 21:44:48,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:44:48,800 INFO L124 PetriNetUnfolderBase]: 199/500 cut-off events. [2023-11-23 21:44:48,800 INFO L125 PetriNetUnfolderBase]: For 396/432 co-relation queries the response was YES. [2023-11-23 21:44:48,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1321 conditions, 500 events. 199/500 cut-off events. For 396/432 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2657 event pairs, 59 based on Foata normal form. 10/468 useless extension candidates. Maximal degree in co-relation 1300. Up to 171 conditions per place. [2023-11-23 21:44:48,804 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 20 selfloop transitions, 3 changer transitions 27/63 dead transitions. [2023-11-23 21:44:48,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 63 transitions, 344 flow [2023-11-23 21:44:48,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 21:44:48,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-23 21:44:48,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2023-11-23 21:44:48,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5073529411764706 [2023-11-23 21:44:48,806 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 138 transitions. [2023-11-23 21:44:48,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 138 transitions. [2023-11-23 21:44:48,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:44:48,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 138 transitions. [2023-11-23 21:44:48,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 17.25) internal successors, (138), 8 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:48,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 34.0) internal successors, (306), 9 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:48,808 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 34.0) internal successors, (306), 9 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:48,808 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 178 flow. Second operand 8 states and 138 transitions. [2023-11-23 21:44:48,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 63 transitions, 344 flow [2023-11-23 21:44:48,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 63 transitions, 338 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-23 21:44:48,812 INFO L231 Difference]: Finished difference. Result has 59 places, 32 transitions, 141 flow [2023-11-23 21:44:48,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=141, PETRI_PLACES=59, PETRI_TRANSITIONS=32} [2023-11-23 21:44:48,813 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 21 predicate places. [2023-11-23 21:44:48,813 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 32 transitions, 141 flow [2023-11-23 21:44:48,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:48,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:44:48,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:44:48,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 21:44:48,814 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 21:44:48,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:48,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1292579191, now seen corresponding path program 3 times [2023-11-23 21:44:48,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:48,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138771622] [2023-11-23 21:44:48,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:48,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:44:49,358 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-23 21:44:49,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:44:49,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138771622] [2023-11-23 21:44:49,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138771622] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:44:49,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:44:49,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 21:44:49,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788004663] [2023-11-23 21:44:49,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:44:49,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 21:44:49,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:44:49,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 21:44:49,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:44:49,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2023-11-23 21:44:49,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 32 transitions, 141 flow. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:49,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:44:49,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2023-11-23 21:44:49,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:44:49,625 INFO L124 PetriNetUnfolderBase]: 90/258 cut-off events. [2023-11-23 21:44:49,625 INFO L125 PetriNetUnfolderBase]: For 178/182 co-relation queries the response was YES. [2023-11-23 21:44:49,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 685 conditions, 258 events. 90/258 cut-off events. For 178/182 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1095 event pairs, 29 based on Foata normal form. 5/242 useless extension candidates. Maximal degree in co-relation 661. Up to 83 conditions per place. [2023-11-23 21:44:49,628 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 17 selfloop transitions, 4 changer transitions 19/53 dead transitions. [2023-11-23 21:44:49,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 53 transitions, 281 flow [2023-11-23 21:44:49,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 21:44:49,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-23 21:44:49,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2023-11-23 21:44:49,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48366013071895425 [2023-11-23 21:44:49,630 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 148 transitions. [2023-11-23 21:44:49,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 148 transitions. [2023-11-23 21:44:49,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:44:49,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 148 transitions. [2023-11-23 21:44:49,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:49,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 34.0) internal successors, (340), 10 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:49,633 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 34.0) internal successors, (340), 10 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:49,633 INFO L175 Difference]: Start difference. First operand has 59 places, 32 transitions, 141 flow. Second operand 9 states and 148 transitions. [2023-11-23 21:44:49,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 53 transitions, 281 flow [2023-11-23 21:44:49,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 53 transitions, 244 flow, removed 13 selfloop flow, removed 9 redundant places. [2023-11-23 21:44:49,636 INFO L231 Difference]: Finished difference. Result has 58 places, 31 transitions, 134 flow [2023-11-23 21:44:49,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=134, PETRI_PLACES=58, PETRI_TRANSITIONS=31} [2023-11-23 21:44:49,637 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2023-11-23 21:44:49,638 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 31 transitions, 134 flow [2023-11-23 21:44:49,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:44:49,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:44:49,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:44:49,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 21:44:49,639 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 21:44:49,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:44:49,639 INFO L85 PathProgramCache]: Analyzing trace with hash -551494859, now seen corresponding path program 4 times [2023-11-23 21:44:49,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:44:49,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314052662] [2023-11-23 21:44:49,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:44:49,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:44:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:44:49,695 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 21:44:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:44:49,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 21:44:49,776 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 21:44:49,777 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-23 21:44:49,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-23 21:44:49,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-23 21:44:49,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-23 21:44:49,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-23 21:44:49,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 21:44:49,780 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-11-23 21:44:49,787 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-23 21:44:49,787 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 21:44:49,830 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-23 21:44:49,832 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-23 21:44:49,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:44:49 BasicIcfg [2023-11-23 21:44:49,856 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 21:44:49,857 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 21:44:49,857 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 21:44:49,857 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 21:44:49,858 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:44:43" (3/4) ... [2023-11-23 21:44:49,859 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-23 21:44:49,882 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-23 21:44:49,883 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-23 21:44:49,965 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74618d57-27d9-4bc9-97b3-2f0f4bad3757/bin/uautomizer-verify-zZY32mL2XJ/witness.graphml [2023-11-23 21:44:49,965 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 21:44:49,968 INFO L158 Benchmark]: Toolchain (without parser) took 8204.34ms. Allocated memory was 161.5MB in the beginning and 272.6MB in the end (delta: 111.1MB). Free memory was 118.8MB in the beginning and 139.2MB in the end (delta: -20.4MB). Peak memory consumption was 91.9MB. Max. memory is 16.1GB. [2023-11-23 21:44:49,968 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 161.5MB. Free memory is still 133.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 21:44:49,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 849.23ms. Allocated memory is still 161.5MB. Free memory was 118.8MB in the beginning and 95.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-23 21:44:49,969 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.68ms. Allocated memory is still 161.5MB. Free memory was 95.7MB in the beginning and 93.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 21:44:49,969 INFO L158 Benchmark]: Boogie Preprocessor took 119.45ms. Allocated memory is still 161.5MB. Free memory was 93.0MB in the beginning and 90.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 21:44:49,970 INFO L158 Benchmark]: RCFGBuilder took 987.62ms. Allocated memory was 161.5MB in the beginning and 226.5MB in the end (delta: 65.0MB). Free memory was 90.0MB in the beginning and 182.2MB in the end (delta: -92.2MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. [2023-11-23 21:44:49,970 INFO L158 Benchmark]: TraceAbstraction took 6045.65ms. Allocated memory was 226.5MB in the beginning and 272.6MB in the end (delta: 46.1MB). Free memory was 182.2MB in the beginning and 148.6MB in the end (delta: 33.6MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. [2023-11-23 21:44:49,971 INFO L158 Benchmark]: Witness Printer took 108.15ms. Allocated memory is still 272.6MB. Free memory was 148.6MB in the beginning and 139.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-23 21:44:49,973 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.33ms. Allocated memory is still 161.5MB. Free memory is still 133.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 849.23ms. Allocated memory is still 161.5MB. Free memory was 118.8MB in the beginning and 95.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.68ms. Allocated memory is still 161.5MB. Free memory was 95.7MB in the beginning and 93.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 119.45ms. Allocated memory is still 161.5MB. Free memory was 93.0MB in the beginning and 90.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 987.62ms. Allocated memory was 161.5MB in the beginning and 226.5MB in the end (delta: 65.0MB). Free memory was 90.0MB in the beginning and 182.2MB in the end (delta: -92.2MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6045.65ms. Allocated memory was 226.5MB in the beginning and 272.6MB in the end (delta: 46.1MB). Free memory was 182.2MB in the beginning and 148.6MB in the end (delta: 33.6MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. * Witness Printer took 108.15ms. Allocated memory is still 272.6MB. Free memory was 148.6MB in the beginning and 139.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff1_thd0; [L732] 0 _Bool y$r_buff1_thd1; [L733] 0 _Bool y$r_buff1_thd2; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L823] 0 pthread_t t835; [L824] FCALL, FORK 0 pthread_create(&t835, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t835={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t836; [L826] FCALL, FORK 0 pthread_create(&t836, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t835={5:0}, t836={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L781] 2 y$w_buff1 = y$w_buff0 [L782] 2 y$w_buff0 = 1 [L783] 2 y$w_buff1_used = y$w_buff0_used [L784] 2 y$w_buff0_used = (_Bool)1 [L785] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L785] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L786] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L787] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L788] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L789] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L792] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L795] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L798] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 y$flush_delayed = weak$$choice2 [L759] 1 y$mem_tmp = y [L760] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L761] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L762] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L763] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L764] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L766] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EBX = y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L801] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L802] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L803] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L804] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L805] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L828] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t835={5:0}, t836={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L830] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L830] RET 0 assume_abort_if_not(main$tmp_guard0) [L832] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L836] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t835={5:0}, t836={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L839] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t835={5:0}, t836={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L841] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L19] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: 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: 824]: 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: 826]: 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 5 procedures, 55 locations, 5 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: 5.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 275 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 261 mSDsluCounter, 176 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 141 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 771 IncrementalHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 35 mSDtfsCounter, 771 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=7, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 197 NumberOfCodeBlocks, 197 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 1034 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-23 21:44:50,025 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74618d57-27d9-4bc9-97b3-2f0f4bad3757/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE