./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/chl-word-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b5a6ad-b082-423a-a573-f2bc470f5890/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b5a6ad-b082-423a-a573-f2bc470f5890/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b5a6ad-b082-423a-a573-f2bc470f5890/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b5a6ad-b082-423a-a573-f2bc470f5890/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-word-trans.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b5a6ad-b082-423a-a573-f2bc470f5890/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b5a6ad-b082-423a-a573-f2bc470f5890/bin/uautomizer-Dbtcem3rbc --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 73462fb8dbdc39f07edabdd79150cbad579fbba379eb033cd2e89802bbb8b9a6 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 21:09:22,483 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:09:22,486 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:09:22,547 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:09:22,548 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:09:22,552 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:09:22,555 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:09:22,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:09:22,562 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:09:22,567 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:09:22,569 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:09:22,570 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:09:22,571 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:09:22,574 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:09:22,576 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:09:22,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:09:22,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:09:22,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:09:22,582 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:09:22,589 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:09:22,592 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:09:22,594 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:09:22,597 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:09:22,599 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:09:22,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:09:22,611 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:09:22,611 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:09:22,612 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:09:22,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:09:22,615 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:09:22,616 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:09:22,617 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:09:22,618 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:09:22,620 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:09:22,622 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:09:22,622 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:09:22,623 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:09:22,623 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:09:22,624 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:09:22,625 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:09:22,625 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:09:22,626 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b5a6ad-b082-423a-a573-f2bc470f5890/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 21:09:22,669 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:09:22,670 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:09:22,670 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:09:22,671 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:09:22,672 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:09:22,672 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:09:22,672 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:09:22,673 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:09:22,673 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:09:22,673 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:09:22,674 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:09:22,675 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:09:22,675 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:09:22,675 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:09:22,675 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:09:22,676 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:09:22,676 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:09:22,676 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:09:22,676 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:09:22,676 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:09:22,677 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:09:22,677 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:09:22,677 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:09:22,677 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:09:22,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:09:22,678 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:09:22,678 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:09:22,678 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:09:22,679 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:09:22,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:09:22,679 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:09:22,679 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:09:22,680 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:09:22,680 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_64b5a6ad-b082-423a-a573-f2bc470f5890/bin/uautomizer-Dbtcem3rbc/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_64b5a6ad-b082-423a-a573-f2bc470f5890/bin/uautomizer-Dbtcem3rbc 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 -> 73462fb8dbdc39f07edabdd79150cbad579fbba379eb033cd2e89802bbb8b9a6 [2022-11-02 21:09:23,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:09:23,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:09:23,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:09:23,059 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:09:23,060 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:09:23,061 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b5a6ad-b082-423a-a573-f2bc470f5890/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2022-11-02 21:09:23,143 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b5a6ad-b082-423a-a573-f2bc470f5890/bin/uautomizer-Dbtcem3rbc/data/3d08cde67/c8cfe544f5114fc9aa1e8e9e8b85da82/FLAGdfa71aab4 [2022-11-02 21:09:23,777 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:09:23,778 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b5a6ad-b082-423a-a573-f2bc470f5890/sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2022-11-02 21:09:23,795 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b5a6ad-b082-423a-a573-f2bc470f5890/bin/uautomizer-Dbtcem3rbc/data/3d08cde67/c8cfe544f5114fc9aa1e8e9e8b85da82/FLAGdfa71aab4 [2022-11-02 21:09:24,109 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b5a6ad-b082-423a-a573-f2bc470f5890/bin/uautomizer-Dbtcem3rbc/data/3d08cde67/c8cfe544f5114fc9aa1e8e9e8b85da82 [2022-11-02 21:09:24,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:09:24,113 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:09:24,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:09:24,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:09:24,121 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:09:24,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:09:24" (1/1) ... [2022-11-02 21:09:24,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@849f50b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:24, skipping insertion in model container [2022-11-02 21:09:24,124 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:09:24" (1/1) ... [2022-11-02 21:09:24,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:09:24,174 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:09:24,387 WARN L230 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_64b5a6ad-b082-423a-a573-f2bc470f5890/sv-benchmarks/c/weaver/chl-word-trans.wvr.c[3292,3305] [2022-11-02 21:09:24,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:09:24,403 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:09:24,447 WARN L230 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_64b5a6ad-b082-423a-a573-f2bc470f5890/sv-benchmarks/c/weaver/chl-word-trans.wvr.c[3292,3305] [2022-11-02 21:09:24,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:09:24,470 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:09:24,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:24 WrapperNode [2022-11-02 21:09:24,471 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:09:24,472 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:09:24,472 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:09:24,472 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:09:24,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:24" (1/1) ... [2022-11-02 21:09:24,490 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:24" (1/1) ... [2022-11-02 21:09:24,517 INFO L138 Inliner]: procedures = 25, calls = 44, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 172 [2022-11-02 21:09:24,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:09:24,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:09:24,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:09:24,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:09:24,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:24" (1/1) ... [2022-11-02 21:09:24,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:24" (1/1) ... [2022-11-02 21:09:24,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:24" (1/1) ... [2022-11-02 21:09:24,533 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:24" (1/1) ... [2022-11-02 21:09:24,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:24" (1/1) ... [2022-11-02 21:09:24,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:24" (1/1) ... [2022-11-02 21:09:24,552 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:24" (1/1) ... [2022-11-02 21:09:24,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:24" (1/1) ... [2022-11-02 21:09:24,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:09:24,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:09:24,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:09:24,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:09:24,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:24" (1/1) ... [2022-11-02 21:09:24,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:09:24,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b5a6ad-b082-423a-a573-f2bc470f5890/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:09:24,592 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b5a6ad-b082-423a-a573-f2bc470f5890/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:09:24,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b5a6ad-b082-423a-a573-f2bc470f5890/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:09:24,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:09:24,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:09:24,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:09:24,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:09:24,651 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 21:09:24,651 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 21:09:24,651 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 21:09:24,653 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 21:09:24,653 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 21:09:24,654 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 21:09:24,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:09:24,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:09:24,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:09:24,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:09:24,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:09:24,656 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 21:09:24,888 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:09:24,890 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:09:25,413 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:09:25,434 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:09:25,434 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-02 21:09:25,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:09:25 BoogieIcfgContainer [2022-11-02 21:09:25,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:09:25,446 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:09:25,446 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:09:25,451 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:09:25,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:09:24" (1/3) ... [2022-11-02 21:09:25,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f0399e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:09:25, skipping insertion in model container [2022-11-02 21:09:25,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:24" (2/3) ... [2022-11-02 21:09:25,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f0399e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:09:25, skipping insertion in model container [2022-11-02 21:09:25,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:09:25" (3/3) ... [2022-11-02 21:09:25,455 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-word-trans.wvr.c [2022-11-02 21:09:25,466 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 21:09:25,479 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:09:25,479 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 21:09:25,479 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 21:09:25,702 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-02 21:09:25,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 308 places, 332 transitions, 688 flow [2022-11-02 21:09:25,963 INFO L130 PetriNetUnfolder]: 34/329 cut-off events. [2022-11-02 21:09:25,963 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 21:09:25,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 329 events. 34/329 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 504 event pairs, 0 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 261. Up to 3 conditions per place. [2022-11-02 21:09:25,971 INFO L82 GeneralOperation]: Start removeDead. Operand has 308 places, 332 transitions, 688 flow [2022-11-02 21:09:25,980 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 294 places, 318 transitions, 654 flow [2022-11-02 21:09:25,991 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:09:25,998 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;@5c64bc7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:09:25,998 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-02 21:09:26,074 INFO L130 PetriNetUnfolder]: 34/317 cut-off events. [2022-11-02 21:09:26,074 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 21:09:26,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:09:26,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:26,076 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:09:26,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:26,080 INFO L85 PathProgramCache]: Analyzing trace with hash -320614511, now seen corresponding path program 1 times [2022-11-02 21:09:26,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:26,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958222802] [2022-11-02 21:09:26,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:26,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:26,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:26,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:26,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958222802] [2022-11-02 21:09:26,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958222802] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:26,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:26,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:09:26,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973477038] [2022-11-02 21:09:26,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:26,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 21:09:26,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:26,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 21:09:26,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 21:09:26,560 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 332 [2022-11-02 21:09:26,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 318 transitions, 654 flow. Second operand has 2 states, 2 states have (on average 316.0) internal successors, (632), 2 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) [2022-11-02 21:09:26,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:09:26,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 332 [2022-11-02 21:09:26,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:09:26,731 INFO L130 PetriNetUnfolder]: 21/305 cut-off events. [2022-11-02 21:09:26,732 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-11-02 21:09:26,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 305 events. 21/305 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 493 event pairs, 0 based on Foata normal form. 19/296 useless extension candidates. Maximal degree in co-relation 252. Up to 7 conditions per place. [2022-11-02 21:09:26,741 INFO L137 encePairwiseOnDemand]: 319/332 looper letters, 6 selfloop transitions, 0 changer transitions 7/305 dead transitions. [2022-11-02 21:09:26,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 305 transitions, 640 flow [2022-11-02 21:09:26,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 21:09:26,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-02 21:09:26,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 643 transitions. [2022-11-02 21:09:26,768 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9683734939759037 [2022-11-02 21:09:26,769 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 643 transitions. [2022-11-02 21:09:26,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 643 transitions. [2022-11-02 21:09:26,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:09:26,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 643 transitions. [2022-11-02 21:09:26,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 321.5) internal successors, (643), 2 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:26,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 332.0) internal successors, (996), 3 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:26,797 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 332.0) internal successors, (996), 3 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:26,800 INFO L175 Difference]: Start difference. First operand has 294 places, 318 transitions, 654 flow. Second operand 2 states and 643 transitions. [2022-11-02 21:09:26,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 305 transitions, 640 flow [2022-11-02 21:09:26,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 305 transitions, 628 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-02 21:09:26,827 INFO L231 Difference]: Finished difference. Result has 289 places, 298 transitions, 602 flow [2022-11-02 21:09:26,830 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=602, PETRI_PLACES=289, PETRI_TRANSITIONS=298} [2022-11-02 21:09:26,835 INFO L287 CegarLoopForPetriNet]: 294 programPoint places, -5 predicate places. [2022-11-02 21:09:26,836 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 298 transitions, 602 flow [2022-11-02 21:09:26,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 316.0) internal successors, (632), 2 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) [2022-11-02 21:09:26,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:09:26,838 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:26,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:09:26,839 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:09:26,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:26,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1734824051, now seen corresponding path program 1 times [2022-11-02 21:09:26,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:26,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124261037] [2022-11-02 21:09:26,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:26,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:27,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:27,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:27,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124261037] [2022-11-02 21:09:27,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124261037] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:27,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:27,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:09:27,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019101640] [2022-11-02 21:09:27,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:27,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:09:27,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:27,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:09:27,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:09:27,376 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 332 [2022-11-02 21:09:27,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 298 transitions, 602 flow. Second operand has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:27,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:09:27,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 332 [2022-11-02 21:09:27,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:09:27,539 INFO L130 PetriNetUnfolder]: 40/410 cut-off events. [2022-11-02 21:09:27,539 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-02 21:09:27,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 410 events. 40/410 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1090 event pairs, 6 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 451. Up to 22 conditions per place. [2022-11-02 21:09:27,546 INFO L137 encePairwiseOnDemand]: 329/332 looper letters, 13 selfloop transitions, 2 changer transitions 0/303 dead transitions. [2022-11-02 21:09:27,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 303 transitions, 646 flow [2022-11-02 21:09:27,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:09:27,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:09:27,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 940 transitions. [2022-11-02 21:09:27,551 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9437751004016064 [2022-11-02 21:09:27,551 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 940 transitions. [2022-11-02 21:09:27,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 940 transitions. [2022-11-02 21:09:27,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:09:27,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 940 transitions. [2022-11-02 21:09:27,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:27,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:27,559 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:27,559 INFO L175 Difference]: Start difference. First operand has 289 places, 298 transitions, 602 flow. Second operand 3 states and 940 transitions. [2022-11-02 21:09:27,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 303 transitions, 646 flow [2022-11-02 21:09:27,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 303 transitions, 646 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 21:09:27,570 INFO L231 Difference]: Finished difference. Result has 285 places, 298 transitions, 610 flow [2022-11-02 21:09:27,571 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=610, PETRI_PLACES=285, PETRI_TRANSITIONS=298} [2022-11-02 21:09:27,572 INFO L287 CegarLoopForPetriNet]: 294 programPoint places, -9 predicate places. [2022-11-02 21:09:27,572 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 298 transitions, 610 flow [2022-11-02 21:09:27,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:27,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:09:27,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:27,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:09:27,574 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:09:27,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:27,577 INFO L85 PathProgramCache]: Analyzing trace with hash -2019345115, now seen corresponding path program 1 times [2022-11-02 21:09:27,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:27,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575868138] [2022-11-02 21:09:27,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:27,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:27,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:27,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:27,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575868138] [2022-11-02 21:09:27,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575868138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:27,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:27,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:09:27,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260012148] [2022-11-02 21:09:27,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:27,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:09:27,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:27,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:09:27,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:09:27,878 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2022-11-02 21:09:27,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 298 transitions, 610 flow. Second operand has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:27,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:09:27,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2022-11-02 21:09:27,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:09:28,671 INFO L130 PetriNetUnfolder]: 543/2808 cut-off events. [2022-11-02 21:09:28,672 INFO L131 PetriNetUnfolder]: For 95/114 co-relation queries the response was YES. [2022-11-02 21:09:28,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3484 conditions, 2808 events. 543/2808 cut-off events. For 95/114 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 25599 event pairs, 135 based on Foata normal form. 4/2381 useless extension candidates. Maximal degree in co-relation 3479. Up to 252 conditions per place. [2022-11-02 21:09:28,705 INFO L137 encePairwiseOnDemand]: 324/332 looper letters, 53 selfloop transitions, 9 changer transitions 0/336 dead transitions. [2022-11-02 21:09:28,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 336 transitions, 822 flow [2022-11-02 21:09:28,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:09:28,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 21:09:28,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1534 transitions. [2022-11-02 21:09:28,712 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9240963855421687 [2022-11-02 21:09:28,712 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1534 transitions. [2022-11-02 21:09:28,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1534 transitions. [2022-11-02 21:09:28,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:09:28,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1534 transitions. [2022-11-02 21:09:28,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 306.8) internal successors, (1534), 5 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:28,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:28,726 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:28,726 INFO L175 Difference]: Start difference. First operand has 285 places, 298 transitions, 610 flow. Second operand 5 states and 1534 transitions. [2022-11-02 21:09:28,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 336 transitions, 822 flow [2022-11-02 21:09:28,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 336 transitions, 818 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:09:28,737 INFO L231 Difference]: Finished difference. Result has 290 places, 307 transitions, 673 flow [2022-11-02 21:09:28,738 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=673, PETRI_PLACES=290, PETRI_TRANSITIONS=307} [2022-11-02 21:09:28,741 INFO L287 CegarLoopForPetriNet]: 294 programPoint places, -4 predicate places. [2022-11-02 21:09:28,741 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 307 transitions, 673 flow [2022-11-02 21:09:28,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:28,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:09:28,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:28,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:09:28,743 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:09:28,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:28,744 INFO L85 PathProgramCache]: Analyzing trace with hash -682553413, now seen corresponding path program 2 times [2022-11-02 21:09:28,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:28,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183167540] [2022-11-02 21:09:28,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:28,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:28,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:28,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:28,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183167540] [2022-11-02 21:09:28,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183167540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:28,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:28,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:09:28,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098657744] [2022-11-02 21:09:28,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:28,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:09:28,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:28,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:09:28,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:09:28,978 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2022-11-02 21:09:28,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 307 transitions, 673 flow. Second operand has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:28,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:09:28,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2022-11-02 21:09:28,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:09:29,672 INFO L130 PetriNetUnfolder]: 575/3084 cut-off events. [2022-11-02 21:09:29,672 INFO L131 PetriNetUnfolder]: For 507/517 co-relation queries the response was YES. [2022-11-02 21:09:29,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4111 conditions, 3084 events. 575/3084 cut-off events. For 507/517 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 29395 event pairs, 178 based on Foata normal form. 8/2831 useless extension candidates. Maximal degree in co-relation 4103. Up to 375 conditions per place. [2022-11-02 21:09:29,713 INFO L137 encePairwiseOnDemand]: 327/332 looper letters, 46 selfloop transitions, 4 changer transitions 0/324 dead transitions. [2022-11-02 21:09:29,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 324 transitions, 829 flow [2022-11-02 21:09:29,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:09:29,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-02 21:09:29,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1218 transitions. [2022-11-02 21:09:29,718 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9171686746987951 [2022-11-02 21:09:29,718 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1218 transitions. [2022-11-02 21:09:29,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1218 transitions. [2022-11-02 21:09:29,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:09:29,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1218 transitions. [2022-11-02 21:09:29,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 304.5) internal successors, (1218), 4 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:29,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:29,728 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:29,728 INFO L175 Difference]: Start difference. First operand has 290 places, 307 transitions, 673 flow. Second operand 4 states and 1218 transitions. [2022-11-02 21:09:29,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 324 transitions, 829 flow [2022-11-02 21:09:29,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 324 transitions, 829 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 21:09:29,739 INFO L231 Difference]: Finished difference. Result has 295 places, 309 transitions, 705 flow [2022-11-02 21:09:29,740 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=705, PETRI_PLACES=295, PETRI_TRANSITIONS=309} [2022-11-02 21:09:29,741 INFO L287 CegarLoopForPetriNet]: 294 programPoint places, 1 predicate places. [2022-11-02 21:09:29,741 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 309 transitions, 705 flow [2022-11-02 21:09:29,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:29,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:09:29,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:29,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:09:29,743 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:09:29,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:29,744 INFO L85 PathProgramCache]: Analyzing trace with hash -381524703, now seen corresponding path program 1 times [2022-11-02 21:09:29,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:29,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31149774] [2022-11-02 21:09:29,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:29,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:29,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:29,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:29,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31149774] [2022-11-02 21:09:29,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31149774] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:30,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:30,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:09:30,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633198858] [2022-11-02 21:09:30,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:30,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:09:30,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:30,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:09:30,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:09:30,004 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 332 [2022-11-02 21:09:30,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 309 transitions, 705 flow. Second operand has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:30,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:09:30,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 332 [2022-11-02 21:09:30,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:09:30,213 INFO L130 PetriNetUnfolder]: 82/967 cut-off events. [2022-11-02 21:09:30,213 INFO L131 PetriNetUnfolder]: For 140/178 co-relation queries the response was YES. [2022-11-02 21:09:30,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1200 conditions, 967 events. 82/967 cut-off events. For 140/178 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 5927 event pairs, 11 based on Foata normal form. 2/897 useless extension candidates. Maximal degree in co-relation 1189. Up to 53 conditions per place. [2022-11-02 21:09:30,226 INFO L137 encePairwiseOnDemand]: 329/332 looper letters, 14 selfloop transitions, 2 changer transitions 0/315 dead transitions. [2022-11-02 21:09:30,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 315 transitions, 754 flow [2022-11-02 21:09:30,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:09:30,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:09:30,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 941 transitions. [2022-11-02 21:09:30,230 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9447791164658634 [2022-11-02 21:09:30,230 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 941 transitions. [2022-11-02 21:09:30,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 941 transitions. [2022-11-02 21:09:30,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:09:30,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 941 transitions. [2022-11-02 21:09:30,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 313.6666666666667) internal successors, (941), 3 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:30,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:30,237 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:30,237 INFO L175 Difference]: Start difference. First operand has 295 places, 309 transitions, 705 flow. Second operand 3 states and 941 transitions. [2022-11-02 21:09:30,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 315 transitions, 754 flow [2022-11-02 21:09:30,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 315 transitions, 752 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 21:09:30,245 INFO L231 Difference]: Finished difference. Result has 297 places, 309 transitions, 711 flow [2022-11-02 21:09:30,246 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=711, PETRI_PLACES=297, PETRI_TRANSITIONS=309} [2022-11-02 21:09:30,247 INFO L287 CegarLoopForPetriNet]: 294 programPoint places, 3 predicate places. [2022-11-02 21:09:30,247 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 309 transitions, 711 flow [2022-11-02 21:09:30,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:30,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:09:30,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:30,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:09:30,249 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:09:30,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:30,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1701335619, now seen corresponding path program 1 times [2022-11-02 21:09:30,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:30,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566391896] [2022-11-02 21:09:30,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:30,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:30,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:30,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:30,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566391896] [2022-11-02 21:09:30,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566391896] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:30,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:30,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:09:30,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758133670] [2022-11-02 21:09:30,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:30,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:09:30,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:30,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:09:30,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:09:30,539 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2022-11-02 21:09:30,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 309 transitions, 711 flow. Second operand has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:30,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:09:30,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2022-11-02 21:09:30,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:09:31,538 INFO L130 PetriNetUnfolder]: 750/4117 cut-off events. [2022-11-02 21:09:31,539 INFO L131 PetriNetUnfolder]: For 1151/1168 co-relation queries the response was YES. [2022-11-02 21:09:31,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5844 conditions, 4117 events. 750/4117 cut-off events. For 1151/1168 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 40863 event pairs, 289 based on Foata normal form. 14/3760 useless extension candidates. Maximal degree in co-relation 5832. Up to 428 conditions per place. [2022-11-02 21:09:31,590 INFO L137 encePairwiseOnDemand]: 324/332 looper letters, 68 selfloop transitions, 13 changer transitions 0/355 dead transitions. [2022-11-02 21:09:31,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 355 transitions, 1070 flow [2022-11-02 21:09:31,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:09:31,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 21:09:31,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1534 transitions. [2022-11-02 21:09:31,596 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9240963855421687 [2022-11-02 21:09:31,596 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1534 transitions. [2022-11-02 21:09:31,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1534 transitions. [2022-11-02 21:09:31,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:09:31,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1534 transitions. [2022-11-02 21:09:31,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 306.8) internal successors, (1534), 5 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:31,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:31,612 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:31,612 INFO L175 Difference]: Start difference. First operand has 297 places, 309 transitions, 711 flow. Second operand 5 states and 1534 transitions. [2022-11-02 21:09:31,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 355 transitions, 1070 flow [2022-11-02 21:09:31,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 355 transitions, 1066 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:09:31,640 INFO L231 Difference]: Finished difference. Result has 303 places, 320 transitions, 836 flow [2022-11-02 21:09:31,641 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=836, PETRI_PLACES=303, PETRI_TRANSITIONS=320} [2022-11-02 21:09:31,644 INFO L287 CegarLoopForPetriNet]: 294 programPoint places, 9 predicate places. [2022-11-02 21:09:31,644 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 320 transitions, 836 flow [2022-11-02 21:09:31,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:31,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:09:31,646 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:31,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:09:31,647 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:09:31,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:31,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1751840955, now seen corresponding path program 2 times [2022-11-02 21:09:31,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:31,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446172053] [2022-11-02 21:09:31,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:31,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:31,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:31,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:31,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446172053] [2022-11-02 21:09:31,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446172053] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:31,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:31,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:09:31,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323759682] [2022-11-02 21:09:31,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:31,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:09:31,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:31,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:09:31,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:09:31,954 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2022-11-02 21:09:31,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 320 transitions, 836 flow. Second operand has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:31,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:09:31,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2022-11-02 21:09:31,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:09:33,064 INFO L130 PetriNetUnfolder]: 761/4727 cut-off events. [2022-11-02 21:09:33,065 INFO L131 PetriNetUnfolder]: For 2208/2230 co-relation queries the response was YES. [2022-11-02 21:09:33,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7045 conditions, 4727 events. 761/4727 cut-off events. For 2208/2230 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 49359 event pairs, 229 based on Foata normal form. 20/4380 useless extension candidates. Maximal degree in co-relation 7030. Up to 358 conditions per place. [2022-11-02 21:09:33,115 INFO L137 encePairwiseOnDemand]: 326/332 looper letters, 82 selfloop transitions, 8 changer transitions 0/364 dead transitions. [2022-11-02 21:09:33,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 364 transitions, 1256 flow [2022-11-02 21:09:33,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:09:33,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 21:09:33,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1528 transitions. [2022-11-02 21:09:33,121 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9204819277108434 [2022-11-02 21:09:33,121 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1528 transitions. [2022-11-02 21:09:33,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1528 transitions. [2022-11-02 21:09:33,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:09:33,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1528 transitions. [2022-11-02 21:09:33,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 305.6) internal successors, (1528), 5 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:33,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:33,130 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:33,130 INFO L175 Difference]: Start difference. First operand has 303 places, 320 transitions, 836 flow. Second operand 5 states and 1528 transitions. [2022-11-02 21:09:33,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 364 transitions, 1256 flow [2022-11-02 21:09:33,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 364 transitions, 1256 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 21:09:33,148 INFO L231 Difference]: Finished difference. Result has 309 places, 324 transitions, 910 flow [2022-11-02 21:09:33,149 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=910, PETRI_PLACES=309, PETRI_TRANSITIONS=324} [2022-11-02 21:09:33,150 INFO L287 CegarLoopForPetriNet]: 294 programPoint places, 15 predicate places. [2022-11-02 21:09:33,151 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 324 transitions, 910 flow [2022-11-02 21:09:33,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:33,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:09:33,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:33,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:09:33,153 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:09:33,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:33,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1375543223, now seen corresponding path program 1 times [2022-11-02 21:09:33,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:33,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218969965] [2022-11-02 21:09:33,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:33,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:33,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:33,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:33,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218969965] [2022-11-02 21:09:33,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218969965] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:33,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:33,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:09:33,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471519508] [2022-11-02 21:09:33,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:33,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:09:33,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:33,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:09:33,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:09:33,322 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2022-11-02 21:09:33,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 324 transitions, 910 flow. Second operand has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:33,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:09:33,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2022-11-02 21:09:33,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:09:34,551 INFO L130 PetriNetUnfolder]: 688/4735 cut-off events. [2022-11-02 21:09:34,551 INFO L131 PetriNetUnfolder]: For 3237/3311 co-relation queries the response was YES. [2022-11-02 21:09:34,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7320 conditions, 4735 events. 688/4735 cut-off events. For 3237/3311 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 50747 event pairs, 268 based on Foata normal form. 30/4465 useless extension candidates. Maximal degree in co-relation 7302. Up to 580 conditions per place. [2022-11-02 21:09:34,617 INFO L137 encePairwiseOnDemand]: 323/332 looper letters, 69 selfloop transitions, 16 changer transitions 0/359 dead transitions. [2022-11-02 21:09:34,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 359 transitions, 1274 flow [2022-11-02 21:09:34,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:09:34,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 21:09:34,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1533 transitions. [2022-11-02 21:09:34,623 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9234939759036145 [2022-11-02 21:09:34,623 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1533 transitions. [2022-11-02 21:09:34,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1533 transitions. [2022-11-02 21:09:34,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:09:34,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1533 transitions. [2022-11-02 21:09:34,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 306.6) internal successors, (1533), 5 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:34,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:34,640 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:34,640 INFO L175 Difference]: Start difference. First operand has 309 places, 324 transitions, 910 flow. Second operand 5 states and 1533 transitions. [2022-11-02 21:09:34,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 359 transitions, 1274 flow [2022-11-02 21:09:34,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 359 transitions, 1256 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:09:34,660 INFO L231 Difference]: Finished difference. Result has 315 places, 333 transitions, 1067 flow [2022-11-02 21:09:34,661 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1067, PETRI_PLACES=315, PETRI_TRANSITIONS=333} [2022-11-02 21:09:34,664 INFO L287 CegarLoopForPetriNet]: 294 programPoint places, 21 predicate places. [2022-11-02 21:09:34,665 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 333 transitions, 1067 flow [2022-11-02 21:09:34,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:34,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:09:34,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:34,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:09:34,667 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:09:34,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:34,668 INFO L85 PathProgramCache]: Analyzing trace with hash -275089797, now seen corresponding path program 2 times [2022-11-02 21:09:34,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:34,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999104886] [2022-11-02 21:09:34,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:34,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:34,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:34,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:34,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999104886] [2022-11-02 21:09:34,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999104886] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:34,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:34,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:09:34,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888038957] [2022-11-02 21:09:34,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:34,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:09:34,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:34,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:09:34,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:09:34,840 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2022-11-02 21:09:34,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 333 transitions, 1067 flow. Second operand has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:34,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:09:34,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2022-11-02 21:09:34,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:09:36,282 INFO L130 PetriNetUnfolder]: 932/6119 cut-off events. [2022-11-02 21:09:36,282 INFO L131 PetriNetUnfolder]: For 5029/5139 co-relation queries the response was YES. [2022-11-02 21:09:36,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9383 conditions, 6119 events. 932/6119 cut-off events. For 5029/5139 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 69388 event pairs, 140 based on Foata normal form. 32/5675 useless extension candidates. Maximal degree in co-relation 9362. Up to 407 conditions per place. [2022-11-02 21:09:36,360 INFO L137 encePairwiseOnDemand]: 323/332 looper letters, 71 selfloop transitions, 31 changer transitions 0/376 dead transitions. [2022-11-02 21:09:36,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 376 transitions, 1590 flow [2022-11-02 21:09:36,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:09:36,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 21:09:36,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1533 transitions. [2022-11-02 21:09:36,364 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9234939759036145 [2022-11-02 21:09:36,365 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1533 transitions. [2022-11-02 21:09:36,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1533 transitions. [2022-11-02 21:09:36,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:09:36,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1533 transitions. [2022-11-02 21:09:36,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 306.6) internal successors, (1533), 5 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:36,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:36,374 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:36,374 INFO L175 Difference]: Start difference. First operand has 315 places, 333 transitions, 1067 flow. Second operand 5 states and 1533 transitions. [2022-11-02 21:09:36,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 376 transitions, 1590 flow [2022-11-02 21:09:36,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 376 transitions, 1586 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-11-02 21:09:36,402 INFO L231 Difference]: Finished difference. Result has 322 places, 353 transitions, 1414 flow [2022-11-02 21:09:36,402 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1063, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1414, PETRI_PLACES=322, PETRI_TRANSITIONS=353} [2022-11-02 21:09:36,404 INFO L287 CegarLoopForPetriNet]: 294 programPoint places, 28 predicate places. [2022-11-02 21:09:36,404 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 353 transitions, 1414 flow [2022-11-02 21:09:36,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:36,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:09:36,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:36,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:09:36,423 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:09:36,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:36,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1567290277, now seen corresponding path program 1 times [2022-11-02 21:09:36,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:36,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510927149] [2022-11-02 21:09:36,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:36,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:36,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:36,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:36,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510927149] [2022-11-02 21:09:36,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510927149] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:36,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:36,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:09:36,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207053045] [2022-11-02 21:09:36,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:36,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:09:36,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:36,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:09:36,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:09:36,650 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2022-11-02 21:09:36,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 353 transitions, 1414 flow. Second operand has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:36,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:09:36,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2022-11-02 21:09:36,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:09:38,006 INFO L130 PetriNetUnfolder]: 950/5884 cut-off events. [2022-11-02 21:09:38,007 INFO L131 PetriNetUnfolder]: For 8702/8748 co-relation queries the response was YES. [2022-11-02 21:09:38,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10262 conditions, 5884 events. 950/5884 cut-off events. For 8702/8748 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 66359 event pairs, 227 based on Foata normal form. 11/5428 useless extension candidates. Maximal degree in co-relation 10237. Up to 627 conditions per place. [2022-11-02 21:09:38,095 INFO L137 encePairwiseOnDemand]: 324/332 looper letters, 112 selfloop transitions, 38 changer transitions 0/424 dead transitions. [2022-11-02 21:09:38,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 424 transitions, 2388 flow [2022-11-02 21:09:38,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:09:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 21:09:38,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1533 transitions. [2022-11-02 21:09:38,101 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9234939759036145 [2022-11-02 21:09:38,101 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1533 transitions. [2022-11-02 21:09:38,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1533 transitions. [2022-11-02 21:09:38,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:09:38,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1533 transitions. [2022-11-02 21:09:38,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 306.6) internal successors, (1533), 5 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:38,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:38,110 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:38,110 INFO L175 Difference]: Start difference. First operand has 322 places, 353 transitions, 1414 flow. Second operand 5 states and 1533 transitions. [2022-11-02 21:09:38,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 424 transitions, 2388 flow [2022-11-02 21:09:38,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 424 transitions, 2340 flow, removed 24 selfloop flow, removed 0 redundant places. [2022-11-02 21:09:38,190 INFO L231 Difference]: Finished difference. Result has 330 places, 384 transitions, 1952 flow [2022-11-02 21:09:38,192 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1390, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1952, PETRI_PLACES=330, PETRI_TRANSITIONS=384} [2022-11-02 21:09:38,193 INFO L287 CegarLoopForPetriNet]: 294 programPoint places, 36 predicate places. [2022-11-02 21:09:38,193 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 384 transitions, 1952 flow [2022-11-02 21:09:38,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:38,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:09:38,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:38,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:09:38,196 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:09:38,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:38,196 INFO L85 PathProgramCache]: Analyzing trace with hash 414583221, now seen corresponding path program 3 times [2022-11-02 21:09:38,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:38,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123926367] [2022-11-02 21:09:38,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:38,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:38,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:38,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:38,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123926367] [2022-11-02 21:09:38,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123926367] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:38,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:38,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:09:38,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262474350] [2022-11-02 21:09:38,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:38,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:09:38,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:38,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:09:38,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:09:38,426 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2022-11-02 21:09:38,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 384 transitions, 1952 flow. Second operand has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:38,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:09:38,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2022-11-02 21:09:38,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:09:39,935 INFO L130 PetriNetUnfolder]: 1031/6674 cut-off events. [2022-11-02 21:09:39,935 INFO L131 PetriNetUnfolder]: For 10815/10891 co-relation queries the response was YES. [2022-11-02 21:09:40,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11482 conditions, 6674 events. 1031/6674 cut-off events. For 10815/10891 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 76436 event pairs, 253 based on Foata normal form. 35/6144 useless extension candidates. Maximal degree in co-relation 11453. Up to 446 conditions per place. [2022-11-02 21:09:40,033 INFO L137 encePairwiseOnDemand]: 322/332 looper letters, 134 selfloop transitions, 46 changer transitions 0/454 dead transitions. [2022-11-02 21:09:40,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 454 transitions, 2858 flow [2022-11-02 21:09:40,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:09:40,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 21:09:40,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2144 transitions. [2022-11-02 21:09:40,039 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9225473321858864 [2022-11-02 21:09:40,040 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2144 transitions. [2022-11-02 21:09:40,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2144 transitions. [2022-11-02 21:09:40,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:09:40,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2144 transitions. [2022-11-02 21:09:40,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 306.2857142857143) internal successors, (2144), 7 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:40,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:40,052 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:40,053 INFO L175 Difference]: Start difference. First operand has 330 places, 384 transitions, 1952 flow. Second operand 7 states and 2144 transitions. [2022-11-02 21:09:40,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 454 transitions, 2858 flow [2022-11-02 21:09:40,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 454 transitions, 2850 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-11-02 21:09:40,123 INFO L231 Difference]: Finished difference. Result has 341 places, 399 transitions, 2277 flow [2022-11-02 21:09:40,124 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1847, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2277, PETRI_PLACES=341, PETRI_TRANSITIONS=399} [2022-11-02 21:09:40,124 INFO L287 CegarLoopForPetriNet]: 294 programPoint places, 47 predicate places. [2022-11-02 21:09:40,125 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 399 transitions, 2277 flow [2022-11-02 21:09:40,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:40,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:09:40,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:40,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:09:40,127 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:09:40,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:40,127 INFO L85 PathProgramCache]: Analyzing trace with hash 104204731, now seen corresponding path program 3 times [2022-11-02 21:09:40,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:40,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140344668] [2022-11-02 21:09:40,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:40,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:40,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:40,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:40,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140344668] [2022-11-02 21:09:40,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140344668] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:40,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:40,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:09:40,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564042180] [2022-11-02 21:09:40,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:40,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:09:40,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:40,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:09:40,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:09:40,249 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2022-11-02 21:09:40,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 399 transitions, 2277 flow. Second operand has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:40,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:09:40,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2022-11-02 21:09:40,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:09:41,909 INFO L130 PetriNetUnfolder]: 1038/6895 cut-off events. [2022-11-02 21:09:41,910 INFO L131 PetriNetUnfolder]: For 12902/13026 co-relation queries the response was YES. [2022-11-02 21:09:41,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12072 conditions, 6895 events. 1038/6895 cut-off events. For 12902/13026 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 79912 event pairs, 133 based on Foata normal form. 16/6349 useless extension candidates. Maximal degree in co-relation 12038. Up to 515 conditions per place. [2022-11-02 21:09:41,984 INFO L137 encePairwiseOnDemand]: 324/332 looper letters, 120 selfloop transitions, 44 changer transitions 0/438 dead transitions. [2022-11-02 21:09:41,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 438 transitions, 2943 flow [2022-11-02 21:09:41,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:09:41,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 21:09:41,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1535 transitions. [2022-11-02 21:09:41,988 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9246987951807228 [2022-11-02 21:09:41,988 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1535 transitions. [2022-11-02 21:09:41,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1535 transitions. [2022-11-02 21:09:41,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:09:41,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1535 transitions. [2022-11-02 21:09:41,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:41,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:41,996 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:41,996 INFO L175 Difference]: Start difference. First operand has 341 places, 399 transitions, 2277 flow. Second operand 5 states and 1535 transitions. [2022-11-02 21:09:41,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 438 transitions, 2943 flow [2022-11-02 21:09:42,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 438 transitions, 2915 flow, removed 14 selfloop flow, removed 0 redundant places. [2022-11-02 21:09:42,081 INFO L231 Difference]: Finished difference. Result has 347 places, 404 transitions, 2445 flow [2022-11-02 21:09:42,082 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=2182, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2445, PETRI_PLACES=347, PETRI_TRANSITIONS=404} [2022-11-02 21:09:42,082 INFO L287 CegarLoopForPetriNet]: 294 programPoint places, 53 predicate places. [2022-11-02 21:09:42,082 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 404 transitions, 2445 flow [2022-11-02 21:09:42,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:42,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:09:42,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:42,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 21:09:42,084 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:09:42,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:42,084 INFO L85 PathProgramCache]: Analyzing trace with hash -750794757, now seen corresponding path program 1 times [2022-11-02 21:09:42,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:42,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737645544] [2022-11-02 21:09:42,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:42,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:42,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:42,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:42,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737645544] [2022-11-02 21:09:42,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737645544] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:42,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:42,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:09:42,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151113534] [2022-11-02 21:09:42,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:42,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:09:42,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:42,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:09:42,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:09:42,237 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 332 [2022-11-02 21:09:42,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 404 transitions, 2445 flow. Second operand has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:42,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:09:42,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 332 [2022-11-02 21:09:42,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:09:43,125 INFO L130 PetriNetUnfolder]: 737/5340 cut-off events. [2022-11-02 21:09:43,126 INFO L131 PetriNetUnfolder]: For 12150/13877 co-relation queries the response was YES. [2022-11-02 21:09:43,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8673 conditions, 5340 events. 737/5340 cut-off events. For 12150/13877 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 60559 event pairs, 165 based on Foata normal form. 59/4884 useless extension candidates. Maximal degree in co-relation 8636. Up to 482 conditions per place. [2022-11-02 21:09:43,165 INFO L137 encePairwiseOnDemand]: 329/332 looper letters, 12 selfloop transitions, 2 changer transitions 0/408 dead transitions. [2022-11-02 21:09:43,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 408 transitions, 2484 flow [2022-11-02 21:09:43,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:09:43,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:09:43,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 939 transitions. [2022-11-02 21:09:43,168 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9427710843373494 [2022-11-02 21:09:43,168 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 939 transitions. [2022-11-02 21:09:43,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 939 transitions. [2022-11-02 21:09:43,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:09:43,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 939 transitions. [2022-11-02 21:09:43,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 313.0) internal successors, (939), 3 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:43,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:43,173 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:43,173 INFO L175 Difference]: Start difference. First operand has 347 places, 404 transitions, 2445 flow. Second operand 3 states and 939 transitions. [2022-11-02 21:09:43,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 408 transitions, 2484 flow [2022-11-02 21:09:43,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 408 transitions, 2432 flow, removed 26 selfloop flow, removed 0 redundant places. [2022-11-02 21:09:43,225 INFO L231 Difference]: Finished difference. Result has 350 places, 404 transitions, 2401 flow [2022-11-02 21:09:43,226 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=2393, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2401, PETRI_PLACES=350, PETRI_TRANSITIONS=404} [2022-11-02 21:09:43,227 INFO L287 CegarLoopForPetriNet]: 294 programPoint places, 56 predicate places. [2022-11-02 21:09:43,227 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 404 transitions, 2401 flow [2022-11-02 21:09:43,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:43,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:09:43,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:43,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 21:09:43,228 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:09:43,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:43,229 INFO L85 PathProgramCache]: Analyzing trace with hash -241027713, now seen corresponding path program 1 times [2022-11-02 21:09:43,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:43,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449429063] [2022-11-02 21:09:43,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:43,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:43,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:43,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:43,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449429063] [2022-11-02 21:09:43,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449429063] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:43,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:43,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:09:43,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164041635] [2022-11-02 21:09:43,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:43,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:09:43,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:43,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:09:43,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:09:43,496 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 332 [2022-11-02 21:09:43,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 404 transitions, 2401 flow. Second operand has 6 states, 6 states have (on average 276.3333333333333) internal successors, (1658), 6 states have internal predecessors, (1658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:43,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:09:43,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 332 [2022-11-02 21:09:43,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:09:44,313 INFO L130 PetriNetUnfolder]: 363/3796 cut-off events. [2022-11-02 21:09:44,313 INFO L131 PetriNetUnfolder]: For 8946/10459 co-relation queries the response was YES. [2022-11-02 21:09:44,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6512 conditions, 3796 events. 363/3796 cut-off events. For 8946/10459 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 41155 event pairs, 22 based on Foata normal form. 101/3616 useless extension candidates. Maximal degree in co-relation 6473. Up to 387 conditions per place. [2022-11-02 21:09:44,354 INFO L137 encePairwiseOnDemand]: 326/332 looper letters, 48 selfloop transitions, 3 changer transitions 22/418 dead transitions. [2022-11-02 21:09:44,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 418 transitions, 2548 flow [2022-11-02 21:09:44,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:09:44,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 21:09:44,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1946 transitions. [2022-11-02 21:09:44,362 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8373493975903614 [2022-11-02 21:09:44,362 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1946 transitions. [2022-11-02 21:09:44,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1946 transitions. [2022-11-02 21:09:44,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:09:44,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1946 transitions. [2022-11-02 21:09:44,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 278.0) internal successors, (1946), 7 states have internal predecessors, (1946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:44,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:44,373 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:44,373 INFO L175 Difference]: Start difference. First operand has 350 places, 404 transitions, 2401 flow. Second operand 7 states and 1946 transitions. [2022-11-02 21:09:44,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 418 transitions, 2548 flow [2022-11-02 21:09:44,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 418 transitions, 2544 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:09:44,418 INFO L231 Difference]: Finished difference. Result has 359 places, 388 transitions, 2140 flow [2022-11-02 21:09:44,419 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=2397, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2140, PETRI_PLACES=359, PETRI_TRANSITIONS=388} [2022-11-02 21:09:44,420 INFO L287 CegarLoopForPetriNet]: 294 programPoint places, 65 predicate places. [2022-11-02 21:09:44,420 INFO L495 AbstractCegarLoop]: Abstraction has has 359 places, 388 transitions, 2140 flow [2022-11-02 21:09:44,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 276.3333333333333) internal successors, (1658), 6 states have internal predecessors, (1658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:44,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:09:44,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:44,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 21:09:44,422 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:09:44,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:44,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1183132561, now seen corresponding path program 1 times [2022-11-02 21:09:44,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:44,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727591266] [2022-11-02 21:09:44,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:44,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:44,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:44,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:44,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727591266] [2022-11-02 21:09:44,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727591266] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:44,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:44,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:09:44,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67993478] [2022-11-02 21:09:44,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:44,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:09:44,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:44,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:09:44,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:09:44,527 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2022-11-02 21:09:44,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 388 transitions, 2140 flow. Second operand has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:44,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:09:44,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2022-11-02 21:09:44,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:09:45,762 INFO L130 PetriNetUnfolder]: 910/6724 cut-off events. [2022-11-02 21:09:45,762 INFO L131 PetriNetUnfolder]: For 12527/12705 co-relation queries the response was YES. [2022-11-02 21:09:45,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12145 conditions, 6724 events. 910/6724 cut-off events. For 12527/12705 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 78201 event pairs, 258 based on Foata normal form. 12/6241 useless extension candidates. Maximal degree in co-relation 12101. Up to 792 conditions per place. [2022-11-02 21:09:45,811 INFO L137 encePairwiseOnDemand]: 323/332 looper letters, 117 selfloop transitions, 27 changer transitions 6/426 dead transitions. [2022-11-02 21:09:45,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 426 transitions, 2723 flow [2022-11-02 21:09:45,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:09:45,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 21:09:45,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1534 transitions. [2022-11-02 21:09:45,815 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9240963855421687 [2022-11-02 21:09:45,815 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1534 transitions. [2022-11-02 21:09:45,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1534 transitions. [2022-11-02 21:09:45,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:09:45,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1534 transitions. [2022-11-02 21:09:45,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 306.8) internal successors, (1534), 5 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:45,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:45,823 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:45,823 INFO L175 Difference]: Start difference. First operand has 359 places, 388 transitions, 2140 flow. Second operand 5 states and 1534 transitions. [2022-11-02 21:09:45,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 426 transitions, 2723 flow [2022-11-02 21:09:45,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 426 transitions, 2705 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-11-02 21:09:45,919 INFO L231 Difference]: Finished difference. Result has 361 places, 389 transitions, 2223 flow [2022-11-02 21:09:45,921 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=2087, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2223, PETRI_PLACES=361, PETRI_TRANSITIONS=389} [2022-11-02 21:09:45,921 INFO L287 CegarLoopForPetriNet]: 294 programPoint places, 67 predicate places. [2022-11-02 21:09:45,922 INFO L495 AbstractCegarLoop]: Abstraction has has 361 places, 389 transitions, 2223 flow [2022-11-02 21:09:45,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:45,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:09:45,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:45,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 21:09:45,923 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:09:45,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:45,923 INFO L85 PathProgramCache]: Analyzing trace with hash -620714805, now seen corresponding path program 1 times [2022-11-02 21:09:45,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:45,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900104339] [2022-11-02 21:09:45,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:45,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:46,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:46,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:46,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900104339] [2022-11-02 21:09:46,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900104339] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:46,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:46,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:09:46,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756980622] [2022-11-02 21:09:46,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:46,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:09:46,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:46,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:09:46,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:09:46,172 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 332 [2022-11-02 21:09:46,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 389 transitions, 2223 flow. Second operand has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:46,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:09:46,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 332 [2022-11-02 21:09:46,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:09:49,157 INFO L130 PetriNetUnfolder]: 3756/14333 cut-off events. [2022-11-02 21:09:49,157 INFO L131 PetriNetUnfolder]: For 13843/15400 co-relation queries the response was YES. [2022-11-02 21:09:49,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24861 conditions, 14333 events. 3756/14333 cut-off events. For 13843/15400 co-relation queries the response was YES. Maximal size of possible extension queue 799. Compared 182061 event pairs, 1625 based on Foata normal form. 247/13652 useless extension candidates. Maximal degree in co-relation 24817. Up to 4546 conditions per place. [2022-11-02 21:09:49,269 INFO L137 encePairwiseOnDemand]: 318/332 looper letters, 58 selfloop transitions, 20 changer transitions 6/423 dead transitions. [2022-11-02 21:09:49,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 423 transitions, 2486 flow [2022-11-02 21:09:49,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:09:49,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 21:09:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1915 transitions. [2022-11-02 21:09:49,274 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8240103270223752 [2022-11-02 21:09:49,274 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1915 transitions. [2022-11-02 21:09:49,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1915 transitions. [2022-11-02 21:09:49,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:09:49,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1915 transitions. [2022-11-02 21:09:49,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 273.57142857142856) internal successors, (1915), 7 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:49,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:49,284 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:49,285 INFO L175 Difference]: Start difference. First operand has 361 places, 389 transitions, 2223 flow. Second operand 7 states and 1915 transitions. [2022-11-02 21:09:49,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 423 transitions, 2486 flow [2022-11-02 21:09:49,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 423 transitions, 2467 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-11-02 21:09:49,377 INFO L231 Difference]: Finished difference. Result has 371 places, 406 transitions, 2357 flow [2022-11-02 21:09:49,378 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=2204, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2357, PETRI_PLACES=371, PETRI_TRANSITIONS=406} [2022-11-02 21:09:49,379 INFO L287 CegarLoopForPetriNet]: 294 programPoint places, 77 predicate places. [2022-11-02 21:09:49,379 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 406 transitions, 2357 flow [2022-11-02 21:09:49,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:49,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:09:49,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:49,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 21:09:49,380 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:09:49,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:49,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1028185905, now seen corresponding path program 1 times [2022-11-02 21:09:49,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:49,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229643160] [2022-11-02 21:09:49,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:49,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:49,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:49,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:49,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229643160] [2022-11-02 21:09:49,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229643160] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:49,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:49,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:09:49,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367043680] [2022-11-02 21:09:49,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:49,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:09:49,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:49,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:09:49,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:09:49,658 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 332 [2022-11-02 21:09:49,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 406 transitions, 2357 flow. Second operand has 6 states, 6 states have (on average 276.3333333333333) internal successors, (1658), 6 states have internal predecessors, (1658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:49,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:09:49,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 332 [2022-11-02 21:09:49,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:09:51,681 INFO L130 PetriNetUnfolder]: 1710/8302 cut-off events. [2022-11-02 21:09:51,681 INFO L131 PetriNetUnfolder]: For 8742/10581 co-relation queries the response was YES. [2022-11-02 21:09:51,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16233 conditions, 8302 events. 1710/8302 cut-off events. For 8742/10581 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 101229 event pairs, 443 based on Foata normal form. 152/7806 useless extension candidates. Maximal degree in co-relation 16184. Up to 1298 conditions per place. [2022-11-02 21:09:51,760 INFO L137 encePairwiseOnDemand]: 326/332 looper letters, 43 selfloop transitions, 4 changer transitions 20/416 dead transitions. [2022-11-02 21:09:51,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 416 transitions, 2498 flow [2022-11-02 21:09:51,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:09:51,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 21:09:51,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1944 transitions. [2022-11-02 21:09:51,766 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8364888123924269 [2022-11-02 21:09:51,766 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1944 transitions. [2022-11-02 21:09:51,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1944 transitions. [2022-11-02 21:09:51,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:09:51,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1944 transitions. [2022-11-02 21:09:51,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 277.7142857142857) internal successors, (1944), 7 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:51,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:51,778 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:51,778 INFO L175 Difference]: Start difference. First operand has 371 places, 406 transitions, 2357 flow. Second operand 7 states and 1944 transitions. [2022-11-02 21:09:51,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 416 transitions, 2498 flow [2022-11-02 21:09:51,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 416 transitions, 2492 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-02 21:09:51,836 INFO L231 Difference]: Finished difference. Result has 376 places, 393 transitions, 2166 flow [2022-11-02 21:09:51,837 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=2353, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2166, PETRI_PLACES=376, PETRI_TRANSITIONS=393} [2022-11-02 21:09:51,837 INFO L287 CegarLoopForPetriNet]: 294 programPoint places, 82 predicate places. [2022-11-02 21:09:51,838 INFO L495 AbstractCegarLoop]: Abstraction has has 376 places, 393 transitions, 2166 flow [2022-11-02 21:09:51,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 276.3333333333333) internal successors, (1658), 6 states have internal predecessors, (1658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:51,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:09:51,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:51,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 21:09:51,839 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:09:51,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:51,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1326058229, now seen corresponding path program 1 times [2022-11-02 21:09:51,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:51,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659714721] [2022-11-02 21:09:51,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:51,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:52,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:52,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:52,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659714721] [2022-11-02 21:09:52,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659714721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:52,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:52,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:09:52,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875011240] [2022-11-02 21:09:52,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:52,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:09:52,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:52,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:09:52,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:09:52,199 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 332 [2022-11-02 21:09:52,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 393 transitions, 2166 flow. Second operand has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:52,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:09:52,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 332 [2022-11-02 21:09:52,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:09:55,824 INFO L130 PetriNetUnfolder]: 3882/15641 cut-off events. [2022-11-02 21:09:55,824 INFO L131 PetriNetUnfolder]: For 21351/24732 co-relation queries the response was YES. [2022-11-02 21:09:55,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33283 conditions, 15641 events. 3882/15641 cut-off events. For 21351/24732 co-relation queries the response was YES. Maximal size of possible extension queue 874. Compared 205571 event pairs, 1448 based on Foata normal form. 501/15245 useless extension candidates. Maximal degree in co-relation 33232. Up to 3966 conditions per place. [2022-11-02 21:09:55,976 INFO L137 encePairwiseOnDemand]: 324/332 looper letters, 94 selfloop transitions, 7 changer transitions 15/444 dead transitions. [2022-11-02 21:09:55,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 444 transitions, 2655 flow [2022-11-02 21:09:55,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:09:55,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-02 21:09:55,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2177 transitions. [2022-11-02 21:09:55,982 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8196536144578314 [2022-11-02 21:09:55,983 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2177 transitions. [2022-11-02 21:09:55,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2177 transitions. [2022-11-02 21:09:55,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:09:55,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2177 transitions. [2022-11-02 21:09:55,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 272.125) internal successors, (2177), 8 states have internal predecessors, (2177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:55,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 332.0) internal successors, (2988), 9 states have internal predecessors, (2988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:55,999 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 332.0) internal successors, (2988), 9 states have internal predecessors, (2988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:55,999 INFO L175 Difference]: Start difference. First operand has 376 places, 393 transitions, 2166 flow. Second operand 8 states and 2177 transitions. [2022-11-02 21:09:55,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 444 transitions, 2655 flow [2022-11-02 21:09:56,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 444 transitions, 2644 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-11-02 21:09:56,136 INFO L231 Difference]: Finished difference. Result has 383 places, 395 transitions, 2184 flow [2022-11-02 21:09:56,137 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=2157, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2184, PETRI_PLACES=383, PETRI_TRANSITIONS=395} [2022-11-02 21:09:56,137 INFO L287 CegarLoopForPetriNet]: 294 programPoint places, 89 predicate places. [2022-11-02 21:09:56,137 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 395 transitions, 2184 flow [2022-11-02 21:09:56,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:56,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:09:56,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:56,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 21:09:56,138 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:09:56,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:56,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1814667815, now seen corresponding path program 2 times [2022-11-02 21:09:56,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:56,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934347613] [2022-11-02 21:09:56,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:56,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:56,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:56,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:56,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934347613] [2022-11-02 21:09:56,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934347613] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:56,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:56,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:09:56,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106884710] [2022-11-02 21:09:56,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:56,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:09:56,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:56,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:09:56,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:09:56,241 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2022-11-02 21:09:56,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 395 transitions, 2184 flow. Second operand has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:56,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:09:56,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2022-11-02 21:09:56,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:09:58,646 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([929] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem38#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} AuxVars[] AssignedVars[][393], [Black: 501#(<= (+ ~res2~0 1) 0), 451#true, Black: 511#(and (<= (+ ~res2~0 1) 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 381#(<= ~count2~0 ~count3~0), Black: 380#(<= ~count1~0 ~count3~0), Black: 500#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), Black: 506#(and (<= (+ ~res2~0 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0)), Black: 509#(and (<= (+ ~res2~0 1) 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 79#L124-2true, 366#true, Black: 395#(and (not (= ~count3~0 ~count2~0)) (<= ~count1~0 ~count2~0) (<= (+ ~count1~0 1) ~count3~0)), Black: 389#true, Black: 392#(and (not (= ~count3~0 ~count2~0)) (or (<= ~count1~0 ~count2~0) (not (<= (+ ~count2~0 1) ~count3~0)))), Black: 408#(and (not (= ~count2~0 ~count1~0)) (<= (+ ~count3~0 1) ~count2~0)), Black: 406#(<= (+ ~count3~0 1) ~count2~0), Black: 405#(<= (+ ~count1~0 1) ~count2~0), 463#true, Black: 420#(<= ~count2~0 ~count3~0), Black: 419#(<= ~count2~0 ~count1~0), 383#(and (<= ~count1~0 ~count3~0) (<= ~count2~0 ~count3~0)), 346#(or (not (<= (+ ~count1~0 1) ~count2~0)) (<= ~count2~0 ~count3~0)), 391#(or (<= ~count1~0 ~count2~0) (not (<= (+ ~count2~0 1) ~count3~0))), 332#(<= ~count1~0 ~count3~0), 518#true, Black: 435#(<= (+ ~res1~0 1) 0), Black: 316#(= thread2Thread1of1ForFork2_~stop~1 0), 89#L89true, Black: 434#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), Black: 439#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 322#(<= (+ ~count3~0 1) ~count1~0), Black: 324#(and (<= (+ ~count3~0 1) ~count1~0) (<= ~count2~0 ~count1~0)), 321#(<= ~count2~0 ~count1~0), Black: 456#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count3~0 1) ~count1~0)), 498#true, Black: 454#(<= (+ ~count3~0 1) ~count1~0), Black: 453#(<= (+ ~count2~0 1) ~count1~0), Black: 335#(and (<= ~count1~0 ~count3~0) (<= (+ ~count1~0 1) ~count2~0)), Black: 341#(= thread1Thread1of1ForFork1_~stop~0 0), Black: 466#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 470#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (= |thread3Thread1of1ForFork0_#t~ite21| 1)), Black: 465#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 350#(and (<= ~count2~0 ~count3~0) (<= (+ ~count1~0 1) ~count3~0) (not (= ~count2~0 ~count1~0))), Black: 347#(and (or (not (<= (+ ~count1~0 1) ~count2~0)) (<= ~count2~0 ~count3~0)) (not (= ~count2~0 ~count1~0))), Black: 344#true, 422#(and (<= ~count2~0 ~count3~0) (<= ~count2~0 ~count1~0)), Black: 359#(<= (+ ~count1~0 1) ~count2~0), 311#true, Black: 485#(= ~res3~0 1), Black: 369#(<= (+ ~count3~0 1) ~count1~0), Black: 368#(<= (+ ~count3~0 1) ~count2~0), Black: 371#(and (<= (+ ~count3~0 1) ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), 402#true]) [2022-11-02 21:09:58,647 INFO L383 tUnfolder$Statistics]: this new event has 195 ancestors and is cut-off event [2022-11-02 21:09:58,647 INFO L386 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-11-02 21:09:58,647 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-02 21:09:58,647 INFO L386 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-11-02 21:09:58,656 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([929] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem38#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} AuxVars[] AssignedVars[][393], [Black: 501#(<= (+ ~res2~0 1) 0), 451#true, Black: 511#(and (<= (+ ~res2~0 1) 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 381#(<= ~count2~0 ~count3~0), Black: 500#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), Black: 380#(<= ~count1~0 ~count3~0), Black: 506#(and (<= (+ ~res2~0 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0)), Black: 509#(and (<= (+ ~res2~0 1) 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 79#L124-2true, 366#true, Black: 395#(and (not (= ~count3~0 ~count2~0)) (<= ~count1~0 ~count2~0) (<= (+ ~count1~0 1) ~count3~0)), Black: 389#true, Black: 392#(and (not (= ~count3~0 ~count2~0)) (or (<= ~count1~0 ~count2~0) (not (<= (+ ~count2~0 1) ~count3~0)))), Black: 408#(and (not (= ~count2~0 ~count1~0)) (<= (+ ~count3~0 1) ~count2~0)), Black: 406#(<= (+ ~count3~0 1) ~count2~0), Black: 405#(<= (+ ~count1~0 1) ~count2~0), 463#true, Black: 420#(<= ~count2~0 ~count3~0), Black: 419#(<= ~count2~0 ~count1~0), 383#(and (<= ~count1~0 ~count3~0) (<= ~count2~0 ~count3~0)), 346#(or (not (<= (+ ~count1~0 1) ~count2~0)) (<= ~count2~0 ~count3~0)), 391#(or (<= ~count1~0 ~count2~0) (not (<= (+ ~count2~0 1) ~count3~0))), 332#(<= ~count1~0 ~count3~0), 518#true, Black: 435#(<= (+ ~res1~0 1) 0), Black: 316#(= thread2Thread1of1ForFork2_~stop~1 0), Black: 434#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), Black: 439#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 322#(<= (+ ~count3~0 1) ~count1~0), Black: 324#(and (<= (+ ~count3~0 1) ~count1~0) (<= ~count2~0 ~count1~0)), 321#(<= ~count2~0 ~count1~0), Black: 456#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count3~0 1) ~count1~0)), 498#true, 87#L100-3true, Black: 454#(<= (+ ~count3~0 1) ~count1~0), Black: 453#(<= (+ ~count2~0 1) ~count1~0), Black: 335#(and (<= ~count1~0 ~count3~0) (<= (+ ~count1~0 1) ~count2~0)), Black: 341#(= thread1Thread1of1ForFork1_~stop~0 0), Black: 466#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 470#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (= |thread3Thread1of1ForFork0_#t~ite21| 1)), Black: 350#(and (<= ~count2~0 ~count3~0) (<= (+ ~count1~0 1) ~count3~0) (not (= ~count2~0 ~count1~0))), Black: 465#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 347#(and (or (not (<= (+ ~count1~0 1) ~count2~0)) (<= ~count2~0 ~count3~0)) (not (= ~count2~0 ~count1~0))), Black: 344#true, Black: 359#(<= (+ ~count1~0 1) ~count2~0), 422#(and (<= ~count2~0 ~count3~0) (<= ~count2~0 ~count1~0)), 311#true, Black: 485#(= ~res3~0 1), Black: 369#(<= (+ ~count3~0 1) ~count1~0), Black: 368#(<= (+ ~count3~0 1) ~count2~0), Black: 371#(and (<= (+ ~count3~0 1) ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), 402#true]) [2022-11-02 21:09:58,656 INFO L383 tUnfolder$Statistics]: this new event has 194 ancestors and is cut-off event [2022-11-02 21:09:58,656 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-11-02 21:09:58,656 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-02 21:09:58,656 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-02 21:09:58,657 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([929] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem38#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} AuxVars[] AssignedVars[][393], [Black: 501#(<= (+ ~res2~0 1) 0), Black: 511#(and (<= (+ ~res2~0 1) 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 500#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), Black: 380#(<= ~count1~0 ~count3~0), Black: 506#(and (<= (+ ~res2~0 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0)), Black: 383#(and (<= ~count1~0 ~count3~0) (<= ~count2~0 ~count3~0)), Black: 509#(and (<= (+ ~res2~0 1) 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 79#L124-2true, Black: 395#(and (not (= ~count3~0 ~count2~0)) (<= ~count1~0 ~count2~0) (<= (+ ~count1~0 1) ~count3~0)), Black: 389#true, Black: 392#(and (not (= ~count3~0 ~count2~0)) (or (<= ~count1~0 ~count2~0) (not (<= (+ ~count2~0 1) ~count3~0)))), Black: 408#(and (not (= ~count2~0 ~count1~0)) (<= (+ ~count3~0 1) ~count2~0)), Black: 406#(<= (+ ~count3~0 1) ~count2~0), Black: 405#(<= (+ ~count1~0 1) ~count2~0), 369#(<= (+ ~count3~0 1) ~count1~0), 463#true, Black: 420#(<= ~count2~0 ~count3~0), Black: 419#(<= ~count2~0 ~count1~0), 346#(or (not (<= (+ ~count1~0 1) ~count2~0)) (<= ~count2~0 ~count3~0)), 324#(and (<= (+ ~count3~0 1) ~count1~0) (<= ~count2~0 ~count1~0)), 391#(or (<= ~count1~0 ~count2~0) (not (<= (+ ~count2~0 1) ~count3~0))), 518#true, Black: 435#(<= (+ ~res1~0 1) 0), Black: 316#(= thread2Thread1of1ForFork2_~stop~1 0), Black: 434#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), Black: 439#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 322#(<= (+ ~count3~0 1) ~count1~0), Black: 321#(<= ~count2~0 ~count1~0), Black: 451#true, Black: 456#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count3~0 1) ~count1~0)), 498#true, Black: 453#(<= (+ ~count2~0 1) ~count1~0), Black: 332#(<= ~count1~0 ~count3~0), Black: 335#(and (<= ~count1~0 ~count3~0) (<= (+ ~count1~0 1) ~count2~0)), Black: 341#(= thread1Thread1of1ForFork1_~stop~0 0), Black: 466#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 470#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (= |thread3Thread1of1ForFork0_#t~ite21| 1)), 256#L100-1true, Black: 350#(and (<= ~count2~0 ~count3~0) (<= (+ ~count1~0 1) ~count3~0) (not (= ~count2~0 ~count1~0))), Black: 465#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 347#(and (or (not (<= (+ ~count1~0 1) ~count2~0)) (<= ~count2~0 ~count3~0)) (not (= ~count2~0 ~count1~0))), Black: 344#true, Black: 359#(<= (+ ~count1~0 1) ~count2~0), 454#(<= (+ ~count3~0 1) ~count1~0), 422#(and (<= ~count2~0 ~count3~0) (<= ~count2~0 ~count1~0)), 311#true, Black: 485#(= ~res3~0 1), 381#(<= ~count2~0 ~count3~0), Black: 368#(<= (+ ~count3~0 1) ~count2~0), Black: 366#true, Black: 371#(and (<= (+ ~count3~0 1) ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), 402#true]) [2022-11-02 21:09:58,657 INFO L383 tUnfolder$Statistics]: this new event has 194 ancestors and is cut-off event [2022-11-02 21:09:58,657 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-11-02 21:09:58,657 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-02 21:09:58,657 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-02 21:09:58,707 INFO L130 PetriNetUnfolder]: 1565/10190 cut-off events. [2022-11-02 21:09:58,707 INFO L131 PetriNetUnfolder]: For 15616/17010 co-relation queries the response was YES. [2022-11-02 21:09:58,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21068 conditions, 10190 events. 1565/10190 cut-off events. For 15616/17010 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 131885 event pairs, 564 based on Foata normal form. 122/9477 useless extension candidates. Maximal degree in co-relation 21014. Up to 1317 conditions per place. [2022-11-02 21:09:58,811 INFO L137 encePairwiseOnDemand]: 328/332 looper letters, 79 selfloop transitions, 9 changer transitions 31/412 dead transitions. [2022-11-02 21:09:58,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 412 transitions, 2533 flow [2022-11-02 21:09:58,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:09:58,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-02 21:09:58,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1218 transitions. [2022-11-02 21:09:58,817 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9171686746987951 [2022-11-02 21:09:58,817 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1218 transitions. [2022-11-02 21:09:58,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1218 transitions. [2022-11-02 21:09:58,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:09:58,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1218 transitions. [2022-11-02 21:09:58,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 304.5) internal successors, (1218), 4 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:58,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:58,827 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:58,827 INFO L175 Difference]: Start difference. First operand has 383 places, 395 transitions, 2184 flow. Second operand 4 states and 1218 transitions. [2022-11-02 21:09:58,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 412 transitions, 2533 flow [2022-11-02 21:09:59,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 412 transitions, 2512 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-11-02 21:09:59,006 INFO L231 Difference]: Finished difference. Result has 380 places, 371 transitions, 1821 flow [2022-11-02 21:09:59,006 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=2147, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1821, PETRI_PLACES=380, PETRI_TRANSITIONS=371} [2022-11-02 21:09:59,007 INFO L287 CegarLoopForPetriNet]: 294 programPoint places, 86 predicate places. [2022-11-02 21:09:59,007 INFO L495 AbstractCegarLoop]: Abstraction has has 380 places, 371 transitions, 1821 flow [2022-11-02 21:09:59,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:59,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:09:59,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:59,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 21:09:59,009 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:09:59,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:59,010 INFO L85 PathProgramCache]: Analyzing trace with hash 73390781, now seen corresponding path program 1 times [2022-11-02 21:09:59,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:59,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386876306] [2022-11-02 21:09:59,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:59,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:59,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:59,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386876306] [2022-11-02 21:09:59,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386876306] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:59,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:59,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:09:59,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202338560] [2022-11-02 21:09:59,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:59,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:09:59,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:59,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:09:59,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:09:59,148 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2022-11-02 21:09:59,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 371 transitions, 1821 flow. Second operand has 4 states, 4 states have (on average 298.25) internal successors, (1193), 4 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:59,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:09:59,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2022-11-02 21:09:59,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:10:01,019 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([929] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem38#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} AuxVars[] AssignedVars[][379], [Black: 501#(<= (+ ~res2~0 1) 0), 451#true, Black: 381#(<= ~count2~0 ~count3~0), Black: 500#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), Black: 380#(<= ~count1~0 ~count3~0), Black: 506#(and (<= (+ ~res2~0 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0)), 79#L124-2true, 366#true, Black: 520#(<= (+ ~count2~0 1) ~count1~0), Black: 395#(and (not (= ~count3~0 ~count2~0)) (<= ~count1~0 ~count2~0) (<= (+ ~count1~0 1) ~count3~0)), Black: 389#true, Black: 392#(and (not (= ~count3~0 ~count2~0)) (or (<= ~count1~0 ~count2~0) (not (<= (+ ~count2~0 1) ~count3~0)))), Black: 408#(and (not (= ~count2~0 ~count1~0)) (<= (+ ~count3~0 1) ~count2~0)), Black: 406#(<= (+ ~count3~0 1) ~count2~0), Black: 405#(<= (+ ~count1~0 1) ~count2~0), 463#true, Black: 420#(<= ~count2~0 ~count3~0), Black: 419#(<= ~count2~0 ~count1~0), 383#(and (<= ~count1~0 ~count3~0) (<= ~count2~0 ~count3~0)), 346#(or (not (<= (+ ~count1~0 1) ~count2~0)) (<= ~count2~0 ~count3~0)), 391#(or (<= ~count1~0 ~count2~0) (not (<= (+ ~count2~0 1) ~count3~0))), 332#(<= ~count1~0 ~count3~0), 518#true, 531#(and (<= ~count3~0 ~count2~0) (<= ~count1~0 ~count2~0)), Black: 435#(<= (+ ~res1~0 1) 0), 89#L89true, Black: 316#(= thread2Thread1of1ForFork2_~stop~1 0), Black: 434#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), Black: 439#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 322#(<= (+ ~count3~0 1) ~count1~0), Black: 324#(and (<= (+ ~count3~0 1) ~count1~0) (<= ~count2~0 ~count1~0)), 321#(<= ~count2~0 ~count1~0), Black: 456#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count3~0 1) ~count1~0)), Black: 454#(<= (+ ~count3~0 1) ~count1~0), Black: 335#(and (<= ~count1~0 ~count3~0) (<= (+ ~count1~0 1) ~count2~0)), Black: 341#(= thread1Thread1of1ForFork1_~stop~0 0), Black: 466#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 470#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (= |thread3Thread1of1ForFork0_#t~ite21| 1)), Black: 465#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 350#(and (<= ~count2~0 ~count3~0) (<= (+ ~count1~0 1) ~count3~0) (not (= ~count2~0 ~count1~0))), Black: 347#(and (or (not (<= (+ ~count1~0 1) ~count2~0)) (<= ~count2~0 ~count3~0)) (not (= ~count2~0 ~count1~0))), Black: 344#true, Black: 359#(<= (+ ~count1~0 1) ~count2~0), 422#(and (<= ~count2~0 ~count3~0) (<= ~count2~0 ~count1~0)), 311#true, Black: 485#(= ~res3~0 1), Black: 369#(<= (+ ~count3~0 1) ~count1~0), Black: 368#(<= (+ ~count3~0 1) ~count2~0), Black: 371#(and (<= (+ ~count3~0 1) ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), 402#true]) [2022-11-02 21:10:01,020 INFO L383 tUnfolder$Statistics]: this new event has 195 ancestors and is cut-off event [2022-11-02 21:10:01,020 INFO L386 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-11-02 21:10:01,020 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-02 21:10:01,020 INFO L386 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-11-02 21:10:01,025 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([929] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem38#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} AuxVars[] AssignedVars[][379], [Black: 501#(<= (+ ~res2~0 1) 0), 451#true, Black: 381#(<= ~count2~0 ~count3~0), Black: 500#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), Black: 380#(<= ~count1~0 ~count3~0), Black: 506#(and (<= (+ ~res2~0 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0)), 79#L124-2true, 366#true, Black: 520#(<= (+ ~count2~0 1) ~count1~0), Black: 395#(and (not (= ~count3~0 ~count2~0)) (<= ~count1~0 ~count2~0) (<= (+ ~count1~0 1) ~count3~0)), Black: 389#true, Black: 392#(and (not (= ~count3~0 ~count2~0)) (or (<= ~count1~0 ~count2~0) (not (<= (+ ~count2~0 1) ~count3~0)))), Black: 408#(and (not (= ~count2~0 ~count1~0)) (<= (+ ~count3~0 1) ~count2~0)), Black: 406#(<= (+ ~count3~0 1) ~count2~0), Black: 405#(<= (+ ~count1~0 1) ~count2~0), 463#true, Black: 420#(<= ~count2~0 ~count3~0), Black: 419#(<= ~count2~0 ~count1~0), 383#(and (<= ~count1~0 ~count3~0) (<= ~count2~0 ~count3~0)), 346#(or (not (<= (+ ~count1~0 1) ~count2~0)) (<= ~count2~0 ~count3~0)), 391#(or (<= ~count1~0 ~count2~0) (not (<= (+ ~count2~0 1) ~count3~0))), 332#(<= ~count1~0 ~count3~0), 518#true, 531#(and (<= ~count3~0 ~count2~0) (<= ~count1~0 ~count2~0)), Black: 435#(<= (+ ~res1~0 1) 0), Black: 316#(= thread2Thread1of1ForFork2_~stop~1 0), Black: 434#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), Black: 439#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 322#(<= (+ ~count3~0 1) ~count1~0), Black: 324#(and (<= (+ ~count3~0 1) ~count1~0) (<= ~count2~0 ~count1~0)), 321#(<= ~count2~0 ~count1~0), Black: 456#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count3~0 1) ~count1~0)), Black: 454#(<= (+ ~count3~0 1) ~count1~0), 87#L100-3true, Black: 335#(and (<= ~count1~0 ~count3~0) (<= (+ ~count1~0 1) ~count2~0)), Black: 341#(= thread1Thread1of1ForFork1_~stop~0 0), Black: 466#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 470#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (= |thread3Thread1of1ForFork0_#t~ite21| 1)), Black: 350#(and (<= ~count2~0 ~count3~0) (<= (+ ~count1~0 1) ~count3~0) (not (= ~count2~0 ~count1~0))), Black: 465#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 347#(and (or (not (<= (+ ~count1~0 1) ~count2~0)) (<= ~count2~0 ~count3~0)) (not (= ~count2~0 ~count1~0))), Black: 344#true, 422#(and (<= ~count2~0 ~count3~0) (<= ~count2~0 ~count1~0)), Black: 359#(<= (+ ~count1~0 1) ~count2~0), 311#true, Black: 485#(= ~res3~0 1), Black: 369#(<= (+ ~count3~0 1) ~count1~0), Black: 368#(<= (+ ~count3~0 1) ~count2~0), Black: 371#(and (<= (+ ~count3~0 1) ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), 402#true]) [2022-11-02 21:10:01,025 INFO L383 tUnfolder$Statistics]: this new event has 194 ancestors and is cut-off event [2022-11-02 21:10:01,025 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-02 21:10:01,025 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-11-02 21:10:01,025 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-02 21:10:01,025 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([929] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem38#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} AuxVars[] AssignedVars[][379], [Black: 501#(<= (+ ~res2~0 1) 0), Black: 500#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), Black: 380#(<= ~count1~0 ~count3~0), Black: 506#(and (<= (+ ~res2~0 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0)), Black: 383#(and (<= ~count1~0 ~count3~0) (<= ~count2~0 ~count3~0)), 79#L124-2true, Black: 520#(<= (+ ~count2~0 1) ~count1~0), Black: 395#(and (not (= ~count3~0 ~count2~0)) (<= ~count1~0 ~count2~0) (<= (+ ~count1~0 1) ~count3~0)), Black: 389#true, Black: 392#(and (not (= ~count3~0 ~count2~0)) (or (<= ~count1~0 ~count2~0) (not (<= (+ ~count2~0 1) ~count3~0)))), Black: 408#(and (not (= ~count2~0 ~count1~0)) (<= (+ ~count3~0 1) ~count2~0)), Black: 406#(<= (+ ~count3~0 1) ~count2~0), Black: 405#(<= (+ ~count1~0 1) ~count2~0), 369#(<= (+ ~count3~0 1) ~count1~0), 463#true, Black: 420#(<= ~count2~0 ~count3~0), Black: 419#(<= ~count2~0 ~count1~0), 346#(or (not (<= (+ ~count1~0 1) ~count2~0)) (<= ~count2~0 ~count3~0)), 324#(and (<= (+ ~count3~0 1) ~count1~0) (<= ~count2~0 ~count1~0)), 391#(or (<= ~count1~0 ~count2~0) (not (<= (+ ~count2~0 1) ~count3~0))), 518#true, 531#(and (<= ~count3~0 ~count2~0) (<= ~count1~0 ~count2~0)), Black: 435#(<= (+ ~res1~0 1) 0), Black: 316#(= thread2Thread1of1ForFork2_~stop~1 0), Black: 434#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), Black: 439#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 322#(<= (+ ~count3~0 1) ~count1~0), Black: 321#(<= ~count2~0 ~count1~0), Black: 451#true, Black: 456#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count3~0 1) ~count1~0)), Black: 332#(<= ~count1~0 ~count3~0), Black: 335#(and (<= ~count1~0 ~count3~0) (<= (+ ~count1~0 1) ~count2~0)), Black: 341#(= thread1Thread1of1ForFork1_~stop~0 0), Black: 466#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), 256#L100-1true, Black: 470#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (= |thread3Thread1of1ForFork0_#t~ite21| 1)), Black: 350#(and (<= ~count2~0 ~count3~0) (<= (+ ~count1~0 1) ~count3~0) (not (= ~count2~0 ~count1~0))), Black: 465#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 347#(and (or (not (<= (+ ~count1~0 1) ~count2~0)) (<= ~count2~0 ~count3~0)) (not (= ~count2~0 ~count1~0))), Black: 344#true, 422#(and (<= ~count2~0 ~count3~0) (<= ~count2~0 ~count1~0)), Black: 359#(<= (+ ~count1~0 1) ~count2~0), 454#(<= (+ ~count3~0 1) ~count1~0), 311#true, Black: 485#(= ~res3~0 1), 381#(<= ~count2~0 ~count3~0), Black: 368#(<= (+ ~count3~0 1) ~count2~0), Black: 366#true, Black: 371#(and (<= (+ ~count3~0 1) ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), 402#true]) [2022-11-02 21:10:01,026 INFO L383 tUnfolder$Statistics]: this new event has 194 ancestors and is cut-off event [2022-11-02 21:10:01,026 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-11-02 21:10:01,026 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-02 21:10:01,026 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-02 21:10:01,065 INFO L130 PetriNetUnfolder]: 1076/7448 cut-off events. [2022-11-02 21:10:01,065 INFO L131 PetriNetUnfolder]: For 10388/11425 co-relation queries the response was YES. [2022-11-02 21:10:01,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14820 conditions, 7448 events. 1076/7448 cut-off events. For 10388/11425 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 90751 event pairs, 274 based on Foata normal form. 41/6906 useless extension candidates. Maximal degree in co-relation 14768. Up to 882 conditions per place. [2022-11-02 21:10:01,131 INFO L137 encePairwiseOnDemand]: 324/332 looper letters, 71 selfloop transitions, 33 changer transitions 3/400 dead transitions. [2022-11-02 21:10:01,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 400 transitions, 2240 flow [2022-11-02 21:10:01,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:10:01,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 21:10:01,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1534 transitions. [2022-11-02 21:10:01,135 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9240963855421687 [2022-11-02 21:10:01,135 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1534 transitions. [2022-11-02 21:10:01,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1534 transitions. [2022-11-02 21:10:01,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:10:01,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1534 transitions. [2022-11-02 21:10:01,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 306.8) internal successors, (1534), 5 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:01,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:01,144 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:01,145 INFO L175 Difference]: Start difference. First operand has 380 places, 371 transitions, 1821 flow. Second operand 5 states and 1534 transitions. [2022-11-02 21:10:01,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 400 transitions, 2240 flow [2022-11-02 21:10:01,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 400 transitions, 2163 flow, removed 24 selfloop flow, removed 5 redundant places. [2022-11-02 21:10:01,241 INFO L231 Difference]: Finished difference. Result has 382 places, 375 transitions, 1936 flow [2022-11-02 21:10:01,242 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1715, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1936, PETRI_PLACES=382, PETRI_TRANSITIONS=375} [2022-11-02 21:10:01,242 INFO L287 CegarLoopForPetriNet]: 294 programPoint places, 88 predicate places. [2022-11-02 21:10:01,243 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 375 transitions, 1936 flow [2022-11-02 21:10:01,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.25) internal successors, (1193), 4 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:01,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:10:01,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:01,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 21:10:01,245 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:10:01,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:01,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1998195427, now seen corresponding path program 2 times [2022-11-02 21:10:01,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:01,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375714165] [2022-11-02 21:10:01,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:01,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:01,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:01,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375714165] [2022-11-02 21:10:01,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375714165] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:01,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:01,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:10:01,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169803825] [2022-11-02 21:10:01,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:01,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:10:01,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:01,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:10:01,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:10:01,366 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2022-11-02 21:10:01,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 375 transitions, 1936 flow. Second operand has 4 states, 4 states have (on average 298.25) internal successors, (1193), 4 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:01,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:10:01,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2022-11-02 21:10:01,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:10:02,875 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([929] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem38#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} AuxVars[] AssignedVars[][371], [Black: 501#(<= (+ ~res2~0 1) 0), Black: 434#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), 451#true, Black: 439#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 381#(<= ~count2~0 ~count3~0), Black: 500#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), Black: 380#(<= ~count1~0 ~count3~0), Black: 506#(and (<= (+ ~res2~0 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0)), Black: 324#(and (<= (+ ~count3~0 1) ~count1~0) (<= ~count2~0 ~count1~0)), 79#L124-2true, 321#(<= ~count2~0 ~count1~0), Black: 454#(<= (+ ~count3~0 1) ~count1~0), Black: 520#(<= (+ ~count2~0 1) ~count1~0), Black: 395#(and (not (= ~count3~0 ~count2~0)) (<= ~count1~0 ~count2~0) (<= (+ ~count1~0 1) ~count3~0)), Black: 389#true, Black: 392#(and (not (= ~count3~0 ~count2~0)) (or (<= ~count1~0 ~count2~0) (not (<= (+ ~count2~0 1) ~count3~0)))), Black: 335#(and (<= ~count1~0 ~count3~0) (<= (+ ~count1~0 1) ~count2~0)), Black: 529#(<= ~count1~0 ~count2~0), Black: 341#(= thread1Thread1of1ForFork1_~stop~0 0), Black: 528#(<= ~count3~0 ~count2~0), 539#(<= ~count3~0 ~count2~0), Black: 406#(<= (+ ~count3~0 1) ~count2~0), Black: 466#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 405#(<= (+ ~count1~0 1) ~count2~0), Black: 470#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (= |thread3Thread1of1ForFork0_#t~ite21| 1)), Black: 465#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 350#(and (<= ~count2~0 ~count3~0) (<= (+ ~count1~0 1) ~count3~0) (not (= ~count2~0 ~count1~0))), Black: 347#(and (or (not (<= (+ ~count1~0 1) ~count2~0)) (<= ~count2~0 ~count3~0)) (not (= ~count2~0 ~count1~0))), Black: 344#true, 463#true, Black: 420#(<= ~count2~0 ~count3~0), Black: 419#(<= ~count2~0 ~count1~0), 383#(and (<= ~count1~0 ~count3~0) (<= ~count2~0 ~count3~0)), Black: 359#(<= (+ ~count1~0 1) ~count2~0), 422#(and (<= ~count2~0 ~count3~0) (<= ~count2~0 ~count1~0)), 311#true, Black: 485#(= ~res3~0 1), 346#(or (not (<= (+ ~count1~0 1) ~count2~0)) (<= ~count2~0 ~count3~0)), 391#(or (<= ~count1~0 ~count2~0) (not (<= (+ ~count2~0 1) ~count3~0))), Black: 369#(<= (+ ~count3~0 1) ~count1~0), 332#(<= ~count1~0 ~count3~0), Black: 368#(<= (+ ~count3~0 1) ~count2~0), Black: 371#(and (<= (+ ~count3~0 1) ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), 402#true, 531#(and (<= ~count3~0 ~count2~0) (<= ~count1~0 ~count2~0)), Black: 435#(<= (+ ~res1~0 1) 0), Black: 316#(= thread2Thread1of1ForFork2_~stop~1 0), 89#L89true]) [2022-11-02 21:10:02,875 INFO L383 tUnfolder$Statistics]: this new event has 195 ancestors and is cut-off event [2022-11-02 21:10:02,875 INFO L386 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-11-02 21:10:02,875 INFO L386 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-11-02 21:10:02,875 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-02 21:10:02,879 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([929] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem38#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} AuxVars[] AssignedVars[][371], [Black: 501#(<= (+ ~res2~0 1) 0), Black: 434#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), 451#true, Black: 381#(<= ~count2~0 ~count3~0), Black: 439#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 500#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), Black: 380#(<= ~count1~0 ~count3~0), Black: 506#(and (<= (+ ~res2~0 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0)), Black: 324#(and (<= (+ ~count3~0 1) ~count1~0) (<= ~count2~0 ~count1~0)), 79#L124-2true, 321#(<= ~count2~0 ~count1~0), 87#L100-3true, Black: 520#(<= (+ ~count2~0 1) ~count1~0), Black: 454#(<= (+ ~count3~0 1) ~count1~0), Black: 395#(and (not (= ~count3~0 ~count2~0)) (<= ~count1~0 ~count2~0) (<= (+ ~count1~0 1) ~count3~0)), Black: 389#true, Black: 392#(and (not (= ~count3~0 ~count2~0)) (or (<= ~count1~0 ~count2~0) (not (<= (+ ~count2~0 1) ~count3~0)))), Black: 335#(and (<= ~count1~0 ~count3~0) (<= (+ ~count1~0 1) ~count2~0)), Black: 529#(<= ~count1~0 ~count2~0), Black: 528#(<= ~count3~0 ~count2~0), Black: 341#(= thread1Thread1of1ForFork1_~stop~0 0), 539#(<= ~count3~0 ~count2~0), Black: 406#(<= (+ ~count3~0 1) ~count2~0), Black: 466#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 405#(<= (+ ~count1~0 1) ~count2~0), Black: 470#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (= |thread3Thread1of1ForFork0_#t~ite21| 1)), Black: 350#(and (<= ~count2~0 ~count3~0) (<= (+ ~count1~0 1) ~count3~0) (not (= ~count2~0 ~count1~0))), Black: 465#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 347#(and (or (not (<= (+ ~count1~0 1) ~count2~0)) (<= ~count2~0 ~count3~0)) (not (= ~count2~0 ~count1~0))), Black: 344#true, 463#true, Black: 420#(<= ~count2~0 ~count3~0), Black: 419#(<= ~count2~0 ~count1~0), 383#(and (<= ~count1~0 ~count3~0) (<= ~count2~0 ~count3~0)), Black: 359#(<= (+ ~count1~0 1) ~count2~0), 422#(and (<= ~count2~0 ~count3~0) (<= ~count2~0 ~count1~0)), 311#true, Black: 485#(= ~res3~0 1), 346#(or (not (<= (+ ~count1~0 1) ~count2~0)) (<= ~count2~0 ~count3~0)), 332#(<= ~count1~0 ~count3~0), Black: 369#(<= (+ ~count3~0 1) ~count1~0), 391#(or (<= ~count1~0 ~count2~0) (not (<= (+ ~count2~0 1) ~count3~0))), Black: 368#(<= (+ ~count3~0 1) ~count2~0), Black: 371#(and (<= (+ ~count3~0 1) ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), 402#true, 531#(and (<= ~count3~0 ~count2~0) (<= ~count1~0 ~count2~0)), Black: 435#(<= (+ ~res1~0 1) 0), Black: 316#(= thread2Thread1of1ForFork2_~stop~1 0)]) [2022-11-02 21:10:02,880 INFO L383 tUnfolder$Statistics]: this new event has 194 ancestors and is cut-off event [2022-11-02 21:10:02,880 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-02 21:10:02,880 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-02 21:10:02,880 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-11-02 21:10:02,880 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([929] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem38#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} AuxVars[] AssignedVars[][376], [Black: 501#(<= (+ ~res2~0 1) 0), Black: 500#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), Black: 380#(<= ~count1~0 ~count3~0), Black: 506#(and (<= (+ ~res2~0 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0)), Black: 383#(and (<= ~count1~0 ~count3~0) (<= ~count2~0 ~count3~0)), 79#L124-2true, Black: 520#(<= (+ ~count2~0 1) ~count1~0), Black: 395#(and (not (= ~count3~0 ~count2~0)) (<= ~count1~0 ~count2~0) (<= (+ ~count1~0 1) ~count3~0)), Black: 389#true, Black: 392#(and (not (= ~count3~0 ~count2~0)) (or (<= ~count1~0 ~count2~0) (not (<= (+ ~count2~0 1) ~count3~0)))), Black: 529#(<= ~count1~0 ~count2~0), Black: 528#(<= ~count3~0 ~count2~0), Black: 406#(<= (+ ~count3~0 1) ~count2~0), Black: 405#(<= (+ ~count1~0 1) ~count2~0), 369#(<= (+ ~count3~0 1) ~count1~0), 463#true, Black: 420#(<= ~count2~0 ~count3~0), Black: 419#(<= ~count2~0 ~count1~0), 346#(or (not (<= (+ ~count1~0 1) ~count2~0)) (<= ~count2~0 ~count3~0)), 324#(and (<= (+ ~count3~0 1) ~count1~0) (<= ~count2~0 ~count1~0)), 391#(or (<= ~count1~0 ~count2~0) (not (<= (+ ~count2~0 1) ~count3~0))), 531#(and (<= ~count3~0 ~count2~0) (<= ~count1~0 ~count2~0)), Black: 435#(<= (+ ~res1~0 1) 0), Black: 316#(= thread2Thread1of1ForFork2_~stop~1 0), Black: 434#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), Black: 439#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 321#(<= ~count2~0 ~count1~0), Black: 451#true, Black: 332#(<= ~count1~0 ~count3~0), Black: 335#(and (<= ~count1~0 ~count3~0) (<= (+ ~count1~0 1) ~count2~0)), Black: 341#(= thread1Thread1of1ForFork1_~stop~0 0), Black: 466#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), 256#L100-1true, Black: 470#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (= |thread3Thread1of1ForFork0_#t~ite21| 1)), Black: 350#(and (<= ~count2~0 ~count3~0) (<= (+ ~count1~0 1) ~count3~0) (not (= ~count2~0 ~count1~0))), Black: 465#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 347#(and (or (not (<= (+ ~count1~0 1) ~count2~0)) (<= ~count2~0 ~count3~0)) (not (= ~count2~0 ~count1~0))), Black: 344#true, 454#(<= (+ ~count3~0 1) ~count1~0), Black: 359#(<= (+ ~count1~0 1) ~count2~0), 422#(and (<= ~count2~0 ~count3~0) (<= ~count2~0 ~count1~0)), 542#(and (<= ~count3~0 ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), 311#true, Black: 485#(= ~res3~0 1), 381#(<= ~count2~0 ~count3~0), Black: 368#(<= (+ ~count3~0 1) ~count2~0), Black: 366#true, Black: 371#(and (<= (+ ~count3~0 1) ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), 402#true]) [2022-11-02 21:10:02,880 INFO L383 tUnfolder$Statistics]: this new event has 194 ancestors and is cut-off event [2022-11-02 21:10:02,880 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-02 21:10:02,881 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-11-02 21:10:02,881 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-02 21:10:02,914 INFO L130 PetriNetUnfolder]: 1073/7355 cut-off events. [2022-11-02 21:10:02,914 INFO L131 PetriNetUnfolder]: For 10773/11797 co-relation queries the response was YES. [2022-11-02 21:10:02,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14729 conditions, 7355 events. 1073/7355 cut-off events. For 10773/11797 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 89370 event pairs, 307 based on Foata normal form. 49/6824 useless extension candidates. Maximal degree in co-relation 14678. Up to 877 conditions per place. [2022-11-02 21:10:02,985 INFO L137 encePairwiseOnDemand]: 326/332 looper letters, 68 selfloop transitions, 20 changer transitions 11/392 dead transitions. [2022-11-02 21:10:02,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 392 transitions, 2209 flow [2022-11-02 21:10:02,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:10:02,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 21:10:02,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1525 transitions. [2022-11-02 21:10:02,989 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9186746987951807 [2022-11-02 21:10:02,989 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1525 transitions. [2022-11-02 21:10:02,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1525 transitions. [2022-11-02 21:10:02,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:10:02,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1525 transitions. [2022-11-02 21:10:02,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 305.0) internal successors, (1525), 5 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:02,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:02,997 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:02,997 INFO L175 Difference]: Start difference. First operand has 382 places, 375 transitions, 1936 flow. Second operand 5 states and 1525 transitions. [2022-11-02 21:10:02,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 392 transitions, 2209 flow [2022-11-02 21:10:03,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 392 transitions, 2167 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-11-02 21:10:03,089 INFO L231 Difference]: Finished difference. Result has 384 places, 369 transitions, 1853 flow [2022-11-02 21:10:03,089 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1858, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1853, PETRI_PLACES=384, PETRI_TRANSITIONS=369} [2022-11-02 21:10:03,090 INFO L287 CegarLoopForPetriNet]: 294 programPoint places, 90 predicate places. [2022-11-02 21:10:03,090 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 369 transitions, 1853 flow [2022-11-02 21:10:03,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.25) internal successors, (1193), 4 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:03,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:10:03,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:03,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 21:10:03,092 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:10:03,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:03,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1887188111, now seen corresponding path program 3 times [2022-11-02 21:10:03,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:03,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349115772] [2022-11-02 21:10:03,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:03,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:03,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:03,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:03,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349115772] [2022-11-02 21:10:03,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349115772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:03,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:03,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:10:03,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141808903] [2022-11-02 21:10:03,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:03,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:10:03,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:03,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:10:03,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:10:03,394 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2022-11-02 21:10:03,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 369 transitions, 1853 flow. Second operand has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:03,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:10:03,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2022-11-02 21:10:03,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:10:04,828 INFO L130 PetriNetUnfolder]: 847/5774 cut-off events. [2022-11-02 21:10:04,828 INFO L131 PetriNetUnfolder]: For 10068/10749 co-relation queries the response was YES. [2022-11-02 21:10:04,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11757 conditions, 5774 events. 847/5774 cut-off events. For 10068/10749 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 66559 event pairs, 253 based on Foata normal form. 49/5360 useless extension candidates. Maximal degree in co-relation 11706. Up to 636 conditions per place. [2022-11-02 21:10:04,919 INFO L137 encePairwiseOnDemand]: 323/332 looper letters, 52 selfloop transitions, 24 changer transitions 21/390 dead transitions. [2022-11-02 21:10:04,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 390 transitions, 2141 flow [2022-11-02 21:10:04,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:10:05,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 21:10:05,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1532 transitions. [2022-11-02 21:10:05,108 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9228915662650602 [2022-11-02 21:10:05,108 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1532 transitions. [2022-11-02 21:10:05,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1532 transitions. [2022-11-02 21:10:05,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:10:05,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1532 transitions. [2022-11-02 21:10:05,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 306.4) internal successors, (1532), 5 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:05,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:05,117 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:05,117 INFO L175 Difference]: Start difference. First operand has 384 places, 369 transitions, 1853 flow. Second operand 5 states and 1532 transitions. [2022-11-02 21:10:05,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 390 transitions, 2141 flow [2022-11-02 21:10:05,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 390 transitions, 2125 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-02 21:10:05,185 INFO L231 Difference]: Finished difference. Result has 387 places, 355 transitions, 1664 flow [2022-11-02 21:10:05,185 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1815, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1664, PETRI_PLACES=387, PETRI_TRANSITIONS=355} [2022-11-02 21:10:05,186 INFO L287 CegarLoopForPetriNet]: 294 programPoint places, 93 predicate places. [2022-11-02 21:10:05,186 INFO L495 AbstractCegarLoop]: Abstraction has has 387 places, 355 transitions, 1664 flow [2022-11-02 21:10:05,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:05,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:10:05,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:05,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 21:10:05,188 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:10:05,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:05,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1416213107, now seen corresponding path program 4 times [2022-11-02 21:10:05,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:05,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401898960] [2022-11-02 21:10:05,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:05,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:05,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:05,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:05,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401898960] [2022-11-02 21:10:05,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401898960] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:05,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:05,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:10:05,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308427128] [2022-11-02 21:10:05,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:05,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:10:05,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:05,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:10:05,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:10:05,307 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2022-11-02 21:10:05,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 355 transitions, 1664 flow. Second operand has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:05,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:10:05,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2022-11-02 21:10:05,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:10:06,514 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([929] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem38#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} AuxVars[] AssignedVars[][349], [Black: 501#(<= (+ ~res2~0 1) 0), Black: 434#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), Black: 439#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 381#(<= ~count2~0 ~count3~0), Black: 500#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), Black: 380#(<= ~count1~0 ~count3~0), Black: 506#(and (<= (+ ~res2~0 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0)), Black: 324#(and (<= (+ ~count3~0 1) ~count1~0) (<= ~count2~0 ~count1~0)), 79#L124-2true, 321#(<= ~count2~0 ~count1~0), Black: 520#(<= (+ ~count2~0 1) ~count1~0), Black: 454#(<= (+ ~count3~0 1) ~count1~0), Black: 395#(and (not (= ~count3~0 ~count2~0)) (<= ~count1~0 ~count2~0) (<= (+ ~count1~0 1) ~count3~0)), Black: 389#true, Black: 392#(and (not (= ~count3~0 ~count2~0)) (or (<= ~count1~0 ~count2~0) (not (<= (+ ~count2~0 1) ~count3~0)))), 551#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), Black: 529#(<= ~count1~0 ~count2~0), Black: 528#(<= ~count3~0 ~count2~0), Black: 341#(= thread1Thread1of1ForFork1_~stop~0 0), 539#(<= ~count3~0 ~count2~0), Black: 406#(<= (+ ~count3~0 1) ~count2~0), Black: 466#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 405#(<= (+ ~count1~0 1) ~count2~0), Black: 470#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (= |thread3Thread1of1ForFork0_#t~ite21| 1)), Black: 465#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 347#(and (or (not (<= (+ ~count1~0 1) ~count2~0)) (<= ~count2~0 ~count3~0)) (not (= ~count2~0 ~count1~0))), Black: 344#true, 463#true, Black: 420#(<= ~count2~0 ~count3~0), Black: 419#(<= ~count2~0 ~count1~0), 557#(<= ~count1~0 ~count3~0), 383#(and (<= ~count1~0 ~count3~0) (<= ~count2~0 ~count3~0)), Black: 359#(<= (+ ~count1~0 1) ~count2~0), 422#(and (<= ~count2~0 ~count3~0) (<= ~count2~0 ~count1~0)), 311#true, Black: 485#(= ~res3~0 1), 346#(or (not (<= (+ ~count1~0 1) ~count2~0)) (<= ~count2~0 ~count3~0)), Black: 369#(<= (+ ~count3~0 1) ~count1~0), 391#(or (<= ~count1~0 ~count2~0) (not (<= (+ ~count2~0 1) ~count3~0))), 332#(<= ~count1~0 ~count3~0), Black: 368#(<= (+ ~count3~0 1) ~count2~0), Black: 371#(and (<= (+ ~count3~0 1) ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), 402#true, 531#(and (<= ~count3~0 ~count2~0) (<= ~count1~0 ~count2~0)), Black: 435#(<= (+ ~res1~0 1) 0), 89#L89true, Black: 316#(= thread2Thread1of1ForFork2_~stop~1 0)]) [2022-11-02 21:10:06,514 INFO L383 tUnfolder$Statistics]: this new event has 195 ancestors and is cut-off event [2022-11-02 21:10:06,514 INFO L386 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-11-02 21:10:06,514 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-02 21:10:06,515 INFO L386 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-11-02 21:10:06,518 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([929] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem38#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} AuxVars[] AssignedVars[][349], [Black: 501#(<= (+ ~res2~0 1) 0), Black: 434#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), Black: 439#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 381#(<= ~count2~0 ~count3~0), Black: 500#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), Black: 380#(<= ~count1~0 ~count3~0), Black: 506#(and (<= (+ ~res2~0 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0)), Black: 324#(and (<= (+ ~count3~0 1) ~count1~0) (<= ~count2~0 ~count1~0)), 79#L124-2true, 321#(<= ~count2~0 ~count1~0), Black: 454#(<= (+ ~count3~0 1) ~count1~0), 87#L100-3true, Black: 520#(<= (+ ~count2~0 1) ~count1~0), Black: 395#(and (not (= ~count3~0 ~count2~0)) (<= ~count1~0 ~count2~0) (<= (+ ~count1~0 1) ~count3~0)), Black: 389#true, Black: 392#(and (not (= ~count3~0 ~count2~0)) (or (<= ~count1~0 ~count2~0) (not (<= (+ ~count2~0 1) ~count3~0)))), 551#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), Black: 529#(<= ~count1~0 ~count2~0), Black: 528#(<= ~count3~0 ~count2~0), Black: 341#(= thread1Thread1of1ForFork1_~stop~0 0), 539#(<= ~count3~0 ~count2~0), Black: 466#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 406#(<= (+ ~count3~0 1) ~count2~0), Black: 405#(<= (+ ~count1~0 1) ~count2~0), Black: 470#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (= |thread3Thread1of1ForFork0_#t~ite21| 1)), Black: 465#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 347#(and (or (not (<= (+ ~count1~0 1) ~count2~0)) (<= ~count2~0 ~count3~0)) (not (= ~count2~0 ~count1~0))), Black: 344#true, 463#true, Black: 420#(<= ~count2~0 ~count3~0), Black: 419#(<= ~count2~0 ~count1~0), 557#(<= ~count1~0 ~count3~0), 383#(and (<= ~count1~0 ~count3~0) (<= ~count2~0 ~count3~0)), Black: 359#(<= (+ ~count1~0 1) ~count2~0), 422#(and (<= ~count2~0 ~count3~0) (<= ~count2~0 ~count1~0)), 311#true, Black: 485#(= ~res3~0 1), 346#(or (not (<= (+ ~count1~0 1) ~count2~0)) (<= ~count2~0 ~count3~0)), Black: 369#(<= (+ ~count3~0 1) ~count1~0), 391#(or (<= ~count1~0 ~count2~0) (not (<= (+ ~count2~0 1) ~count3~0))), 332#(<= ~count1~0 ~count3~0), Black: 368#(<= (+ ~count3~0 1) ~count2~0), Black: 371#(and (<= (+ ~count3~0 1) ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), 402#true, 531#(and (<= ~count3~0 ~count2~0) (<= ~count1~0 ~count2~0)), Black: 435#(<= (+ ~res1~0 1) 0), Black: 316#(= thread2Thread1of1ForFork2_~stop~1 0)]) [2022-11-02 21:10:06,519 INFO L383 tUnfolder$Statistics]: this new event has 194 ancestors and is cut-off event [2022-11-02 21:10:06,519 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-02 21:10:06,519 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-11-02 21:10:06,519 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-02 21:10:06,540 INFO L130 PetriNetUnfolder]: 827/5755 cut-off events. [2022-11-02 21:10:06,540 INFO L131 PetriNetUnfolder]: For 9085/9848 co-relation queries the response was YES. [2022-11-02 21:10:06,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11151 conditions, 5755 events. 827/5755 cut-off events. For 9085/9848 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 65830 event pairs, 273 based on Foata normal form. 19/5331 useless extension candidates. Maximal degree in co-relation 11100. Up to 658 conditions per place. [2022-11-02 21:10:06,586 INFO L137 encePairwiseOnDemand]: 328/332 looper letters, 49 selfloop transitions, 10 changer transitions 11/363 dead transitions. [2022-11-02 21:10:06,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 363 transitions, 1823 flow [2022-11-02 21:10:06,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:10:06,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-02 21:10:06,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1214 transitions. [2022-11-02 21:10:06,588 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9141566265060241 [2022-11-02 21:10:06,589 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1214 transitions. [2022-11-02 21:10:06,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1214 transitions. [2022-11-02 21:10:06,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:10:06,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1214 transitions. [2022-11-02 21:10:06,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 303.5) internal successors, (1214), 4 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:06,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:06,594 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:06,595 INFO L175 Difference]: Start difference. First operand has 387 places, 355 transitions, 1664 flow. Second operand 4 states and 1214 transitions. [2022-11-02 21:10:06,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 363 transitions, 1823 flow [2022-11-02 21:10:06,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 363 transitions, 1708 flow, removed 21 selfloop flow, removed 9 redundant places. [2022-11-02 21:10:06,649 INFO L231 Difference]: Finished difference. Result has 380 places, 348 transitions, 1446 flow [2022-11-02 21:10:06,650 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1529, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1446, PETRI_PLACES=380, PETRI_TRANSITIONS=348} [2022-11-02 21:10:06,651 INFO L287 CegarLoopForPetriNet]: 294 programPoint places, 86 predicate places. [2022-11-02 21:10:06,651 INFO L495 AbstractCegarLoop]: Abstraction has has 380 places, 348 transitions, 1446 flow [2022-11-02 21:10:06,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:06,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:10:06,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:06,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 21:10:06,652 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:10:06,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:06,653 INFO L85 PathProgramCache]: Analyzing trace with hash 364453765, now seen corresponding path program 1 times [2022-11-02 21:10:06,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:06,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936209447] [2022-11-02 21:10:06,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:06,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:06,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:06,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:06,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936209447] [2022-11-02 21:10:06,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936209447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:06,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:06,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:10:06,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664342548] [2022-11-02 21:10:06,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:06,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:10:06,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:06,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:10:06,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:10:06,828 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2022-11-02 21:10:06,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 348 transitions, 1446 flow. Second operand has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:06,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:10:06,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2022-11-02 21:10:06,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:10:08,084 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([929] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem38#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} AuxVars[] AssignedVars[][369], [Black: 501#(<= (+ ~res2~0 1) 0), Black: 434#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), Black: 439#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 500#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), Black: 506#(and (<= (+ ~res2~0 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0)), Black: 383#(and (<= ~count1~0 ~count3~0) (<= ~count2~0 ~count3~0)), 240#L100true, Black: 324#(and (<= (+ ~count3~0 1) ~count1~0) (<= ~count2~0 ~count1~0)), 79#L124-2true, 321#(<= ~count2~0 ~count1~0), Black: 520#(<= (+ ~count2~0 1) ~count1~0), Black: 454#(<= (+ ~count3~0 1) ~count1~0), Black: 395#(and (not (= ~count3~0 ~count2~0)) (<= ~count1~0 ~count2~0) (<= (+ ~count1~0 1) ~count3~0)), Black: 389#true, Black: 332#(<= ~count1~0 ~count3~0), 551#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), Black: 529#(<= ~count1~0 ~count2~0), Black: 528#(<= ~count3~0 ~count2~0), Black: 341#(= thread1Thread1of1ForFork1_~stop~0 0), 539#(<= ~count3~0 ~count2~0), Black: 466#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 405#(<= (+ ~count1~0 1) ~count2~0), Black: 470#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (= |thread3Thread1of1ForFork0_#t~ite21| 1)), Black: 465#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 347#(and (or (not (<= (+ ~count1~0 1) ~count2~0)) (<= ~count2~0 ~count3~0)) (not (= ~count2~0 ~count1~0))), Black: 344#true, 463#true, 555#true, Black: 420#(<= ~count2~0 ~count3~0), 422#(and (<= ~count2~0 ~count3~0) (<= ~count2~0 ~count1~0)), 311#true, 564#(not (= ~count3~0 ~count1~0)), Black: 485#(= ~res3~0 1), 346#(or (not (<= (+ ~count1~0 1) ~count2~0)) (<= ~count2~0 ~count3~0)), 381#(<= ~count2~0 ~count3~0), 391#(or (<= ~count1~0 ~count2~0) (not (<= (+ ~count2~0 1) ~count3~0))), Black: 369#(<= (+ ~count3~0 1) ~count1~0), Black: 371#(and (<= (+ ~count3~0 1) ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), 402#true, 531#(and (<= ~count3~0 ~count2~0) (<= ~count1~0 ~count2~0)), Black: 316#(= thread2Thread1of1ForFork2_~stop~1 0), Black: 435#(<= (+ ~res1~0 1) 0)]) [2022-11-02 21:10:08,084 INFO L383 tUnfolder$Statistics]: this new event has 195 ancestors and is cut-off event [2022-11-02 21:10:08,085 INFO L386 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-11-02 21:10:08,085 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-02 21:10:08,085 INFO L386 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-11-02 21:10:08,085 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([929] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem38#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} AuxVars[] AssignedVars[][368], [Black: 501#(<= (+ ~res2~0 1) 0), Black: 434#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), Black: 439#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 381#(<= ~count2~0 ~count3~0), Black: 500#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), Black: 506#(and (<= (+ ~res2~0 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0)), 79#L124-2true, Black: 324#(and (<= (+ ~count3~0 1) ~count1~0) (<= ~count2~0 ~count1~0)), 321#(<= ~count2~0 ~count1~0), Black: 454#(<= (+ ~count3~0 1) ~count1~0), Black: 520#(<= (+ ~count2~0 1) ~count1~0), Black: 395#(and (not (= ~count3~0 ~count2~0)) (<= ~count1~0 ~count2~0) (<= (+ ~count1~0 1) ~count3~0)), Black: 389#true, 551#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), Black: 529#(<= ~count1~0 ~count2~0), Black: 528#(<= ~count3~0 ~count2~0), Black: 341#(= thread1Thread1of1ForFork1_~stop~0 0), 539#(<= ~count3~0 ~count2~0), Black: 466#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 405#(<= (+ ~count1~0 1) ~count2~0), Black: 470#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (= |thread3Thread1of1ForFork0_#t~ite21| 1)), Black: 465#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 347#(and (or (not (<= (+ ~count1~0 1) ~count2~0)) (<= ~count2~0 ~count3~0)) (not (= ~count2~0 ~count1~0))), Black: 344#true, 463#true, Black: 420#(<= ~count2~0 ~count3~0), 557#(<= ~count1~0 ~count3~0), 383#(and (<= ~count1~0 ~count3~0) (<= ~count2~0 ~count3~0)), 422#(and (<= ~count2~0 ~count3~0) (<= ~count2~0 ~count1~0)), 311#true, Black: 485#(= ~res3~0 1), 346#(or (not (<= (+ ~count1~0 1) ~count2~0)) (<= ~count2~0 ~count3~0)), 391#(or (<= ~count1~0 ~count2~0) (not (<= (+ ~count2~0 1) ~count3~0))), Black: 369#(<= (+ ~count3~0 1) ~count1~0), 332#(<= ~count1~0 ~count3~0), Black: 371#(and (<= (+ ~count3~0 1) ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), 562#true, 402#true, 531#(and (<= ~count3~0 ~count2~0) (<= ~count1~0 ~count2~0)), Black: 316#(= thread2Thread1of1ForFork2_~stop~1 0), Black: 435#(<= (+ ~res1~0 1) 0), 89#L89true]) [2022-11-02 21:10:08,085 INFO L383 tUnfolder$Statistics]: this new event has 195 ancestors and is cut-off event [2022-11-02 21:10:08,085 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-02 21:10:08,085 INFO L386 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-11-02 21:10:08,086 INFO L386 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-11-02 21:10:08,090 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([929] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem38#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} AuxVars[] AssignedVars[][369], [Black: 501#(<= (+ ~res2~0 1) 0), Black: 434#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), Black: 439#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 381#(<= ~count2~0 ~count3~0), Black: 500#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), Black: 506#(and (<= (+ ~res2~0 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0)), Black: 324#(and (<= (+ ~count3~0 1) ~count1~0) (<= ~count2~0 ~count1~0)), 79#L124-2true, 321#(<= ~count2~0 ~count1~0), Black: 454#(<= (+ ~count3~0 1) ~count1~0), 87#L100-3true, Black: 520#(<= (+ ~count2~0 1) ~count1~0), Black: 395#(and (not (= ~count3~0 ~count2~0)) (<= ~count1~0 ~count2~0) (<= (+ ~count1~0 1) ~count3~0)), Black: 389#true, 551#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), Black: 529#(<= ~count1~0 ~count2~0), Black: 528#(<= ~count3~0 ~count2~0), Black: 341#(= thread1Thread1of1ForFork1_~stop~0 0), 539#(<= ~count3~0 ~count2~0), Black: 466#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 405#(<= (+ ~count1~0 1) ~count2~0), Black: 470#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (= |thread3Thread1of1ForFork0_#t~ite21| 1)), Black: 465#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 347#(and (or (not (<= (+ ~count1~0 1) ~count2~0)) (<= ~count2~0 ~count3~0)) (not (= ~count2~0 ~count1~0))), Black: 344#true, 463#true, Black: 420#(<= ~count2~0 ~count3~0), 557#(<= ~count1~0 ~count3~0), 383#(and (<= ~count1~0 ~count3~0) (<= ~count2~0 ~count3~0)), 422#(and (<= ~count2~0 ~count3~0) (<= ~count2~0 ~count1~0)), 311#true, 564#(not (= ~count3~0 ~count1~0)), Black: 485#(= ~res3~0 1), 346#(or (not (<= (+ ~count1~0 1) ~count2~0)) (<= ~count2~0 ~count3~0)), 332#(<= ~count1~0 ~count3~0), 391#(or (<= ~count1~0 ~count2~0) (not (<= (+ ~count2~0 1) ~count3~0))), Black: 369#(<= (+ ~count3~0 1) ~count1~0), Black: 371#(and (<= (+ ~count3~0 1) ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), 531#(and (<= ~count3~0 ~count2~0) (<= ~count1~0 ~count2~0)), 402#true, Black: 316#(= thread2Thread1of1ForFork2_~stop~1 0), Black: 435#(<= (+ ~res1~0 1) 0)]) [2022-11-02 21:10:08,090 INFO L383 tUnfolder$Statistics]: this new event has 194 ancestors and is cut-off event [2022-11-02 21:10:08,090 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-02 21:10:08,090 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-11-02 21:10:08,091 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-02 21:10:08,132 INFO L130 PetriNetUnfolder]: 829/5615 cut-off events. [2022-11-02 21:10:08,132 INFO L131 PetriNetUnfolder]: For 8942/9673 co-relation queries the response was YES. [2022-11-02 21:10:08,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10989 conditions, 5615 events. 829/5615 cut-off events. For 8942/9673 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 63605 event pairs, 210 based on Foata normal form. 16/5187 useless extension candidates. Maximal degree in co-relation 10945. Up to 620 conditions per place. [2022-11-02 21:10:08,207 INFO L137 encePairwiseOnDemand]: 325/332 looper letters, 80 selfloop transitions, 14 changer transitions 2/389 dead transitions. [2022-11-02 21:10:08,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 389 transitions, 2128 flow [2022-11-02 21:10:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:10:08,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 21:10:08,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1526 transitions. [2022-11-02 21:10:08,211 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9192771084337349 [2022-11-02 21:10:08,211 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1526 transitions. [2022-11-02 21:10:08,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1526 transitions. [2022-11-02 21:10:08,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:10:08,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1526 transitions. [2022-11-02 21:10:08,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 305.2) internal successors, (1526), 5 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:08,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:08,218 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:08,218 INFO L175 Difference]: Start difference. First operand has 380 places, 348 transitions, 1446 flow. Second operand 5 states and 1526 transitions. [2022-11-02 21:10:08,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 389 transitions, 2128 flow [2022-11-02 21:10:08,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 389 transitions, 2011 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-11-02 21:10:08,251 INFO L231 Difference]: Finished difference. Result has 375 places, 358 transitions, 1610 flow [2022-11-02 21:10:08,251 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1383, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1610, PETRI_PLACES=375, PETRI_TRANSITIONS=358} [2022-11-02 21:10:08,252 INFO L287 CegarLoopForPetriNet]: 294 programPoint places, 81 predicate places. [2022-11-02 21:10:08,252 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 358 transitions, 1610 flow [2022-11-02 21:10:08,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:08,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:10:08,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:08,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 21:10:08,254 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:10:08,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:08,254 INFO L85 PathProgramCache]: Analyzing trace with hash 303441847, now seen corresponding path program 2 times [2022-11-02 21:10:08,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:08,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666487055] [2022-11-02 21:10:08,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:08,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:08,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:08,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:08,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666487055] [2022-11-02 21:10:08,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666487055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:08,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:08,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:10:08,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615664484] [2022-11-02 21:10:08,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:08,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:10:08,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:08,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:10:08,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:10:08,407 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2022-11-02 21:10:08,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 358 transitions, 1610 flow. Second operand has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:08,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:10:08,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2022-11-02 21:10:08,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:10:09,594 INFO L130 PetriNetUnfolder]: 843/5903 cut-off events. [2022-11-02 21:10:09,594 INFO L131 PetriNetUnfolder]: For 8312/9046 co-relation queries the response was YES. [2022-11-02 21:10:09,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11462 conditions, 5903 events. 843/5903 cut-off events. For 8312/9046 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 67659 event pairs, 278 based on Foata normal form. 16/5438 useless extension candidates. Maximal degree in co-relation 11420. Up to 610 conditions per place. [2022-11-02 21:10:09,640 INFO L137 encePairwiseOnDemand]: 324/332 looper letters, 63 selfloop transitions, 24 changer transitions 5/385 dead transitions. [2022-11-02 21:10:09,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 385 transitions, 1966 flow [2022-11-02 21:10:09,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:10:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 21:10:09,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1530 transitions. [2022-11-02 21:10:09,643 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9216867469879518 [2022-11-02 21:10:09,643 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1530 transitions. [2022-11-02 21:10:09,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1530 transitions. [2022-11-02 21:10:09,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:10:09,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1530 transitions. [2022-11-02 21:10:09,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 306.0) internal successors, (1530), 5 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:09,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:09,649 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:09,649 INFO L175 Difference]: Start difference. First operand has 375 places, 358 transitions, 1610 flow. Second operand 5 states and 1530 transitions. [2022-11-02 21:10:09,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 385 transitions, 1966 flow [2022-11-02 21:10:09,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 385 transitions, 1950 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-02 21:10:09,687 INFO L231 Difference]: Finished difference. Result has 379 places, 359 transitions, 1669 flow [2022-11-02 21:10:09,688 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1597, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1669, PETRI_PLACES=379, PETRI_TRANSITIONS=359} [2022-11-02 21:10:09,688 INFO L287 CegarLoopForPetriNet]: 294 programPoint places, 85 predicate places. [2022-11-02 21:10:09,688 INFO L495 AbstractCegarLoop]: Abstraction has has 379 places, 359 transitions, 1669 flow [2022-11-02 21:10:09,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:09,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:10:09,689 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:09,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 21:10:09,690 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:10:09,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:09,690 INFO L85 PathProgramCache]: Analyzing trace with hash 616359587, now seen corresponding path program 1 times [2022-11-02 21:10:09,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:09,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871703776] [2022-11-02 21:10:09,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:09,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:10,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:10,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:10,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871703776] [2022-11-02 21:10:10,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871703776] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:10,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:10,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 21:10:10,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098330137] [2022-11-02 21:10:10,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:10,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 21:10:10,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:10,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 21:10:10,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-02 21:10:10,281 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 332 [2022-11-02 21:10:10,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 359 transitions, 1669 flow. Second operand has 14 states, 14 states have (on average 235.5) internal successors, (3297), 14 states have internal predecessors, (3297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:10,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:10:10,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 332 [2022-11-02 21:10:10,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:10:14,605 INFO L130 PetriNetUnfolder]: 4489/21847 cut-off events. [2022-11-02 21:10:14,606 INFO L131 PetriNetUnfolder]: For 14224/16513 co-relation queries the response was YES. [2022-11-02 21:10:14,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39068 conditions, 21847 events. 4489/21847 cut-off events. For 14224/16513 co-relation queries the response was YES. Maximal size of possible extension queue 924. Compared 306547 event pairs, 1187 based on Foata normal form. 127/19458 useless extension candidates. Maximal degree in co-relation 39025. Up to 2514 conditions per place. [2022-11-02 21:10:14,909 INFO L137 encePairwiseOnDemand]: 309/332 looper letters, 147 selfloop transitions, 39 changer transitions 6/462 dead transitions. [2022-11-02 21:10:14,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 462 transitions, 2394 flow [2022-11-02 21:10:14,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 21:10:14,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-11-02 21:10:14,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4787 transitions. [2022-11-02 21:10:14,913 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.720933734939759 [2022-11-02 21:10:14,914 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 4787 transitions. [2022-11-02 21:10:14,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 4787 transitions. [2022-11-02 21:10:14,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:10:14,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 4787 transitions. [2022-11-02 21:10:14,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 239.35) internal successors, (4787), 20 states have internal predecessors, (4787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:14,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 332.0) internal successors, (6972), 21 states have internal predecessors, (6972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:14,926 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 332.0) internal successors, (6972), 21 states have internal predecessors, (6972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:14,926 INFO L175 Difference]: Start difference. First operand has 379 places, 359 transitions, 1669 flow. Second operand 20 states and 4787 transitions. [2022-11-02 21:10:14,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 462 transitions, 2394 flow [2022-11-02 21:10:14,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 462 transitions, 2378 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-02 21:10:14,976 INFO L231 Difference]: Finished difference. Result has 408 places, 382 transitions, 1926 flow [2022-11-02 21:10:14,976 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1653, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1926, PETRI_PLACES=408, PETRI_TRANSITIONS=382} [2022-11-02 21:10:14,977 INFO L287 CegarLoopForPetriNet]: 294 programPoint places, 114 predicate places. [2022-11-02 21:10:14,977 INFO L495 AbstractCegarLoop]: Abstraction has has 408 places, 382 transitions, 1926 flow [2022-11-02 21:10:14,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 235.5) internal successors, (3297), 14 states have internal predecessors, (3297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:14,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:10:14,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:14,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 21:10:14,978 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:10:14,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:14,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1101556339, now seen corresponding path program 1 times [2022-11-02 21:10:14,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:14,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375483209] [2022-11-02 21:10:14,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:14,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:15,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:10:15,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:15,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375483209] [2022-11-02 21:10:15,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375483209] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:15,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:15,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:10:15,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782858705] [2022-11-02 21:10:15,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:15,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:10:15,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:15,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:10:15,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:10:15,154 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2022-11-02 21:10:15,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 382 transitions, 1926 flow. Second operand has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:15,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:10:15,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2022-11-02 21:10:15,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:10:17,612 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([929] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem38#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} AuxVars[] AssignedVars[][385], [Black: 501#(<= (+ ~res2~0 1) 0), 579#true, Black: 381#(<= ~count2~0 ~count3~0), Black: 500#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), Black: 506#(and (<= (+ ~res2~0 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0)), 79#L124-2true, Black: 520#(<= (+ ~count2~0 1) ~count1~0), Black: 395#(and (not (= ~count3~0 ~count2~0)) (<= ~count1~0 ~count2~0) (<= (+ ~count1~0 1) ~count3~0)), Black: 529#(<= ~count1~0 ~count2~0), Black: 528#(<= ~count3~0 ~count2~0), 642#(or (not (<= (+ ~count1~0 1) ~count3~0)) (<= ~count2~0 ~count1~0)), 463#true, Black: 420#(<= ~count2~0 ~count3~0), 383#(and (<= ~count1~0 ~count3~0) (<= ~count2~0 ~count3~0)), 346#(or (not (<= (+ ~count1~0 1) ~count2~0)) (<= ~count2~0 ~count3~0)), 391#(or (<= ~count1~0 ~count2~0) (not (<= (+ ~count2~0 1) ~count3~0))), 332#(<= ~count1~0 ~count3~0), Black: 565#(and (or (not (<= (+ ~count1~0 1) ~count3~0)) (<= ~count2~0 ~count1~0)) (not (= ~count3~0 ~count1~0))), Black: 566#(and (not (= ~count3~0 ~count1~0)) (< ~count3~0 (+ ~count1~0 1))), Black: 564#(not (= ~count3~0 ~count1~0)), 531#(and (<= ~count3~0 ~count2~0) (<= ~count1~0 ~count2~0)), Black: 316#(= thread2Thread1of1ForFork2_~stop~1 0), Black: 435#(<= (+ ~res1~0 1) 0), 89#L89true, Black: 575#(and (not (= ~count3~0 ~count1~0)) (< ~count3~0 (+ ~count1~0 1))), Black: 434#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), Black: 439#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 324#(and (<= (+ ~count3~0 1) ~count1~0) (<= ~count2~0 ~count1~0)), Black: 454#(<= (+ ~count3~0 1) ~count1~0), 551#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), 574#(< ~count3~0 (+ ~count1~0 1)), Black: 341#(= thread1Thread1of1ForFork1_~stop~0 0), Black: 466#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 470#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (= |thread3Thread1of1ForFork0_#t~ite21| 1)), Black: 465#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 344#true, 557#(<= ~count1~0 ~count3~0), 422#(and (<= ~count2~0 ~count3~0) (<= ~count2~0 ~count1~0)), 311#true, Black: 485#(= ~res3~0 1), Black: 620#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 608#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~res1~0 0)), Black: 369#(<= (+ ~count3~0 1) ~count1~0), Black: 614#(and (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 610#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 612#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 626#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~res1~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 371#(and (<= (+ ~count3~0 1) ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), Black: 590#(<= ~res1~0 0), Black: 602#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 624#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 596#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 594#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 618#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0))]) [2022-11-02 21:10:17,613 INFO L383 tUnfolder$Statistics]: this new event has 202 ancestors and is cut-off event [2022-11-02 21:10:17,613 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-11-02 21:10:17,613 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-02 21:10:17,613 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-11-02 21:10:17,613 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([929] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem38#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} AuxVars[] AssignedVars[][386], [Black: 501#(<= (+ ~res2~0 1) 0), 579#true, Black: 500#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), Black: 506#(and (<= (+ ~res2~0 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0)), Black: 383#(and (<= ~count1~0 ~count3~0) (<= ~count2~0 ~count3~0)), 79#L124-2true, 643#(and (or (not (<= (+ ~count1~0 1) ~count3~0)) (<= ~count2~0 ~count1~0)) (not (= ~count3~0 ~count1~0))), Black: 520#(<= (+ ~count2~0 1) ~count1~0), Black: 395#(and (not (= ~count3~0 ~count2~0)) (<= ~count1~0 ~count2~0) (<= (+ ~count1~0 1) ~count3~0)), Black: 529#(<= ~count1~0 ~count2~0), Black: 528#(<= ~count3~0 ~count2~0), 463#true, 575#(and (not (= ~count3~0 ~count1~0)) (< ~count3~0 (+ ~count1~0 1))), Black: 420#(<= ~count2~0 ~count3~0), 346#(or (not (<= (+ ~count1~0 1) ~count2~0)) (<= ~count2~0 ~count3~0)), 391#(or (<= ~count1~0 ~count2~0) (not (<= (+ ~count2~0 1) ~count3~0))), Black: 565#(and (or (not (<= (+ ~count1~0 1) ~count3~0)) (<= ~count2~0 ~count1~0)) (not (= ~count3~0 ~count1~0))), Black: 566#(and (not (= ~count3~0 ~count1~0)) (< ~count3~0 (+ ~count1~0 1))), 531#(and (<= ~count3~0 ~count2~0) (<= ~count1~0 ~count2~0)), Black: 316#(= thread2Thread1of1ForFork2_~stop~1 0), Black: 435#(<= (+ ~res1~0 1) 0), Black: 434#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), Black: 439#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 574#(< ~count3~0 (+ ~count1~0 1)), 240#L100true, Black: 324#(and (<= (+ ~count3~0 1) ~count1~0) (<= ~count2~0 ~count1~0)), Black: 454#(<= (+ ~count3~0 1) ~count1~0), Black: 332#(<= ~count1~0 ~count3~0), 551#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), Black: 341#(= thread1Thread1of1ForFork1_~stop~0 0), Black: 466#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 470#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (= |thread3Thread1of1ForFork0_#t~ite21| 1)), Black: 465#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 344#true, 422#(and (<= ~count2~0 ~count3~0) (<= ~count2~0 ~count1~0)), 311#true, 564#(not (= ~count3~0 ~count1~0)), Black: 485#(= ~res3~0 1), Black: 620#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), 381#(<= ~count2~0 ~count3~0), Black: 608#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~res1~0 0)), Black: 369#(<= (+ ~count3~0 1) ~count1~0), Black: 614#(and (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 610#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 612#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 626#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~res1~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 371#(and (<= (+ ~count3~0 1) ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), Black: 590#(<= ~res1~0 0), Black: 602#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 624#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 596#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 594#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 618#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0))]) [2022-11-02 21:10:17,613 INFO L383 tUnfolder$Statistics]: this new event has 202 ancestors and is cut-off event [2022-11-02 21:10:17,613 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-02 21:10:17,613 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-11-02 21:10:17,613 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-11-02 21:10:17,675 INFO L130 PetriNetUnfolder]: 1882/13346 cut-off events. [2022-11-02 21:10:17,676 INFO L131 PetriNetUnfolder]: For 22663/24320 co-relation queries the response was YES. [2022-11-02 21:10:17,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27056 conditions, 13346 events. 1882/13346 cut-off events. For 22663/24320 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 181338 event pairs, 614 based on Foata normal form. 33/12294 useless extension candidates. Maximal degree in co-relation 27001. Up to 1451 conditions per place. [2022-11-02 21:10:17,840 INFO L137 encePairwiseOnDemand]: 324/332 looper letters, 72 selfloop transitions, 19 changer transitions 4/411 dead transitions. [2022-11-02 21:10:17,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 411 transitions, 2359 flow [2022-11-02 21:10:17,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:10:17,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 21:10:17,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1529 transitions. [2022-11-02 21:10:17,842 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9210843373493975 [2022-11-02 21:10:17,843 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1529 transitions. [2022-11-02 21:10:17,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1529 transitions. [2022-11-02 21:10:17,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:10:17,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1529 transitions. [2022-11-02 21:10:17,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 305.8) internal successors, (1529), 5 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:17,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:17,845 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:17,846 INFO L175 Difference]: Start difference. First operand has 408 places, 382 transitions, 1926 flow. Second operand 5 states and 1529 transitions. [2022-11-02 21:10:17,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 411 transitions, 2359 flow [2022-11-02 21:10:18,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 411 transitions, 2340 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-11-02 21:10:18,172 INFO L231 Difference]: Finished difference. Result has 408 places, 385 transitions, 2029 flow [2022-11-02 21:10:18,173 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1907, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2029, PETRI_PLACES=408, PETRI_TRANSITIONS=385} [2022-11-02 21:10:18,173 INFO L287 CegarLoopForPetriNet]: 294 programPoint places, 114 predicate places. [2022-11-02 21:10:18,173 INFO L495 AbstractCegarLoop]: Abstraction has has 408 places, 385 transitions, 2029 flow [2022-11-02 21:10:18,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:18,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:10:18,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:18,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 21:10:18,174 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:10:18,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:18,175 INFO L85 PathProgramCache]: Analyzing trace with hash -385583295, now seen corresponding path program 1 times [2022-11-02 21:10:18,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:18,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961966726] [2022-11-02 21:10:18,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:18,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:18,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:18,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961966726] [2022-11-02 21:10:18,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961966726] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:10:18,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629171574] [2022-11-02 21:10:18,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:18,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:10:18,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b5a6ad-b082-423a-a573-f2bc470f5890/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:10:18,661 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b5a6ad-b082-423a-a573-f2bc470f5890/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:10:18,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b5a6ad-b082-423a-a573-f2bc470f5890/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 21:10:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-02 21:10:18,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:10:19,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:19,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:10:20,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:20,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629171574] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-02 21:10:20,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-02 21:10:20,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [14, 14] total 31 [2022-11-02 21:10:20,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957031210] [2022-11-02 21:10:20,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:20,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 21:10:20,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:20,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 21:10:20,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=807, Unknown=0, NotChecked=0, Total=930 [2022-11-02 21:10:20,184 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 332 [2022-11-02 21:10:20,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 385 transitions, 2029 flow. Second operand has 14 states, 14 states have (on average 231.0) internal successors, (3234), 14 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:20,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:10:20,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 332 [2022-11-02 21:10:20,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:10:33,597 INFO L130 PetriNetUnfolder]: 10685/47778 cut-off events. [2022-11-02 21:10:33,597 INFO L131 PetriNetUnfolder]: For 42343/47710 co-relation queries the response was YES. [2022-11-02 21:10:34,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88676 conditions, 47778 events. 10685/47778 cut-off events. For 42343/47710 co-relation queries the response was YES. Maximal size of possible extension queue 1952. Compared 737123 event pairs, 5448 based on Foata normal form. 681/41930 useless extension candidates. Maximal degree in co-relation 88620. Up to 5662 conditions per place. [2022-11-02 21:10:34,233 INFO L137 encePairwiseOnDemand]: 305/332 looper letters, 213 selfloop transitions, 35 changer transitions 13/535 dead transitions. [2022-11-02 21:10:34,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 535 transitions, 3157 flow [2022-11-02 21:10:34,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 21:10:34,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-02 21:10:34,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4509 transitions. [2022-11-02 21:10:34,239 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7148065948002537 [2022-11-02 21:10:34,239 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 4509 transitions. [2022-11-02 21:10:34,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 4509 transitions. [2022-11-02 21:10:34,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:10:34,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 4509 transitions. [2022-11-02 21:10:34,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 237.31578947368422) internal successors, (4509), 19 states have internal predecessors, (4509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:34,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 332.0) internal successors, (6640), 20 states have internal predecessors, (6640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:34,250 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 332.0) internal successors, (6640), 20 states have internal predecessors, (6640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:34,250 INFO L175 Difference]: Start difference. First operand has 408 places, 385 transitions, 2029 flow. Second operand 19 states and 4509 transitions. [2022-11-02 21:10:34,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 535 transitions, 3157 flow [2022-11-02 21:10:34,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 535 transitions, 3151 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-11-02 21:10:34,517 INFO L231 Difference]: Finished difference. Result has 434 places, 403 transitions, 2207 flow [2022-11-02 21:10:34,518 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=2023, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2207, PETRI_PLACES=434, PETRI_TRANSITIONS=403} [2022-11-02 21:10:34,519 INFO L287 CegarLoopForPetriNet]: 294 programPoint places, 140 predicate places. [2022-11-02 21:10:34,519 INFO L495 AbstractCegarLoop]: Abstraction has has 434 places, 403 transitions, 2207 flow [2022-11-02 21:10:34,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 231.0) internal successors, (3234), 14 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:34,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:10:34,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:34,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b5a6ad-b082-423a-a573-f2bc470f5890/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 21:10:34,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b5a6ad-b082-423a-a573-f2bc470f5890/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-02 21:10:34,737 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:10:34,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:34,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1232756263, now seen corresponding path program 2 times [2022-11-02 21:10:34,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:34,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098104679] [2022-11-02 21:10:34,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:34,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:35,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:35,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:35,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098104679] [2022-11-02 21:10:35,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098104679] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:10:35,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194065888] [2022-11-02 21:10:35,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:10:35,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:10:35,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b5a6ad-b082-423a-a573-f2bc470f5890/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:10:35,209 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b5a6ad-b082-423a-a573-f2bc470f5890/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:10:35,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b5a6ad-b082-423a-a573-f2bc470f5890/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 21:10:35,388 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-02 21:10:35,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:10:35,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 21:10:35,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:10:35,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:10:35,549 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 21:10:35,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194065888] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:35,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 21:10:35,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 17 [2022-11-02 21:10:35,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72395807] [2022-11-02 21:10:35,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:35,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:10:35,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:35,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:10:35,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:10:35,554 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 332 [2022-11-02 21:10:35,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 403 transitions, 2207 flow. Second operand has 7 states, 7 states have (on average 257.42857142857144) internal successors, (1802), 7 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:35,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:10:35,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 332 [2022-11-02 21:10:35,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand