./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 e04fb08f 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_1b1d602d-e76c-4b77-98bb-be73128245ad/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1d602d-e76c-4b77-98bb-be73128245ad/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1d602d-e76c-4b77-98bb-be73128245ad/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1d602d-e76c-4b77-98bb-be73128245ad/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-word-trans.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1d602d-e76c-4b77-98bb-be73128245ad/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1d602d-e76c-4b77-98bb-be73128245ad/bin/uautomizer-tPACEb0tL8 --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-e04fb08 [2022-11-16 11:28:28,862 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:28:28,864 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:28:28,888 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:28:28,889 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:28:28,890 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:28:28,892 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:28:28,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:28:28,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:28:28,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:28:28,899 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:28:28,900 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:28:28,901 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:28:28,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:28:28,904 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:28:28,905 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:28:28,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:28:28,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:28:28,910 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:28:28,912 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:28:28,914 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:28:28,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:28:28,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:28:28,919 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:28:28,923 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:28:28,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:28:28,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:28:28,926 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:28:28,926 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:28:28,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:28:28,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:28:28,929 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:28:28,930 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:28:28,932 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:28:28,933 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:28:28,933 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:28:28,934 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:28:28,935 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:28:28,935 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:28:28,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:28:28,938 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:28:28,939 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1d602d-e76c-4b77-98bb-be73128245ad/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 11:28:28,966 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:28:28,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:28:28,967 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:28:28,967 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:28:28,968 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:28:28,969 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:28:28,969 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:28:28,970 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:28:28,970 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:28:28,970 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:28:28,971 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:28:28,971 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:28:28,971 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:28:28,972 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:28:28,972 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:28:28,972 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:28:28,973 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:28:28,973 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:28:28,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:28:28,973 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:28:28,974 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:28:28,974 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:28:28,975 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:28:28,975 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:28:28,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:28:28,975 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:28:28,976 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:28:28,976 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:28:28,976 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:28:28,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:28:28,977 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:28:28,977 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:28:28,977 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:28:28,978 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_1b1d602d-e76c-4b77-98bb-be73128245ad/bin/uautomizer-tPACEb0tL8/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_1b1d602d-e76c-4b77-98bb-be73128245ad/bin/uautomizer-tPACEb0tL8 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-16 11:28:29,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:28:29,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:28:29,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:28:29,413 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:28:29,414 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:28:29,416 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1d602d-e76c-4b77-98bb-be73128245ad/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2022-11-16 11:28:29,511 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1d602d-e76c-4b77-98bb-be73128245ad/bin/uautomizer-tPACEb0tL8/data/d908c0149/f7f921b5f9e14422b602037c5dbfe902/FLAG418a1302d [2022-11-16 11:28:30,173 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:28:30,178 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1d602d-e76c-4b77-98bb-be73128245ad/sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2022-11-16 11:28:30,192 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1d602d-e76c-4b77-98bb-be73128245ad/bin/uautomizer-tPACEb0tL8/data/d908c0149/f7f921b5f9e14422b602037c5dbfe902/FLAG418a1302d [2022-11-16 11:28:30,476 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1d602d-e76c-4b77-98bb-be73128245ad/bin/uautomizer-tPACEb0tL8/data/d908c0149/f7f921b5f9e14422b602037c5dbfe902 [2022-11-16 11:28:30,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:28:30,485 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:28:30,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:28:30,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:28:30,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:28:30,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:28:30" (1/1) ... [2022-11-16 11:28:30,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d3e903b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:30, skipping insertion in model container [2022-11-16 11:28:30,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:28:30" (1/1) ... [2022-11-16 11:28:30,505 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:28:30,540 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:28:30,806 WARN L229 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_1b1d602d-e76c-4b77-98bb-be73128245ad/sv-benchmarks/c/weaver/chl-word-trans.wvr.c[3292,3305] [2022-11-16 11:28:30,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:28:30,833 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:28:30,874 WARN L229 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_1b1d602d-e76c-4b77-98bb-be73128245ad/sv-benchmarks/c/weaver/chl-word-trans.wvr.c[3292,3305] [2022-11-16 11:28:30,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:28:30,896 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:28:30,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:30 WrapperNode [2022-11-16 11:28:30,897 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:28:30,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:28:30,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:28:30,899 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:28:30,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:30" (1/1) ... [2022-11-16 11:28:30,948 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:30" (1/1) ... [2022-11-16 11:28:30,975 INFO L138 Inliner]: procedures = 25, calls = 44, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 172 [2022-11-16 11:28:30,976 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:28:30,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:28:30,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:28:30,977 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:28:30,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:30" (1/1) ... [2022-11-16 11:28:30,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:30" (1/1) ... [2022-11-16 11:28:30,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:30" (1/1) ... [2022-11-16 11:28:31,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:30" (1/1) ... [2022-11-16 11:28:31,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:30" (1/1) ... [2022-11-16 11:28:31,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:30" (1/1) ... [2022-11-16 11:28:31,035 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:30" (1/1) ... [2022-11-16 11:28:31,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:30" (1/1) ... [2022-11-16 11:28:31,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:28:31,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:28:31,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:28:31,042 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:28:31,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:30" (1/1) ... [2022-11-16 11:28:31,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:28:31,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1d602d-e76c-4b77-98bb-be73128245ad/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:31,096 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1d602d-e76c-4b77-98bb-be73128245ad/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:31,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b1d602d-e76c-4b77-98bb-be73128245ad/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:28:31,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:28:31,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:28:31,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:28:31,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:28:31,159 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-16 11:28:31,159 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-16 11:28:31,159 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-16 11:28:31,161 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-16 11:28:31,161 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-16 11:28:31,162 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-16 11:28:31,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:28:31,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:28:31,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:28:31,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:28:31,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:28:31,165 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:28:31,345 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:28:31,347 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:28:31,897 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:28:31,927 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:28:31,928 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-16 11:28:31,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:28:31 BoogieIcfgContainer [2022-11-16 11:28:31,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:28:31,934 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:28:31,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:28:31,939 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:28:31,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:28:30" (1/3) ... [2022-11-16 11:28:31,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dadbb17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:28:31, skipping insertion in model container [2022-11-16 11:28:31,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:30" (2/3) ... [2022-11-16 11:28:31,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dadbb17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:28:31, skipping insertion in model container [2022-11-16 11:28:31,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:28:31" (3/3) ... [2022-11-16 11:28:31,942 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-word-trans.wvr.c [2022-11-16 11:28:31,971 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 11:28:32,000 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:28:32,001 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 11:28:32,001 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:28:32,188 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-16 11:28:32,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 284 places, 302 transitions, 628 flow [2022-11-16 11:28:32,579 INFO L130 PetriNetUnfolder]: 28/299 cut-off events. [2022-11-16 11:28:32,579 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-16 11:28:32,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 299 events. 28/299 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 362 event pairs, 0 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 241. Up to 3 conditions per place. [2022-11-16 11:28:32,591 INFO L82 GeneralOperation]: Start removeDead. Operand has 284 places, 302 transitions, 628 flow [2022-11-16 11:28:32,609 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 270 places, 288 transitions, 594 flow [2022-11-16 11:28:32,628 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:28:32,642 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;@1098f7ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:28:32,643 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-16 11:28:32,743 INFO L130 PetriNetUnfolder]: 28/287 cut-off events. [2022-11-16 11:28:32,745 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-16 11:28:32,745 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:28:32,746 INFO L209 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] [2022-11-16 11:28:32,748 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-16 11:28:32,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:32,755 INFO L85 PathProgramCache]: Analyzing trace with hash 899097834, now seen corresponding path program 1 times [2022-11-16 11:28:32,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:32,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298192360] [2022-11-16 11:28:32,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:32,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:33,325 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-16 11:28:33,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:33,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298192360] [2022-11-16 11:28:33,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298192360] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:33,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:33,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:28:33,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426974194] [2022-11-16 11:28:33,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:33,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:28:33,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:33,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:28:33,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:28:33,401 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 302 [2022-11-16 11:28:33,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 288 transitions, 594 flow. Second operand has 2 states, 2 states have (on average 286.5) internal successors, (573), 2 states have internal predecessors, (573), 0 states have call successors, (0), 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-16 11:28:33,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:28:33,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 302 [2022-11-16 11:28:33,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:28:33,502 INFO L130 PetriNetUnfolder]: 15/275 cut-off events. [2022-11-16 11:28:33,502 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-11-16 11:28:33,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 275 events. 15/275 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 359 event pairs, 0 based on Foata normal form. 19/272 useless extension candidates. Maximal degree in co-relation 232. Up to 7 conditions per place. [2022-11-16 11:28:33,507 INFO L137 encePairwiseOnDemand]: 289/302 looper letters, 6 selfloop transitions, 0 changer transitions 7/275 dead transitions. [2022-11-16 11:28:33,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 275 transitions, 580 flow [2022-11-16 11:28:33,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:28:33,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-16 11:28:33,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 583 transitions. [2022-11-16 11:28:33,535 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9652317880794702 [2022-11-16 11:28:33,537 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 583 transitions. [2022-11-16 11:28:33,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 583 transitions. [2022-11-16 11:28:33,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:28:33,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 583 transitions. [2022-11-16 11:28:33,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 291.5) internal successors, (583), 2 states have internal predecessors, (583), 0 states have call successors, (0), 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-16 11:28:33,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 302.0) internal successors, (906), 3 states have internal predecessors, (906), 0 states have call successors, (0), 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-16 11:28:33,567 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 302.0) internal successors, (906), 3 states have internal predecessors, (906), 0 states have call successors, (0), 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-16 11:28:33,570 INFO L175 Difference]: Start difference. First operand has 270 places, 288 transitions, 594 flow. Second operand 2 states and 583 transitions. [2022-11-16 11:28:33,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 275 transitions, 580 flow [2022-11-16 11:28:33,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 275 transitions, 568 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-16 11:28:33,589 INFO L231 Difference]: Finished difference. Result has 265 places, 268 transitions, 542 flow [2022-11-16 11:28:33,592 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=542, PETRI_PLACES=265, PETRI_TRANSITIONS=268} [2022-11-16 11:28:33,601 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, -5 predicate places. [2022-11-16 11:28:33,602 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 268 transitions, 542 flow [2022-11-16 11:28:33,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 286.5) internal successors, (573), 2 states have internal predecessors, (573), 0 states have call successors, (0), 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-16 11:28:33,603 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:28:33,604 INFO L209 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] [2022-11-16 11:28:33,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:28:33,605 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-16 11:28:33,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:33,607 INFO L85 PathProgramCache]: Analyzing trace with hash 786412167, now seen corresponding path program 1 times [2022-11-16 11:28:33,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:33,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444270756] [2022-11-16 11:28:33,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:33,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:35,081 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-16 11:28:35,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:35,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444270756] [2022-11-16 11:28:35,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444270756] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:35,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:35,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:28:35,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107071254] [2022-11-16 11:28:35,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:35,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:28:35,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:35,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:28:35,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:28:35,092 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 302 [2022-11-16 11:28:35,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 268 transitions, 542 flow. Second operand has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 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-16 11:28:35,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:28:35,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 302 [2022-11-16 11:28:35,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:28:36,087 INFO L130 PetriNetUnfolder]: 490/1949 cut-off events. [2022-11-16 11:28:36,087 INFO L131 PetriNetUnfolder]: For 55/60 co-relation queries the response was YES. [2022-11-16 11:28:36,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2646 conditions, 1949 events. 490/1949 cut-off events. For 55/60 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 15069 event pairs, 221 based on Foata normal form. 2/1635 useless extension candidates. Maximal degree in co-relation 2643. Up to 492 conditions per place. [2022-11-16 11:28:36,170 INFO L137 encePairwiseOnDemand]: 290/302 looper letters, 83 selfloop transitions, 8 changer transitions 6/307 dead transitions. [2022-11-16 11:28:36,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 307 transitions, 825 flow [2022-11-16 11:28:36,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:28:36,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:28:36,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2105 transitions. [2022-11-16 11:28:36,181 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7744665194996321 [2022-11-16 11:28:36,182 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2105 transitions. [2022-11-16 11:28:36,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2105 transitions. [2022-11-16 11:28:36,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:28:36,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2105 transitions. [2022-11-16 11:28:36,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 233.88888888888889) internal successors, (2105), 9 states have internal predecessors, (2105), 0 states have call successors, (0), 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-16 11:28:36,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 302.0) internal successors, (3020), 10 states have internal predecessors, (3020), 0 states have call successors, (0), 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-16 11:28:36,200 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 302.0) internal successors, (3020), 10 states have internal predecessors, (3020), 0 states have call successors, (0), 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-16 11:28:36,200 INFO L175 Difference]: Start difference. First operand has 265 places, 268 transitions, 542 flow. Second operand 9 states and 2105 transitions. [2022-11-16 11:28:36,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 307 transitions, 825 flow [2022-11-16 11:28:36,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 307 transitions, 825 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:28:36,213 INFO L231 Difference]: Finished difference. Result has 271 places, 272 transitions, 591 flow [2022-11-16 11:28:36,214 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=591, PETRI_PLACES=271, PETRI_TRANSITIONS=272} [2022-11-16 11:28:36,215 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 1 predicate places. [2022-11-16 11:28:36,216 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 272 transitions, 591 flow [2022-11-16 11:28:36,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 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-16 11:28:36,218 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:28:36,219 INFO L209 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] [2022-11-16 11:28:36,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:28:36,219 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-16 11:28:36,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:36,221 INFO L85 PathProgramCache]: Analyzing trace with hash 204285325, now seen corresponding path program 2 times [2022-11-16 11:28:36,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:36,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194106019] [2022-11-16 11:28:36,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:36,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:36,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:37,141 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-16 11:28:37,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:37,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194106019] [2022-11-16 11:28:37,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194106019] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:37,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:37,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:28:37,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666116453] [2022-11-16 11:28:37,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:37,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:28:37,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:37,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:28:37,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:28:37,150 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 302 [2022-11-16 11:28:37,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 272 transitions, 591 flow. Second operand has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 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-16 11:28:37,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:28:37,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 302 [2022-11-16 11:28:37,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:28:38,252 INFO L130 PetriNetUnfolder]: 850/2684 cut-off events. [2022-11-16 11:28:38,252 INFO L131 PetriNetUnfolder]: For 621/621 co-relation queries the response was YES. [2022-11-16 11:28:38,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4287 conditions, 2684 events. 850/2684 cut-off events. For 621/621 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 21055 event pairs, 101 based on Foata normal form. 2/2314 useless extension candidates. Maximal degree in co-relation 4278. Up to 683 conditions per place. [2022-11-16 11:28:38,283 INFO L137 encePairwiseOnDemand]: 287/302 looper letters, 98 selfloop transitions, 17 changer transitions 10/335 dead transitions. [2022-11-16 11:28:38,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 335 transitions, 1040 flow [2022-11-16 11:28:38,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:28:38,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-16 11:28:38,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2576 transitions. [2022-11-16 11:28:38,290 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7754364840457556 [2022-11-16 11:28:38,291 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2576 transitions. [2022-11-16 11:28:38,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2576 transitions. [2022-11-16 11:28:38,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:28:38,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2576 transitions. [2022-11-16 11:28:38,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 234.1818181818182) internal successors, (2576), 11 states have internal predecessors, (2576), 0 states have call successors, (0), 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-16 11:28:38,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 302.0) internal successors, (3624), 12 states have internal predecessors, (3624), 0 states have call successors, (0), 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-16 11:28:38,311 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 302.0) internal successors, (3624), 12 states have internal predecessors, (3624), 0 states have call successors, (0), 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-16 11:28:38,311 INFO L175 Difference]: Start difference. First operand has 271 places, 272 transitions, 591 flow. Second operand 11 states and 2576 transitions. [2022-11-16 11:28:38,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 335 transitions, 1040 flow [2022-11-16 11:28:38,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 335 transitions, 1015 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-11-16 11:28:38,323 INFO L231 Difference]: Finished difference. Result has 281 places, 285 transitions, 711 flow [2022-11-16 11:28:38,324 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=711, PETRI_PLACES=281, PETRI_TRANSITIONS=285} [2022-11-16 11:28:38,325 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 11 predicate places. [2022-11-16 11:28:38,325 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 285 transitions, 711 flow [2022-11-16 11:28:38,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 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-16 11:28:38,327 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:28:38,327 INFO L209 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] [2022-11-16 11:28:38,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:28:38,328 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-16 11:28:38,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:38,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1045950575, now seen corresponding path program 3 times [2022-11-16 11:28:38,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:38,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227493860] [2022-11-16 11:28:38,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:38,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:38,891 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-16 11:28:38,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:38,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227493860] [2022-11-16 11:28:38,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227493860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:38,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:38,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:28:38,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351856117] [2022-11-16 11:28:38,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:38,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:28:38,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:38,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:28:38,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:28:38,899 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 302 [2022-11-16 11:28:38,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 285 transitions, 711 flow. Second operand has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 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-16 11:28:38,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:28:38,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 302 [2022-11-16 11:28:38,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:28:39,950 INFO L130 PetriNetUnfolder]: 836/2995 cut-off events. [2022-11-16 11:28:39,951 INFO L131 PetriNetUnfolder]: For 2036/2502 co-relation queries the response was YES. [2022-11-16 11:28:39,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5615 conditions, 2995 events. 836/2995 cut-off events. For 2036/2502 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 26148 event pairs, 284 based on Foata normal form. 10/2566 useless extension candidates. Maximal degree in co-relation 5601. Up to 760 conditions per place. [2022-11-16 11:28:39,989 INFO L137 encePairwiseOnDemand]: 290/302 looper letters, 94 selfloop transitions, 19 changer transitions 4/327 dead transitions. [2022-11-16 11:28:39,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 327 transitions, 1141 flow [2022-11-16 11:28:39,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:28:39,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-16 11:28:39,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1663 transitions. [2022-11-16 11:28:39,995 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7866603595080416 [2022-11-16 11:28:39,995 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1663 transitions. [2022-11-16 11:28:39,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1663 transitions. [2022-11-16 11:28:39,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:28:39,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1663 transitions. [2022-11-16 11:28:40,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 237.57142857142858) internal successors, (1663), 7 states have internal predecessors, (1663), 0 states have call successors, (0), 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-16 11:28:40,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 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-16 11:28:40,015 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 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-16 11:28:40,015 INFO L175 Difference]: Start difference. First operand has 281 places, 285 transitions, 711 flow. Second operand 7 states and 1663 transitions. [2022-11-16 11:28:40,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 327 transitions, 1141 flow [2022-11-16 11:28:40,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 327 transitions, 1099 flow, removed 20 selfloop flow, removed 5 redundant places. [2022-11-16 11:28:40,042 INFO L231 Difference]: Finished difference. Result has 283 places, 295 transitions, 851 flow [2022-11-16 11:28:40,043 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=851, PETRI_PLACES=283, PETRI_TRANSITIONS=295} [2022-11-16 11:28:40,045 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 13 predicate places. [2022-11-16 11:28:40,051 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 295 transitions, 851 flow [2022-11-16 11:28:40,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 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-16 11:28:40,052 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:28:40,052 INFO L209 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] [2022-11-16 11:28:40,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:28:40,053 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-16 11:28:40,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:40,054 INFO L85 PathProgramCache]: Analyzing trace with hash 235625509, now seen corresponding path program 4 times [2022-11-16 11:28:40,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:40,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848577260] [2022-11-16 11:28:40,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:40,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:41,281 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-16 11:28:41,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:41,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848577260] [2022-11-16 11:28:41,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848577260] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:41,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:41,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:28:41,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783840009] [2022-11-16 11:28:41,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:41,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:28:41,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:41,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:28:41,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:28:41,287 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 302 [2022-11-16 11:28:41,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 295 transitions, 851 flow. Second operand has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 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-16 11:28:41,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:28:41,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 302 [2022-11-16 11:28:41,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:28:42,363 INFO L130 PetriNetUnfolder]: 950/3286 cut-off events. [2022-11-16 11:28:42,363 INFO L131 PetriNetUnfolder]: For 5198/5961 co-relation queries the response was YES. [2022-11-16 11:28:42,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7023 conditions, 3286 events. 950/3286 cut-off events. For 5198/5961 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 28847 event pairs, 116 based on Foata normal form. 75/2978 useless extension candidates. Maximal degree in co-relation 7007. Up to 824 conditions per place. [2022-11-16 11:28:42,414 INFO L137 encePairwiseOnDemand]: 284/302 looper letters, 102 selfloop transitions, 32 changer transitions 5/349 dead transitions. [2022-11-16 11:28:42,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 349 transitions, 1409 flow [2022-11-16 11:28:42,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:28:42,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:28:42,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2128 transitions. [2022-11-16 11:28:42,421 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7829286239882266 [2022-11-16 11:28:42,421 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2128 transitions. [2022-11-16 11:28:42,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2128 transitions. [2022-11-16 11:28:42,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:28:42,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2128 transitions. [2022-11-16 11:28:42,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 236.44444444444446) internal successors, (2128), 9 states have internal predecessors, (2128), 0 states have call successors, (0), 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-16 11:28:42,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 302.0) internal successors, (3020), 10 states have internal predecessors, (3020), 0 states have call successors, (0), 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-16 11:28:42,437 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 302.0) internal successors, (3020), 10 states have internal predecessors, (3020), 0 states have call successors, (0), 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-16 11:28:42,438 INFO L175 Difference]: Start difference. First operand has 283 places, 295 transitions, 851 flow. Second operand 9 states and 2128 transitions. [2022-11-16 11:28:42,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 349 transitions, 1409 flow [2022-11-16 11:28:42,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 349 transitions, 1363 flow, removed 21 selfloop flow, removed 3 redundant places. [2022-11-16 11:28:42,492 INFO L231 Difference]: Finished difference. Result has 291 places, 305 transitions, 1040 flow [2022-11-16 11:28:42,493 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1040, PETRI_PLACES=291, PETRI_TRANSITIONS=305} [2022-11-16 11:28:42,497 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 21 predicate places. [2022-11-16 11:28:42,498 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 305 transitions, 1040 flow [2022-11-16 11:28:42,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 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-16 11:28:42,499 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:28:42,499 INFO L209 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] [2022-11-16 11:28:42,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:28:42,500 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-16 11:28:42,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:42,502 INFO L85 PathProgramCache]: Analyzing trace with hash -762082599, now seen corresponding path program 5 times [2022-11-16 11:28:42,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:42,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833972674] [2022-11-16 11:28:42,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:42,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:43,210 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-16 11:28:43,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:43,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833972674] [2022-11-16 11:28:43,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833972674] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:43,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:43,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:28:43,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010313403] [2022-11-16 11:28:43,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:43,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:28:43,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:43,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:28:43,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:28:43,220 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 302 [2022-11-16 11:28:43,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 305 transitions, 1040 flow. Second operand has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 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-16 11:28:43,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:28:43,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 302 [2022-11-16 11:28:43,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:28:44,358 INFO L130 PetriNetUnfolder]: 993/3655 cut-off events. [2022-11-16 11:28:44,358 INFO L131 PetriNetUnfolder]: For 8857/9791 co-relation queries the response was YES. [2022-11-16 11:28:44,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8488 conditions, 3655 events. 993/3655 cut-off events. For 8857/9791 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 34148 event pairs, 138 based on Foata normal form. 72/3369 useless extension candidates. Maximal degree in co-relation 8469. Up to 1044 conditions per place. [2022-11-16 11:28:44,416 INFO L137 encePairwiseOnDemand]: 288/302 looper letters, 124 selfloop transitions, 18 changer transitions 10/362 dead transitions. [2022-11-16 11:28:44,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 362 transitions, 1647 flow [2022-11-16 11:28:44,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:28:44,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-16 11:28:44,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1900 transitions. [2022-11-16 11:28:44,422 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7864238410596026 [2022-11-16 11:28:44,423 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1900 transitions. [2022-11-16 11:28:44,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1900 transitions. [2022-11-16 11:28:44,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:28:44,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1900 transitions. [2022-11-16 11:28:44,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 237.5) internal successors, (1900), 8 states have internal predecessors, (1900), 0 states have call successors, (0), 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-16 11:28:44,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 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-16 11:28:44,438 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 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-16 11:28:44,438 INFO L175 Difference]: Start difference. First operand has 291 places, 305 transitions, 1040 flow. Second operand 8 states and 1900 transitions. [2022-11-16 11:28:44,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 362 transitions, 1647 flow [2022-11-16 11:28:44,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 362 transitions, 1591 flow, removed 21 selfloop flow, removed 4 redundant places. [2022-11-16 11:28:44,537 INFO L231 Difference]: Finished difference. Result has 297 places, 310 transitions, 1104 flow [2022-11-16 11:28:44,537 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=998, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1104, PETRI_PLACES=297, PETRI_TRANSITIONS=310} [2022-11-16 11:28:44,541 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 27 predicate places. [2022-11-16 11:28:44,541 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 310 transitions, 1104 flow [2022-11-16 11:28:44,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 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-16 11:28:44,556 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:28:44,557 INFO L209 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] [2022-11-16 11:28:44,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:28:44,558 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-16 11:28:44,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:44,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1785579015, now seen corresponding path program 6 times [2022-11-16 11:28:44,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:44,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038378242] [2022-11-16 11:28:44,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:44,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:45,335 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-16 11:28:45,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:45,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038378242] [2022-11-16 11:28:45,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038378242] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:45,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:45,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:28:45,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978859313] [2022-11-16 11:28:45,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:45,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:28:45,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:45,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:28:45,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:28:45,350 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 302 [2022-11-16 11:28:45,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 310 transitions, 1104 flow. Second operand has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 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-16 11:28:45,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:28:45,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 302 [2022-11-16 11:28:45,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:28:46,586 INFO L130 PetriNetUnfolder]: 968/4361 cut-off events. [2022-11-16 11:28:46,586 INFO L131 PetriNetUnfolder]: For 9855/10269 co-relation queries the response was YES. [2022-11-16 11:28:46,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9362 conditions, 4361 events. 968/4361 cut-off events. For 9855/10269 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 44923 event pairs, 249 based on Foata normal form. 68/3963 useless extension candidates. Maximal degree in co-relation 9339. Up to 871 conditions per place. [2022-11-16 11:28:46,653 INFO L137 encePairwiseOnDemand]: 288/302 looper letters, 105 selfloop transitions, 41 changer transitions 5/361 dead transitions. [2022-11-16 11:28:46,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 361 transitions, 1765 flow [2022-11-16 11:28:46,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:28:46,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-16 11:28:46,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1885 transitions. [2022-11-16 11:28:46,660 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7802152317880795 [2022-11-16 11:28:46,660 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1885 transitions. [2022-11-16 11:28:46,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1885 transitions. [2022-11-16 11:28:46,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:28:46,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1885 transitions. [2022-11-16 11:28:46,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 235.625) internal successors, (1885), 8 states have internal predecessors, (1885), 0 states have call successors, (0), 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-16 11:28:46,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 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-16 11:28:46,688 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 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-16 11:28:46,698 INFO L175 Difference]: Start difference. First operand has 297 places, 310 transitions, 1104 flow. Second operand 8 states and 1885 transitions. [2022-11-16 11:28:46,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 361 transitions, 1765 flow [2022-11-16 11:28:46,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 361 transitions, 1725 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-11-16 11:28:46,760 INFO L231 Difference]: Finished difference. Result has 304 places, 323 transitions, 1370 flow [2022-11-16 11:28:46,761 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1080, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1370, PETRI_PLACES=304, PETRI_TRANSITIONS=323} [2022-11-16 11:28:46,762 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 34 predicate places. [2022-11-16 11:28:46,762 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 323 transitions, 1370 flow [2022-11-16 11:28:46,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 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-16 11:28:46,763 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:28:46,764 INFO L209 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] [2022-11-16 11:28:46,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:28:46,764 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-16 11:28:46,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:46,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1202193495, now seen corresponding path program 1 times [2022-11-16 11:28:46,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:46,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864647546] [2022-11-16 11:28:46,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:46,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:46,949 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-16 11:28:46,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:46,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864647546] [2022-11-16 11:28:46,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864647546] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:46,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:46,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:28:46,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356770180] [2022-11-16 11:28:46,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:46,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:28:46,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:46,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:28:46,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:46,955 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 302 [2022-11-16 11:28:46,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 323 transitions, 1370 flow. Second operand has 3 states, 3 states have (on average 280.6666666666667) internal successors, (842), 3 states have internal predecessors, (842), 0 states have call successors, (0), 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-16 11:28:46,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:28:46,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 302 [2022-11-16 11:28:46,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:28:47,415 INFO L130 PetriNetUnfolder]: 310/1901 cut-off events. [2022-11-16 11:28:47,415 INFO L131 PetriNetUnfolder]: For 4828/5085 co-relation queries the response was YES. [2022-11-16 11:28:47,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4178 conditions, 1901 events. 310/1901 cut-off events. For 4828/5085 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 15987 event pairs, 45 based on Foata normal form. 24/1733 useless extension candidates. Maximal degree in co-relation 4151. Up to 296 conditions per place. [2022-11-16 11:28:47,454 INFO L137 encePairwiseOnDemand]: 299/302 looper letters, 14 selfloop transitions, 2 changer transitions 0/329 dead transitions. [2022-11-16 11:28:47,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 329 transitions, 1419 flow [2022-11-16 11:28:47,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:28:47,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:28:47,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 851 transitions. [2022-11-16 11:28:47,459 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9392935982339956 [2022-11-16 11:28:47,459 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 851 transitions. [2022-11-16 11:28:47,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 851 transitions. [2022-11-16 11:28:47,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:28:47,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 851 transitions. [2022-11-16 11:28:47,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 283.6666666666667) internal successors, (851), 3 states have internal predecessors, (851), 0 states have call successors, (0), 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-16 11:28:47,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 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-16 11:28:47,470 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 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-16 11:28:47,471 INFO L175 Difference]: Start difference. First operand has 304 places, 323 transitions, 1370 flow. Second operand 3 states and 851 transitions. [2022-11-16 11:28:47,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 329 transitions, 1419 flow [2022-11-16 11:28:47,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 329 transitions, 1363 flow, removed 27 selfloop flow, removed 3 redundant places. [2022-11-16 11:28:47,510 INFO L231 Difference]: Finished difference. Result has 302 places, 323 transitions, 1322 flow [2022-11-16 11:28:47,511 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1314, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1322, PETRI_PLACES=302, PETRI_TRANSITIONS=323} [2022-11-16 11:28:47,513 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 32 predicate places. [2022-11-16 11:28:47,514 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 323 transitions, 1322 flow [2022-11-16 11:28:47,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.6666666666667) internal successors, (842), 3 states have internal predecessors, (842), 0 states have call successors, (0), 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-16 11:28:47,514 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:28:47,515 INFO L209 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] [2022-11-16 11:28:47,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:28:47,515 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-16 11:28:47,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:47,516 INFO L85 PathProgramCache]: Analyzing trace with hash -48409571, now seen corresponding path program 1 times [2022-11-16 11:28:47,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:47,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028736283] [2022-11-16 11:28:47,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:47,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:47,698 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-16 11:28:47,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:47,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028736283] [2022-11-16 11:28:47,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028736283] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:47,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:47,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:28:47,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846667502] [2022-11-16 11:28:47,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:47,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:28:47,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:47,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:28:47,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:47,702 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 302 [2022-11-16 11:28:47,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 323 transitions, 1322 flow. Second operand has 3 states, 3 states have (on average 280.6666666666667) internal successors, (842), 3 states have internal predecessors, (842), 0 states have call successors, (0), 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-16 11:28:47,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:28:47,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 302 [2022-11-16 11:28:47,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:28:48,327 INFO L130 PetriNetUnfolder]: 516/2726 cut-off events. [2022-11-16 11:28:48,328 INFO L131 PetriNetUnfolder]: For 7429/7831 co-relation queries the response was YES. [2022-11-16 11:28:48,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6071 conditions, 2726 events. 516/2726 cut-off events. For 7429/7831 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 25369 event pairs, 101 based on Foata normal form. 18/2445 useless extension candidates. Maximal degree in co-relation 6044. Up to 378 conditions per place. [2022-11-16 11:28:48,364 INFO L137 encePairwiseOnDemand]: 299/302 looper letters, 12 selfloop transitions, 2 changer transitions 0/327 dead transitions. [2022-11-16 11:28:48,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 327 transitions, 1361 flow [2022-11-16 11:28:48,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:28:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:28:48,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 849 transitions. [2022-11-16 11:28:48,368 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9370860927152318 [2022-11-16 11:28:48,368 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 849 transitions. [2022-11-16 11:28:48,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 849 transitions. [2022-11-16 11:28:48,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:28:48,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 849 transitions. [2022-11-16 11:28:48,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 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-16 11:28:48,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 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-16 11:28:48,375 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 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-16 11:28:48,375 INFO L175 Difference]: Start difference. First operand has 302 places, 323 transitions, 1322 flow. Second operand 3 states and 849 transitions. [2022-11-16 11:28:48,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 327 transitions, 1361 flow [2022-11-16 11:28:48,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 327 transitions, 1349 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-11-16 11:28:48,413 INFO L231 Difference]: Finished difference. Result has 303 places, 323 transitions, 1318 flow [2022-11-16 11:28:48,414 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1318, PETRI_PLACES=303, PETRI_TRANSITIONS=323} [2022-11-16 11:28:48,415 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 33 predicate places. [2022-11-16 11:28:48,415 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 323 transitions, 1318 flow [2022-11-16 11:28:48,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.6666666666667) internal successors, (842), 3 states have internal predecessors, (842), 0 states have call successors, (0), 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-16 11:28:48,416 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:28:48,416 INFO L209 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] [2022-11-16 11:28:48,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:28:48,417 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-16 11:28:48,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:48,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1306535191, now seen corresponding path program 1 times [2022-11-16 11:28:48,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:48,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498154237] [2022-11-16 11:28:48,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:48,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:48,567 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-16 11:28:48,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:48,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498154237] [2022-11-16 11:28:48,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498154237] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:48,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:48,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:28:48,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138006174] [2022-11-16 11:28:48,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:48,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:28:48,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:48,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:28:48,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:48,580 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 302 [2022-11-16 11:28:48,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 323 transitions, 1318 flow. Second operand has 3 states, 3 states have (on average 280.6666666666667) internal successors, (842), 3 states have internal predecessors, (842), 0 states have call successors, (0), 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-16 11:28:48,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:28:48,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 302 [2022-11-16 11:28:48,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:28:49,351 INFO L130 PetriNetUnfolder]: 462/2860 cut-off events. [2022-11-16 11:28:49,351 INFO L131 PetriNetUnfolder]: For 5960/6222 co-relation queries the response was YES. [2022-11-16 11:28:49,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6025 conditions, 2860 events. 462/2860 cut-off events. For 5960/6222 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 27022 event pairs, 115 based on Foata normal form. 31/2644 useless extension candidates. Maximal degree in co-relation 5997. Up to 406 conditions per place. [2022-11-16 11:28:49,393 INFO L137 encePairwiseOnDemand]: 299/302 looper letters, 13 selfloop transitions, 2 changer transitions 0/328 dead transitions. [2022-11-16 11:28:49,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 328 transitions, 1362 flow [2022-11-16 11:28:49,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:28:49,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:28:49,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 850 transitions. [2022-11-16 11:28:49,397 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9381898454746137 [2022-11-16 11:28:49,398 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 850 transitions. [2022-11-16 11:28:49,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 850 transitions. [2022-11-16 11:28:49,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:28:49,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 850 transitions. [2022-11-16 11:28:49,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 0 states have call successors, (0), 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-16 11:28:49,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 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-16 11:28:49,405 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 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-16 11:28:49,406 INFO L175 Difference]: Start difference. First operand has 303 places, 323 transitions, 1318 flow. Second operand 3 states and 850 transitions. [2022-11-16 11:28:49,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 328 transitions, 1362 flow [2022-11-16 11:28:49,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 328 transitions, 1344 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-11-16 11:28:49,446 INFO L231 Difference]: Finished difference. Result has 304 places, 323 transitions, 1308 flow [2022-11-16 11:28:49,447 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1308, PETRI_PLACES=304, PETRI_TRANSITIONS=323} [2022-11-16 11:28:49,449 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 34 predicate places. [2022-11-16 11:28:49,449 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 323 transitions, 1308 flow [2022-11-16 11:28:49,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.6666666666667) internal successors, (842), 3 states have internal predecessors, (842), 0 states have call successors, (0), 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-16 11:28:49,450 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:28:49,450 INFO L209 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] [2022-11-16 11:28:49,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:28:49,451 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-16 11:28:49,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:49,451 INFO L85 PathProgramCache]: Analyzing trace with hash 2070629245, now seen corresponding path program 1 times [2022-11-16 11:28:49,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:49,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381685907] [2022-11-16 11:28:49,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:49,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:49,927 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-16 11:28:49,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:49,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381685907] [2022-11-16 11:28:49,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381685907] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:49,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:49,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:28:49,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000705310] [2022-11-16 11:28:49,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:49,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:28:49,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:49,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:28:49,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:28:49,933 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-16 11:28:49,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 323 transitions, 1308 flow. Second operand has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 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-16 11:28:49,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:28:49,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-16 11:28:49,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:28:51,329 INFO L130 PetriNetUnfolder]: 1012/4992 cut-off events. [2022-11-16 11:28:51,330 INFO L131 PetriNetUnfolder]: For 14537/15358 co-relation queries the response was YES. [2022-11-16 11:28:51,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12122 conditions, 4992 events. 1012/4992 cut-off events. For 14537/15358 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 51339 event pairs, 122 based on Foata normal form. 86/4844 useless extension candidates. Maximal degree in co-relation 12093. Up to 755 conditions per place. [2022-11-16 11:28:51,403 INFO L137 encePairwiseOnDemand]: 289/302 looper letters, 146 selfloop transitions, 47 changer transitions 5/417 dead transitions. [2022-11-16 11:28:51,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 417 transitions, 2537 flow [2022-11-16 11:28:51,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:28:51,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 11:28:51,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2383 transitions. [2022-11-16 11:28:51,410 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7890728476821192 [2022-11-16 11:28:51,410 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2383 transitions. [2022-11-16 11:28:51,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2383 transitions. [2022-11-16 11:28:51,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:28:51,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2383 transitions. [2022-11-16 11:28:51,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 238.3) internal successors, (2383), 10 states have internal predecessors, (2383), 0 states have call successors, (0), 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-16 11:28:51,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 302.0) internal successors, (3322), 11 states have internal predecessors, (3322), 0 states have call successors, (0), 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-16 11:28:51,427 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 302.0) internal successors, (3322), 11 states have internal predecessors, (3322), 0 states have call successors, (0), 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-16 11:28:51,427 INFO L175 Difference]: Start difference. First operand has 304 places, 323 transitions, 1308 flow. Second operand 10 states and 2383 transitions. [2022-11-16 11:28:51,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 417 transitions, 2537 flow [2022-11-16 11:28:51,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 417 transitions, 2477 flow, removed 28 selfloop flow, removed 2 redundant places. [2022-11-16 11:28:51,536 INFO L231 Difference]: Finished difference. Result has 317 places, 354 transitions, 1860 flow [2022-11-16 11:28:51,537 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1860, PETRI_PLACES=317, PETRI_TRANSITIONS=354} [2022-11-16 11:28:51,538 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 47 predicate places. [2022-11-16 11:28:51,538 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 354 transitions, 1860 flow [2022-11-16 11:28:51,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 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-16 11:28:51,539 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:28:51,539 INFO L209 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] [2022-11-16 11:28:51,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:28:51,540 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-16 11:28:51,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:51,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1262580947, now seen corresponding path program 2 times [2022-11-16 11:28:51,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:51,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981963294] [2022-11-16 11:28:51,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:51,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:51,878 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-16 11:28:51,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:51,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981963294] [2022-11-16 11:28:51,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981963294] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:51,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:51,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:28:51,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782937457] [2022-11-16 11:28:51,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:51,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:28:51,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:51,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:28:51,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:28:51,883 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-16 11:28:51,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 354 transitions, 1860 flow. Second operand has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 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-16 11:28:51,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:28:51,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-16 11:28:51,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:28:53,935 INFO L130 PetriNetUnfolder]: 1254/6599 cut-off events. [2022-11-16 11:28:53,936 INFO L131 PetriNetUnfolder]: For 21645/22990 co-relation queries the response was YES. [2022-11-16 11:28:53,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16469 conditions, 6599 events. 1254/6599 cut-off events. For 21645/22990 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 74036 event pairs, 260 based on Foata normal form. 148/6358 useless extension candidates. Maximal degree in co-relation 16434. Up to 947 conditions per place. [2022-11-16 11:28:54,028 INFO L137 encePairwiseOnDemand]: 292/302 looper letters, 172 selfloop transitions, 50 changer transitions 4/445 dead transitions. [2022-11-16 11:28:54,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 445 transitions, 3181 flow [2022-11-16 11:28:54,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:28:54,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-16 11:28:54,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1927 transitions. [2022-11-16 11:28:54,034 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7975993377483444 [2022-11-16 11:28:54,035 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1927 transitions. [2022-11-16 11:28:54,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1927 transitions. [2022-11-16 11:28:54,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:28:54,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1927 transitions. [2022-11-16 11:28:54,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 240.875) internal successors, (1927), 8 states have internal predecessors, (1927), 0 states have call successors, (0), 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-16 11:28:54,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 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-16 11:28:54,048 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 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-16 11:28:54,049 INFO L175 Difference]: Start difference. First operand has 317 places, 354 transitions, 1860 flow. Second operand 8 states and 1927 transitions. [2022-11-16 11:28:54,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 445 transitions, 3181 flow [2022-11-16 11:28:54,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 445 transitions, 3057 flow, removed 61 selfloop flow, removed 3 redundant places. [2022-11-16 11:28:54,174 INFO L231 Difference]: Finished difference. Result has 325 places, 387 transitions, 2505 flow [2022-11-16 11:28:54,175 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1788, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2505, PETRI_PLACES=325, PETRI_TRANSITIONS=387} [2022-11-16 11:28:54,176 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 55 predicate places. [2022-11-16 11:28:54,176 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 387 transitions, 2505 flow [2022-11-16 11:28:54,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 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-16 11:28:54,177 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:28:54,177 INFO L209 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] [2022-11-16 11:28:54,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:28:54,179 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-16 11:28:54,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:54,180 INFO L85 PathProgramCache]: Analyzing trace with hash 824522733, now seen corresponding path program 1 times [2022-11-16 11:28:54,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:54,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91408301] [2022-11-16 11:28:54,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:54,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:54,762 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-16 11:28:54,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:54,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91408301] [2022-11-16 11:28:54,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91408301] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:54,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:54,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:28:54,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110831361] [2022-11-16 11:28:54,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:54,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:28:54,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:54,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:28:54,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:28:54,768 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-16 11:28:54,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 387 transitions, 2505 flow. Second operand has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 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-16 11:28:54,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:28:54,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-16 11:28:54,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:28:56,716 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([816] thread3EXIT-->L125-2: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem33#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][415], [Black: 376#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 366#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 374#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), 498#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), 410#true, 473#true, Black: 317#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)), Black: 323#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= (+ ~count3~0 2) ~count1~0))), Black: 325#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= (+ ~count3~0 2) ~count1~0))), Black: 461#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 451#(or (<= ~res2~0 0) (<= 1 ~res3~0)), Black: 396#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0)))), Black: 390#(or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0))), Black: 457#(and (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 399#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0)))), Black: 459#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), 315#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), 287#true, Black: 350#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0))), 447#true, Black: 353#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0))), Black: 486#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 418#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 488#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~count2~0 ~count1~0) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 344#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 475#(<= ~count2~0 ~count1~0), Black: 420#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 484#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0))), Black: 481#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), Black: 412#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), 364#true, Black: 476#(or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)), Black: 292#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 302#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0) (<= ~res1~0 0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count3~0 2) ~count1~0) (<= ~res1~0 0))), 85#L125-2true, Black: 300#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count3~0 2) ~count1~0) (<= ~res1~0 0))), Black: 439#(= thread3Thread1of1ForFork2_~stop~2 0), Black: 444#(= thread2Thread1of1ForFork1_~stop~1 0), 388#true]) [2022-11-16 11:28:56,716 INFO L383 tUnfolder$Statistics]: this new event has 193 ancestors and is not cut-off event [2022-11-16 11:28:56,717 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is not cut-off event [2022-11-16 11:28:56,717 INFO L386 tUnfolder$Statistics]: existing Event has 193 ancestors and is not cut-off event [2022-11-16 11:28:56,717 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is not cut-off event [2022-11-16 11:28:56,726 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([816] thread3EXIT-->L125-2: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem33#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][414], [Black: 376#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 366#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 374#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), 410#true, Black: 317#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)), Black: 323#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= (+ ~count3~0 2) ~count1~0))), Black: 325#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= (+ ~count3~0 2) ~count1~0))), Black: 461#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 451#(or (<= ~res2~0 0) (<= 1 ~res3~0)), Black: 396#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0)))), Black: 390#(or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0))), Black: 457#(and (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 399#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0)))), Black: 459#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), 287#true, Black: 350#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0))), Black: 353#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0))), Black: 344#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 486#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 418#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 488#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~count2~0 ~count1~0) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 420#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 484#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0))), Black: 481#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), Black: 412#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), 496#true, Black: 476#(or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)), 364#true, Black: 292#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 302#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0) (<= ~res1~0 0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count3~0 2) ~count1~0) (<= ~res1~0 0))), 475#(<= ~count2~0 ~count1~0), 449#(<= ~count2~0 ~count1~0), 85#L125-2true, Black: 300#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count3~0 2) ~count1~0) (<= ~res1~0 0))), Black: 439#(= thread3Thread1of1ForFork2_~stop~2 0), 313#true, Black: 444#(= thread2Thread1of1ForFork1_~stop~1 0), 388#true]) [2022-11-16 11:28:56,726 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is not cut-off event [2022-11-16 11:28:56,726 INFO L386 tUnfolder$Statistics]: existing Event has 197 ancestors and is not cut-off event [2022-11-16 11:28:56,727 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-16 11:28:56,727 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is not cut-off event [2022-11-16 11:28:56,762 INFO L130 PetriNetUnfolder]: 1137/6122 cut-off events. [2022-11-16 11:28:56,762 INFO L131 PetriNetUnfolder]: For 21543/22327 co-relation queries the response was YES. [2022-11-16 11:28:56,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15878 conditions, 6122 events. 1137/6122 cut-off events. For 21543/22327 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 67583 event pairs, 194 based on Foata normal form. 78/5836 useless extension candidates. Maximal degree in co-relation 15838. Up to 1293 conditions per place. [2022-11-16 11:28:56,856 INFO L137 encePairwiseOnDemand]: 291/302 looper letters, 131 selfloop transitions, 32 changer transitions 13/436 dead transitions. [2022-11-16 11:28:56,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 436 transitions, 3165 flow [2022-11-16 11:28:56,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:28:56,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-16 11:28:56,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1912 transitions. [2022-11-16 11:28:56,862 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7913907284768212 [2022-11-16 11:28:56,862 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1912 transitions. [2022-11-16 11:28:56,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1912 transitions. [2022-11-16 11:28:56,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:28:56,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1912 transitions. [2022-11-16 11:28:56,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 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-16 11:28:56,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 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-16 11:28:56,875 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 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-16 11:28:56,875 INFO L175 Difference]: Start difference. First operand has 325 places, 387 transitions, 2505 flow. Second operand 8 states and 1912 transitions. [2022-11-16 11:28:56,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 436 transitions, 3165 flow [2022-11-16 11:28:57,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 436 transitions, 3047 flow, removed 56 selfloop flow, removed 4 redundant places. [2022-11-16 11:28:57,133 INFO L231 Difference]: Finished difference. Result has 330 places, 391 transitions, 2542 flow [2022-11-16 11:28:57,133 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=2413, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2542, PETRI_PLACES=330, PETRI_TRANSITIONS=391} [2022-11-16 11:28:57,135 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 60 predicate places. [2022-11-16 11:28:57,135 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 391 transitions, 2542 flow [2022-11-16 11:28:57,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 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-16 11:28:57,136 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:28:57,136 INFO L209 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] [2022-11-16 11:28:57,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:28:57,137 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-16 11:28:57,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:57,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1355129075, now seen corresponding path program 2 times [2022-11-16 11:28:57,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:57,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345474650] [2022-11-16 11:28:57,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:57,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:57,608 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-16 11:28:57,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:57,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345474650] [2022-11-16 11:28:57,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345474650] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:57,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:57,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:28:57,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399664480] [2022-11-16 11:28:57,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:57,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:28:57,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:57,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:28:57,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:28:57,614 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-16 11:28:57,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 391 transitions, 2542 flow. Second operand has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 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-16 11:28:57,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:28:57,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-16 11:28:57,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:28:59,707 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([816] thread3EXIT-->L125-2: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem33#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][456], [Black: 376#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 511#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 366#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 374#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 500#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0)), Black: 507#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 509#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 498#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), 410#true, 473#true, Black: 317#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)), Black: 323#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= (+ ~count3~0 2) ~count1~0))), Black: 461#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 451#(or (<= ~res2~0 0) (<= 1 ~res3~0)), Black: 396#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0)))), Black: 390#(or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0))), Black: 457#(and (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 399#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0)))), Black: 459#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), 315#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), 287#true, Black: 350#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0))), Black: 353#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0))), 447#true, Black: 418#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), 344#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 475#(<= ~count2~0 ~count1~0), Black: 420#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 484#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0))), Black: 481#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), Black: 412#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 476#(or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)), 364#true, Black: 292#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), 85#L125-2true, Black: 300#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count3~0 2) ~count1~0) (<= ~res1~0 0))), Black: 439#(= thread3Thread1of1ForFork2_~stop~2 0), 527#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0))), 388#true]) [2022-11-16 11:28:59,707 INFO L383 tUnfolder$Statistics]: this new event has 183 ancestors and is not cut-off event [2022-11-16 11:28:59,707 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is not cut-off event [2022-11-16 11:28:59,707 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is not cut-off event [2022-11-16 11:28:59,707 INFO L386 tUnfolder$Statistics]: existing Event has 183 ancestors and is not cut-off event [2022-11-16 11:28:59,793 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([816] thread3EXIT-->L125-2: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem33#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][456], [Black: 376#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 511#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 366#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 374#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 500#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0)), Black: 507#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 509#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 498#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), 410#true, 473#true, Black: 317#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)), Black: 323#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= (+ ~count3~0 2) ~count1~0))), Black: 461#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 451#(or (<= ~res2~0 0) (<= 1 ~res3~0)), Black: 396#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0)))), Black: 390#(or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0))), Black: 457#(and (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 399#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0)))), Black: 459#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), 315#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), 287#true, Black: 350#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0))), 447#true, Black: 353#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0))), Black: 418#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), 344#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 475#(<= ~count2~0 ~count1~0), Black: 420#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 484#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0))), Black: 481#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), Black: 412#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 476#(or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)), 364#true, Black: 292#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), 85#L125-2true, Black: 300#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count3~0 2) ~count1~0) (<= ~res1~0 0))), Black: 439#(= thread3Thread1of1ForFork2_~stop~2 0), 527#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0))), Black: 444#(= thread2Thread1of1ForFork1_~stop~1 0), 388#true]) [2022-11-16 11:28:59,794 INFO L383 tUnfolder$Statistics]: this new event has 193 ancestors and is not cut-off event [2022-11-16 11:28:59,794 INFO L386 tUnfolder$Statistics]: existing Event has 193 ancestors and is not cut-off event [2022-11-16 11:28:59,794 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is not cut-off event [2022-11-16 11:28:59,794 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is not cut-off event [2022-11-16 11:28:59,832 INFO L130 PetriNetUnfolder]: 1195/7053 cut-off events. [2022-11-16 11:28:59,832 INFO L131 PetriNetUnfolder]: For 23765/24597 co-relation queries the response was YES. [2022-11-16 11:28:59,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17968 conditions, 7053 events. 1195/7053 cut-off events. For 23765/24597 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 82111 event pairs, 139 based on Foata normal form. 164/6833 useless extension candidates. Maximal degree in co-relation 17927. Up to 996 conditions per place. [2022-11-16 11:28:59,987 INFO L137 encePairwiseOnDemand]: 290/302 looper letters, 159 selfloop transitions, 55 changer transitions 4/478 dead transitions. [2022-11-16 11:28:59,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 478 transitions, 3664 flow [2022-11-16 11:28:59,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:28:59,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:28:59,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2152 transitions. [2022-11-16 11:28:59,997 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7917586460632818 [2022-11-16 11:28:59,997 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2152 transitions. [2022-11-16 11:28:59,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2152 transitions. [2022-11-16 11:28:59,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:28:59,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2152 transitions. [2022-11-16 11:29:00,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 239.11111111111111) internal successors, (2152), 9 states have internal predecessors, (2152), 0 states have call successors, (0), 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-16 11:29:00,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 302.0) internal successors, (3020), 10 states have internal predecessors, (3020), 0 states have call successors, (0), 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-16 11:29:00,010 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 302.0) internal successors, (3020), 10 states have internal predecessors, (3020), 0 states have call successors, (0), 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-16 11:29:00,010 INFO L175 Difference]: Start difference. First operand has 330 places, 391 transitions, 2542 flow. Second operand 9 states and 2152 transitions. [2022-11-16 11:29:00,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 478 transitions, 3664 flow [2022-11-16 11:29:00,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 478 transitions, 3585 flow, removed 32 selfloop flow, removed 4 redundant places. [2022-11-16 11:29:00,185 INFO L231 Difference]: Finished difference. Result has 335 places, 412 transitions, 2924 flow [2022-11-16 11:29:00,186 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=2493, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2924, PETRI_PLACES=335, PETRI_TRANSITIONS=412} [2022-11-16 11:29:00,187 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 65 predicate places. [2022-11-16 11:29:00,187 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 412 transitions, 2924 flow [2022-11-16 11:29:00,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 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-16 11:29:00,188 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:29:00,188 INFO L209 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] [2022-11-16 11:29:00,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 11:29:00,189 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-16 11:29:00,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:29:00,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1992335965, now seen corresponding path program 3 times [2022-11-16 11:29:00,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:29:00,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552390330] [2022-11-16 11:29:00,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:29:00,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:29:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:00,723 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-16 11:29:00,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:29:00,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552390330] [2022-11-16 11:29:00,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552390330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:29:00,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:29:00,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:29:00,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782800156] [2022-11-16 11:29:00,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:29:00,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:29:00,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:29:00,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:29:00,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:29:00,728 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-16 11:29:00,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 412 transitions, 2924 flow. Second operand has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 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-16 11:29:00,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:29:00,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-16 11:29:00,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:29:02,723 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([816] thread3EXIT-->L125-2: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem33#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][427], [Black: 376#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 366#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 374#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 500#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0)), 498#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), 410#true, 473#true, Black: 317#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)), Black: 323#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= (+ ~count3~0 2) ~count1~0))), Black: 461#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 451#(or (<= ~res2~0 0) (<= 1 ~res3~0)), Black: 396#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0)))), Black: 390#(or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0))), Black: 457#(and (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 399#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0)))), Black: 519#(<= ~count1~0 ~count3~0), Black: 459#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 529#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 533#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 531#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 287#true, Black: 350#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0))), 447#true, Black: 353#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0))), Black: 418#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), 344#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 420#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 475#(<= ~count2~0 ~count1~0), Black: 484#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0))), 542#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 481#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), Black: 412#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 476#(or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)), 364#true, Black: 292#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), 85#L125-2true, Black: 300#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count3~0 2) ~count1~0) (<= ~res1~0 0))), Black: 439#(= thread3Thread1of1ForFork2_~stop~2 0), 527#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0))), Black: 444#(= thread2Thread1of1ForFork1_~stop~1 0), 388#true]) [2022-11-16 11:29:02,724 INFO L383 tUnfolder$Statistics]: this new event has 193 ancestors and is not cut-off event [2022-11-16 11:29:02,724 INFO L386 tUnfolder$Statistics]: existing Event has 193 ancestors and is not cut-off event [2022-11-16 11:29:02,724 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is not cut-off event [2022-11-16 11:29:02,724 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is not cut-off event [2022-11-16 11:29:02,760 INFO L130 PetriNetUnfolder]: 1233/7269 cut-off events. [2022-11-16 11:29:02,760 INFO L131 PetriNetUnfolder]: For 28506/29485 co-relation queries the response was YES. [2022-11-16 11:29:02,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18836 conditions, 7269 events. 1233/7269 cut-off events. For 28506/29485 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 84984 event pairs, 372 based on Foata normal form. 122/6927 useless extension candidates. Maximal degree in co-relation 18792. Up to 1425 conditions per place. [2022-11-16 11:29:02,851 INFO L137 encePairwiseOnDemand]: 290/302 looper letters, 159 selfloop transitions, 22 changer transitions 9/448 dead transitions. [2022-11-16 11:29:02,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 448 transitions, 3538 flow [2022-11-16 11:29:02,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:29:02,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:29:02,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2127 transitions. [2022-11-16 11:29:02,858 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.782560706401766 [2022-11-16 11:29:02,859 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2127 transitions. [2022-11-16 11:29:02,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2127 transitions. [2022-11-16 11:29:02,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:29:02,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2127 transitions. [2022-11-16 11:29:02,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 236.33333333333334) internal successors, (2127), 9 states have internal predecessors, (2127), 0 states have call successors, (0), 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-16 11:29:02,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 302.0) internal successors, (3020), 10 states have internal predecessors, (3020), 0 states have call successors, (0), 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-16 11:29:02,873 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 302.0) internal successors, (3020), 10 states have internal predecessors, (3020), 0 states have call successors, (0), 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-16 11:29:02,873 INFO L175 Difference]: Start difference. First operand has 335 places, 412 transitions, 2924 flow. Second operand 9 states and 2127 transitions. [2022-11-16 11:29:02,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 448 transitions, 3538 flow [2022-11-16 11:29:03,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 448 transitions, 3443 flow, removed 28 selfloop flow, removed 4 redundant places. [2022-11-16 11:29:03,082 INFO L231 Difference]: Finished difference. Result has 341 places, 412 transitions, 2904 flow [2022-11-16 11:29:03,083 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=2839, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2904, PETRI_PLACES=341, PETRI_TRANSITIONS=412} [2022-11-16 11:29:03,084 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 71 predicate places. [2022-11-16 11:29:03,084 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 412 transitions, 2904 flow [2022-11-16 11:29:03,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 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-16 11:29:03,085 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:29:03,085 INFO L209 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] [2022-11-16 11:29:03,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 11:29:03,086 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-16 11:29:03,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:29:03,086 INFO L85 PathProgramCache]: Analyzing trace with hash 991306587, now seen corresponding path program 1 times [2022-11-16 11:29:03,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:29:03,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703726738] [2022-11-16 11:29:03,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:29:03,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:29:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:03,540 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-16 11:29:03,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:29:03,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703726738] [2022-11-16 11:29:03,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703726738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:29:03,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:29:03,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:29:03,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023935749] [2022-11-16 11:29:03,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:29:03,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:29:03,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:29:03,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:29:03,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:29:03,549 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-16 11:29:03,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 412 transitions, 2904 flow. Second operand has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 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-16 11:29:03,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:29:03,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-16 11:29:03,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:29:05,877 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([815] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem32#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][405], [Black: 376#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 366#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 374#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 500#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0)), 410#true, 517#true, Black: 317#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)), Black: 461#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 451#(or (<= ~res2~0 0) (<= 1 ~res3~0)), Black: 396#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0)))), Black: 390#(or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0))), Black: 457#(and (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 519#(<= ~count1~0 ~count3~0), Black: 399#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0)))), Black: 529#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 459#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 527#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0))), 287#true, 72#L124-2true, 540#true, 565#(<= ~count3~0 ~count2~0), 224#thread3ENTRYtrue, Black: 350#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0))), Black: 353#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0))), Black: 344#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 418#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), 481#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), Black: 475#(<= ~count2~0 ~count1~0), Black: 420#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 484#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0))), Black: 412#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), 496#true, Black: 476#(or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)), Black: 553#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), 364#true, Black: 555#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 557#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 550#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 292#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 434#(= thread1Thread1of1ForFork0_~stop~0 0), 449#(<= ~count2~0 ~count1~0), Black: 300#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count3~0 2) ~count1~0) (<= ~res1~0 0))), Black: 439#(= thread3Thread1of1ForFork2_~stop~2 0), 313#true, Black: 444#(= thread2Thread1of1ForFork1_~stop~1 0), 388#true]) [2022-11-16 11:29:05,878 INFO L383 tUnfolder$Statistics]: this new event has 185 ancestors and is not cut-off event [2022-11-16 11:29:05,878 INFO L386 tUnfolder$Statistics]: existing Event has 187 ancestors and is not cut-off event [2022-11-16 11:29:05,878 INFO L386 tUnfolder$Statistics]: existing Event has 185 ancestors and is not cut-off event [2022-11-16 11:29:05,878 INFO L386 tUnfolder$Statistics]: existing Event has 186 ancestors and is not cut-off event [2022-11-16 11:29:05,878 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([815] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem32#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][405], [Black: 376#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 366#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 374#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 500#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0)), 410#true, 517#true, Black: 317#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)), Black: 461#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 451#(or (<= ~res2~0 0) (<= 1 ~res3~0)), Black: 396#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0)))), Black: 390#(or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0))), Black: 457#(and (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 519#(<= ~count1~0 ~count3~0), Black: 399#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0)))), Black: 529#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 459#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 527#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0))), 287#true, 72#L124-2true, 540#true, 565#(<= ~count3~0 ~count2~0), 122#L100true, Black: 350#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0))), Black: 353#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0))), Black: 344#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 418#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), 481#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), Black: 475#(<= ~count2~0 ~count1~0), Black: 420#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 484#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0))), Black: 412#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), 496#true, Black: 476#(or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)), Black: 553#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), 364#true, Black: 555#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 557#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 550#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 292#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 434#(= thread1Thread1of1ForFork0_~stop~0 0), 449#(<= ~count2~0 ~count1~0), Black: 300#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count3~0 2) ~count1~0) (<= ~res1~0 0))), 313#true, Black: 444#(= thread2Thread1of1ForFork1_~stop~1 0), 388#true]) [2022-11-16 11:29:05,878 INFO L383 tUnfolder$Statistics]: this new event has 187 ancestors and is cut-off event [2022-11-16 11:29:05,879 INFO L386 tUnfolder$Statistics]: existing Event has 189 ancestors and is cut-off event [2022-11-16 11:29:05,879 INFO L386 tUnfolder$Statistics]: existing Event has 187 ancestors and is cut-off event [2022-11-16 11:29:05,879 INFO L386 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-11-16 11:29:05,892 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([815] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem32#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][405], [Black: 376#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 366#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 374#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 500#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0)), Black: 317#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)), Black: 461#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 451#(or (<= ~res2~0 0) (<= 1 ~res3~0)), Black: 396#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0)))), Black: 390#(or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0))), Black: 457#(and (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 399#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0)))), Black: 459#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 529#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 527#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0))), 58#L89true, 287#true, 72#L124-2true, 565#(<= ~count3~0 ~count2~0), 540#true, Black: 350#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0))), Black: 353#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0))), Black: 344#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 418#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 420#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), 481#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), Black: 475#(<= ~count2~0 ~count1~0), Black: 484#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0))), 496#true, Black: 476#(or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)), Black: 553#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), 364#true, Black: 555#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 557#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 550#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), 519#(<= ~count1~0 ~count3~0), Black: 292#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 434#(= thread1Thread1of1ForFork0_~stop~0 0), 449#(<= ~count2~0 ~count1~0), Black: 300#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count3~0 2) ~count1~0) (<= ~res1~0 0))), 412#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), 313#true, Black: 444#(= thread2Thread1of1ForFork1_~stop~1 0), 388#true]) [2022-11-16 11:29:05,893 INFO L383 tUnfolder$Statistics]: this new event has 189 ancestors and is cut-off event [2022-11-16 11:29:05,893 INFO L386 tUnfolder$Statistics]: existing Event has 187 ancestors and is cut-off event [2022-11-16 11:29:05,893 INFO L386 tUnfolder$Statistics]: existing Event has 187 ancestors and is cut-off event [2022-11-16 11:29:05,893 INFO L386 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-11-16 11:29:06,041 INFO L130 PetriNetUnfolder]: 1394/7739 cut-off events. [2022-11-16 11:29:06,041 INFO L131 PetriNetUnfolder]: For 35371/36661 co-relation queries the response was YES. [2022-11-16 11:29:06,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21295 conditions, 7739 events. 1394/7739 cut-off events. For 35371/36661 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 91710 event pairs, 371 based on Foata normal form. 146/7419 useless extension candidates. Maximal degree in co-relation 21249. Up to 1163 conditions per place. [2022-11-16 11:29:06,121 INFO L137 encePairwiseOnDemand]: 293/302 looper letters, 204 selfloop transitions, 21 changer transitions 6/472 dead transitions. [2022-11-16 11:29:06,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 472 transitions, 3971 flow [2022-11-16 11:29:06,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:29:06,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-16 11:29:06,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1677 transitions. [2022-11-16 11:29:06,132 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.793282876064333 [2022-11-16 11:29:06,132 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1677 transitions. [2022-11-16 11:29:06,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1677 transitions. [2022-11-16 11:29:06,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:29:06,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1677 transitions. [2022-11-16 11:29:06,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 239.57142857142858) internal successors, (1677), 7 states have internal predecessors, (1677), 0 states have call successors, (0), 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-16 11:29:06,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 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-16 11:29:06,143 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 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-16 11:29:06,144 INFO L175 Difference]: Start difference. First operand has 341 places, 412 transitions, 2904 flow. Second operand 7 states and 1677 transitions. [2022-11-16 11:29:06,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 472 transitions, 3971 flow [2022-11-16 11:29:06,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 472 transitions, 3887 flow, removed 23 selfloop flow, removed 6 redundant places. [2022-11-16 11:29:06,382 INFO L231 Difference]: Finished difference. Result has 344 places, 421 transitions, 3082 flow [2022-11-16 11:29:06,383 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=2844, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3082, PETRI_PLACES=344, PETRI_TRANSITIONS=421} [2022-11-16 11:29:06,384 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 74 predicate places. [2022-11-16 11:29:06,384 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 421 transitions, 3082 flow [2022-11-16 11:29:06,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 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-16 11:29:06,386 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:29:06,387 INFO L209 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] [2022-11-16 11:29:06,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 11:29:06,391 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-16 11:29:06,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:29:06,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1489914153, now seen corresponding path program 2 times [2022-11-16 11:29:06,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:29:06,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450866455] [2022-11-16 11:29:06,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:29:06,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:29:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:07,020 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-16 11:29:07,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:29:07,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450866455] [2022-11-16 11:29:07,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450866455] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:29:07,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:29:07,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-16 11:29:07,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111377059] [2022-11-16 11:29:07,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:29:07,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 11:29:07,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:29:07,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 11:29:07,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:29:07,026 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 302 [2022-11-16 11:29:07,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 421 transitions, 3082 flow. Second operand has 14 states, 14 states have (on average 205.21428571428572) internal successors, (2873), 14 states have internal predecessors, (2873), 0 states have call successors, (0), 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-16 11:29:07,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:29:07,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 302 [2022-11-16 11:29:07,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:29:12,751 INFO L130 PetriNetUnfolder]: 4779/21759 cut-off events. [2022-11-16 11:29:12,752 INFO L131 PetriNetUnfolder]: For 84540/86558 co-relation queries the response was YES. [2022-11-16 11:29:12,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56501 conditions, 21759 events. 4779/21759 cut-off events. For 84540/86558 co-relation queries the response was YES. Maximal size of possible extension queue 973. Compared 298273 event pairs, 1204 based on Foata normal form. 275/19709 useless extension candidates. Maximal degree in co-relation 56452. Up to 3001 conditions per place. [2022-11-16 11:29:12,995 INFO L137 encePairwiseOnDemand]: 281/302 looper letters, 197 selfloop transitions, 93 changer transitions 15/571 dead transitions. [2022-11-16 11:29:12,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 571 transitions, 5247 flow [2022-11-16 11:29:12,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 11:29:12,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-11-16 11:29:13,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4168 transitions. [2022-11-16 11:29:13,004 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6900662251655629 [2022-11-16 11:29:13,004 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 4168 transitions. [2022-11-16 11:29:13,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 4168 transitions. [2022-11-16 11:29:13,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:29:13,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 4168 transitions. [2022-11-16 11:29:13,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 208.4) internal successors, (4168), 20 states have internal predecessors, (4168), 0 states have call successors, (0), 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-16 11:29:13,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 302.0) internal successors, (6342), 21 states have internal predecessors, (6342), 0 states have call successors, (0), 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-16 11:29:13,026 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 302.0) internal successors, (6342), 21 states have internal predecessors, (6342), 0 states have call successors, (0), 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-16 11:29:13,026 INFO L175 Difference]: Start difference. First operand has 344 places, 421 transitions, 3082 flow. Second operand 20 states and 4168 transitions. [2022-11-16 11:29:13,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 571 transitions, 5247 flow [2022-11-16 11:29:13,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 571 transitions, 5183 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-11-16 11:29:13,421 INFO L231 Difference]: Finished difference. Result has 367 places, 469 transitions, 4001 flow [2022-11-16 11:29:13,422 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=3040, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4001, PETRI_PLACES=367, PETRI_TRANSITIONS=469} [2022-11-16 11:29:13,422 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 97 predicate places. [2022-11-16 11:29:13,422 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 469 transitions, 4001 flow [2022-11-16 11:29:13,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 205.21428571428572) internal successors, (2873), 14 states have internal predecessors, (2873), 0 states have call successors, (0), 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-16 11:29:13,424 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:29:13,424 INFO L209 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] [2022-11-16 11:29:13,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 11:29:13,424 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-16 11:29:13,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:29:13,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1117367067, now seen corresponding path program 4 times [2022-11-16 11:29:13,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:29:13,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135093304] [2022-11-16 11:29:13,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:29:13,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:29:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:13,979 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-16 11:29:13,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:29:13,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135093304] [2022-11-16 11:29:13,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135093304] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:29:13,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:29:13,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:29:13,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216225808] [2022-11-16 11:29:13,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:29:13,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:29:13,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:29:13,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:29:13,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:29:13,984 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-16 11:29:13,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 469 transitions, 4001 flow. Second operand has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 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-16 11:29:13,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:29:13,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-16 11:29:13,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:29:18,274 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([816] thread3EXIT-->L125-2: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem33#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][475], [Black: 376#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 596#(<= ~res2~0 0), Black: 366#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 618#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 374#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 500#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0)), 473#true, Black: 396#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0)))), Black: 390#(or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0))), Black: 519#(<= ~count1~0 ~count3~0), Black: 399#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0)))), Black: 529#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), 642#true, Black: 418#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 420#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 412#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 553#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), 364#true, Black: 550#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), 85#L125-2true, Black: 300#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count3~0 2) ~count1~0) (<= ~res1~0 0))), Black: 439#(= thread3Thread1of1ForFork2_~stop~2 0), Black: 444#(= thread2Thread1of1ForFork1_~stop~1 0), Black: 565#(<= ~count3~0 ~count2~0), Black: 574#(and (<= ~count3~0 ~count2~0) (or (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count3~0 1) ~count1~0))), 410#true, Black: 317#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)), Black: 461#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 451#(or (<= ~res2~0 0) (<= 1 ~res3~0)), 585#true, Black: 457#(and (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 459#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), 287#true, Black: 350#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0))), 447#true, Black: 353#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0))), 344#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 475#(<= ~count2~0 ~count1~0), Black: 484#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0))), 542#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 481#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), Black: 476#(or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)), 571#(and (<= ~count3~0 ~count2~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count3~0 1) ~count1~0))), Black: 620#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 608#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 527#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0))), Black: 614#(and (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 630#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 626#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 616#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 628#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 624#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), 388#true]) [2022-11-16 11:29:18,275 INFO L383 tUnfolder$Statistics]: this new event has 200 ancestors and is not cut-off event [2022-11-16 11:29:18,275 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is not cut-off event [2022-11-16 11:29:18,275 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is not cut-off event [2022-11-16 11:29:18,275 INFO L386 tUnfolder$Statistics]: existing Event has 202 ancestors and is not cut-off event [2022-11-16 11:29:18,333 INFO L130 PetriNetUnfolder]: 2669/16315 cut-off events. [2022-11-16 11:29:18,333 INFO L131 PetriNetUnfolder]: For 80550/82457 co-relation queries the response was YES. [2022-11-16 11:29:18,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44413 conditions, 16315 events. 2669/16315 cut-off events. For 80550/82457 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 224509 event pairs, 966 based on Foata normal form. 178/15489 useless extension candidates. Maximal degree in co-relation 44357. Up to 3454 conditions per place. [2022-11-16 11:29:18,541 INFO L137 encePairwiseOnDemand]: 294/302 looper letters, 185 selfloop transitions, 35 changer transitions 12/497 dead transitions. [2022-11-16 11:29:18,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 497 transitions, 4593 flow [2022-11-16 11:29:18,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:29:18,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-16 11:29:18,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1896 transitions. [2022-11-16 11:29:18,550 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7847682119205298 [2022-11-16 11:29:18,550 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1896 transitions. [2022-11-16 11:29:18,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1896 transitions. [2022-11-16 11:29:18,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:29:18,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1896 transitions. [2022-11-16 11:29:18,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 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-16 11:29:18,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 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-16 11:29:18,562 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 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-16 11:29:18,563 INFO L175 Difference]: Start difference. First operand has 367 places, 469 transitions, 4001 flow. Second operand 8 states and 1896 transitions. [2022-11-16 11:29:18,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 497 transitions, 4593 flow [2022-11-16 11:29:19,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 497 transitions, 4513 flow, removed 13 selfloop flow, removed 7 redundant places. [2022-11-16 11:29:19,259 INFO L231 Difference]: Finished difference. Result has 368 places, 465 transitions, 3941 flow [2022-11-16 11:29:19,259 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=3937, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3941, PETRI_PLACES=368, PETRI_TRANSITIONS=465} [2022-11-16 11:29:19,259 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 98 predicate places. [2022-11-16 11:29:19,260 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 465 transitions, 3941 flow [2022-11-16 11:29:19,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 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-16 11:29:19,260 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:29:19,260 INFO L209 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] [2022-11-16 11:29:19,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 11:29:19,260 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-16 11:29:19,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:29:19,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1388413625, now seen corresponding path program 5 times [2022-11-16 11:29:19,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:29:19,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881641542] [2022-11-16 11:29:19,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:29:19,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:29:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:19,636 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-16 11:29:19,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:29:19,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881641542] [2022-11-16 11:29:19,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881641542] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:29:19,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:29:19,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:29:19,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402887303] [2022-11-16 11:29:19,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:29:19,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:29:19,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:29:19,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:29:19,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:29:19,643 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-16 11:29:19,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 465 transitions, 3941 flow. Second operand has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 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-16 11:29:19,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:29:19,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-16 11:29:19,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:29:24,505 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([816] thread3EXIT-->L125-2: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem33#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][478], [Black: 376#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 596#(<= ~res2~0 0), Black: 366#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 618#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 374#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 500#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0)), 661#true, 473#true, Black: 654#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 652#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0))), Black: 656#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 396#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0)))), Black: 390#(or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0))), Black: 519#(<= ~count1~0 ~count3~0), Black: 399#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0)))), Black: 529#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), 642#true, Black: 418#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 420#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 412#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 553#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), 364#true, Black: 550#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), 85#L125-2true, Black: 300#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count3~0 2) ~count1~0) (<= ~res1~0 0))), Black: 439#(= thread3Thread1of1ForFork2_~stop~2 0), Black: 444#(= thread2Thread1of1ForFork1_~stop~1 0), Black: 565#(<= ~count3~0 ~count2~0), Black: 574#(and (<= ~count3~0 ~count2~0) (or (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count3~0 1) ~count1~0))), 410#true, Black: 317#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)), Black: 461#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 451#(or (<= ~res2~0 0) (<= 1 ~res3~0)), Black: 457#(and (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 459#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), 287#true, Black: 350#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0))), 447#true, Black: 353#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0))), 344#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 475#(<= ~count2~0 ~count1~0), 542#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 484#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0))), Black: 481#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), Black: 476#(or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)), 571#(and (<= ~count3~0 ~count2~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count3~0 1) ~count1~0))), Black: 620#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), 527#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0))), Black: 608#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 614#(and (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 626#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 616#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), 388#true, Black: 624#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0))]) [2022-11-16 11:29:24,506 INFO L383 tUnfolder$Statistics]: this new event has 200 ancestors and is not cut-off event [2022-11-16 11:29:24,506 INFO L386 tUnfolder$Statistics]: existing Event has 202 ancestors and is not cut-off event [2022-11-16 11:29:24,506 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is not cut-off event [2022-11-16 11:29:24,506 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is not cut-off event [2022-11-16 11:29:24,567 INFO L130 PetriNetUnfolder]: 2656/16742 cut-off events. [2022-11-16 11:29:24,568 INFO L131 PetriNetUnfolder]: For 79187/81258 co-relation queries the response was YES. [2022-11-16 11:29:24,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44915 conditions, 16742 events. 2656/16742 cut-off events. For 79187/81258 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 232418 event pairs, 918 based on Foata normal form. 180/15938 useless extension candidates. Maximal degree in co-relation 44858. Up to 3456 conditions per place. [2022-11-16 11:29:24,785 INFO L137 encePairwiseOnDemand]: 293/302 looper letters, 189 selfloop transitions, 39 changer transitions 8/501 dead transitions. [2022-11-16 11:29:24,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 501 transitions, 4636 flow [2022-11-16 11:29:24,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:29:24,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-16 11:29:24,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1674 transitions. [2022-11-16 11:29:24,789 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7918637653736992 [2022-11-16 11:29:24,789 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1674 transitions. [2022-11-16 11:29:24,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1674 transitions. [2022-11-16 11:29:24,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:29:24,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1674 transitions. [2022-11-16 11:29:24,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 239.14285714285714) internal successors, (1674), 7 states have internal predecessors, (1674), 0 states have call successors, (0), 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-16 11:29:24,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 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-16 11:29:24,797 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 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-16 11:29:24,797 INFO L175 Difference]: Start difference. First operand has 368 places, 465 transitions, 3941 flow. Second operand 7 states and 1674 transitions. [2022-11-16 11:29:24,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 501 transitions, 4636 flow [2022-11-16 11:29:25,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 501 transitions, 4510 flow, removed 27 selfloop flow, removed 7 redundant places. [2022-11-16 11:29:25,238 INFO L231 Difference]: Finished difference. Result has 367 places, 470 transitions, 3982 flow [2022-11-16 11:29:25,239 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=3833, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3982, PETRI_PLACES=367, PETRI_TRANSITIONS=470} [2022-11-16 11:29:25,240 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 97 predicate places. [2022-11-16 11:29:25,240 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 470 transitions, 3982 flow [2022-11-16 11:29:25,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 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-16 11:29:25,241 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:29:25,241 INFO L209 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] [2022-11-16 11:29:25,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 11:29:25,242 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-16 11:29:25,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:29:25,242 INFO L85 PathProgramCache]: Analyzing trace with hash -838506953, now seen corresponding path program 6 times [2022-11-16 11:29:25,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:29:25,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842930854] [2022-11-16 11:29:25,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:29:25,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:29:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:25,753 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-16 11:29:25,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:29:25,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842930854] [2022-11-16 11:29:25,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842930854] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:29:25,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:29:25,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:29:25,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518004553] [2022-11-16 11:29:25,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:29:25,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:29:25,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:29:25,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:29:25,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:29:25,758 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-16 11:29:25,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 470 transitions, 3982 flow. Second operand has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 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-16 11:29:25,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:29:25,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-16 11:29:25,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:29:30,522 INFO L130 PetriNetUnfolder]: 2672/16907 cut-off events. [2022-11-16 11:29:30,522 INFO L131 PetriNetUnfolder]: For 79465/81384 co-relation queries the response was YES. [2022-11-16 11:29:30,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45365 conditions, 16907 events. 2672/16907 cut-off events. For 79465/81384 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 234866 event pairs, 696 based on Foata normal form. 248/16240 useless extension candidates. Maximal degree in co-relation 45308. Up to 2365 conditions per place. [2022-11-16 11:29:30,734 INFO L137 encePairwiseOnDemand]: 291/302 looper letters, 214 selfloop transitions, 33 changer transitions 11/523 dead transitions. [2022-11-16 11:29:30,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 523 transitions, 4966 flow [2022-11-16 11:29:30,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:29:30,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-16 11:29:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1901 transitions. [2022-11-16 11:29:30,738 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7868377483443708 [2022-11-16 11:29:30,738 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1901 transitions. [2022-11-16 11:29:30,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1901 transitions. [2022-11-16 11:29:30,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:29:30,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1901 transitions. [2022-11-16 11:29:30,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 237.625) internal successors, (1901), 8 states have internal predecessors, (1901), 0 states have call successors, (0), 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-16 11:29:30,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 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-16 11:29:30,747 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 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-16 11:29:30,747 INFO L175 Difference]: Start difference. First operand has 367 places, 470 transitions, 3982 flow. Second operand 8 states and 1901 transitions. [2022-11-16 11:29:30,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 523 transitions, 4966 flow [2022-11-16 11:29:31,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 523 transitions, 4904 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-11-16 11:29:31,163 INFO L231 Difference]: Finished difference. Result has 373 places, 472 transitions, 4020 flow [2022-11-16 11:29:31,164 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=3936, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4020, PETRI_PLACES=373, PETRI_TRANSITIONS=472} [2022-11-16 11:29:31,165 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 103 predicate places. [2022-11-16 11:29:31,165 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 472 transitions, 4020 flow [2022-11-16 11:29:31,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 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-16 11:29:31,166 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:29:31,166 INFO L209 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] [2022-11-16 11:29:31,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 11:29:31,167 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-16 11:29:31,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:29:31,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1829309927, now seen corresponding path program 3 times [2022-11-16 11:29:31,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:29:31,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490991718] [2022-11-16 11:29:31,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:29:31,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:29:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:31,649 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-16 11:29:31,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:29:31,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490991718] [2022-11-16 11:29:31,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490991718] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:29:31,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:29:31,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-16 11:29:31,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808462357] [2022-11-16 11:29:31,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:29:31,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 11:29:31,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:29:31,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 11:29:31,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:29:31,655 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 302 [2022-11-16 11:29:31,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 472 transitions, 4020 flow. Second operand has 14 states, 14 states have (on average 205.21428571428572) internal successors, (2873), 14 states have internal predecessors, (2873), 0 states have call successors, (0), 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-16 11:29:31,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:29:31,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 302 [2022-11-16 11:29:31,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:29:43,487 INFO L130 PetriNetUnfolder]: 9059/41889 cut-off events. [2022-11-16 11:29:43,487 INFO L131 PetriNetUnfolder]: For 190078/193915 co-relation queries the response was YES. [2022-11-16 11:29:43,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114525 conditions, 41889 events. 9059/41889 cut-off events. For 190078/193915 co-relation queries the response was YES. Maximal size of possible extension queue 1761. Compared 635588 event pairs, 2354 based on Foata normal form. 686/38174 useless extension candidates. Maximal degree in co-relation 114466. Up to 6119 conditions per place. [2022-11-16 11:29:44,049 INFO L137 encePairwiseOnDemand]: 279/302 looper letters, 268 selfloop transitions, 77 changer transitions 22/671 dead transitions. [2022-11-16 11:29:44,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 671 transitions, 6711 flow [2022-11-16 11:29:44,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 11:29:44,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-11-16 11:29:44,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4187 transitions. [2022-11-16 11:29:44,057 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6932119205298013 [2022-11-16 11:29:44,057 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 4187 transitions. [2022-11-16 11:29:44,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 4187 transitions. [2022-11-16 11:29:44,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:29:44,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 4187 transitions. [2022-11-16 11:29:44,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 209.35) internal successors, (4187), 20 states have internal predecessors, (4187), 0 states have call successors, (0), 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-16 11:29:44,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 302.0) internal successors, (6342), 21 states have internal predecessors, (6342), 0 states have call successors, (0), 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-16 11:29:44,076 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 302.0) internal successors, (6342), 21 states have internal predecessors, (6342), 0 states have call successors, (0), 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-16 11:29:44,077 INFO L175 Difference]: Start difference. First operand has 373 places, 472 transitions, 4020 flow. Second operand 20 states and 4187 transitions. [2022-11-16 11:29:44,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 671 transitions, 6711 flow [2022-11-16 11:29:46,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 671 transitions, 6654 flow, removed 22 selfloop flow, removed 4 redundant places. [2022-11-16 11:29:46,027 INFO L231 Difference]: Finished difference. Result has 394 places, 509 transitions, 4627 flow [2022-11-16 11:29:46,028 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=3985, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4627, PETRI_PLACES=394, PETRI_TRANSITIONS=509} [2022-11-16 11:29:46,028 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 124 predicate places. [2022-11-16 11:29:46,029 INFO L495 AbstractCegarLoop]: Abstraction has has 394 places, 509 transitions, 4627 flow [2022-11-16 11:29:46,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 205.21428571428572) internal successors, (2873), 14 states have internal predecessors, (2873), 0 states have call successors, (0), 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-16 11:29:46,030 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:29:46,030 INFO L209 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] [2022-11-16 11:29:46,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 11:29:46,030 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-16 11:29:46,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:29:46,031 INFO L85 PathProgramCache]: Analyzing trace with hash -122927118, now seen corresponding path program 1 times [2022-11-16 11:29:46,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:29:46,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766164400] [2022-11-16 11:29:46,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:29:46,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:29:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:46,446 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-16 11:29:46,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:29:46,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766164400] [2022-11-16 11:29:46,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766164400] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:29:46,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:29:46,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:29:46,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622157688] [2022-11-16 11:29:46,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:29:46,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:29:46,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:29:46,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:29:46,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:29:46,453 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-16 11:29:46,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 509 transitions, 4627 flow. Second operand has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 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-16 11:29:46,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:29:46,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-16 11:29:46,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand