./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 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_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a --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 e9065224c0b163ad014fc0aee4009feab43ed37ef70e06d8d8f3b14d045f755a --- 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-b5237d8 [2022-11-21 14:00:29,884 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 14:00:29,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 14:00:29,910 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 14:00:29,911 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 14:00:29,912 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 14:00:29,914 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 14:00:29,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 14:00:29,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 14:00:29,919 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 14:00:29,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 14:00:29,922 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 14:00:29,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 14:00:29,924 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 14:00:29,925 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 14:00:29,927 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 14:00:29,928 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 14:00:29,929 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 14:00:29,931 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 14:00:29,933 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 14:00:29,935 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 14:00:29,937 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 14:00:29,939 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 14:00:29,941 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 14:00:29,945 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 14:00:29,945 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 14:00:29,946 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 14:00:29,947 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 14:00:29,948 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 14:00:29,949 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 14:00:29,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 14:00:29,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 14:00:29,952 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 14:00:29,953 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 14:00:29,954 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 14:00:29,954 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 14:00:29,955 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 14:00:29,956 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 14:00:29,956 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 14:00:29,958 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 14:00:29,959 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 14:00:29,960 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 14:00:29,987 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 14:00:29,988 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 14:00:29,988 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 14:00:29,989 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 14:00:29,989 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 14:00:29,990 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 14:00:29,991 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 14:00:29,991 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 14:00:30,000 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 14:00:30,000 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 14:00:30,001 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 14:00:30,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 14:00:30,002 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 14:00:30,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 14:00:30,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 14:00:30,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 14:00:30,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 14:00:30,003 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 14:00:30,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 14:00:30,004 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 14:00:30,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 14:00:30,005 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 14:00:30,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 14:00:30,005 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 14:00:30,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 14:00:30,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 14:00:30,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 14:00:30,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 14:00:30,007 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 14:00:30,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 14:00:30,007 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 14:00:30,008 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 14:00:30,008 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 14:00:30,008 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_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/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_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a 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 -> e9065224c0b163ad014fc0aee4009feab43ed37ef70e06d8d8f3b14d045f755a [2022-11-21 14:00:30,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 14:00:30,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 14:00:30,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 14:00:30,352 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 14:00:30,353 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 14:00:30,355 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c [2022-11-21 14:00:33,888 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 14:00:34,188 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 14:00:34,188 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c [2022-11-21 14:00:34,197 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/data/84c7539d2/06c43a4c14e14c0685027495405ea0a6/FLAG4d06fd7d7 [2022-11-21 14:00:34,214 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/data/84c7539d2/06c43a4c14e14c0685027495405ea0a6 [2022-11-21 14:00:34,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 14:00:34,219 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 14:00:34,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 14:00:34,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 14:00:34,226 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 14:00:34,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 02:00:34" (1/1) ... [2022-11-21 14:00:34,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b1007ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:00:34, skipping insertion in model container [2022-11-21 14:00:34,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 02:00:34" (1/1) ... [2022-11-21 14:00:34,237 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 14:00:34,258 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 14:00:34,457 WARN L237 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_700b185e-0ff1-48cc-a4de-fd7141aa7024/sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c[2566,2579] [2022-11-21 14:00:34,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 14:00:34,481 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 14:00:34,510 WARN L237 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_700b185e-0ff1-48cc-a4de-fd7141aa7024/sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c[2566,2579] [2022-11-21 14:00:34,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 14:00:34,532 INFO L208 MainTranslator]: Completed translation [2022-11-21 14:00:34,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:00:34 WrapperNode [2022-11-21 14:00:34,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 14:00:34,534 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 14:00:34,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 14:00:34,535 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 14:00:34,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:00:34" (1/1) ... [2022-11-21 14:00:34,551 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:00:34" (1/1) ... [2022-11-21 14:00:34,584 INFO L138 Inliner]: procedures = 24, calls = 35, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 174 [2022-11-21 14:00:34,584 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 14:00:34,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 14:00:34,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 14:00:34,585 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 14:00:34,596 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:00:34" (1/1) ... [2022-11-21 14:00:34,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:00:34" (1/1) ... [2022-11-21 14:00:34,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:00:34" (1/1) ... [2022-11-21 14:00:34,601 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:00:34" (1/1) ... [2022-11-21 14:00:34,609 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:00:34" (1/1) ... [2022-11-21 14:00:34,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:00:34" (1/1) ... [2022-11-21 14:00:34,617 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:00:34" (1/1) ... [2022-11-21 14:00:34,618 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:00:34" (1/1) ... [2022-11-21 14:00:34,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 14:00:34,623 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 14:00:34,623 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 14:00:34,623 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 14:00:34,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:00:34" (1/1) ... [2022-11-21 14:00:34,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 14:00:34,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:00:34,664 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 14:00:34,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 14:00:34,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 14:00:34,728 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-21 14:00:34,729 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-21 14:00:34,730 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-21 14:00:34,730 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-21 14:00:34,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 14:00:34,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 14:00:34,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 14:00:34,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 14:00:34,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 14:00:34,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 14:00:34,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 14:00:34,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 14:00:34,741 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 14:00:34,886 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 14:00:34,889 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 14:00:35,371 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 14:00:35,384 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 14:00:35,384 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-21 14:00:35,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 02:00:35 BoogieIcfgContainer [2022-11-21 14:00:35,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 14:00:35,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 14:00:35,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 14:00:35,394 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 14:00:35,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 02:00:34" (1/3) ... [2022-11-21 14:00:35,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59b96f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 02:00:35, skipping insertion in model container [2022-11-21 14:00:35,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:00:34" (2/3) ... [2022-11-21 14:00:35,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59b96f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 02:00:35, skipping insertion in model container [2022-11-21 14:00:35,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 02:00:35" (3/3) ... [2022-11-21 14:00:35,399 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-chromosome-opt-symm.wvr.c [2022-11-21 14:00:35,410 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-21 14:00:35,423 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 14:00:35,423 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 14:00:35,424 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 14:00:35,564 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-21 14:00:35,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 212 transitions, 440 flow [2022-11-21 14:00:35,754 INFO L130 PetriNetUnfolder]: 19/210 cut-off events. [2022-11-21 14:00:35,755 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-21 14:00:35,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 210 events. 19/210 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 216 event pairs, 0 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 150. Up to 3 conditions per place. [2022-11-21 14:00:35,766 INFO L82 GeneralOperation]: Start removeDead. Operand has 200 places, 212 transitions, 440 flow [2022-11-21 14:00:35,777 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 189 places, 201 transitions, 414 flow [2022-11-21 14:00:35,791 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 14:00:35,800 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;@902f496, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 14:00:35,800 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-21 14:00:35,876 INFO L130 PetriNetUnfolder]: 19/200 cut-off events. [2022-11-21 14:00:35,876 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-21 14:00:35,877 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:00:35,878 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] [2022-11-21 14:00:35,878 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 14:00:35,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:00:35,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1446908551, now seen corresponding path program 1 times [2022-11-21 14:00:35,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:00:35,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022538578] [2022-11-21 14:00:35,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:00:35,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:00:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:36,239 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-21 14:00:36,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:00:36,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022538578] [2022-11-21 14:00:36,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022538578] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:00:36,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:00:36,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 14:00:36,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503672620] [2022-11-21 14:00:36,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:00:36,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 14:00:36,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:00:36,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 14:00:36,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 14:00:36,302 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 212 [2022-11-21 14:00:36,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 201 transitions, 414 flow. Second operand has 2 states, 2 states have (on average 200.0) internal successors, (400), 2 states have internal predecessors, (400), 0 states have call successors, (0), 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-21 14:00:36,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:00:36,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 212 [2022-11-21 14:00:36,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:00:36,428 INFO L130 PetriNetUnfolder]: 8/190 cut-off events. [2022-11-21 14:00:36,428 INFO L131 PetriNetUnfolder]: For 9/10 co-relation queries the response was YES. [2022-11-21 14:00:36,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 190 events. 8/190 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 204 event pairs, 0 based on Foata normal form. 13/188 useless extension candidates. Maximal degree in co-relation 143. Up to 5 conditions per place. [2022-11-21 14:00:36,434 INFO L137 encePairwiseOnDemand]: 201/212 looper letters, 4 selfloop transitions, 0 changer transitions 5/190 dead transitions. [2022-11-21 14:00:36,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 190 transitions, 400 flow [2022-11-21 14:00:36,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 14:00:36,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-21 14:00:36,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 407 transitions. [2022-11-21 14:00:36,459 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9599056603773585 [2022-11-21 14:00:36,461 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 407 transitions. [2022-11-21 14:00:36,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 407 transitions. [2022-11-21 14:00:36,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:00:36,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 407 transitions. [2022-11-21 14:00:36,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 203.5) internal successors, (407), 2 states have internal predecessors, (407), 0 states have call successors, (0), 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-21 14:00:36,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 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-21 14:00:36,495 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 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-21 14:00:36,497 INFO L175 Difference]: Start difference. First operand has 189 places, 201 transitions, 414 flow. Second operand 2 states and 407 transitions. [2022-11-21 14:00:36,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 190 transitions, 400 flow [2022-11-21 14:00:36,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 190 transitions, 392 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-21 14:00:36,507 INFO L231 Difference]: Finished difference. Result has 186 places, 185 transitions, 374 flow [2022-11-21 14:00:36,510 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=374, PETRI_PLACES=186, PETRI_TRANSITIONS=185} [2022-11-21 14:00:36,514 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, -3 predicate places. [2022-11-21 14:00:36,515 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 185 transitions, 374 flow [2022-11-21 14:00:36,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 200.0) internal successors, (400), 2 states have internal predecessors, (400), 0 states have call successors, (0), 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-21 14:00:36,516 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:00:36,517 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] [2022-11-21 14:00:36,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 14:00:36,518 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 14:00:36,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:00:36,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1277731351, now seen corresponding path program 1 times [2022-11-21 14:00:36,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:00:36,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888132273] [2022-11-21 14:00:36,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:00:36,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:00:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:37,053 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-21 14:00:37,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:00:37,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888132273] [2022-11-21 14:00:37,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888132273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:00:37,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:00:37,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 14:00:37,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034270549] [2022-11-21 14:00:37,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:00:37,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 14:00:37,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:00:37,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 14:00:37,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 14:00:37,060 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 212 [2022-11-21 14:00:37,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 185 transitions, 374 flow. Second operand has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 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-21 14:00:37,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:00:37,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 212 [2022-11-21 14:00:37,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:00:37,240 INFO L130 PetriNetUnfolder]: 8/197 cut-off events. [2022-11-21 14:00:37,240 INFO L131 PetriNetUnfolder]: For 2/3 co-relation queries the response was YES. [2022-11-21 14:00:37,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 197 events. 8/197 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 192 event pairs, 0 based on Foata normal form. 0/187 useless extension candidates. Maximal degree in co-relation 235. Up to 25 conditions per place. [2022-11-21 14:00:37,246 INFO L137 encePairwiseOnDemand]: 202/212 looper letters, 28 selfloop transitions, 8 changer transitions 0/193 dead transitions. [2022-11-21 14:00:37,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 193 transitions, 462 flow [2022-11-21 14:00:37,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 14:00:37,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-21 14:00:37,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 898 transitions. [2022-11-21 14:00:37,251 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8471698113207548 [2022-11-21 14:00:37,251 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 898 transitions. [2022-11-21 14:00:37,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 898 transitions. [2022-11-21 14:00:37,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:00:37,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 898 transitions. [2022-11-21 14:00:37,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 179.6) internal successors, (898), 5 states have internal predecessors, (898), 0 states have call successors, (0), 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-21 14:00:37,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 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-21 14:00:37,263 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 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-21 14:00:37,263 INFO L175 Difference]: Start difference. First operand has 186 places, 185 transitions, 374 flow. Second operand 5 states and 898 transitions. [2022-11-21 14:00:37,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 193 transitions, 462 flow [2022-11-21 14:00:37,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 193 transitions, 462 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 14:00:37,272 INFO L231 Difference]: Finished difference. Result has 186 places, 187 transitions, 406 flow [2022-11-21 14:00:37,273 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=406, PETRI_PLACES=186, PETRI_TRANSITIONS=187} [2022-11-21 14:00:37,274 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, -3 predicate places. [2022-11-21 14:00:37,274 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 187 transitions, 406 flow [2022-11-21 14:00:37,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 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-21 14:00:37,275 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:00:37,275 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] [2022-11-21 14:00:37,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 14:00:37,277 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 14:00:37,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:00:37,279 INFO L85 PathProgramCache]: Analyzing trace with hash 103260147, now seen corresponding path program 1 times [2022-11-21 14:00:37,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:00:37,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757285342] [2022-11-21 14:00:37,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:00:37,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:00:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:37,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 14:00:37,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:00:37,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757285342] [2022-11-21 14:00:37,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757285342] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:00:37,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485776714] [2022-11-21 14:00:37,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:00:37,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:00:37,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:00:37,766 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:00:37,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 14:00:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:37,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 14:00:37,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:00:38,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 14:00:38,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:00:38,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 14:00:38,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485776714] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 14:00:38,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 14:00:38,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-11-21 14:00:38,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587337774] [2022-11-21 14:00:38,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 14:00:38,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-21 14:00:38,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:00:38,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-21 14:00:38,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-11-21 14:00:38,342 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 212 [2022-11-21 14:00:38,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 187 transitions, 406 flow. Second operand has 15 states, 15 states have (on average 173.33333333333334) internal successors, (2600), 15 states have internal predecessors, (2600), 0 states have call successors, (0), 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-21 14:00:38,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:00:38,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 212 [2022-11-21 14:00:38,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:00:38,661 INFO L130 PetriNetUnfolder]: 8/215 cut-off events. [2022-11-21 14:00:38,661 INFO L131 PetriNetUnfolder]: For 10/11 co-relation queries the response was YES. [2022-11-21 14:00:38,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 215 events. 8/215 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 174 event pairs, 0 based on Foata normal form. 4/211 useless extension candidates. Maximal degree in co-relation 285. Up to 19 conditions per place. [2022-11-21 14:00:38,664 INFO L137 encePairwiseOnDemand]: 196/212 looper letters, 30 selfloop transitions, 22 changer transitions 0/207 dead transitions. [2022-11-21 14:00:38,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 207 transitions, 554 flow [2022-11-21 14:00:38,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 14:00:38,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-21 14:00:38,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1926 transitions. [2022-11-21 14:00:38,670 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8259005145797599 [2022-11-21 14:00:38,670 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1926 transitions. [2022-11-21 14:00:38,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1926 transitions. [2022-11-21 14:00:38,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:00:38,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1926 transitions. [2022-11-21 14:00:38,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 175.0909090909091) internal successors, (1926), 11 states have internal predecessors, (1926), 0 states have call successors, (0), 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-21 14:00:38,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 212.0) internal successors, (2544), 12 states have internal predecessors, (2544), 0 states have call successors, (0), 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-21 14:00:38,686 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 212.0) internal successors, (2544), 12 states have internal predecessors, (2544), 0 states have call successors, (0), 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-21 14:00:38,686 INFO L175 Difference]: Start difference. First operand has 186 places, 187 transitions, 406 flow. Second operand 11 states and 1926 transitions. [2022-11-21 14:00:38,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 207 transitions, 554 flow [2022-11-21 14:00:38,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 207 transitions, 542 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-21 14:00:38,696 INFO L231 Difference]: Finished difference. Result has 196 places, 199 transitions, 505 flow [2022-11-21 14:00:38,697 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=505, PETRI_PLACES=196, PETRI_TRANSITIONS=199} [2022-11-21 14:00:38,702 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 7 predicate places. [2022-11-21 14:00:38,702 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 199 transitions, 505 flow [2022-11-21 14:00:38,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 173.33333333333334) internal successors, (2600), 15 states have internal predecessors, (2600), 0 states have call successors, (0), 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-21 14:00:38,705 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:00:38,706 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 14:00:38,719 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 14:00:38,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:00:38,914 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 14:00:38,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:00:38,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1732772241, now seen corresponding path program 2 times [2022-11-21 14:00:38,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:00:38,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623231494] [2022-11-21 14:00:38,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:00:38,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:00:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:39,447 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-21 14:00:39,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:00:39,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623231494] [2022-11-21 14:00:39,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623231494] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:00:39,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833071362] [2022-11-21 14:00:39,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 14:00:39,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:00:39,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:00:39,451 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:00:39,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 14:00:39,627 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-21 14:00:39,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 14:00:39,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 14:00:39,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:00:39,868 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-21 14:00:39,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 14:00:39,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833071362] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:00:39,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 14:00:39,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2022-11-21 14:00:39,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855249044] [2022-11-21 14:00:39,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:00:39,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 14:00:39,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:00:39,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 14:00:39,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-11-21 14:00:39,881 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-21 14:00:39,883 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 199 transitions, 505 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:00:39,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:00:39,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-21 14:00:39,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:00:40,330 INFO L130 PetriNetUnfolder]: 98/591 cut-off events. [2022-11-21 14:00:40,330 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-11-21 14:00:40,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 591 events. 98/591 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2704 event pairs, 8 based on Foata normal form. 0/538 useless extension candidates. Maximal degree in co-relation 820. Up to 70 conditions per place. [2022-11-21 14:00:40,335 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 50 selfloop transitions, 10 changer transitions 1/240 dead transitions. [2022-11-21 14:00:40,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 240 transitions, 714 flow [2022-11-21 14:00:40,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 14:00:40,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-21 14:00:40,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1503 transitions. [2022-11-21 14:00:40,340 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8862028301886793 [2022-11-21 14:00:40,340 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1503 transitions. [2022-11-21 14:00:40,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1503 transitions. [2022-11-21 14:00:40,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:00:40,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1503 transitions. [2022-11-21 14:00:40,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 187.875) internal successors, (1503), 8 states have internal predecessors, (1503), 0 states have call successors, (0), 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-21 14:00:40,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 0 states have call successors, (0), 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-21 14:00:40,352 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 0 states have call successors, (0), 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-21 14:00:40,352 INFO L175 Difference]: Start difference. First operand has 196 places, 199 transitions, 505 flow. Second operand 8 states and 1503 transitions. [2022-11-21 14:00:40,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 240 transitions, 714 flow [2022-11-21 14:00:40,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 240 transitions, 697 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-11-21 14:00:40,360 INFO L231 Difference]: Finished difference. Result has 205 places, 206 transitions, 551 flow [2022-11-21 14:00:40,361 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=551, PETRI_PLACES=205, PETRI_TRANSITIONS=206} [2022-11-21 14:00:40,362 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 16 predicate places. [2022-11-21 14:00:40,362 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 206 transitions, 551 flow [2022-11-21 14:00:40,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:00:40,363 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:00:40,363 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 14:00:40,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 14:00:40,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:00:40,570 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 14:00:40,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:00:40,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1166526937, now seen corresponding path program 3 times [2022-11-21 14:00:40,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:00:40,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824959126] [2022-11-21 14:00:40,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:00:40,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:00:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:40,971 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-21 14:00:40,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:00:40,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824959126] [2022-11-21 14:00:40,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824959126] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:00:40,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289228773] [2022-11-21 14:00:40,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 14:00:40,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:00:40,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:00:40,974 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:00:40,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 14:00:41,133 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-21 14:00:41,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 14:00:41,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 14:00:41,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:00:41,338 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-21 14:00:41,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 14:00:41,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289228773] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:00:41,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 14:00:41,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2022-11-21 14:00:41,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191239998] [2022-11-21 14:00:41,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:00:41,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 14:00:41,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:00:41,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 14:00:41,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-11-21 14:00:41,344 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-21 14:00:41,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 206 transitions, 551 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:00:41,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:00:41,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-21 14:00:41,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:00:42,006 INFO L130 PetriNetUnfolder]: 218/1283 cut-off events. [2022-11-21 14:00:42,007 INFO L131 PetriNetUnfolder]: For 151/153 co-relation queries the response was YES. [2022-11-21 14:00:42,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1834 conditions, 1283 events. 218/1283 cut-off events. For 151/153 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 9050 event pairs, 4 based on Foata normal form. 0/1169 useless extension candidates. Maximal degree in co-relation 1822. Up to 112 conditions per place. [2022-11-21 14:00:42,020 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 53 selfloop transitions, 10 changer transitions 1/250 dead transitions. [2022-11-21 14:00:42,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 250 transitions, 775 flow [2022-11-21 14:00:42,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 14:00:42,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-21 14:00:42,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1506 transitions. [2022-11-21 14:00:42,026 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8879716981132075 [2022-11-21 14:00:42,026 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1506 transitions. [2022-11-21 14:00:42,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1506 transitions. [2022-11-21 14:00:42,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:00:42,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1506 transitions. [2022-11-21 14:00:42,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 188.25) internal successors, (1506), 8 states have internal predecessors, (1506), 0 states have call successors, (0), 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-21 14:00:42,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 0 states have call successors, (0), 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-21 14:00:42,037 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 0 states have call successors, (0), 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-21 14:00:42,038 INFO L175 Difference]: Start difference. First operand has 205 places, 206 transitions, 551 flow. Second operand 8 states and 1506 transitions. [2022-11-21 14:00:42,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 250 transitions, 775 flow [2022-11-21 14:00:42,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 250 transitions, 775 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 14:00:42,048 INFO L231 Difference]: Finished difference. Result has 216 places, 213 transitions, 614 flow [2022-11-21 14:00:42,048 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=614, PETRI_PLACES=216, PETRI_TRANSITIONS=213} [2022-11-21 14:00:42,049 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 27 predicate places. [2022-11-21 14:00:42,049 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 213 transitions, 614 flow [2022-11-21 14:00:42,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:00:42,051 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:00:42,051 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 14:00:42,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 14:00:42,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:00:42,258 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 14:00:42,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:00:42,259 INFO L85 PathProgramCache]: Analyzing trace with hash -454834163, now seen corresponding path program 4 times [2022-11-21 14:00:42,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:00:42,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162418686] [2022-11-21 14:00:42,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:00:42,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:00:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:42,656 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-21 14:00:42,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:00:42,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162418686] [2022-11-21 14:00:42,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162418686] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:00:42,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795818810] [2022-11-21 14:00:42,658 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 14:00:42,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:00:42,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:00:42,659 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:00:42,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 14:00:42,814 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 14:00:42,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 14:00:42,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-21 14:00:42,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:00:43,091 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-21 14:00:43,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:00:43,283 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-21 14:00:43,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795818810] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 14:00:43,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 14:00:43,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2022-11-21 14:00:43,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785601182] [2022-11-21 14:00:43,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 14:00:43,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-21 14:00:43,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:00:43,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-21 14:00:43,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2022-11-21 14:00:43,293 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 212 [2022-11-21 14:00:43,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 213 transitions, 614 flow. Second operand has 22 states, 22 states have (on average 173.1818181818182) internal successors, (3810), 22 states have internal predecessors, (3810), 0 states have call successors, (0), 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-21 14:00:43,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:00:43,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 212 [2022-11-21 14:00:43,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:00:43,962 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([577] thread2EXIT-->L90-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} AuxVars[] AssignedVars[][223], [Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), 203#true, Black: 1627#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), 123#L90-2true, Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))))]) [2022-11-21 14:00:43,963 INFO L383 tUnfolder$Statistics]: this new event has 204 ancestors and is cut-off event [2022-11-21 14:00:43,963 INFO L386 tUnfolder$Statistics]: existing Event has 189 ancestors and is cut-off event [2022-11-21 14:00:43,963 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-21 14:00:43,963 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-21 14:00:43,964 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([577] thread2EXIT-->L90-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} AuxVars[] AssignedVars[][223], [Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), 203#true, Black: 1627#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), 123#L90-2true, Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))))]) [2022-11-21 14:00:43,964 INFO L383 tUnfolder$Statistics]: this new event has 216 ancestors and is cut-off event [2022-11-21 14:00:43,964 INFO L386 tUnfolder$Statistics]: existing Event has 189 ancestors and is cut-off event [2022-11-21 14:00:43,965 INFO L386 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-11-21 14:00:43,965 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-21 14:00:43,965 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-21 14:00:43,970 INFO L130 PetriNetUnfolder]: 61/633 cut-off events. [2022-11-21 14:00:43,970 INFO L131 PetriNetUnfolder]: For 137/147 co-relation queries the response was YES. [2022-11-21 14:00:43,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 633 events. 61/633 cut-off events. For 137/147 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2923 event pairs, 0 based on Foata normal form. 4/604 useless extension candidates. Maximal degree in co-relation 957. Up to 32 conditions per place. [2022-11-21 14:00:43,977 INFO L137 encePairwiseOnDemand]: 196/212 looper letters, 38 selfloop transitions, 34 changer transitions 0/241 dead transitions. [2022-11-21 14:00:43,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 241 transitions, 870 flow [2022-11-21 14:00:43,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-21 14:00:43,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-21 14:00:43,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2966 transitions. [2022-11-21 14:00:43,985 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8229744728079911 [2022-11-21 14:00:43,986 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2966 transitions. [2022-11-21 14:00:43,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2966 transitions. [2022-11-21 14:00:43,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:00:43,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2966 transitions. [2022-11-21 14:00:43,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 174.47058823529412) internal successors, (2966), 17 states have internal predecessors, (2966), 0 states have call successors, (0), 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-21 14:00:44,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 212.0) internal successors, (3816), 18 states have internal predecessors, (3816), 0 states have call successors, (0), 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-21 14:00:44,009 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 212.0) internal successors, (3816), 18 states have internal predecessors, (3816), 0 states have call successors, (0), 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-21 14:00:44,009 INFO L175 Difference]: Start difference. First operand has 216 places, 213 transitions, 614 flow. Second operand 17 states and 2966 transitions. [2022-11-21 14:00:44,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 241 transitions, 870 flow [2022-11-21 14:00:44,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 241 transitions, 870 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 14:00:44,019 INFO L231 Difference]: Finished difference. Result has 234 places, 227 transitions, 789 flow [2022-11-21 14:00:44,020 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=789, PETRI_PLACES=234, PETRI_TRANSITIONS=227} [2022-11-21 14:00:44,023 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 45 predicate places. [2022-11-21 14:00:44,024 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 227 transitions, 789 flow [2022-11-21 14:00:44,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 173.1818181818182) internal successors, (3810), 22 states have internal predecessors, (3810), 0 states have call successors, (0), 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-21 14:00:44,027 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:00:44,028 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 14:00:44,041 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 14:00:44,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_700b185e-0ff1-48cc-a4de-fd7141aa7024/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:00:44,235 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 14:00:44,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:00:44,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1478895127, now seen corresponding path program 5 times [2022-11-21 14:00:44,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:00:44,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447265875] [2022-11-21 14:00:44,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:00:44,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:00:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:44,687 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-21 14:00:44,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:00:44,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447265875] [2022-11-21 14:00:44,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447265875] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:00:44,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:00:44,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 14:00:44,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510149188] [2022-11-21 14:00:44,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:00:44,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 14:00:44,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:00:44,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 14:00:44,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-21 14:00:44,692 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-21 14:00:44,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 227 transitions, 789 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:00:44,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:00:44,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-21 14:00:44,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:00:45,106 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] L66-2-->L66-3: Formula: (or (not (< |v_thread2Thread1of1ForFork0_~i~1#1_3| 5)) (= v_~isNullA~0_2 0)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~isNullA~0=v_~isNullA~0_2} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~isNullA~0=v_~isNullA~0_2} AuxVars[] AssignedVars[][178], [Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 3229#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), 203#true, Black: 1627#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3217#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3211#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 3)), 61#L89-2true, Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 28#L66-3true, Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))))]) [2022-11-21 14:00:45,107 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-21 14:00:45,107 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-21 14:00:45,107 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-21 14:00:45,107 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-21 14:00:45,107 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([549] L66-2-->L67: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_5| 5) (not (= v_~isNullA~0_3 0))) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~isNullA~0=v_~isNullA~0_3} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~isNullA~0=v_~isNullA~0_3} AuxVars[] AssignedVars[][179], [Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 3229#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), 203#true, Black: 1627#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 116#L67true, 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3217#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3211#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 3)), 61#L89-2true, Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))))]) [2022-11-21 14:00:45,108 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-21 14:00:45,108 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-21 14:00:45,108 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-21 14:00:45,108 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-21 14:00:45,119 INFO L130 PetriNetUnfolder]: 249/1173 cut-off events. [2022-11-21 14:00:45,119 INFO L131 PetriNetUnfolder]: For 539/569 co-relation queries the response was YES. [2022-11-21 14:00:45,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2106 conditions, 1173 events. 249/1173 cut-off events. For 539/569 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7342 event pairs, 20 based on Foata normal form. 16/1098 useless extension candidates. Maximal degree in co-relation 2085. Up to 246 conditions per place. [2022-11-21 14:00:45,129 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 43 selfloop transitions, 14 changer transitions 0/257 dead transitions. [2022-11-21 14:00:45,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 257 transitions, 1013 flow [2022-11-21 14:00:45,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 14:00:45,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 14:00:45,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1131 transitions. [2022-11-21 14:00:45,134 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8891509433962265 [2022-11-21 14:00:45,135 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1131 transitions. [2022-11-21 14:00:45,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1131 transitions. [2022-11-21 14:00:45,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:00:45,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1131 transitions. [2022-11-21 14:00:45,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 188.5) internal successors, (1131), 6 states have internal predecessors, (1131), 0 states have call successors, (0), 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-21 14:00:45,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:00:45,144 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:00:45,144 INFO L175 Difference]: Start difference. First operand has 234 places, 227 transitions, 789 flow. Second operand 6 states and 1131 transitions. [2022-11-21 14:00:45,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 257 transitions, 1013 flow [2022-11-21 14:00:45,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 257 transitions, 968 flow, removed 8 selfloop flow, removed 8 redundant places. [2022-11-21 14:00:45,154 INFO L231 Difference]: Finished difference. Result has 235 places, 235 transitions, 859 flow [2022-11-21 14:00:45,155 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=859, PETRI_PLACES=235, PETRI_TRANSITIONS=235} [2022-11-21 14:00:45,156 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 46 predicate places. [2022-11-21 14:00:45,156 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 235 transitions, 859 flow [2022-11-21 14:00:45,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:00:45,157 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:00:45,157 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 14:00:45,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 14:00:45,158 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 14:00:45,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:00:45,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1629208313, now seen corresponding path program 6 times [2022-11-21 14:00:45,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:00:45,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949092420] [2022-11-21 14:00:45,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:00:45,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:00:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:45,463 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-21 14:00:45,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:00:45,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949092420] [2022-11-21 14:00:45,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949092420] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:00:45,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:00:45,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 14:00:45,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686962306] [2022-11-21 14:00:45,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:00:45,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 14:00:45,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:00:45,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 14:00:45,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-21 14:00:45,468 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-21 14:00:45,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 235 transitions, 859 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:00:45,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:00:45,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-21 14:00:45,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:00:46,114 INFO L130 PetriNetUnfolder]: 389/2119 cut-off events. [2022-11-21 14:00:46,115 INFO L131 PetriNetUnfolder]: For 1302/1317 co-relation queries the response was YES. [2022-11-21 14:00:46,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3721 conditions, 2119 events. 389/2119 cut-off events. For 1302/1317 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 17971 event pairs, 60 based on Foata normal form. 11/1997 useless extension candidates. Maximal degree in co-relation 3696. Up to 320 conditions per place. [2022-11-21 14:00:46,136 INFO L137 encePairwiseOnDemand]: 203/212 looper letters, 49 selfloop transitions, 17 changer transitions 0/274 dead transitions. [2022-11-21 14:00:46,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 274 transitions, 1130 flow [2022-11-21 14:00:46,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 14:00:46,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 14:00:46,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1138 transitions. [2022-11-21 14:00:46,140 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8946540880503144 [2022-11-21 14:00:46,140 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1138 transitions. [2022-11-21 14:00:46,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1138 transitions. [2022-11-21 14:00:46,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:00:46,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1138 transitions. [2022-11-21 14:00:46,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 189.66666666666666) internal successors, (1138), 6 states have internal predecessors, (1138), 0 states have call successors, (0), 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-21 14:00:46,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:00:46,159 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:00:46,169 INFO L175 Difference]: Start difference. First operand has 235 places, 235 transitions, 859 flow. Second operand 6 states and 1138 transitions. [2022-11-21 14:00:46,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 274 transitions, 1130 flow [2022-11-21 14:00:46,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 274 transitions, 1120 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-11-21 14:00:46,186 INFO L231 Difference]: Finished difference. Result has 244 places, 247 transitions, 1005 flow [2022-11-21 14:00:46,186 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=849, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1005, PETRI_PLACES=244, PETRI_TRANSITIONS=247} [2022-11-21 14:00:46,187 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 55 predicate places. [2022-11-21 14:00:46,188 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 247 transitions, 1005 flow [2022-11-21 14:00:46,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:00:46,189 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:00:46,190 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 14:00:46,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 14:00:46,190 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 14:00:46,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:00:46,191 INFO L85 PathProgramCache]: Analyzing trace with hash -983881509, now seen corresponding path program 7 times [2022-11-21 14:00:46,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:00:46,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585822065] [2022-11-21 14:00:46,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:00:46,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:00:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:46,593 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-21 14:00:46,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:00:46,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585822065] [2022-11-21 14:00:46,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585822065] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:00:46,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:00:46,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 14:00:46,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416239875] [2022-11-21 14:00:46,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:00:46,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 14:00:46,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:00:46,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 14:00:46,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-21 14:00:46,603 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-21 14:00:46,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 247 transitions, 1005 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:00:46,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:00:46,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-21 14:00:46,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:00:47,317 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] L66-2-->L66-3: Formula: (or (not (< |v_thread2Thread1of1ForFork0_~i~1#1_3| 5)) (= v_~isNullA~0_2 0)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~isNullA~0=v_~isNullA~0_2} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~isNullA~0=v_~isNullA~0_2} AuxVars[] AssignedVars[][180], [Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 3255#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3217#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3211#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 3)), 61#L89-2true, Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))), 3244#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3224#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3231#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0)))), Black: 3227#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))), 3229#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), 203#true, Black: 1627#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3237#true, 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3239#(or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))), Black: 3246#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= ~isNullB~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3242#(and (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= ~isNullB~0 0))), 28#L66-3true]) [2022-11-21 14:00:47,318 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-21 14:00:47,318 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-21 14:00:47,318 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-21 14:00:47,319 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-21 14:00:47,319 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([549] L66-2-->L67: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_5| 5) (not (= v_~isNullA~0_3 0))) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~isNullA~0=v_~isNullA~0_3} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~isNullA~0=v_~isNullA~0_3} AuxVars[] AssignedVars[][199], [Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 3255#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3217#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3211#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 3)), 61#L89-2true, Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))), 3244#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3224#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3231#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0)))), Black: 3227#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))), 3229#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), 203#true, Black: 1627#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3237#true, 116#L67true, 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3239#(or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))), Black: 3246#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= ~isNullB~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3242#(and (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= ~isNullB~0 0)))]) [2022-11-21 14:00:47,319 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-21 14:00:47,319 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-21 14:00:47,320 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-21 14:00:47,320 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-21 14:00:47,333 INFO L130 PetriNetUnfolder]: 423/2018 cut-off events. [2022-11-21 14:00:47,333 INFO L131 PetriNetUnfolder]: For 2031/2081 co-relation queries the response was YES. [2022-11-21 14:00:47,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4068 conditions, 2018 events. 423/2018 cut-off events. For 2031/2081 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 16336 event pairs, 54 based on Foata normal form. 31/1898 useless extension candidates. Maximal degree in co-relation 4039. Up to 438 conditions per place. [2022-11-21 14:00:47,352 INFO L137 encePairwiseOnDemand]: 205/212 looper letters, 47 selfloop transitions, 15 changer transitions 0/273 dead transitions. [2022-11-21 14:00:47,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 273 transitions, 1275 flow [2022-11-21 14:00:47,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 14:00:47,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 14:00:47,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1127 transitions. [2022-11-21 14:00:47,357 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8860062893081762 [2022-11-21 14:00:47,357 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1127 transitions. [2022-11-21 14:00:47,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1127 transitions. [2022-11-21 14:00:47,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:00:47,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1127 transitions. [2022-11-21 14:00:47,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 187.83333333333334) internal successors, (1127), 6 states have internal predecessors, (1127), 0 states have call successors, (0), 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-21 14:00:47,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:00:47,366 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:00:47,366 INFO L175 Difference]: Start difference. First operand has 244 places, 247 transitions, 1005 flow. Second operand 6 states and 1127 transitions. [2022-11-21 14:00:47,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 273 transitions, 1275 flow [2022-11-21 14:00:47,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 273 transitions, 1249 flow, removed 13 selfloop flow, removed 0 redundant places. [2022-11-21 14:00:47,384 INFO L231 Difference]: Finished difference. Result has 253 places, 254 transitions, 1114 flow [2022-11-21 14:00:47,384 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=983, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1114, PETRI_PLACES=253, PETRI_TRANSITIONS=254} [2022-11-21 14:00:47,386 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 64 predicate places. [2022-11-21 14:00:47,386 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 254 transitions, 1114 flow [2022-11-21 14:00:47,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:00:47,387 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:00:47,387 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 14:00:47,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 14:00:47,388 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 14:00:47,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:00:47,388 INFO L85 PathProgramCache]: Analyzing trace with hash 143533027, now seen corresponding path program 8 times [2022-11-21 14:00:47,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:00:47,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274270188] [2022-11-21 14:00:47,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:00:47,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:00:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:47,722 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-21 14:00:47,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:00:47,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274270188] [2022-11-21 14:00:47,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274270188] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:00:47,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:00:47,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 14:00:47,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026400224] [2022-11-21 14:00:47,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:00:47,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 14:00:47,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:00:47,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 14:00:47,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 14:00:47,728 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-21 14:00:47,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 254 transitions, 1114 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:00:47,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:00:47,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-21 14:00:47,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:00:48,395 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] L66-2-->L66-3: Formula: (or (not (< |v_thread2Thread1of1ForFork0_~i~1#1_3| 5)) (= v_~isNullA~0_2 0)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~isNullA~0=v_~isNullA~0_2} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~isNullA~0=v_~isNullA~0_2} AuxVars[] AssignedVars[][194], [Black: 3256#(or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0))), Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), 3255#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3217#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3211#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 3)), 61#L89-2true, Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))), 3244#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3224#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3231#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0)))), Black: 3227#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))), 3229#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), Black: 1627#true, 203#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3237#true, 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3239#(or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))), Black: 3246#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= ~isNullB~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3242#(and (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= ~isNullB~0 0))), 28#L66-3true, 3273#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3260#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))))), Black: 3258#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0)))]) [2022-11-21 14:00:48,396 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-21 14:00:48,396 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-21 14:00:48,396 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-21 14:00:48,396 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-21 14:00:48,397 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([549] L66-2-->L67: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_5| 5) (not (= v_~isNullA~0_3 0))) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~isNullA~0=v_~isNullA~0_3} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~isNullA~0=v_~isNullA~0_3} AuxVars[] AssignedVars[][199], [Black: 3256#(or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0))), Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), 3255#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3217#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3211#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 3)), 61#L89-2true, Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))), 3244#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3224#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3231#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0)))), Black: 3227#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))), 3229#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), 203#true, Black: 1627#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3237#true, 116#L67true, 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3239#(or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))), Black: 3246#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= ~isNullB~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3242#(and (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= ~isNullB~0 0))), 3273#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3260#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))))), Black: 3258#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0)))]) [2022-11-21 14:00:48,397 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-21 14:00:48,397 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-21 14:00:48,397 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-21 14:00:48,397 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-21 14:00:48,411 INFO L130 PetriNetUnfolder]: 416/1942 cut-off events. [2022-11-21 14:00:48,411 INFO L131 PetriNetUnfolder]: For 2451/2522 co-relation queries the response was YES. [2022-11-21 14:00:48,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4104 conditions, 1942 events. 416/1942 cut-off events. For 2451/2522 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 15363 event pairs, 44 based on Foata normal form. 36/1835 useless extension candidates. Maximal degree in co-relation 4070. Up to 447 conditions per place. [2022-11-21 14:00:48,433 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 49 selfloop transitions, 13 changer transitions 1/274 dead transitions. [2022-11-21 14:00:48,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 274 transitions, 1322 flow [2022-11-21 14:00:48,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 14:00:48,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 14:00:48,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1128 transitions. [2022-11-21 14:00:48,437 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8867924528301887 [2022-11-21 14:00:48,438 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1128 transitions. [2022-11-21 14:00:48,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1128 transitions. [2022-11-21 14:00:48,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:00:48,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1128 transitions. [2022-11-21 14:00:48,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 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-21 14:00:48,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:00:48,446 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:00:48,447 INFO L175 Difference]: Start difference. First operand has 253 places, 254 transitions, 1114 flow. Second operand 6 states and 1128 transitions. [2022-11-21 14:00:48,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 274 transitions, 1322 flow [2022-11-21 14:00:48,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 274 transitions, 1314 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-11-21 14:00:48,469 INFO L231 Difference]: Finished difference. Result has 259 places, 254 transitions, 1140 flow [2022-11-21 14:00:48,470 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1106, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1140, PETRI_PLACES=259, PETRI_TRANSITIONS=254} [2022-11-21 14:00:48,471 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 70 predicate places. [2022-11-21 14:00:48,472 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 254 transitions, 1140 flow [2022-11-21 14:00:48,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:00:48,472 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:00:48,473 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 14:00:48,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 14:00:48,473 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 14:00:48,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:00:48,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1529011803, now seen corresponding path program 9 times [2022-11-21 14:00:48,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:00:48,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12700150] [2022-11-21 14:00:48,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:00:48,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:00:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:48,786 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-21 14:00:48,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:00:48,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12700150] [2022-11-21 14:00:48,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12700150] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:00:48,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:00:48,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 14:00:48,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173631730] [2022-11-21 14:00:48,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:00:48,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 14:00:48,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:00:48,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 14:00:48,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 14:00:48,790 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-21 14:00:48,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 254 transitions, 1140 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:00:48,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:00:48,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-21 14:00:48,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:00:49,361 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] L66-2-->L66-3: Formula: (or (not (< |v_thread2Thread1of1ForFork0_~i~1#1_3| 5)) (= v_~isNullA~0_2 0)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~isNullA~0=v_~isNullA~0_2} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~isNullA~0=v_~isNullA~0_2} AuxVars[] AssignedVars[][180], [Black: 3256#(or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0))), Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), 3255#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3275#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0)) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3277#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0)) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)), Black: 3217#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3211#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 3)), 61#L89-2true, Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))), 3244#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3224#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3231#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0)))), Black: 3227#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))), 3229#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), Black: 1627#true, 203#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3237#true, 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3239#(or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))), Black: 3246#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= ~isNullB~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), 3283#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3242#(and (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= ~isNullB~0 0))), 28#L66-3true, 3273#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3260#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))))), Black: 3258#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0)))]) [2022-11-21 14:00:49,361 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-21 14:00:49,361 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-21 14:00:49,362 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-21 14:00:49,362 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-21 14:00:49,362 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([549] L66-2-->L67: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_5| 5) (not (= v_~isNullA~0_3 0))) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~isNullA~0=v_~isNullA~0_3} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~isNullA~0=v_~isNullA~0_3} AuxVars[] AssignedVars[][198], [Black: 3256#(or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0))), Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 3255#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3275#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0)) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3277#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0)) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)), Black: 3217#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3211#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 3)), 61#L89-2true, Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))), 3244#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3224#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3231#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0)))), Black: 3227#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))), 3229#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), 203#true, Black: 1627#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3237#true, 116#L67true, 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3239#(or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))), Black: 3246#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= ~isNullB~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), 3283#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3242#(and (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= ~isNullB~0 0))), 3273#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3260#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))))), Black: 3258#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0)))]) [2022-11-21 14:00:49,362 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-21 14:00:49,363 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-21 14:00:49,363 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-21 14:00:49,363 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-21 14:00:49,377 INFO L130 PetriNetUnfolder]: 416/1998 cut-off events. [2022-11-21 14:00:49,378 INFO L131 PetriNetUnfolder]: For 2943/3003 co-relation queries the response was YES. [2022-11-21 14:00:49,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4297 conditions, 1998 events. 416/1998 cut-off events. For 2943/3003 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 16045 event pairs, 66 based on Foata normal form. 23/1869 useless extension candidates. Maximal degree in co-relation 4261. Up to 438 conditions per place. [2022-11-21 14:00:49,398 INFO L137 encePairwiseOnDemand]: 205/212 looper letters, 53 selfloop transitions, 9 changer transitions 2/275 dead transitions. [2022-11-21 14:00:49,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 275 transitions, 1391 flow [2022-11-21 14:00:49,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 14:00:49,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 14:00:49,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1123 transitions. [2022-11-21 14:00:49,403 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8828616352201258 [2022-11-21 14:00:49,403 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1123 transitions. [2022-11-21 14:00:49,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1123 transitions. [2022-11-21 14:00:49,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:00:49,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1123 transitions. [2022-11-21 14:00:49,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 187.16666666666666) internal successors, (1123), 6 states have internal predecessors, (1123), 0 states have call successors, (0), 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-21 14:00:49,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:00:49,411 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:00:49,412 INFO L175 Difference]: Start difference. First operand has 259 places, 254 transitions, 1140 flow. Second operand 6 states and 1123 transitions. [2022-11-21 14:00:49,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 275 transitions, 1391 flow [2022-11-21 14:00:49,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 275 transitions, 1357 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-11-21 14:00:49,431 INFO L231 Difference]: Finished difference. Result has 261 places, 255 transitions, 1154 flow [2022-11-21 14:00:49,431 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1112, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1154, PETRI_PLACES=261, PETRI_TRANSITIONS=255} [2022-11-21 14:00:49,432 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 72 predicate places. [2022-11-21 14:00:49,432 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 255 transitions, 1154 flow [2022-11-21 14:00:49,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:00:49,433 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:00:49,433 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 14:00:49,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 14:00:49,434 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 14:00:49,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:00:49,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1704685739, now seen corresponding path program 10 times [2022-11-21 14:00:49,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:00:49,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158921262] [2022-11-21 14:00:49,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:00:49,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:00:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:49,733 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-21 14:00:49,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:00:49,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158921262] [2022-11-21 14:00:49,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158921262] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:00:49,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:00:49,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 14:00:49,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502850866] [2022-11-21 14:00:49,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:00:49,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 14:00:49,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:00:49,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 14:00:49,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 14:00:49,737 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-21 14:00:49,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 255 transitions, 1154 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:00:49,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:00:49,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-21 14:00:49,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:00:50,361 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] L66-2-->L66-3: Formula: (or (not (< |v_thread2Thread1of1ForFork0_~i~1#1_3| 5)) (= v_~isNullA~0_2 0)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~isNullA~0=v_~isNullA~0_2} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~isNullA~0=v_~isNullA~0_2} AuxVars[] AssignedVars[][180], [Black: 3256#(or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0))), Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), 3255#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3275#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0)) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3217#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3211#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 3)), 61#L89-2true, Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))), 3244#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3284#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0)) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0)))), Black: 3288#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0))), Black: 3290#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)), Black: 3224#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3231#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0)))), Black: 3227#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), Black: 1627#true, 203#true, Black: 3237#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3239#(or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))), Black: 3246#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= ~isNullB~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), 3283#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3242#(and (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= ~isNullB~0 0))), 3297#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), 28#L66-3true, 3273#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3260#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))))), Black: 3258#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0)))]) [2022-11-21 14:00:50,362 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-21 14:00:50,362 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-21 14:00:50,362 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-21 14:00:50,362 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-21 14:00:50,363 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([549] L66-2-->L67: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_5| 5) (not (= v_~isNullA~0_3 0))) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~isNullA~0=v_~isNullA~0_3} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~isNullA~0=v_~isNullA~0_3} AuxVars[] AssignedVars[][197], [Black: 3256#(or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0))), Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), 3255#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3275#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0)) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3217#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3211#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 3)), 61#L89-2true, Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))), 3244#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3284#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0)) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0)))), Black: 3288#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0))), Black: 3290#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)), Black: 3224#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3231#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0)))), Black: 3227#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), Black: 1627#true, 203#true, Black: 3237#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 116#L67true, 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3239#(or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))), 3283#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3246#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= ~isNullB~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3242#(and (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= ~isNullB~0 0))), 3297#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), 3273#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3260#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))))), Black: 3258#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0)))]) [2022-11-21 14:00:50,363 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-21 14:00:50,363 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-21 14:00:50,363 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-21 14:00:50,363 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-21 14:00:50,378 INFO L130 PetriNetUnfolder]: 413/1947 cut-off events. [2022-11-21 14:00:50,379 INFO L131 PetriNetUnfolder]: For 3023/3085 co-relation queries the response was YES. [2022-11-21 14:00:50,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4243 conditions, 1947 events. 413/1947 cut-off events. For 3023/3085 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 15443 event pairs, 48 based on Foata normal form. 30/1832 useless extension candidates. Maximal degree in co-relation 4205. Up to 438 conditions per place. [2022-11-21 14:00:50,395 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 49 selfloop transitions, 16 changer transitions 2/278 dead transitions. [2022-11-21 14:00:50,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 278 transitions, 1403 flow [2022-11-21 14:00:50,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 14:00:50,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 14:00:50,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1130 transitions. [2022-11-21 14:00:50,399 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8883647798742138 [2022-11-21 14:00:50,399 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1130 transitions. [2022-11-21 14:00:50,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1130 transitions. [2022-11-21 14:00:50,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:00:50,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1130 transitions. [2022-11-21 14:00:50,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 188.33333333333334) internal successors, (1130), 6 states have internal predecessors, (1130), 0 states have call successors, (0), 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-21 14:00:50,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:00:50,407 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:00:50,407 INFO L175 Difference]: Start difference. First operand has 261 places, 255 transitions, 1154 flow. Second operand 6 states and 1130 transitions. [2022-11-21 14:00:50,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 278 transitions, 1403 flow [2022-11-21 14:00:50,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 278 transitions, 1386 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-21 14:00:50,427 INFO L231 Difference]: Finished difference. Result has 265 places, 257 transitions, 1212 flow [2022-11-21 14:00:50,428 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1212, PETRI_PLACES=265, PETRI_TRANSITIONS=257} [2022-11-21 14:00:50,428 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 76 predicate places. [2022-11-21 14:00:50,429 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 257 transitions, 1212 flow [2022-11-21 14:00:50,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:00:50,429 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:00:50,430 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 14:00:50,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 14:00:50,430 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 14:00:50,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:00:50,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1932854447, now seen corresponding path program 11 times [2022-11-21 14:00:50,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:00:50,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573197718] [2022-11-21 14:00:50,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:00:50,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:00:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:50,689 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-21 14:00:50,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:00:50,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573197718] [2022-11-21 14:00:50,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573197718] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:00:50,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:00:50,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 14:00:50,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529745233] [2022-11-21 14:00:50,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:00:50,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 14:00:50,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:00:50,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 14:00:50,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-21 14:00:50,694 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-21 14:00:50,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 257 transitions, 1212 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:00:50,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:00:50,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-21 14:00:50,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:00:51,576 INFO L130 PetriNetUnfolder]: 539/2991 cut-off events. [2022-11-21 14:00:51,576 INFO L131 PetriNetUnfolder]: For 4048/4148 co-relation queries the response was YES. [2022-11-21 14:00:51,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6102 conditions, 2991 events. 539/2991 cut-off events. For 4048/4148 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 28293 event pairs, 129 based on Foata normal form. 40/2825 useless extension candidates. Maximal degree in co-relation 6062. Up to 554 conditions per place. [2022-11-21 14:00:51,610 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 53 selfloop transitions, 18 changer transitions 0/289 dead transitions. [2022-11-21 14:00:51,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 289 transitions, 1499 flow [2022-11-21 14:00:51,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 14:00:51,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 14:00:51,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1135 transitions. [2022-11-21 14:00:51,614 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8922955974842768 [2022-11-21 14:00:51,615 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1135 transitions. [2022-11-21 14:00:51,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1135 transitions. [2022-11-21 14:00:51,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:00:51,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1135 transitions. [2022-11-21 14:00:51,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 189.16666666666666) internal successors, (1135), 6 states have internal predecessors, (1135), 0 states have call successors, (0), 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-21 14:00:51,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:00:51,623 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:00:51,624 INFO L175 Difference]: Start difference. First operand has 265 places, 257 transitions, 1212 flow. Second operand 6 states and 1135 transitions. [2022-11-21 14:00:51,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 289 transitions, 1499 flow [2022-11-21 14:00:51,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 289 transitions, 1473 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-11-21 14:00:51,655 INFO L231 Difference]: Finished difference. Result has 266 places, 263 transitions, 1314 flow [2022-11-21 14:00:51,655 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1186, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1314, PETRI_PLACES=266, PETRI_TRANSITIONS=263} [2022-11-21 14:00:51,656 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 77 predicate places. [2022-11-21 14:00:51,656 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 263 transitions, 1314 flow [2022-11-21 14:00:51,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:00:51,657 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:00:51,658 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 14:00:51,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 14:00:51,658 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 14:00:51,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:00:51,659 INFO L85 PathProgramCache]: Analyzing trace with hash -655024259, now seen corresponding path program 12 times [2022-11-21 14:00:51,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:00:51,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777689043] [2022-11-21 14:00:51,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:00:51,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:00:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:51,965 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-21 14:00:51,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:00:51,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777689043] [2022-11-21 14:00:51,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777689043] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:00:51,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:00:51,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 14:00:51,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631866482] [2022-11-21 14:00:51,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:00:51,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 14:00:51,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:00:51,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 14:00:51,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-21 14:00:51,970 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-21 14:00:51,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 263 transitions, 1314 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:00:51,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:00:51,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-21 14:00:51,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:00:53,033 INFO L130 PetriNetUnfolder]: 723/3323 cut-off events. [2022-11-21 14:00:53,034 INFO L131 PetriNetUnfolder]: For 4782/4907 co-relation queries the response was YES. [2022-11-21 14:00:53,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6973 conditions, 3323 events. 723/3323 cut-off events. For 4782/4907 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 29883 event pairs, 117 based on Foata normal form. 52/3122 useless extension candidates. Maximal degree in co-relation 6932. Up to 548 conditions per place. [2022-11-21 14:00:53,072 INFO L137 encePairwiseOnDemand]: 203/212 looper letters, 47 selfloop transitions, 23 changer transitions 0/287 dead transitions. [2022-11-21 14:00:53,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 287 transitions, 1609 flow [2022-11-21 14:00:53,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 14:00:53,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 14:00:53,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1127 transitions. [2022-11-21 14:00:53,076 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8860062893081762 [2022-11-21 14:00:53,076 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1127 transitions. [2022-11-21 14:00:53,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1127 transitions. [2022-11-21 14:00:53,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:00:53,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1127 transitions. [2022-11-21 14:00:53,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 187.83333333333334) internal successors, (1127), 6 states have internal predecessors, (1127), 0 states have call successors, (0), 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-21 14:00:53,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:00:53,084 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:00:53,084 INFO L175 Difference]: Start difference. First operand has 266 places, 263 transitions, 1314 flow. Second operand 6 states and 1127 transitions. [2022-11-21 14:00:53,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 287 transitions, 1609 flow [2022-11-21 14:00:53,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 287 transitions, 1600 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-11-21 14:00:53,114 INFO L231 Difference]: Finished difference. Result has 274 places, 268 transitions, 1450 flow [2022-11-21 14:00:53,115 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1305, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1450, PETRI_PLACES=274, PETRI_TRANSITIONS=268} [2022-11-21 14:00:53,116 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 85 predicate places. [2022-11-21 14:00:53,116 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 268 transitions, 1450 flow [2022-11-21 14:00:53,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:00:53,117 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:00:53,117 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 14:00:53,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 14:00:53,118 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 14:00:53,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:00:53,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1203987853, now seen corresponding path program 13 times [2022-11-21 14:00:53,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:00:53,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799272321] [2022-11-21 14:00:53,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:00:53,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:00:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:53,418 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-21 14:00:53,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:00:53,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799272321] [2022-11-21 14:00:53,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799272321] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:00:53,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:00:53,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 14:00:53,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538712444] [2022-11-21 14:00:53,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:00:53,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 14:00:53,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:00:53,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 14:00:53,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-21 14:00:53,426 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-21 14:00:53,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 268 transitions, 1450 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:00:53,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:00:53,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-21 14:00:53,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:00:54,906 INFO L130 PetriNetUnfolder]: 787/4624 cut-off events. [2022-11-21 14:00:54,906 INFO L131 PetriNetUnfolder]: For 6888/7042 co-relation queries the response was YES. [2022-11-21 14:00:55,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9324 conditions, 4624 events. 787/4624 cut-off events. For 6888/7042 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 47631 event pairs, 144 based on Foata normal form. 47/4337 useless extension candidates. Maximal degree in co-relation 9279. Up to 510 conditions per place. [2022-11-21 14:00:55,075 INFO L137 encePairwiseOnDemand]: 205/212 looper letters, 56 selfloop transitions, 20 changer transitions 0/299 dead transitions. [2022-11-21 14:00:55,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 299 transitions, 1776 flow [2022-11-21 14:00:55,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 14:00:55,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 14:00:55,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1132 transitions. [2022-11-21 14:00:55,083 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.889937106918239 [2022-11-21 14:00:55,084 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1132 transitions. [2022-11-21 14:00:55,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1132 transitions. [2022-11-21 14:00:55,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:00:55,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1132 transitions. [2022-11-21 14:00:55,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 188.66666666666666) internal successors, (1132), 6 states have internal predecessors, (1132), 0 states have call successors, (0), 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-21 14:00:55,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:00:55,096 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:00:55,096 INFO L175 Difference]: Start difference. First operand has 274 places, 268 transitions, 1450 flow. Second operand 6 states and 1132 transitions. [2022-11-21 14:00:55,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 299 transitions, 1776 flow [2022-11-21 14:00:55,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 299 transitions, 1753 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-11-21 14:00:55,143 INFO L231 Difference]: Finished difference. Result has 282 places, 273 transitions, 1559 flow [2022-11-21 14:00:55,144 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1427, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1559, PETRI_PLACES=282, PETRI_TRANSITIONS=273} [2022-11-21 14:00:55,145 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 93 predicate places. [2022-11-21 14:00:55,146 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 273 transitions, 1559 flow [2022-11-21 14:00:55,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:00:55,147 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:00:55,147 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 14:00:55,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 14:00:55,148 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 14:00:55,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:00:55,148 INFO L85 PathProgramCache]: Analyzing trace with hash 579029916, now seen corresponding path program 1 times [2022-11-21 14:00:55,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:00:55,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603262579] [2022-11-21 14:00:55,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:00:55,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:00:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:55,504 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-21 14:00:55,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:00:55,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603262579] [2022-11-21 14:00:55,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603262579] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:00:55,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:00:55,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 14:00:55,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831727396] [2022-11-21 14:00:55,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:00:55,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 14:00:55,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:00:55,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 14:00:55,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 14:00:55,510 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-21 14:00:55,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 273 transitions, 1559 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:00:55,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:00:55,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-21 14:00:55,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:00:57,298 INFO L130 PetriNetUnfolder]: 797/4868 cut-off events. [2022-11-21 14:00:57,298 INFO L131 PetriNetUnfolder]: For 8448/8600 co-relation queries the response was YES. [2022-11-21 14:00:57,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9963 conditions, 4868 events. 797/4868 cut-off events. For 8448/8600 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 50811 event pairs, 150 based on Foata normal form. 33/4552 useless extension candidates. Maximal degree in co-relation 9914. Up to 509 conditions per place. [2022-11-21 14:00:57,355 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 65 selfloop transitions, 11 changer transitions 6/305 dead transitions. [2022-11-21 14:00:57,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 305 transitions, 1938 flow [2022-11-21 14:00:57,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 14:00:57,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 14:00:57,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1126 transitions. [2022-11-21 14:00:57,358 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8852201257861635 [2022-11-21 14:00:57,358 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1126 transitions. [2022-11-21 14:00:57,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1126 transitions. [2022-11-21 14:00:57,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:00:57,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1126 transitions. [2022-11-21 14:00:57,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 187.66666666666666) internal successors, (1126), 6 states have internal predecessors, (1126), 0 states have call successors, (0), 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-21 14:00:57,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:00:57,367 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:00:57,369 INFO L175 Difference]: Start difference. First operand has 282 places, 273 transitions, 1559 flow. Second operand 6 states and 1126 transitions. [2022-11-21 14:00:57,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 305 transitions, 1938 flow [2022-11-21 14:00:57,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 305 transitions, 1910 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-11-21 14:00:57,416 INFO L231 Difference]: Finished difference. Result has 290 places, 274 transitions, 1591 flow [2022-11-21 14:00:57,417 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1539, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1591, PETRI_PLACES=290, PETRI_TRANSITIONS=274} [2022-11-21 14:00:57,417 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 101 predicate places. [2022-11-21 14:00:57,418 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 274 transitions, 1591 flow [2022-11-21 14:00:57,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:00:57,419 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:00:57,419 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 14:00:57,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-21 14:00:57,420 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 14:00:57,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:00:57,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1129490250, now seen corresponding path program 2 times [2022-11-21 14:00:57,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:00:57,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972286043] [2022-11-21 14:00:57,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:00:57,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:00:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:57,819 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-21 14:00:57,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:00:57,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972286043] [2022-11-21 14:00:57,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972286043] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:00:57,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:00:57,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 14:00:57,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910355789] [2022-11-21 14:00:57,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:00:57,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 14:00:57,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:00:57,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 14:00:57,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 14:00:57,824 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-21 14:00:57,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 274 transitions, 1591 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:00:57,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:00:57,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-21 14:00:57,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:00:59,464 INFO L130 PetriNetUnfolder]: 779/4816 cut-off events. [2022-11-21 14:00:59,464 INFO L131 PetriNetUnfolder]: For 8635/8798 co-relation queries the response was YES. [2022-11-21 14:00:59,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9851 conditions, 4816 events. 779/4816 cut-off events. For 8635/8798 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 50306 event pairs, 108 based on Foata normal form. 53/4535 useless extension candidates. Maximal degree in co-relation 9798. Up to 509 conditions per place. [2022-11-21 14:00:59,514 INFO L137 encePairwiseOnDemand]: 201/212 looper letters, 59 selfloop transitions, 27 changer transitions 2/311 dead transitions. [2022-11-21 14:00:59,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 311 transitions, 1956 flow [2022-11-21 14:00:59,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 14:00:59,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 14:00:59,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1142 transitions. [2022-11-21 14:00:59,518 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8977987421383647 [2022-11-21 14:00:59,518 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1142 transitions. [2022-11-21 14:00:59,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1142 transitions. [2022-11-21 14:00:59,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:00:59,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1142 transitions. [2022-11-21 14:00:59,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 190.33333333333334) internal successors, (1142), 6 states have internal predecessors, (1142), 0 states have call successors, (0), 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-21 14:00:59,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:00:59,528 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:00:59,528 INFO L175 Difference]: Start difference. First operand has 290 places, 274 transitions, 1591 flow. Second operand 6 states and 1142 transitions. [2022-11-21 14:00:59,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 311 transitions, 1956 flow [2022-11-21 14:00:59,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 311 transitions, 1934 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-21 14:00:59,590 INFO L231 Difference]: Finished difference. Result has 293 places, 281 transitions, 1753 flow [2022-11-21 14:00:59,590 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1574, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1753, PETRI_PLACES=293, PETRI_TRANSITIONS=281} [2022-11-21 14:00:59,591 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 104 predicate places. [2022-11-21 14:00:59,591 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 281 transitions, 1753 flow [2022-11-21 14:00:59,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:00:59,592 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:00:59,593 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 14:00:59,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-21 14:00:59,594 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 14:00:59,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:00:59,594 INFO L85 PathProgramCache]: Analyzing trace with hash 852978444, now seen corresponding path program 3 times [2022-11-21 14:00:59,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:00:59,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844596961] [2022-11-21 14:00:59,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:00:59,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:00:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:59,864 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-21 14:00:59,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:00:59,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844596961] [2022-11-21 14:00:59,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844596961] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:00:59,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:00:59,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 14:00:59,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566481193] [2022-11-21 14:00:59,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:00:59,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 14:00:59,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:00:59,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 14:00:59,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 14:00:59,868 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-21 14:00:59,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 281 transitions, 1753 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:00:59,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:00:59,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-21 14:00:59,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:01:01,148 INFO L130 PetriNetUnfolder]: 756/4526 cut-off events. [2022-11-21 14:01:01,148 INFO L131 PetriNetUnfolder]: For 9507/9669 co-relation queries the response was YES. [2022-11-21 14:01:01,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9734 conditions, 4526 events. 756/4526 cut-off events. For 9507/9669 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 46021 event pairs, 142 based on Foata normal form. 46/4252 useless extension candidates. Maximal degree in co-relation 9679. Up to 510 conditions per place. [2022-11-21 14:01:01,199 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 58 selfloop transitions, 21 changer transitions 5/307 dead transitions. [2022-11-21 14:01:01,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 307 transitions, 2034 flow [2022-11-21 14:01:01,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 14:01:01,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 14:01:01,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1134 transitions. [2022-11-21 14:01:01,203 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8915094339622641 [2022-11-21 14:01:01,203 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1134 transitions. [2022-11-21 14:01:01,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1134 transitions. [2022-11-21 14:01:01,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:01:01,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1134 transitions. [2022-11-21 14:01:01,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 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-21 14:01:01,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:01:01,212 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:01:01,213 INFO L175 Difference]: Start difference. First operand has 293 places, 281 transitions, 1753 flow. Second operand 6 states and 1134 transitions. [2022-11-21 14:01:01,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 307 transitions, 2034 flow [2022-11-21 14:01:01,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 307 transitions, 2019 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-21 14:01:01,279 INFO L231 Difference]: Finished difference. Result has 298 places, 281 transitions, 1802 flow [2022-11-21 14:01:01,280 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1738, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1802, PETRI_PLACES=298, PETRI_TRANSITIONS=281} [2022-11-21 14:01:01,281 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 109 predicate places. [2022-11-21 14:01:01,281 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 281 transitions, 1802 flow [2022-11-21 14:01:01,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:01:01,282 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:01:01,282 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 14:01:01,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-21 14:01:01,283 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 14:01:01,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:01,284 INFO L85 PathProgramCache]: Analyzing trace with hash 317472708, now seen corresponding path program 1 times [2022-11-21 14:01:01,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:01,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289510619] [2022-11-21 14:01:01,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:01,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:01,661 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-21 14:01:01,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:01,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289510619] [2022-11-21 14:01:01,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289510619] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:01:01,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:01:01,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 14:01:01,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600346977] [2022-11-21 14:01:01,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:01:01,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 14:01:01,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:01:01,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 14:01:01,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 14:01:01,667 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-21 14:01:01,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 281 transitions, 1802 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:01:01,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:01:01,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-21 14:01:01,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:01:02,851 INFO L130 PetriNetUnfolder]: 788/4246 cut-off events. [2022-11-21 14:01:02,851 INFO L131 PetriNetUnfolder]: For 9244/9350 co-relation queries the response was YES. [2022-11-21 14:01:02,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9203 conditions, 4246 events. 788/4246 cut-off events. For 9244/9350 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 42709 event pairs, 133 based on Foata normal form. 25/3920 useless extension candidates. Maximal degree in co-relation 9146. Up to 662 conditions per place. [2022-11-21 14:01:02,885 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 60 selfloop transitions, 12 changer transitions 3/304 dead transitions. [2022-11-21 14:01:02,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 304 transitions, 2098 flow [2022-11-21 14:01:02,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 14:01:02,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 14:01:02,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1122 transitions. [2022-11-21 14:01:02,888 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8820754716981132 [2022-11-21 14:01:02,888 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1122 transitions. [2022-11-21 14:01:02,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1122 transitions. [2022-11-21 14:01:02,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:01:02,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1122 transitions. [2022-11-21 14:01:02,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 187.0) internal successors, (1122), 6 states have internal predecessors, (1122), 0 states have call successors, (0), 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-21 14:01:02,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:01:02,895 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:01:02,896 INFO L175 Difference]: Start difference. First operand has 298 places, 281 transitions, 1802 flow. Second operand 6 states and 1122 transitions. [2022-11-21 14:01:02,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 304 transitions, 2098 flow [2022-11-21 14:01:02,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 304 transitions, 2042 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-11-21 14:01:02,947 INFO L231 Difference]: Finished difference. Result has 300 places, 282 transitions, 1803 flow [2022-11-21 14:01:02,948 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1746, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1803, PETRI_PLACES=300, PETRI_TRANSITIONS=282} [2022-11-21 14:01:02,948 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 111 predicate places. [2022-11-21 14:01:02,949 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 282 transitions, 1803 flow [2022-11-21 14:01:02,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:01:02,949 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:01:02,950 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 14:01:02,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-21 14:01:02,950 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 14:01:02,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:02,951 INFO L85 PathProgramCache]: Analyzing trace with hash -570362480, now seen corresponding path program 2 times [2022-11-21 14:01:02,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:02,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632346670] [2022-11-21 14:01:02,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:02,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:03,213 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-21 14:01:03,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:03,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632346670] [2022-11-21 14:01:03,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632346670] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:01:03,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:01:03,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 14:01:03,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398242765] [2022-11-21 14:01:03,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:01:03,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 14:01:03,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:01:03,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 14:01:03,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 14:01:03,218 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-21 14:01:03,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 282 transitions, 1803 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:01:03,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:01:03,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-21 14:01:03,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:01:04,380 INFO L130 PetriNetUnfolder]: 785/4185 cut-off events. [2022-11-21 14:01:04,380 INFO L131 PetriNetUnfolder]: For 9604/9718 co-relation queries the response was YES. [2022-11-21 14:01:04,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9243 conditions, 4185 events. 785/4185 cut-off events. For 9604/9718 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 41831 event pairs, 126 based on Foata normal form. 45/3899 useless extension candidates. Maximal degree in co-relation 9184. Up to 596 conditions per place. [2022-11-21 14:01:04,431 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 51 selfloop transitions, 24 changer transitions 2/306 dead transitions. [2022-11-21 14:01:04,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 306 transitions, 2087 flow [2022-11-21 14:01:04,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 14:01:04,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 14:01:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1131 transitions. [2022-11-21 14:01:04,434 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8891509433962265 [2022-11-21 14:01:04,434 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1131 transitions. [2022-11-21 14:01:04,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1131 transitions. [2022-11-21 14:01:04,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:01:04,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1131 transitions. [2022-11-21 14:01:04,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 188.5) internal successors, (1131), 6 states have internal predecessors, (1131), 0 states have call successors, (0), 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-21 14:01:04,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:01:04,440 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:01:04,440 INFO L175 Difference]: Start difference. First operand has 300 places, 282 transitions, 1803 flow. Second operand 6 states and 1131 transitions. [2022-11-21 14:01:04,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 306 transitions, 2087 flow [2022-11-21 14:01:04,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 306 transitions, 2064 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-11-21 14:01:04,488 INFO L231 Difference]: Finished difference. Result has 302 places, 285 transitions, 1896 flow [2022-11-21 14:01:04,488 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1783, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1896, PETRI_PLACES=302, PETRI_TRANSITIONS=285} [2022-11-21 14:01:04,489 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 113 predicate places. [2022-11-21 14:01:04,489 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 285 transitions, 1896 flow [2022-11-21 14:01:04,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:01:04,489 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:01:04,490 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 14:01:04,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-21 14:01:04,490 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 14:01:04,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:04,491 INFO L85 PathProgramCache]: Analyzing trace with hash -371126752, now seen corresponding path program 3 times [2022-11-21 14:01:04,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:04,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048742621] [2022-11-21 14:01:04,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:04,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,708 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-21 14:01:04,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:04,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048742621] [2022-11-21 14:01:04,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048742621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:01:04,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:01:04,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 14:01:04,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248902205] [2022-11-21 14:01:04,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:01:04,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 14:01:04,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:01:04,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 14:01:04,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 14:01:04,712 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-21 14:01:04,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 285 transitions, 1896 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:01:04,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:01:04,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-21 14:01:04,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:01:05,564 INFO L130 PetriNetUnfolder]: 780/4060 cut-off events. [2022-11-21 14:01:05,565 INFO L131 PetriNetUnfolder]: For 10707/10822 co-relation queries the response was YES. [2022-11-21 14:01:05,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9253 conditions, 4060 events. 780/4060 cut-off events. For 10707/10822 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 39997 event pairs, 147 based on Foata normal form. 39/3768 useless extension candidates. Maximal degree in co-relation 9193. Up to 621 conditions per place. [2022-11-21 14:01:05,599 INFO L137 encePairwiseOnDemand]: 203/212 looper letters, 49 selfloop transitions, 20 changer transitions 4/302 dead transitions. [2022-11-21 14:01:05,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 302 transitions, 2137 flow [2022-11-21 14:01:05,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 14:01:05,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 14:01:05,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1123 transitions. [2022-11-21 14:01:05,602 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8828616352201258 [2022-11-21 14:01:05,602 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1123 transitions. [2022-11-21 14:01:05,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1123 transitions. [2022-11-21 14:01:05,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:01:05,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1123 transitions. [2022-11-21 14:01:05,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 187.16666666666666) internal successors, (1123), 6 states have internal predecessors, (1123), 0 states have call successors, (0), 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-21 14:01:05,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:01:05,608 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:01:05,608 INFO L175 Difference]: Start difference. First operand has 302 places, 285 transitions, 1896 flow. Second operand 6 states and 1123 transitions. [2022-11-21 14:01:05,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 302 transitions, 2137 flow [2022-11-21 14:01:05,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 302 transitions, 2111 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-11-21 14:01:05,662 INFO L231 Difference]: Finished difference. Result has 305 places, 284 transitions, 1897 flow [2022-11-21 14:01:05,662 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1870, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1897, PETRI_PLACES=305, PETRI_TRANSITIONS=284} [2022-11-21 14:01:05,663 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 116 predicate places. [2022-11-21 14:01:05,663 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 284 transitions, 1897 flow [2022-11-21 14:01:05,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:01:05,664 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:01:05,664 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 14:01:05,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-21 14:01:05,664 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 14:01:05,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:05,665 INFO L85 PathProgramCache]: Analyzing trace with hash -159016458, now seen corresponding path program 4 times [2022-11-21 14:01:05,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:05,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770779319] [2022-11-21 14:01:05,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:05,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-21 14:01:05,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:05,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770779319] [2022-11-21 14:01:05,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770779319] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:01:05,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:01:05,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 14:01:05,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742645297] [2022-11-21 14:01:05,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:01:05,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 14:01:05,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:01:05,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 14:01:05,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 14:01:05,898 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-21 14:01:05,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 284 transitions, 1897 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:01:05,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:01:05,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-21 14:01:05,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:01:07,048 INFO L130 PetriNetUnfolder]: 726/4367 cut-off events. [2022-11-21 14:01:07,048 INFO L131 PetriNetUnfolder]: For 11639/11810 co-relation queries the response was YES. [2022-11-21 14:01:07,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9723 conditions, 4367 events. 726/4367 cut-off events. For 11639/11810 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 43915 event pairs, 207 based on Foata normal form. 40/4104 useless extension candidates. Maximal degree in co-relation 9662. Up to 830 conditions per place. [2022-11-21 14:01:07,078 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 66 selfloop transitions, 16 changer transitions 4/312 dead transitions. [2022-11-21 14:01:07,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 312 transitions, 2222 flow [2022-11-21 14:01:07,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 14:01:07,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 14:01:07,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1131 transitions. [2022-11-21 14:01:07,081 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8891509433962265 [2022-11-21 14:01:07,081 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1131 transitions. [2022-11-21 14:01:07,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1131 transitions. [2022-11-21 14:01:07,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:01:07,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1131 transitions. [2022-11-21 14:01:07,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 188.5) internal successors, (1131), 6 states have internal predecessors, (1131), 0 states have call successors, (0), 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-21 14:01:07,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:01:07,088 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:01:07,088 INFO L175 Difference]: Start difference. First operand has 305 places, 284 transitions, 1897 flow. Second operand 6 states and 1131 transitions. [2022-11-21 14:01:07,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 312 transitions, 2222 flow [2022-11-21 14:01:07,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 312 transitions, 2149 flow, removed 7 selfloop flow, removed 8 redundant places. [2022-11-21 14:01:07,151 INFO L231 Difference]: Finished difference. Result has 302 places, 284 transitions, 1861 flow [2022-11-21 14:01:07,152 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1824, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1861, PETRI_PLACES=302, PETRI_TRANSITIONS=284} [2022-11-21 14:01:07,152 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 113 predicate places. [2022-11-21 14:01:07,153 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 284 transitions, 1861 flow [2022-11-21 14:01:07,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:01:07,153 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:01:07,154 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 14:01:07,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-21 14:01:07,154 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 14:01:07,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:07,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1679936616, now seen corresponding path program 5 times [2022-11-21 14:01:07,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:07,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893395897] [2022-11-21 14:01:07,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:07,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:07,439 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-21 14:01:07,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:07,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893395897] [2022-11-21 14:01:07,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893395897] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:01:07,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:01:07,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 14:01:07,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571130252] [2022-11-21 14:01:07,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:01:07,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 14:01:07,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:01:07,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 14:01:07,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 14:01:07,444 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-21 14:01:07,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 284 transitions, 1861 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:01:07,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:01:07,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-21 14:01:07,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:01:08,644 INFO L130 PetriNetUnfolder]: 714/4220 cut-off events. [2022-11-21 14:01:08,644 INFO L131 PetriNetUnfolder]: For 10100/10258 co-relation queries the response was YES. [2022-11-21 14:01:08,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9333 conditions, 4220 events. 714/4220 cut-off events. For 10100/10258 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 42073 event pairs, 201 based on Foata normal form. 42/3971 useless extension candidates. Maximal degree in co-relation 9274. Up to 830 conditions per place. [2022-11-21 14:01:08,680 INFO L137 encePairwiseOnDemand]: 203/212 looper letters, 63 selfloop transitions, 22 changer transitions 2/313 dead transitions. [2022-11-21 14:01:08,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 313 transitions, 2163 flow [2022-11-21 14:01:08,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 14:01:08,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 14:01:08,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1139 transitions. [2022-11-21 14:01:08,682 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8954402515723271 [2022-11-21 14:01:08,683 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1139 transitions. [2022-11-21 14:01:08,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1139 transitions. [2022-11-21 14:01:08,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:01:08,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1139 transitions. [2022-11-21 14:01:08,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 189.83333333333334) internal successors, (1139), 6 states have internal predecessors, (1139), 0 states have call successors, (0), 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-21 14:01:08,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:01:08,689 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:01:08,689 INFO L175 Difference]: Start difference. First operand has 302 places, 284 transitions, 1861 flow. Second operand 6 states and 1139 transitions. [2022-11-21 14:01:08,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 313 transitions, 2163 flow [2022-11-21 14:01:08,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 313 transitions, 2119 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-11-21 14:01:08,752 INFO L231 Difference]: Finished difference. Result has 304 places, 286 transitions, 1915 flow [2022-11-21 14:01:08,753 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1819, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1915, PETRI_PLACES=304, PETRI_TRANSITIONS=286} [2022-11-21 14:01:08,753 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 115 predicate places. [2022-11-21 14:01:08,754 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 286 transitions, 1915 flow [2022-11-21 14:01:08,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:01:08,754 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:01:08,755 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 14:01:08,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-21 14:01:08,755 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 14:01:08,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:08,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1503119990, now seen corresponding path program 6 times [2022-11-21 14:01:08,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:08,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417199942] [2022-11-21 14:01:08,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:08,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:09,042 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-21 14:01:09,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:09,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417199942] [2022-11-21 14:01:09,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417199942] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:01:09,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:01:09,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 14:01:09,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168320557] [2022-11-21 14:01:09,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:01:09,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 14:01:09,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:01:09,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 14:01:09,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 14:01:09,047 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-21 14:01:09,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 286 transitions, 1915 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:01:09,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:01:09,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-21 14:01:09,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:01:10,091 INFO L130 PetriNetUnfolder]: 704/4071 cut-off events. [2022-11-21 14:01:10,091 INFO L131 PetriNetUnfolder]: For 10072/10238 co-relation queries the response was YES. [2022-11-21 14:01:10,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9171 conditions, 4071 events. 704/4071 cut-off events. For 10072/10238 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 40193 event pairs, 141 based on Foata normal form. 50/3849 useless extension candidates. Maximal degree in co-relation 9111. Up to 699 conditions per place. [2022-11-21 14:01:10,123 INFO L137 encePairwiseOnDemand]: 203/212 looper letters, 59 selfloop transitions, 24 changer transitions 3/312 dead transitions. [2022-11-21 14:01:10,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 312 transitions, 2200 flow [2022-11-21 14:01:10,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 14:01:10,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 14:01:10,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1136 transitions. [2022-11-21 14:01:10,126 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8930817610062893 [2022-11-21 14:01:10,126 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1136 transitions. [2022-11-21 14:01:10,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1136 transitions. [2022-11-21 14:01:10,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:01:10,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1136 transitions. [2022-11-21 14:01:10,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 189.33333333333334) internal successors, (1136), 6 states have internal predecessors, (1136), 0 states have call successors, (0), 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-21 14:01:10,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:01:10,132 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-21 14:01:10,132 INFO L175 Difference]: Start difference. First operand has 304 places, 286 transitions, 1915 flow. Second operand 6 states and 1136 transitions. [2022-11-21 14:01:10,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 312 transitions, 2200 flow [2022-11-21 14:01:10,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 312 transitions, 2175 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-11-21 14:01:10,201 INFO L231 Difference]: Finished difference. Result has 306 places, 285 transitions, 1920 flow [2022-11-21 14:01:10,201 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1890, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1920, PETRI_PLACES=306, PETRI_TRANSITIONS=285} [2022-11-21 14:01:10,202 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 117 predicate places. [2022-11-21 14:01:10,202 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 285 transitions, 1920 flow [2022-11-21 14:01:10,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 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-21 14:01:10,203 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:01:10,203 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 14:01:10,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-21 14:01:10,204 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 14:01:10,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:10,205 INFO L85 PathProgramCache]: Analyzing trace with hash 956089543, now seen corresponding path program 1 times [2022-11-21 14:01:10,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:10,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368903297] [2022-11-21 14:01:10,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:10,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:11,777 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-21 14:01:11,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:11,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368903297] [2022-11-21 14:01:11,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368903297] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:01:11,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:01:11,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-21 14:01:11,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374774599] [2022-11-21 14:01:11,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:01:11,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-21 14:01:11,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:01:11,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-21 14:01:11,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-11-21 14:01:11,782 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 212 [2022-11-21 14:01:11,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 285 transitions, 1920 flow. Second operand has 19 states, 19 states have (on average 143.47368421052633) internal successors, (2726), 19 states have internal predecessors, (2726), 0 states have call successors, (0), 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-21 14:01:11,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:01:11,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 212 [2022-11-21 14:01:11,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:01:23,052 INFO L130 PetriNetUnfolder]: 13168/32690 cut-off events. [2022-11-21 14:01:23,053 INFO L131 PetriNetUnfolder]: For 80860/80985 co-relation queries the response was YES. [2022-11-21 14:01:23,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78201 conditions, 32690 events. 13168/32690 cut-off events. For 80860/80985 co-relation queries the response was YES. Maximal size of possible extension queue 1181. Compared 378202 event pairs, 4861 based on Foata normal form. 36/30209 useless extension candidates. Maximal degree in co-relation 78141. Up to 6907 conditions per place. [2022-11-21 14:01:23,346 INFO L137 encePairwiseOnDemand]: 184/212 looper letters, 276 selfloop transitions, 81 changer transitions 0/541 dead transitions. [2022-11-21 14:01:23,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 541 transitions, 4297 flow [2022-11-21 14:01:23,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-21 14:01:23,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-11-21 14:01:23,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 3510 transitions. [2022-11-21 14:01:23,352 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7198523379819525 [2022-11-21 14:01:23,353 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 3510 transitions. [2022-11-21 14:01:23,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 3510 transitions. [2022-11-21 14:01:23,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:01:23,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 3510 transitions. [2022-11-21 14:01:23,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 152.6086956521739) internal successors, (3510), 23 states have internal predecessors, (3510), 0 states have call successors, (0), 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-21 14:01:23,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 212.0) internal successors, (5088), 24 states have internal predecessors, (5088), 0 states have call successors, (0), 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-21 14:01:23,370 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 212.0) internal successors, (5088), 24 states have internal predecessors, (5088), 0 states have call successors, (0), 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-21 14:01:23,371 INFO L175 Difference]: Start difference. First operand has 306 places, 285 transitions, 1920 flow. Second operand 23 states and 3510 transitions. [2022-11-21 14:01:23,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 541 transitions, 4297 flow [2022-11-21 14:01:23,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 541 transitions, 4207 flow, removed 2 selfloop flow, removed 8 redundant places. [2022-11-21 14:01:23,671 INFO L231 Difference]: Finished difference. Result has 331 places, 337 transitions, 2773 flow [2022-11-21 14:01:23,671 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1845, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2773, PETRI_PLACES=331, PETRI_TRANSITIONS=337} [2022-11-21 14:01:23,672 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 142 predicate places. [2022-11-21 14:01:23,672 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 337 transitions, 2773 flow [2022-11-21 14:01:23,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 143.47368421052633) internal successors, (2726), 19 states have internal predecessors, (2726), 0 states have call successors, (0), 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-21 14:01:23,674 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:01:23,674 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 14:01:23,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-21 14:01:23,674 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 14:01:23,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:23,675 INFO L85 PathProgramCache]: Analyzing trace with hash -885347297, now seen corresponding path program 2 times [2022-11-21 14:01:23,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:23,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327812037] [2022-11-21 14:01:23,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:23,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:25,030 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-21 14:01:25,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:25,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327812037] [2022-11-21 14:01:25,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327812037] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:01:25,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:01:25,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-21 14:01:25,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982903799] [2022-11-21 14:01:25,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:01:25,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-21 14:01:25,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:01:25,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-21 14:01:25,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-11-21 14:01:25,036 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 212 [2022-11-21 14:01:25,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 337 transitions, 2773 flow. Second operand has 19 states, 19 states have (on average 143.47368421052633) internal successors, (2726), 19 states have internal predecessors, (2726), 0 states have call successors, (0), 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-21 14:01:25,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:01:25,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 212 [2022-11-21 14:01:25,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:01:39,727 INFO L130 PetriNetUnfolder]: 16971/41645 cut-off events. [2022-11-21 14:01:39,728 INFO L131 PetriNetUnfolder]: For 146485/146658 co-relation queries the response was YES. [2022-11-21 14:01:40,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120184 conditions, 41645 events. 16971/41645 cut-off events. For 146485/146658 co-relation queries the response was YES. Maximal size of possible extension queue 1477. Compared 499011 event pairs, 4550 based on Foata normal form. 80/40112 useless extension candidates. Maximal degree in co-relation 120114. Up to 7488 conditions per place. [2022-11-21 14:01:40,230 INFO L137 encePairwiseOnDemand]: 183/212 looper letters, 349 selfloop transitions, 85 changer transitions 0/618 dead transitions. [2022-11-21 14:01:40,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 618 transitions, 5868 flow [2022-11-21 14:01:40,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-21 14:01:40,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-11-21 14:01:40,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3826 transitions. [2022-11-21 14:01:40,240 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7218867924528302 [2022-11-21 14:01:40,240 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 3826 transitions. [2022-11-21 14:01:40,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 3826 transitions. [2022-11-21 14:01:40,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:01:40,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3826 transitions. [2022-11-21 14:01:40,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 153.04) internal successors, (3826), 25 states have internal predecessors, (3826), 0 states have call successors, (0), 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-21 14:01:40,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 212.0) internal successors, (5512), 26 states have internal predecessors, (5512), 0 states have call successors, (0), 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-21 14:01:40,264 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 212.0) internal successors, (5512), 26 states have internal predecessors, (5512), 0 states have call successors, (0), 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-21 14:01:40,265 INFO L175 Difference]: Start difference. First operand has 331 places, 337 transitions, 2773 flow. Second operand 25 states and 3826 transitions. [2022-11-21 14:01:40,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 618 transitions, 5868 flow [2022-11-21 14:01:40,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 618 transitions, 5763 flow, removed 40 selfloop flow, removed 8 redundant places. [2022-11-21 14:01:40,890 INFO L231 Difference]: Finished difference. Result has 362 places, 381 transitions, 3549 flow [2022-11-21 14:01:40,891 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=2708, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=3549, PETRI_PLACES=362, PETRI_TRANSITIONS=381} [2022-11-21 14:01:40,892 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 173 predicate places. [2022-11-21 14:01:40,892 INFO L495 AbstractCegarLoop]: Abstraction has has 362 places, 381 transitions, 3549 flow [2022-11-21 14:01:40,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 143.47368421052633) internal successors, (2726), 19 states have internal predecessors, (2726), 0 states have call successors, (0), 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-21 14:01:40,893 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:01:40,894 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 14:01:40,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-21 14:01:40,895 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 14:01:40,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:40,895 INFO L85 PathProgramCache]: Analyzing trace with hash -246155891, now seen corresponding path program 3 times [2022-11-21 14:01:40,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:40,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317455652] [2022-11-21 14:01:40,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:40,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:42,565 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-21 14:01:42,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:42,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317455652] [2022-11-21 14:01:42,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317455652] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:01:42,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:01:42,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-21 14:01:42,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098224874] [2022-11-21 14:01:42,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:01:42,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-21 14:01:42,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:01:42,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-21 14:01:42,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-11-21 14:01:42,570 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 212 [2022-11-21 14:01:42,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 381 transitions, 3549 flow. Second operand has 19 states, 19 states have (on average 143.47368421052633) internal successors, (2726), 19 states have internal predecessors, (2726), 0 states have call successors, (0), 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-21 14:01:42,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:01:42,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 212 [2022-11-21 14:01:42,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:02:00,152 INFO L130 PetriNetUnfolder]: 19772/49474 cut-off events. [2022-11-21 14:02:00,152 INFO L131 PetriNetUnfolder]: For 258655/258830 co-relation queries the response was YES. [2022-11-21 14:02:00,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160655 conditions, 49474 events. 19772/49474 cut-off events. For 258655/258830 co-relation queries the response was YES. Maximal size of possible extension queue 1819. Compared 612897 event pairs, 9299 based on Foata normal form. 142/47519 useless extension candidates. Maximal degree in co-relation 160570. Up to 13505 conditions per place. [2022-11-21 14:02:00,756 INFO L137 encePairwiseOnDemand]: 184/212 looper letters, 322 selfloop transitions, 152 changer transitions 0/658 dead transitions. [2022-11-21 14:02:00,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 658 transitions, 7035 flow [2022-11-21 14:02:00,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-21 14:02:00,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-11-21 14:02:00,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 3502 transitions. [2022-11-21 14:02:00,762 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7182116488925349 [2022-11-21 14:02:00,762 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 3502 transitions. [2022-11-21 14:02:00,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 3502 transitions. [2022-11-21 14:02:00,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:02:00,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 3502 transitions. [2022-11-21 14:02:00,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 152.2608695652174) internal successors, (3502), 23 states have internal predecessors, (3502), 0 states have call successors, (0), 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-21 14:02:00,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 212.0) internal successors, (5088), 24 states have internal predecessors, (5088), 0 states have call successors, (0), 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-21 14:02:00,777 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 212.0) internal successors, (5088), 24 states have internal predecessors, (5088), 0 states have call successors, (0), 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-21 14:02:00,777 INFO L175 Difference]: Start difference. First operand has 362 places, 381 transitions, 3549 flow. Second operand 23 states and 3502 transitions. [2022-11-21 14:02:00,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 658 transitions, 7035 flow [2022-11-21 14:02:02,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 658 transitions, 6904 flow, removed 53 selfloop flow, removed 8 redundant places. [2022-11-21 14:02:02,321 INFO L231 Difference]: Finished difference. Result has 388 places, 441 transitions, 4993 flow [2022-11-21 14:02:02,322 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=3444, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=4993, PETRI_PLACES=388, PETRI_TRANSITIONS=441} [2022-11-21 14:02:02,322 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 199 predicate places. [2022-11-21 14:02:02,323 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 441 transitions, 4993 flow [2022-11-21 14:02:02,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 143.47368421052633) internal successors, (2726), 19 states have internal predecessors, (2726), 0 states have call successors, (0), 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-21 14:02:02,323 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:02:02,324 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 14:02:02,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-21 14:02:02,324 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-21 14:02:02,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:02:02,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1992116649, now seen corresponding path program 4 times [2022-11-21 14:02:02,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:02:02,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311919487] [2022-11-21 14:02:02,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:02:02,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:02:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:02:03,673 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-21 14:02:03,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:02:03,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311919487] [2022-11-21 14:02:03,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311919487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:02:03,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:02:03,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-21 14:02:03,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605371088] [2022-11-21 14:02:03,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:02:03,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-21 14:02:03,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:02:03,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-21 14:02:03,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-11-21 14:02:03,679 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 212 [2022-11-21 14:02:03,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 441 transitions, 4993 flow. Second operand has 19 states, 19 states have (on average 143.47368421052633) internal successors, (2726), 19 states have internal predecessors, (2726), 0 states have call successors, (0), 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-21 14:02:03,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:02:03,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 212 [2022-11-21 14:02:03,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand