./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix040.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1762a9-d9f9-4f71-aba7-fed80ca3a526/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1762a9-d9f9-4f71-aba7-fed80ca3a526/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1762a9-d9f9-4f71-aba7-fed80ca3a526/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1762a9-d9f9-4f71-aba7-fed80ca3a526/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix040.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1762a9-d9f9-4f71-aba7-fed80ca3a526/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1762a9-d9f9-4f71-aba7-fed80ca3a526/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 9adb0e975425d9a1b173bce1a766592f39d0541cd50cefd6e228e1140c2f9f3e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:16:56,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:16:56,727 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1762a9-d9f9-4f71-aba7-fed80ca3a526/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:16:56,744 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:16:56,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:16:56,795 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:16:56,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:16:56,797 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:16:56,798 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:16:56,804 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:16:56,805 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:16:56,805 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:16:56,806 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:16:56,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:16:56,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:16:56,808 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:16:56,808 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:16:56,809 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:16:56,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:16:56,809 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:16:56,810 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:16:56,811 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:16:56,811 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:16:56,812 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:16:56,812 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:16:56,813 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:16:56,814 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:16:56,814 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:16:56,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:16:56,816 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:16:56,817 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:16:56,817 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:16:56,818 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:16:56,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:16:56,818 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:16:56,819 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:16:56,819 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:16:56,819 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:16:56,820 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:16:56,820 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_5e1762a9-d9f9-4f71-aba7-fed80ca3a526/bin/uautomizer-verify-WvqO1wxjHP/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_5e1762a9-d9f9-4f71-aba7-fed80ca3a526/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 9adb0e975425d9a1b173bce1a766592f39d0541cd50cefd6e228e1140c2f9f3e [2023-11-06 22:16:57,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:16:57,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:16:57,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:16:57,196 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:16:57,197 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:16:57,199 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1762a9-d9f9-4f71-aba7-fed80ca3a526/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix040.opt.i [2023-11-06 22:17:00,628 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:17:00,976 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:17:00,977 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1762a9-d9f9-4f71-aba7-fed80ca3a526/sv-benchmarks/c/pthread-wmm/mix040.opt.i [2023-11-06 22:17:00,998 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1762a9-d9f9-4f71-aba7-fed80ca3a526/bin/uautomizer-verify-WvqO1wxjHP/data/8984930fb/8f70bdddc9ca4d9b9584ddb96cb502c5/FLAGb519ae94d [2023-11-06 22:17:01,017 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1762a9-d9f9-4f71-aba7-fed80ca3a526/bin/uautomizer-verify-WvqO1wxjHP/data/8984930fb/8f70bdddc9ca4d9b9584ddb96cb502c5 [2023-11-06 22:17:01,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:17:01,023 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:17:01,025 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:17:01,025 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:17:01,032 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:17:01,033 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:17:01" (1/1) ... [2023-11-06 22:17:01,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1419cf7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:01, skipping insertion in model container [2023-11-06 22:17:01,035 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:17:01" (1/1) ... [2023-11-06 22:17:01,096 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:17:01,308 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_5e1762a9-d9f9-4f71-aba7-fed80ca3a526/sv-benchmarks/c/pthread-wmm/mix040.opt.i[944,957] [2023-11-06 22:17:01,588 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:17:01,611 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:17:01,632 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_5e1762a9-d9f9-4f71-aba7-fed80ca3a526/sv-benchmarks/c/pthread-wmm/mix040.opt.i[944,957] [2023-11-06 22:17:01,728 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:17:01,778 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:17:01,778 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:17:01,785 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:17:01,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:01 WrapperNode [2023-11-06 22:17:01,786 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:17:01,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:17:01,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:17:01,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:17:01,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:01" (1/1) ... [2023-11-06 22:17:01,835 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:01" (1/1) ... [2023-11-06 22:17:01,874 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2023-11-06 22:17:01,875 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:17:01,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:17:01,876 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:17:01,876 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:17:01,889 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:01" (1/1) ... [2023-11-06 22:17:01,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:01" (1/1) ... [2023-11-06 22:17:01,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:01" (1/1) ... [2023-11-06 22:17:01,896 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:01" (1/1) ... [2023-11-06 22:17:01,910 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:01" (1/1) ... [2023-11-06 22:17:01,913 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:01" (1/1) ... [2023-11-06 22:17:01,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:01" (1/1) ... [2023-11-06 22:17:01,918 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:01" (1/1) ... [2023-11-06 22:17:01,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:17:01,924 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:17:01,924 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:17:01,925 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:17:01,926 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:01" (1/1) ... [2023-11-06 22:17:01,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:17:01,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1762a9-d9f9-4f71-aba7-fed80ca3a526/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:17:01,992 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1762a9-d9f9-4f71-aba7-fed80ca3a526/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:17:02,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1762a9-d9f9-4f71-aba7-fed80ca3a526/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:17:02,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:17:02,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:17:02,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:17:02,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:17:02,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:17:02,049 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:17:02,050 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:17:02,050 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:17:02,050 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:17:02,050 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:17:02,050 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:17:02,051 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 22:17:02,051 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 22:17:02,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:17:02,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:17:02,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:17:02,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:17:02,054 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:17:02,227 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:17:02,229 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:17:02,670 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:17:02,886 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:17:02,886 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:17:02,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:17:02 BoogieIcfgContainer [2023-11-06 22:17:02,889 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:17:02,892 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:17:02,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:17:02,896 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:17:02,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:17:01" (1/3) ... [2023-11-06 22:17:02,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf249c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:17:02, skipping insertion in model container [2023-11-06 22:17:02,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:01" (2/3) ... [2023-11-06 22:17:02,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf249c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:17:02, skipping insertion in model container [2023-11-06 22:17:02,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:17:02" (3/3) ... [2023-11-06 22:17:02,905 INFO L112 eAbstractionObserver]: Analyzing ICFG mix040.opt.i [2023-11-06 22:17:02,919 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 22:17:02,933 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:17:02,934 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-06 22:17:02,934 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:17:03,025 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:17:03,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 280 flow [2023-11-06 22:17:03,166 INFO L124 PetriNetUnfolderBase]: 2/128 cut-off events. [2023-11-06 22:17:03,167 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:17:03,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2023-11-06 22:17:03,175 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 280 flow [2023-11-06 22:17:03,187 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2023-11-06 22:17:03,192 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:17:03,214 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2023-11-06 22:17:03,218 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2023-11-06 22:17:03,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2023-11-06 22:17:03,271 INFO L124 PetriNetUnfolderBase]: 2/128 cut-off events. [2023-11-06 22:17:03,272 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:17:03,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2023-11-06 22:17:03,278 INFO L119 LiptonReduction]: Number of co-enabled transitions 3040 [2023-11-06 22:17:09,061 INFO L134 LiptonReduction]: Checked pairs total: 7526 [2023-11-06 22:17:09,061 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-11-06 22:17:09,079 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:17:09,087 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=LoopsAndPotentialCycles, 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;@336478ad, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:17:09,087 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-06 22:17:09,095 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:17:09,095 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2023-11-06 22:17:09,095 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:17:09,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:09,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:09,097 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:17:09,103 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:09,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1868497921, now seen corresponding path program 1 times [2023-11-06 22:17:09,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:09,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198614015] [2023-11-06 22:17:09,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:09,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:09,752 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-06 22:17:09,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:09,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198614015] [2023-11-06 22:17:09,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198614015] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:09,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:09,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:17:09,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884116199] [2023-11-06 22:17:09,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:09,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:17:09,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:09,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:17:09,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:17:09,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 244 [2023-11-06 22:17:09,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:09,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:09,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 244 [2023-11-06 22:17:09,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:10,711 INFO L124 PetriNetUnfolderBase]: 2891/4507 cut-off events. [2023-11-06 22:17:10,713 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-06 22:17:10,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8607 conditions, 4507 events. 2891/4507 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 26764 event pairs, 668 based on Foata normal form. 144/4359 useless extension candidates. Maximal degree in co-relation 8595. Up to 2980 conditions per place. [2023-11-06 22:17:10,764 INFO L140 encePairwiseOnDemand]: 240/244 looper letters, 31 selfloop transitions, 2 changer transitions 4/41 dead transitions. [2023-11-06 22:17:10,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 168 flow [2023-11-06 22:17:10,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:17:10,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:17:10,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2023-11-06 22:17:10,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5423497267759563 [2023-11-06 22:17:10,790 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2023-11-06 22:17:10,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2023-11-06 22:17:10,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:10,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2023-11-06 22:17:10,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:10,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:10,815 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:10,817 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 397 transitions. [2023-11-06 22:17:10,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 168 flow [2023-11-06 22:17:10,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 164 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:17:10,827 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 64 flow [2023-11-06 22:17:10,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2023-11-06 22:17:10,834 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-11-06 22:17:10,835 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 64 flow [2023-11-06 22:17:10,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:10,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:10,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:10,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:17:10,837 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:17:10,849 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:10,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1648375077, now seen corresponding path program 1 times [2023-11-06 22:17:10,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:10,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583550053] [2023-11-06 22:17:10,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:10,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:11,284 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-06 22:17:11,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:11,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583550053] [2023-11-06 22:17:11,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583550053] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:11,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:11,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:17:11,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850030544] [2023-11-06 22:17:11,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:11,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:17:11,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:11,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:17:11,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:17:11,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 244 [2023-11-06 22:17:11,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:11,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:11,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 244 [2023-11-06 22:17:11,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:13,688 INFO L124 PetriNetUnfolderBase]: 10895/15040 cut-off events. [2023-11-06 22:17:13,689 INFO L125 PetriNetUnfolderBase]: For 554/554 co-relation queries the response was YES. [2023-11-06 22:17:13,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30938 conditions, 15040 events. 10895/15040 cut-off events. For 554/554 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 78579 event pairs, 3419 based on Foata normal form. 652/15692 useless extension candidates. Maximal degree in co-relation 30928. Up to 7839 conditions per place. [2023-11-06 22:17:13,821 INFO L140 encePairwiseOnDemand]: 234/244 looper letters, 39 selfloop transitions, 8 changer transitions 29/76 dead transitions. [2023-11-06 22:17:13,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 76 transitions, 326 flow [2023-11-06 22:17:13,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:17:13,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:17:13,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 613 transitions. [2023-11-06 22:17:13,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5024590163934426 [2023-11-06 22:17:13,826 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 613 transitions. [2023-11-06 22:17:13,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 613 transitions. [2023-11-06 22:17:13,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:13,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 613 transitions. [2023-11-06 22:17:13,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:13,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:13,837 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:13,837 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 64 flow. Second operand 5 states and 613 transitions. [2023-11-06 22:17:13,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 76 transitions, 326 flow [2023-11-06 22:17:13,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 76 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:17:13,863 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 140 flow [2023-11-06 22:17:13,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=140, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-11-06 22:17:13,872 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-11-06 22:17:13,873 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 140 flow [2023-11-06 22:17:13,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:13,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:13,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:13,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:17:13,875 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:17:13,878 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:13,878 INFO L85 PathProgramCache]: Analyzing trace with hash -440025058, now seen corresponding path program 1 times [2023-11-06 22:17:13,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:13,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348053690] [2023-11-06 22:17:13,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:13,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:14,219 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-06 22:17:14,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:14,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348053690] [2023-11-06 22:17:14,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348053690] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:14,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:14,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:17:14,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707130890] [2023-11-06 22:17:14,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:14,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:17:14,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:14,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:17:14,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:17:14,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 244 [2023-11-06 22:17:14,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:14,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:14,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 244 [2023-11-06 22:17:14,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:16,682 INFO L124 PetriNetUnfolderBase]: 9965/13882 cut-off events. [2023-11-06 22:17:16,682 INFO L125 PetriNetUnfolderBase]: For 10946/10946 co-relation queries the response was YES. [2023-11-06 22:17:16,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40358 conditions, 13882 events. 9965/13882 cut-off events. For 10946/10946 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 74696 event pairs, 919 based on Foata normal form. 608/14490 useless extension candidates. Maximal degree in co-relation 40344. Up to 6985 conditions per place. [2023-11-06 22:17:16,814 INFO L140 encePairwiseOnDemand]: 234/244 looper letters, 56 selfloop transitions, 12 changer transitions 45/113 dead transitions. [2023-11-06 22:17:16,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 113 transitions, 686 flow [2023-11-06 22:17:16,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:17:16,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:17:16,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 854 transitions. [2023-11-06 22:17:16,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-06 22:17:16,820 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 854 transitions. [2023-11-06 22:17:16,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 854 transitions. [2023-11-06 22:17:16,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:16,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 854 transitions. [2023-11-06 22:17:16,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:16,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:16,832 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:16,832 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 140 flow. Second operand 7 states and 854 transitions. [2023-11-06 22:17:16,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 113 transitions, 686 flow [2023-11-06 22:17:16,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 113 transitions, 632 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:17:16,879 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 240 flow [2023-11-06 22:17:16,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=240, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-11-06 22:17:16,881 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2023-11-06 22:17:16,881 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 240 flow [2023-11-06 22:17:16,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:16,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:16,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:16,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:17:16,883 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:17:16,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:16,884 INFO L85 PathProgramCache]: Analyzing trace with hash -440001033, now seen corresponding path program 1 times [2023-11-06 22:17:16,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:16,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623902681] [2023-11-06 22:17:16,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:16,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:17,149 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-06 22:17:17,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:17,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623902681] [2023-11-06 22:17:17,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623902681] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:17,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:17,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:17:17,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255220606] [2023-11-06 22:17:17,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:17,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:17:17,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:17,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:17:17,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:17:17,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 244 [2023-11-06 22:17:17,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 240 flow. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:17,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:17,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 244 [2023-11-06 22:17:17,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:19,500 INFO L124 PetriNetUnfolderBase]: 8825/12302 cut-off events. [2023-11-06 22:17:19,500 INFO L125 PetriNetUnfolderBase]: For 28233/28233 co-relation queries the response was YES. [2023-11-06 22:17:19,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40368 conditions, 12302 events. 8825/12302 cut-off events. For 28233/28233 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 62017 event pairs, 1895 based on Foata normal form. 504/12806 useless extension candidates. Maximal degree in co-relation 40348. Up to 5075 conditions per place. [2023-11-06 22:17:19,631 INFO L140 encePairwiseOnDemand]: 234/244 looper letters, 56 selfloop transitions, 15 changer transitions 38/109 dead transitions. [2023-11-06 22:17:19,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 109 transitions, 806 flow [2023-11-06 22:17:19,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:17:19,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:17:19,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 837 transitions. [2023-11-06 22:17:19,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49004683840749413 [2023-11-06 22:17:19,638 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 837 transitions. [2023-11-06 22:17:19,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 837 transitions. [2023-11-06 22:17:19,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:19,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 837 transitions. [2023-11-06 22:17:19,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.57142857142857) internal successors, (837), 7 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:19,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:19,651 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:19,652 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 240 flow. Second operand 7 states and 837 transitions. [2023-11-06 22:17:19,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 109 transitions, 806 flow [2023-11-06 22:17:19,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 109 transitions, 798 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-11-06 22:17:19,824 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 402 flow [2023-11-06 22:17:19,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=402, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2023-11-06 22:17:19,826 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2023-11-06 22:17:19,826 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 402 flow [2023-11-06 22:17:19,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:19,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:19,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:19,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:17:19,828 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:17:19,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:19,829 INFO L85 PathProgramCache]: Analyzing trace with hash -730891167, now seen corresponding path program 1 times [2023-11-06 22:17:19,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:19,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30417322] [2023-11-06 22:17:19,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:19,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:20,052 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-06 22:17:20,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:20,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30417322] [2023-11-06 22:17:20,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30417322] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:20,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:20,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:17:20,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581478622] [2023-11-06 22:17:20,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:20,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:17:20,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:20,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:17:20,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:17:20,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 244 [2023-11-06 22:17:20,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 402 flow. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:20,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:20,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 244 [2023-11-06 22:17:20,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:21,963 INFO L124 PetriNetUnfolderBase]: 6587/9604 cut-off events. [2023-11-06 22:17:21,964 INFO L125 PetriNetUnfolderBase]: For 35080/35550 co-relation queries the response was YES. [2023-11-06 22:17:22,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34628 conditions, 9604 events. 6587/9604 cut-off events. For 35080/35550 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 54686 event pairs, 2494 based on Foata normal form. 640/9934 useless extension candidates. Maximal degree in co-relation 34600. Up to 7610 conditions per place. [2023-11-06 22:17:22,080 INFO L140 encePairwiseOnDemand]: 239/244 looper letters, 53 selfloop transitions, 7 changer transitions 20/92 dead transitions. [2023-11-06 22:17:22,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 92 transitions, 784 flow [2023-11-06 22:17:22,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:17:22,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:17:22,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2023-11-06 22:17:22,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.519672131147541 [2023-11-06 22:17:22,085 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 634 transitions. [2023-11-06 22:17:22,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 634 transitions. [2023-11-06 22:17:22,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:22,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 634 transitions. [2023-11-06 22:17:22,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:22,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:22,093 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:22,093 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 402 flow. Second operand 5 states and 634 transitions. [2023-11-06 22:17:22,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 92 transitions, 784 flow [2023-11-06 22:17:22,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 758 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-11-06 22:17:22,281 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 477 flow [2023-11-06 22:17:22,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=477, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2023-11-06 22:17:22,285 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2023-11-06 22:17:22,285 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 477 flow [2023-11-06 22:17:22,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:22,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:22,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:22,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:17:22,286 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:17:22,287 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:22,287 INFO L85 PathProgramCache]: Analyzing trace with hash 750061404, now seen corresponding path program 1 times [2023-11-06 22:17:22,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:22,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119164966] [2023-11-06 22:17:22,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:22,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:22,497 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-06 22:17:22,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:22,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119164966] [2023-11-06 22:17:22,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119164966] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:22,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:22,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:17:22,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016613744] [2023-11-06 22:17:22,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:22,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:17:22,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:22,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:17:22,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:17:22,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 244 [2023-11-06 22:17:22,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 477 flow. Second operand has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:22,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:22,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 244 [2023-11-06 22:17:22,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:24,514 INFO L124 PetriNetUnfolderBase]: 8553/12266 cut-off events. [2023-11-06 22:17:24,515 INFO L125 PetriNetUnfolderBase]: For 43394/44104 co-relation queries the response was YES. [2023-11-06 22:17:24,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43711 conditions, 12266 events. 8553/12266 cut-off events. For 43394/44104 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 70578 event pairs, 3335 based on Foata normal form. 557/11993 useless extension candidates. Maximal degree in co-relation 43682. Up to 6106 conditions per place. [2023-11-06 22:17:24,638 INFO L140 encePairwiseOnDemand]: 240/244 looper letters, 48 selfloop transitions, 8 changer transitions 21/92 dead transitions. [2023-11-06 22:17:24,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 92 transitions, 795 flow [2023-11-06 22:17:24,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:17:24,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:17:24,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 632 transitions. [2023-11-06 22:17:24,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5180327868852459 [2023-11-06 22:17:24,643 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 632 transitions. [2023-11-06 22:17:24,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 632 transitions. [2023-11-06 22:17:24,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:24,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 632 transitions. [2023-11-06 22:17:24,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:24,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:24,651 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:24,652 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 477 flow. Second operand 5 states and 632 transitions. [2023-11-06 22:17:24,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 92 transitions, 795 flow [2023-11-06 22:17:24,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 92 transitions, 766 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-11-06 22:17:24,794 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 474 flow [2023-11-06 22:17:24,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=474, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2023-11-06 22:17:24,797 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2023-11-06 22:17:24,798 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 474 flow [2023-11-06 22:17:24,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:24,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:24,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:24,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:17:24,799 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:17:24,799 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:24,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1498329750, now seen corresponding path program 1 times [2023-11-06 22:17:24,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:24,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997577965] [2023-11-06 22:17:24,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:24,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:25,083 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-06 22:17:25,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:25,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997577965] [2023-11-06 22:17:25,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997577965] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:25,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:25,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:17:25,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492100082] [2023-11-06 22:17:25,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:25,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:17:25,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:25,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:17:25,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:17:25,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 244 [2023-11-06 22:17:25,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:25,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:25,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 244 [2023-11-06 22:17:25,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:26,177 INFO L124 PetriNetUnfolderBase]: 4735/7068 cut-off events. [2023-11-06 22:17:26,178 INFO L125 PetriNetUnfolderBase]: For 23892/24744 co-relation queries the response was YES. [2023-11-06 22:17:26,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24150 conditions, 7068 events. 4735/7068 cut-off events. For 23892/24744 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 41177 event pairs, 1247 based on Foata normal form. 410/7049 useless extension candidates. Maximal degree in co-relation 24121. Up to 6201 conditions per place. [2023-11-06 22:17:26,249 INFO L140 encePairwiseOnDemand]: 238/244 looper letters, 58 selfloop transitions, 5 changer transitions 0/83 dead transitions. [2023-11-06 22:17:26,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 83 transitions, 791 flow [2023-11-06 22:17:26,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:17:26,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:17:26,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-11-06 22:17:26,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5245901639344263 [2023-11-06 22:17:26,253 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-11-06 22:17:26,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-11-06 22:17:26,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:26,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-11-06 22:17:26,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:26,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:26,257 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:26,257 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 474 flow. Second operand 3 states and 384 transitions. [2023-11-06 22:17:26,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 83 transitions, 791 flow [2023-11-06 22:17:26,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 83 transitions, 766 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-11-06 22:17:26,298 INFO L231 Difference]: Finished difference. Result has 58 places, 59 transitions, 487 flow [2023-11-06 22:17:26,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=487, PETRI_PLACES=58, PETRI_TRANSITIONS=59} [2023-11-06 22:17:26,299 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2023-11-06 22:17:26,299 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 59 transitions, 487 flow [2023-11-06 22:17:26,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:26,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:26,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:26,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:17:26,301 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:17:26,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:26,301 INFO L85 PathProgramCache]: Analyzing trace with hash -353823287, now seen corresponding path program 1 times [2023-11-06 22:17:26,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:26,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132317017] [2023-11-06 22:17:26,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:26,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:26,569 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-06 22:17:26,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:26,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132317017] [2023-11-06 22:17:26,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132317017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:26,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:26,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:17:26,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426760786] [2023-11-06 22:17:26,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:26,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:17:26,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:26,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:17:26,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:17:26,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 244 [2023-11-06 22:17:26,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 59 transitions, 487 flow. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:26,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:26,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 244 [2023-11-06 22:17:26,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:28,331 INFO L124 PetriNetUnfolderBase]: 7889/11754 cut-off events. [2023-11-06 22:17:28,331 INFO L125 PetriNetUnfolderBase]: For 37598/37598 co-relation queries the response was YES. [2023-11-06 22:17:28,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46430 conditions, 11754 events. 7889/11754 cut-off events. For 37598/37598 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 68149 event pairs, 2203 based on Foata normal form. 228/11982 useless extension candidates. Maximal degree in co-relation 46402. Up to 5380 conditions per place. [2023-11-06 22:17:28,415 INFO L140 encePairwiseOnDemand]: 234/244 looper letters, 77 selfloop transitions, 23 changer transitions 37/137 dead transitions. [2023-11-06 22:17:28,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 137 transitions, 1224 flow [2023-11-06 22:17:28,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:17:28,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:17:28,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 844 transitions. [2023-11-06 22:17:28,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49414519906323184 [2023-11-06 22:17:28,421 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 844 transitions. [2023-11-06 22:17:28,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 844 transitions. [2023-11-06 22:17:28,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:28,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 844 transitions. [2023-11-06 22:17:28,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.57142857142857) internal successors, (844), 7 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:28,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:28,437 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:28,437 INFO L175 Difference]: Start difference. First operand has 58 places, 59 transitions, 487 flow. Second operand 7 states and 844 transitions. [2023-11-06 22:17:28,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 137 transitions, 1224 flow [2023-11-06 22:17:28,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 137 transitions, 1207 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-06 22:17:28,536 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 624 flow [2023-11-06 22:17:28,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=624, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2023-11-06 22:17:28,537 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places. [2023-11-06 22:17:28,537 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 624 flow [2023-11-06 22:17:28,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:28,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:28,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:28,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:17:28,538 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:17:28,539 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:28,539 INFO L85 PathProgramCache]: Analyzing trace with hash 103633344, now seen corresponding path program 1 times [2023-11-06 22:17:28,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:28,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900663287] [2023-11-06 22:17:28,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:28,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:28,830 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-06 22:17:28,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:28,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900663287] [2023-11-06 22:17:28,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900663287] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:28,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:28,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:17:28,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384080872] [2023-11-06 22:17:28,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:28,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:17:28,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:28,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:17:28,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:17:28,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 244 [2023-11-06 22:17:28,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 624 flow. Second operand has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:28,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:28,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 244 [2023-11-06 22:17:28,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:29,666 INFO L124 PetriNetUnfolderBase]: 2608/4276 cut-off events. [2023-11-06 22:17:29,667 INFO L125 PetriNetUnfolderBase]: For 18153/18673 co-relation queries the response was YES. [2023-11-06 22:17:29,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16719 conditions, 4276 events. 2608/4276 cut-off events. For 18153/18673 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 25964 event pairs, 455 based on Foata normal form. 513/4661 useless extension candidates. Maximal degree in co-relation 16684. Up to 2721 conditions per place. [2023-11-06 22:17:29,703 INFO L140 encePairwiseOnDemand]: 238/244 looper letters, 81 selfloop transitions, 9 changer transitions 0/110 dead transitions. [2023-11-06 22:17:29,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 110 transitions, 1230 flow [2023-11-06 22:17:29,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:17:29,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:17:29,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 513 transitions. [2023-11-06 22:17:29,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5256147540983607 [2023-11-06 22:17:29,707 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 513 transitions. [2023-11-06 22:17:29,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 513 transitions. [2023-11-06 22:17:29,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:29,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 513 transitions. [2023-11-06 22:17:29,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:29,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:29,714 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:29,714 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 624 flow. Second operand 4 states and 513 transitions. [2023-11-06 22:17:29,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 110 transitions, 1230 flow [2023-11-06 22:17:29,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 110 transitions, 1212 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-11-06 22:17:29,757 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 664 flow [2023-11-06 22:17:29,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=664, PETRI_PLACES=69, PETRI_TRANSITIONS=65} [2023-11-06 22:17:29,758 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places. [2023-11-06 22:17:29,759 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 664 flow [2023-11-06 22:17:29,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:29,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:29,759 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-06 22:17:29,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:17:29,760 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:17:29,760 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:29,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1974569189, now seen corresponding path program 1 times [2023-11-06 22:17:29,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:29,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165279761] [2023-11-06 22:17:29,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:29,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:30,096 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-06 22:17:30,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:30,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165279761] [2023-11-06 22:17:30,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165279761] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:30,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:30,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:17:30,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898035988] [2023-11-06 22:17:30,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:30,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:17:30,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:30,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:17:30,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:17:30,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 244 [2023-11-06 22:17:30,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 664 flow. Second operand has 5 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:30,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:30,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 244 [2023-11-06 22:17:30,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:30,761 INFO L124 PetriNetUnfolderBase]: 1635/2744 cut-off events. [2023-11-06 22:17:30,761 INFO L125 PetriNetUnfolderBase]: For 12706/13198 co-relation queries the response was YES. [2023-11-06 22:17:30,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12460 conditions, 2744 events. 1635/2744 cut-off events. For 12706/13198 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 15819 event pairs, 208 based on Foata normal form. 473/3136 useless extension candidates. Maximal degree in co-relation 12423. Up to 1124 conditions per place. [2023-11-06 22:17:30,791 INFO L140 encePairwiseOnDemand]: 238/244 looper letters, 90 selfloop transitions, 13 changer transitions 5/126 dead transitions. [2023-11-06 22:17:30,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 126 transitions, 1406 flow [2023-11-06 22:17:30,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:17:30,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:17:30,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 640 transitions. [2023-11-06 22:17:30,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5245901639344263 [2023-11-06 22:17:30,796 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 640 transitions. [2023-11-06 22:17:30,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 640 transitions. [2023-11-06 22:17:30,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:30,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 640 transitions. [2023-11-06 22:17:30,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:30,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:30,806 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:30,806 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 664 flow. Second operand 5 states and 640 transitions. [2023-11-06 22:17:30,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 126 transitions, 1406 flow [2023-11-06 22:17:30,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 126 transitions, 1382 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-11-06 22:17:30,839 INFO L231 Difference]: Finished difference. Result has 71 places, 67 transitions, 682 flow [2023-11-06 22:17:30,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=682, PETRI_PLACES=71, PETRI_TRANSITIONS=67} [2023-11-06 22:17:30,841 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 29 predicate places. [2023-11-06 22:17:30,841 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 67 transitions, 682 flow [2023-11-06 22:17:30,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:30,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:30,842 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-06 22:17:30,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:17:30,842 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:17:30,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:30,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1592352899, now seen corresponding path program 1 times [2023-11-06 22:17:30,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:30,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150025479] [2023-11-06 22:17:30,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:30,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:31,198 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-06 22:17:31,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:31,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150025479] [2023-11-06 22:17:31,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150025479] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:31,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:31,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:17:31,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690446610] [2023-11-06 22:17:31,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:31,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:17:31,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:31,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:17:31,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:17:31,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 244 [2023-11-06 22:17:31,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 67 transitions, 682 flow. Second operand has 6 states, 6 states have (on average 118.33333333333333) internal successors, (710), 6 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:31,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:31,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 244 [2023-11-06 22:17:31,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:31,880 INFO L124 PetriNetUnfolderBase]: 1492/2448 cut-off events. [2023-11-06 22:17:31,880 INFO L125 PetriNetUnfolderBase]: For 12606/13123 co-relation queries the response was YES. [2023-11-06 22:17:31,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11560 conditions, 2448 events. 1492/2448 cut-off events. For 12606/13123 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 13836 event pairs, 187 based on Foata normal form. 357/2726 useless extension candidates. Maximal degree in co-relation 11523. Up to 868 conditions per place. [2023-11-06 22:17:31,894 INFO L140 encePairwiseOnDemand]: 238/244 looper letters, 56 selfloop transitions, 17 changer transitions 40/124 dead transitions. [2023-11-06 22:17:31,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 124 transitions, 1400 flow [2023-11-06 22:17:31,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:17:31,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:17:31,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 755 transitions. [2023-11-06 22:17:31,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5157103825136612 [2023-11-06 22:17:31,899 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 755 transitions. [2023-11-06 22:17:31,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 755 transitions. [2023-11-06 22:17:31,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:31,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 755 transitions. [2023-11-06 22:17:31,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.83333333333333) internal successors, (755), 6 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:31,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:31,908 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:31,908 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 682 flow. Second operand 6 states and 755 transitions. [2023-11-06 22:17:31,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 124 transitions, 1400 flow [2023-11-06 22:17:32,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 124 transitions, 1284 flow, removed 20 selfloop flow, removed 9 redundant places. [2023-11-06 22:17:32,005 INFO L231 Difference]: Finished difference. Result has 68 places, 49 transitions, 409 flow [2023-11-06 22:17:32,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=409, PETRI_PLACES=68, PETRI_TRANSITIONS=49} [2023-11-06 22:17:32,006 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places. [2023-11-06 22:17:32,006 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 49 transitions, 409 flow [2023-11-06 22:17:32,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.33333333333333) internal successors, (710), 6 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:32,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:32,007 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-06 22:17:32,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:17:32,008 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:17:32,008 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:32,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1487348650, now seen corresponding path program 1 times [2023-11-06 22:17:32,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:32,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856503534] [2023-11-06 22:17:32,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:32,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:32,263 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-06 22:17:32,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:32,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856503534] [2023-11-06 22:17:32,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856503534] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:32,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:32,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:17:32,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506051492] [2023-11-06 22:17:32,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:32,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:17:32,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:32,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:17:32,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:17:32,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 244 [2023-11-06 22:17:32,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 49 transitions, 409 flow. Second operand has 5 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:32,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:32,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 244 [2023-11-06 22:17:32,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:32,515 INFO L124 PetriNetUnfolderBase]: 354/638 cut-off events. [2023-11-06 22:17:32,515 INFO L125 PetriNetUnfolderBase]: For 2792/2814 co-relation queries the response was YES. [2023-11-06 22:17:32,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3086 conditions, 638 events. 354/638 cut-off events. For 2792/2814 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2550 event pairs, 58 based on Foata normal form. 11/639 useless extension candidates. Maximal degree in co-relation 3054. Up to 374 conditions per place. [2023-11-06 22:17:32,519 INFO L140 encePairwiseOnDemand]: 240/244 looper letters, 36 selfloop transitions, 1 changer transitions 44/84 dead transitions. [2023-11-06 22:17:32,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 84 transitions, 808 flow [2023-11-06 22:17:32,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:17:32,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:17:32,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 615 transitions. [2023-11-06 22:17:32,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5040983606557377 [2023-11-06 22:17:32,522 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 615 transitions. [2023-11-06 22:17:32,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 615 transitions. [2023-11-06 22:17:32,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:32,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 615 transitions. [2023-11-06 22:17:32,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:32,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:32,528 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:32,528 INFO L175 Difference]: Start difference. First operand has 68 places, 49 transitions, 409 flow. Second operand 5 states and 615 transitions. [2023-11-06 22:17:32,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 84 transitions, 808 flow [2023-11-06 22:17:32,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 84 transitions, 641 flow, removed 40 selfloop flow, removed 12 redundant places. [2023-11-06 22:17:32,541 INFO L231 Difference]: Finished difference. Result has 63 places, 38 transitions, 221 flow [2023-11-06 22:17:32,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=63, PETRI_TRANSITIONS=38} [2023-11-06 22:17:32,543 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2023-11-06 22:17:32,543 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 38 transitions, 221 flow [2023-11-06 22:17:32,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:32,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:32,544 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-06 22:17:32,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:17:32,544 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:17:32,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:32,545 INFO L85 PathProgramCache]: Analyzing trace with hash 597352304, now seen corresponding path program 2 times [2023-11-06 22:17:32,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:32,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365842786] [2023-11-06 22:17:32,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:32,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:33,304 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-06 22:17:33,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:33,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365842786] [2023-11-06 22:17:33,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365842786] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:33,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:33,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:17:33,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856859529] [2023-11-06 22:17:33,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:33,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:17:33,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:33,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:17:33,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:17:33,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 244 [2023-11-06 22:17:33,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 38 transitions, 221 flow. Second operand has 7 states, 7 states have (on average 105.71428571428571) internal successors, (740), 7 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:33,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:33,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 244 [2023-11-06 22:17:33,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:33,687 INFO L124 PetriNetUnfolderBase]: 126/254 cut-off events. [2023-11-06 22:17:33,687 INFO L125 PetriNetUnfolderBase]: For 694/694 co-relation queries the response was YES. [2023-11-06 22:17:33,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1069 conditions, 254 events. 126/254 cut-off events. For 694/694 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 798 event pairs, 8 based on Foata normal form. 1/255 useless extension candidates. Maximal degree in co-relation 1050. Up to 81 conditions per place. [2023-11-06 22:17:33,689 INFO L140 encePairwiseOnDemand]: 232/244 looper letters, 42 selfloop transitions, 9 changer transitions 28/79 dead transitions. [2023-11-06 22:17:33,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 79 transitions, 632 flow [2023-11-06 22:17:33,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:17:33,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:17:33,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 966 transitions. [2023-11-06 22:17:33,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43989071038251365 [2023-11-06 22:17:33,694 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 966 transitions. [2023-11-06 22:17:33,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 966 transitions. [2023-11-06 22:17:33,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:33,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 966 transitions. [2023-11-06 22:17:33,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 107.33333333333333) internal successors, (966), 9 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:33,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 244.0) internal successors, (2440), 10 states have internal predecessors, (2440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:33,705 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 244.0) internal successors, (2440), 10 states have internal predecessors, (2440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:33,705 INFO L175 Difference]: Start difference. First operand has 63 places, 38 transitions, 221 flow. Second operand 9 states and 966 transitions. [2023-11-06 22:17:33,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 79 transitions, 632 flow [2023-11-06 22:17:33,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 79 transitions, 530 flow, removed 8 selfloop flow, removed 15 redundant places. [2023-11-06 22:17:33,710 INFO L231 Difference]: Finished difference. Result has 57 places, 38 transitions, 190 flow [2023-11-06 22:17:33,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=190, PETRI_PLACES=57, PETRI_TRANSITIONS=38} [2023-11-06 22:17:33,711 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2023-11-06 22:17:33,711 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 38 transitions, 190 flow [2023-11-06 22:17:33,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.71428571428571) internal successors, (740), 7 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:33,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:33,712 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-06 22:17:33,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:17:33,712 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:17:33,713 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:33,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1283428160, now seen corresponding path program 3 times [2023-11-06 22:17:33,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:33,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066761674] [2023-11-06 22:17:33,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:33,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:17:33,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:17:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:17:33,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:17:33,886 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:17:33,887 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-06 22:17:33,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-06 22:17:33,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-06 22:17:33,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-06 22:17:33,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-06 22:17:33,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-06 22:17:33,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-06 22:17:33,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:17:33,892 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:33,901 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:17:33,902 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:17:34,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:17:34 BasicIcfg [2023-11-06 22:17:34,052 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:17:34,052 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:17:34,053 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:17:34,053 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:17:34,053 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:17:02" (3/4) ... [2023-11-06 22:17:34,054 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 22:17:34,190 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1762a9-d9f9-4f71-aba7-fed80ca3a526/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:17:34,190 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:17:34,191 INFO L158 Benchmark]: Toolchain (without parser) took 33168.13ms. Allocated memory was 174.1MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 127.0MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 592.2MB. Max. memory is 16.1GB. [2023-11-06 22:17:34,191 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 117.4MB. Free memory is still 68.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:17:34,191 INFO L158 Benchmark]: CACSL2BoogieTranslator took 761.68ms. Allocated memory is still 174.1MB. Free memory was 126.5MB in the beginning and 103.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 22:17:34,192 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.84ms. Allocated memory is still 174.1MB. Free memory was 103.4MB in the beginning and 100.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:17:34,193 INFO L158 Benchmark]: Boogie Preprocessor took 47.46ms. Allocated memory is still 174.1MB. Free memory was 100.9MB in the beginning and 98.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:17:34,193 INFO L158 Benchmark]: RCFGBuilder took 965.39ms. Allocated memory is still 174.1MB. Free memory was 98.8MB in the beginning and 127.2MB in the end (delta: -28.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-06 22:17:34,193 INFO L158 Benchmark]: TraceAbstraction took 31159.89ms. Allocated memory was 174.1MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 126.0MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 575.4MB. Max. memory is 16.1GB. [2023-11-06 22:17:34,194 INFO L158 Benchmark]: Witness Printer took 137.68ms. Allocated memory is still 2.7GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:17:34,199 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.29ms. Allocated memory is still 117.4MB. Free memory is still 68.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 761.68ms. Allocated memory is still 174.1MB. Free memory was 126.5MB in the beginning and 103.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.84ms. Allocated memory is still 174.1MB. Free memory was 103.4MB in the beginning and 100.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.46ms. Allocated memory is still 174.1MB. Free memory was 100.9MB in the beginning and 98.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 965.39ms. Allocated memory is still 174.1MB. Free memory was 98.8MB in the beginning and 127.2MB in the end (delta: -28.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 31159.89ms. Allocated memory was 174.1MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 126.0MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 575.4MB. Max. memory is 16.1GB. * Witness Printer took 137.68ms. Allocated memory is still 2.7GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 139 PlacesBefore, 42 PlacesAfterwards, 128 TransitionsBefore, 30 TransitionsAfterwards, 3040 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 112 TotalNumberOfCompositions, 7526 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3463, independent: 3259, independent conditional: 0, independent unconditional: 3259, dependent: 204, dependent conditional: 0, dependent unconditional: 204, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1645, independent: 1613, independent conditional: 0, independent unconditional: 1613, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3463, independent: 1646, independent conditional: 0, independent unconditional: 1646, dependent: 172, dependent conditional: 0, dependent unconditional: 172, unknown: 1645, unknown conditional: 0, unknown unconditional: 1645] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 122, Positive conditional cache size: 0, Positive unconditional cache size: 122, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L854] 0 pthread_t t1061; [L855] FCALL, FORK 0 pthread_create(&t1061, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1061, ((void *)0), P0, ((void *)0))=-3, t1061={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L856] 0 pthread_t t1062; [L857] FCALL, FORK 0 pthread_create(&t1062, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1062, ((void *)0), P1, ((void *)0))=-2, t1061={5:0}, t1062={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L858] 0 pthread_t t1063; [L859] FCALL, FORK 0 pthread_create(&t1063, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1063, ((void *)0), P2, ((void *)0))=-1, t1061={5:0}, t1062={6:0}, t1063={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t1064; [L861] FCALL, FORK 0 pthread_create(&t1064, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1064, ((void *)0), P3, ((void *)0))=0, t1061={5:0}, t1062={6:0}, t1063={7:0}, t1064={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L814] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L814] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 [L823] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L826] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L829] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L767] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L782] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 __unbuffered_p2_EAX = z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L832] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L833] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L834] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L835] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L836] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 4 return 0; [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L865] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L865] RET 0 assume_abort_if_not(main$tmp_guard0) [L867] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L868] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L869] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L870] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L871] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1061={5:0}, t1062={6:0}, t1063={7:0}, t1064={3:0}, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L874] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 855]: 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: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 167 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 30.8s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 19.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 656 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 493 mSDsluCounter, 330 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 239 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1520 IncrementalHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 91 mSDtfsCounter, 1520 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=682occurred in iteration=10, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 251 NumberOfCodeBlocks, 251 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 1016 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-06 22:17:34,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1762a9-d9f9-4f71-aba7-fed80ca3a526/bin/uautomizer-verify-WvqO1wxjHP/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