./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-misc-5.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-misc-5.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 3f696f3d7a078e1a0d9bb5ce793945c7092990826a45e57529562474d0b18f4a --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 09:02:12,555 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 09:02:12,557 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 09:02:12,582 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 09:02:12,583 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 09:02:12,584 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 09:02:12,587 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 09:02:12,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 09:02:12,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 09:02:12,594 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 09:02:12,595 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 09:02:12,596 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 09:02:12,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 09:02:12,597 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 09:02:12,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 09:02:12,601 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 09:02:12,601 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 09:02:12,602 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 09:02:12,604 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 09:02:12,606 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 09:02:12,607 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 09:02:12,608 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 09:02:12,609 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 09:02:12,610 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 09:02:12,611 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 09:02:12,617 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 09:02:12,618 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 09:02:12,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 09:02:12,619 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 09:02:12,619 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 09:02:12,620 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 09:02:12,620 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 09:02:12,621 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 09:02:12,622 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 09:02:12,623 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 09:02:12,623 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 09:02:12,624 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 09:02:12,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 09:02:12,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 09:02:12,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 09:02:12,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 09:02:12,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 09:02:12,631 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 09:02:12,651 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 09:02:12,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 09:02:12,652 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 09:02:12,652 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 09:02:12,652 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 09:02:12,652 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 09:02:12,653 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 09:02:12,653 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 09:02:12,653 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 09:02:12,654 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 09:02:12,654 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 09:02:12,654 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 09:02:12,660 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 09:02:12,660 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 09:02:12,660 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 09:02:12,661 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 09:02:12,661 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 09:02:12,661 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 09:02:12,661 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 09:02:12,661 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 09:02:12,661 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 09:02:12,662 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 09:02:12,662 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 09:02:12,662 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 09:02:12,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:02:12,662 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 09:02:12,662 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 09:02:12,663 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 09:02:12,663 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 09:02:12,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 09:02:12,663 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 09:02:12,663 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 09:02:12,663 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 09:02:12,664 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 3f696f3d7a078e1a0d9bb5ce793945c7092990826a45e57529562474d0b18f4a [2022-07-21 09:02:12,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 09:02:12,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 09:02:12,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 09:02:12,951 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 09:02:12,952 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 09:02:12,954 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-5.wvr.c [2022-07-21 09:02:13,009 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b5d22ed7/770cc3c5c5a24bc594b4dc4a238c303e/FLAG649aa448e [2022-07-21 09:02:13,406 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 09:02:13,407 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-5.wvr.c [2022-07-21 09:02:13,412 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b5d22ed7/770cc3c5c5a24bc594b4dc4a238c303e/FLAG649aa448e [2022-07-21 09:02:13,827 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b5d22ed7/770cc3c5c5a24bc594b4dc4a238c303e [2022-07-21 09:02:13,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 09:02:13,830 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 09:02:13,831 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 09:02:13,831 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 09:02:13,833 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 09:02:13,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:02:13" (1/1) ... [2022-07-21 09:02:13,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@db3e13a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:02:13, skipping insertion in model container [2022-07-21 09:02:13,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:02:13" (1/1) ... [2022-07-21 09:02:13,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 09:02:13,849 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 09:02:13,960 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-5.wvr.c[3027,3040] [2022-07-21 09:02:13,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:02:13,968 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 09:02:14,017 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-5.wvr.c[3027,3040] [2022-07-21 09:02:14,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:02:14,028 INFO L208 MainTranslator]: Completed translation [2022-07-21 09:02:14,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:02:14 WrapperNode [2022-07-21 09:02:14,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 09:02:14,036 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 09:02:14,036 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 09:02:14,036 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 09:02:14,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:02:14" (1/1) ... [2022-07-21 09:02:14,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:02:14" (1/1) ... [2022-07-21 09:02:14,066 INFO L137 Inliner]: procedures = 22, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-07-21 09:02:14,068 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 09:02:14,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 09:02:14,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 09:02:14,070 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 09:02:14,075 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:02:14" (1/1) ... [2022-07-21 09:02:14,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:02:14" (1/1) ... [2022-07-21 09:02:14,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:02:14" (1/1) ... [2022-07-21 09:02:14,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:02:14" (1/1) ... [2022-07-21 09:02:14,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:02:14" (1/1) ... [2022-07-21 09:02:14,108 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:02:14" (1/1) ... [2022-07-21 09:02:14,110 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:02:14" (1/1) ... [2022-07-21 09:02:14,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 09:02:14,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 09:02:14,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 09:02:14,117 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 09:02:14,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:02:14" (1/1) ... [2022-07-21 09:02:14,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:02:14,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:02:14,156 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 09:02:14,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 09:02:14,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 09:02:14,186 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-21 09:02:14,186 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-21 09:02:14,186 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-21 09:02:14,186 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-21 09:02:14,186 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-21 09:02:14,187 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-21 09:02:14,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 09:02:14,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 09:02:14,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 09:02:14,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-21 09:02:14,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-21 09:02:14,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 09:02:14,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 09:02:14,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 09:02:14,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 09:02:14,189 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-21 09:02:14,280 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 09:02:14,282 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 09:02:14,520 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 09:02:14,602 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 09:02:14,602 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-21 09:02:14,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:02:14 BoogieIcfgContainer [2022-07-21 09:02:14,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 09:02:14,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 09:02:14,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 09:02:14,608 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 09:02:14,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 09:02:13" (1/3) ... [2022-07-21 09:02:14,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a2b97d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:02:14, skipping insertion in model container [2022-07-21 09:02:14,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:02:14" (2/3) ... [2022-07-21 09:02:14,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a2b97d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:02:14, skipping insertion in model container [2022-07-21 09:02:14,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:02:14" (3/3) ... [2022-07-21 09:02:14,610 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-misc-5.wvr.c [2022-07-21 09:02:14,614 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-21 09:02:14,620 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 09:02:14,620 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 09:02:14,621 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-21 09:02:14,667 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-21 09:02:14,691 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 109 transitions, 242 flow [2022-07-21 09:02:14,728 INFO L129 PetriNetUnfolder]: 7/106 cut-off events. [2022-07-21 09:02:14,728 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-21 09:02:14,733 INFO L84 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 106 events. 7/106 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2022-07-21 09:02:14,734 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 109 transitions, 242 flow [2022-07-21 09:02:14,738 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 95 transitions, 208 flow [2022-07-21 09:02:14,745 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 09:02:14,749 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5f02f222, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@17b61c39 [2022-07-21 09:02:14,750 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-07-21 09:02:14,775 INFO L129 PetriNetUnfolder]: 7/94 cut-off events. [2022-07-21 09:02:14,776 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-21 09:02:14,776 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:02:14,777 INFO L200 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] [2022-07-21 09:02:14,777 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:02:14,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:02:14,781 INFO L85 PathProgramCache]: Analyzing trace with hash 722273223, now seen corresponding path program 1 times [2022-07-21 09:02:14,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:02:14,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051008765] [2022-07-21 09:02:14,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:02:14,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:02:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:02:14,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:02:14,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:02:14,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051008765] [2022-07-21 09:02:14,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051008765] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:02:14,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:02:14,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 09:02:14,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462766763] [2022-07-21 09:02:14,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:02:14,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 09:02:14,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:02:14,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 09:02:14,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 09:02:14,970 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 109 [2022-07-21 09:02:14,975 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 208 flow. Second operand has 2 states, 2 states have (on average 99.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:14,975 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:02:14,975 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 109 [2022-07-21 09:02:14,976 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:02:15,044 INFO L129 PetriNetUnfolder]: 36/184 cut-off events. [2022-07-21 09:02:15,045 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-07-21 09:02:15,046 INFO L84 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 184 events. 36/184 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 463 event pairs, 7 based on Foata normal form. 18/184 useless extension candidates. Maximal degree in co-relation 178. Up to 49 conditions per place. [2022-07-21 09:02:15,048 INFO L132 encePairwiseOnDemand]: 106/109 looper letters, 10 selfloop transitions, 0 changer transitions 1/92 dead transitions. [2022-07-21 09:02:15,048 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 92 transitions, 222 flow [2022-07-21 09:02:15,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 09:02:15,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-21 09:02:15,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 203 transitions. [2022-07-21 09:02:15,059 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9311926605504587 [2022-07-21 09:02:15,059 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 203 transitions. [2022-07-21 09:02:15,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 203 transitions. [2022-07-21 09:02:15,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:02:15,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 203 transitions. [2022-07-21 09:02:15,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 101.5) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:15,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:15,066 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:15,067 INFO L186 Difference]: Start difference. First operand has 98 places, 95 transitions, 208 flow. Second operand 2 states and 203 transitions. [2022-07-21 09:02:15,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 92 transitions, 222 flow [2022-07-21 09:02:15,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 92 transitions, 210 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-07-21 09:02:15,072 INFO L242 Difference]: Finished difference. Result has 93 places, 91 transitions, 188 flow [2022-07-21 09:02:15,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=188, PETRI_PLACES=93, PETRI_TRANSITIONS=91} [2022-07-21 09:02:15,076 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, -5 predicate places. [2022-07-21 09:02:15,076 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 91 transitions, 188 flow [2022-07-21 09:02:15,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 99.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:15,076 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:02:15,076 INFO L200 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] [2022-07-21 09:02:15,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 09:02:15,077 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:02:15,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:02:15,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1307011461, now seen corresponding path program 1 times [2022-07-21 09:02:15,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:02:15,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557836486] [2022-07-21 09:02:15,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:02:15,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:02:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:02:15,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:02:15,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:02:15,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557836486] [2022-07-21 09:02:15,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557836486] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:02:15,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:02:15,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 09:02:15,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213786057] [2022-07-21 09:02:15,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:02:15,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:02:15,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:02:15,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:02:15,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:02:15,347 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 109 [2022-07-21 09:02:15,348 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 91 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:15,351 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:02:15,352 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 109 [2022-07-21 09:02:15,352 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:02:15,530 INFO L129 PetriNetUnfolder]: 95/279 cut-off events. [2022-07-21 09:02:15,530 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-07-21 09:02:15,531 INFO L84 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 279 events. 95/279 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 967 event pairs, 2 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 445. Up to 71 conditions per place. [2022-07-21 09:02:15,533 INFO L132 encePairwiseOnDemand]: 103/109 looper letters, 33 selfloop transitions, 6 changer transitions 0/107 dead transitions. [2022-07-21 09:02:15,533 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 107 transitions, 300 flow [2022-07-21 09:02:15,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 09:02:15,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-07-21 09:02:15,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 526 transitions. [2022-07-21 09:02:15,537 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8042813455657493 [2022-07-21 09:02:15,543 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 526 transitions. [2022-07-21 09:02:15,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 526 transitions. [2022-07-21 09:02:15,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:02:15,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 526 transitions. [2022-07-21 09:02:15,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:15,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:15,551 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:15,551 INFO L186 Difference]: Start difference. First operand has 93 places, 91 transitions, 188 flow. Second operand 6 states and 526 transitions. [2022-07-21 09:02:15,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 107 transitions, 300 flow [2022-07-21 09:02:15,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 107 transitions, 300 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-21 09:02:15,554 INFO L242 Difference]: Finished difference. Result has 99 places, 93 transitions, 213 flow [2022-07-21 09:02:15,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=213, PETRI_PLACES=99, PETRI_TRANSITIONS=93} [2022-07-21 09:02:15,555 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 1 predicate places. [2022-07-21 09:02:15,556 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 93 transitions, 213 flow [2022-07-21 09:02:15,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:15,556 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:02:15,556 INFO L200 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] [2022-07-21 09:02:15,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 09:02:15,557 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:02:15,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:02:15,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1981283141, now seen corresponding path program 2 times [2022-07-21 09:02:15,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:02:15,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363451710] [2022-07-21 09:02:15,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:02:15,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:02:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:02:15,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:02:15,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:02:15,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363451710] [2022-07-21 09:02:15,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363451710] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:02:15,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:02:15,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 09:02:15,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245659008] [2022-07-21 09:02:15,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:02:15,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:02:15,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:02:15,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:02:15,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:02:15,713 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 109 [2022-07-21 09:02:15,714 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 93 transitions, 213 flow. Second operand has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:15,714 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:02:15,714 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 109 [2022-07-21 09:02:15,714 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:02:15,851 INFO L129 PetriNetUnfolder]: 99/326 cut-off events. [2022-07-21 09:02:15,851 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-07-21 09:02:15,854 INFO L84 FinitePrefix]: Finished finitePrefix Result has 552 conditions, 326 events. 99/326 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1305 event pairs, 20 based on Foata normal form. 3/297 useless extension candidates. Maximal degree in co-relation 546. Up to 71 conditions per place. [2022-07-21 09:02:15,856 INFO L132 encePairwiseOnDemand]: 101/109 looper letters, 36 selfloop transitions, 8 changer transitions 0/112 dead transitions. [2022-07-21 09:02:15,856 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 112 transitions, 341 flow [2022-07-21 09:02:15,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:02:15,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-21 09:02:15,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 612 transitions. [2022-07-21 09:02:15,860 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8020969855832241 [2022-07-21 09:02:15,860 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 612 transitions. [2022-07-21 09:02:15,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 612 transitions. [2022-07-21 09:02:15,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:02:15,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 612 transitions. [2022-07-21 09:02:15,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 87.42857142857143) internal successors, (612), 7 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:15,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:15,864 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:15,864 INFO L186 Difference]: Start difference. First operand has 99 places, 93 transitions, 213 flow. Second operand 7 states and 612 transitions. [2022-07-21 09:02:15,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 112 transitions, 341 flow [2022-07-21 09:02:15,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 112 transitions, 334 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-21 09:02:15,871 INFO L242 Difference]: Finished difference. Result has 104 places, 95 transitions, 239 flow [2022-07-21 09:02:15,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=239, PETRI_PLACES=104, PETRI_TRANSITIONS=95} [2022-07-21 09:02:15,873 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 6 predicate places. [2022-07-21 09:02:15,873 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 95 transitions, 239 flow [2022-07-21 09:02:15,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:15,873 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:02:15,874 INFO L200 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] [2022-07-21 09:02:15,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 09:02:15,874 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:02:15,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:02:15,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1355540335, now seen corresponding path program 3 times [2022-07-21 09:02:15,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:02:15,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209310804] [2022-07-21 09:02:15,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:02:15,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:02:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:02:16,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:02:16,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:02:16,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209310804] [2022-07-21 09:02:16,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209310804] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:02:16,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:02:16,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 09:02:16,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719421101] [2022-07-21 09:02:16,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:02:16,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 09:02:16,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:02:16,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 09:02:16,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 09:02:16,046 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 109 [2022-07-21 09:02:16,047 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 95 transitions, 239 flow. Second operand has 7 states, 7 states have (on average 81.57142857142857) internal successors, (571), 7 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:16,047 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:02:16,048 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 109 [2022-07-21 09:02:16,048 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:02:16,222 INFO L129 PetriNetUnfolder]: 224/608 cut-off events. [2022-07-21 09:02:16,222 INFO L130 PetriNetUnfolder]: For 242/242 co-relation queries the response was YES. [2022-07-21 09:02:16,224 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 608 events. 224/608 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3197 event pairs, 29 based on Foata normal form. 6/557 useless extension candidates. Maximal degree in co-relation 1166. Up to 157 conditions per place. [2022-07-21 09:02:16,226 INFO L132 encePairwiseOnDemand]: 98/109 looper letters, 33 selfloop transitions, 7 changer transitions 36/142 dead transitions. [2022-07-21 09:02:16,226 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 142 transitions, 539 flow [2022-07-21 09:02:16,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 09:02:16,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-21 09:02:16,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 784 transitions. [2022-07-21 09:02:16,228 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.799184505606524 [2022-07-21 09:02:16,228 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 784 transitions. [2022-07-21 09:02:16,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 784 transitions. [2022-07-21 09:02:16,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:02:16,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 784 transitions. [2022-07-21 09:02:16,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 87.11111111111111) internal successors, (784), 9 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:16,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:16,232 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:16,232 INFO L186 Difference]: Start difference. First operand has 104 places, 95 transitions, 239 flow. Second operand 9 states and 784 transitions. [2022-07-21 09:02:16,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 142 transitions, 539 flow [2022-07-21 09:02:16,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 142 transitions, 526 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-21 09:02:16,236 INFO L242 Difference]: Finished difference. Result has 113 places, 97 transitions, 281 flow [2022-07-21 09:02:16,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=281, PETRI_PLACES=113, PETRI_TRANSITIONS=97} [2022-07-21 09:02:16,237 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 15 predicate places. [2022-07-21 09:02:16,237 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 97 transitions, 281 flow [2022-07-21 09:02:16,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 81.57142857142857) internal successors, (571), 7 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:16,237 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:02:16,237 INFO L200 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] [2022-07-21 09:02:16,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 09:02:16,238 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:02:16,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:02:16,238 INFO L85 PathProgramCache]: Analyzing trace with hash -214740210, now seen corresponding path program 1 times [2022-07-21 09:02:16,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:02:16,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432034095] [2022-07-21 09:02:16,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:02:16,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:02:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:02:16,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:02:16,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:02:16,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432034095] [2022-07-21 09:02:16,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432034095] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:02:16,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:02:16,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 09:02:16,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954165615] [2022-07-21 09:02:16,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:02:16,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:02:16,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:02:16,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:02:16,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:02:16,366 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2022-07-21 09:02:16,366 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 97 transitions, 281 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:16,366 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:02:16,367 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2022-07-21 09:02:16,367 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:02:16,519 INFO L129 PetriNetUnfolder]: 323/803 cut-off events. [2022-07-21 09:02:16,520 INFO L130 PetriNetUnfolder]: For 645/652 co-relation queries the response was YES. [2022-07-21 09:02:16,522 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1871 conditions, 803 events. 323/803 cut-off events. For 645/652 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4554 event pairs, 25 based on Foata normal form. 6/724 useless extension candidates. Maximal degree in co-relation 1858. Up to 179 conditions per place. [2022-07-21 09:02:16,525 INFO L132 encePairwiseOnDemand]: 100/109 looper letters, 55 selfloop transitions, 18 changer transitions 6/148 dead transitions. [2022-07-21 09:02:16,525 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 148 transitions, 678 flow [2022-07-21 09:02:16,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:02:16,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-21 09:02:16,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 652 transitions. [2022-07-21 09:02:16,527 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.854521625163827 [2022-07-21 09:02:16,527 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 652 transitions. [2022-07-21 09:02:16,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 652 transitions. [2022-07-21 09:02:16,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:02:16,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 652 transitions. [2022-07-21 09:02:16,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:16,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:16,530 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:16,530 INFO L186 Difference]: Start difference. First operand has 113 places, 97 transitions, 281 flow. Second operand 7 states and 652 transitions. [2022-07-21 09:02:16,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 148 transitions, 678 flow [2022-07-21 09:02:16,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 148 transitions, 650 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-07-21 09:02:16,535 INFO L242 Difference]: Finished difference. Result has 116 places, 110 transitions, 420 flow [2022-07-21 09:02:16,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=420, PETRI_PLACES=116, PETRI_TRANSITIONS=110} [2022-07-21 09:02:16,536 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 18 predicate places. [2022-07-21 09:02:16,536 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 110 transitions, 420 flow [2022-07-21 09:02:16,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:16,537 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:02:16,537 INFO L200 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] [2022-07-21 09:02:16,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 09:02:16,538 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:02:16,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:02:16,538 INFO L85 PathProgramCache]: Analyzing trace with hash -108227670, now seen corresponding path program 2 times [2022-07-21 09:02:16,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:02:16,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929114467] [2022-07-21 09:02:16,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:02:16,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:02:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:02:16,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:02:16,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:02:16,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929114467] [2022-07-21 09:02:16,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929114467] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:02:16,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:02:16,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 09:02:16,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527466308] [2022-07-21 09:02:16,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:02:16,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 09:02:16,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:02:16,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 09:02:16,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-21 09:02:16,678 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 109 [2022-07-21 09:02:16,679 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 110 transitions, 420 flow. Second operand has 8 states, 8 states have (on average 79.75) internal successors, (638), 8 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:16,679 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:02:16,679 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 109 [2022-07-21 09:02:16,679 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:02:16,940 INFO L129 PetriNetUnfolder]: 433/1135 cut-off events. [2022-07-21 09:02:16,940 INFO L130 PetriNetUnfolder]: For 2069/2085 co-relation queries the response was YES. [2022-07-21 09:02:16,944 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3197 conditions, 1135 events. 433/1135 cut-off events. For 2069/2085 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7301 event pairs, 67 based on Foata normal form. 16/1053 useless extension candidates. Maximal degree in co-relation 3181. Up to 236 conditions per place. [2022-07-21 09:02:16,949 INFO L132 encePairwiseOnDemand]: 97/109 looper letters, 68 selfloop transitions, 10 changer transitions 38/182 dead transitions. [2022-07-21 09:02:16,949 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 182 transitions, 1095 flow [2022-07-21 09:02:16,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 09:02:16,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-21 09:02:16,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 931 transitions. [2022-07-21 09:02:16,952 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7764804003336113 [2022-07-21 09:02:16,952 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 931 transitions. [2022-07-21 09:02:16,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 931 transitions. [2022-07-21 09:02:16,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:02:16,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 931 transitions. [2022-07-21 09:02:16,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 84.63636363636364) internal successors, (931), 11 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:16,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 109.0) internal successors, (1308), 12 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:16,958 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 109.0) internal successors, (1308), 12 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:16,958 INFO L186 Difference]: Start difference. First operand has 116 places, 110 transitions, 420 flow. Second operand 11 states and 931 transitions. [2022-07-21 09:02:16,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 182 transitions, 1095 flow [2022-07-21 09:02:16,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 182 transitions, 1084 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-21 09:02:16,967 INFO L242 Difference]: Finished difference. Result has 130 places, 112 transitions, 486 flow [2022-07-21 09:02:16,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=486, PETRI_PLACES=130, PETRI_TRANSITIONS=112} [2022-07-21 09:02:16,969 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 32 predicate places. [2022-07-21 09:02:16,969 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 112 transitions, 486 flow [2022-07-21 09:02:16,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 79.75) internal successors, (638), 8 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:16,970 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:02:16,970 INFO L200 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] [2022-07-21 09:02:16,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 09:02:16,970 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:02:16,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:02:16,971 INFO L85 PathProgramCache]: Analyzing trace with hash 477981010, now seen corresponding path program 3 times [2022-07-21 09:02:16,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:02:16,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028966030] [2022-07-21 09:02:16,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:02:16,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:02:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:02:17,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:02:17,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:02:17,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028966030] [2022-07-21 09:02:17,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028966030] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:02:17,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:02:17,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 09:02:17,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473969676] [2022-07-21 09:02:17,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:02:17,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:02:17,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:02:17,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:02:17,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:02:17,051 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2022-07-21 09:02:17,051 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 112 transitions, 486 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:17,051 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:02:17,051 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2022-07-21 09:02:17,051 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:02:17,304 INFO L129 PetriNetUnfolder]: 594/1490 cut-off events. [2022-07-21 09:02:17,304 INFO L130 PetriNetUnfolder]: For 4347/4374 co-relation queries the response was YES. [2022-07-21 09:02:17,309 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4675 conditions, 1490 events. 594/1490 cut-off events. For 4347/4374 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 10737 event pairs, 42 based on Foata normal form. 12/1388 useless extension candidates. Maximal degree in co-relation 4654. Up to 334 conditions per place. [2022-07-21 09:02:17,316 INFO L132 encePairwiseOnDemand]: 101/109 looper letters, 74 selfloop transitions, 30 changer transitions 2/175 dead transitions. [2022-07-21 09:02:17,316 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 175 transitions, 1212 flow [2022-07-21 09:02:17,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:02:17,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-21 09:02:17,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 653 transitions. [2022-07-21 09:02:17,318 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8558322411533421 [2022-07-21 09:02:17,318 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 653 transitions. [2022-07-21 09:02:17,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 653 transitions. [2022-07-21 09:02:17,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:02:17,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 653 transitions. [2022-07-21 09:02:17,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:17,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:17,321 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:17,322 INFO L186 Difference]: Start difference. First operand has 130 places, 112 transitions, 486 flow. Second operand 7 states and 653 transitions. [2022-07-21 09:02:17,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 175 transitions, 1212 flow [2022-07-21 09:02:17,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 175 transitions, 1149 flow, removed 20 selfloop flow, removed 8 redundant places. [2022-07-21 09:02:17,336 INFO L242 Difference]: Finished difference. Result has 130 places, 130 transitions, 785 flow [2022-07-21 09:02:17,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=785, PETRI_PLACES=130, PETRI_TRANSITIONS=130} [2022-07-21 09:02:17,337 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 32 predicate places. [2022-07-21 09:02:17,337 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 130 transitions, 785 flow [2022-07-21 09:02:17,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:17,337 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:02:17,338 INFO L200 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] [2022-07-21 09:02:17,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 09:02:17,338 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:02:17,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:02:17,338 INFO L85 PathProgramCache]: Analyzing trace with hash 768641710, now seen corresponding path program 4 times [2022-07-21 09:02:17,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:02:17,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596928527] [2022-07-21 09:02:17,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:02:17,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:02:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:02:17,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:02:17,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:02:17,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596928527] [2022-07-21 09:02:17,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596928527] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:02:17,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:02:17,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 09:02:17,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288560025] [2022-07-21 09:02:17,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:02:17,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:02:17,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:02:17,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:02:17,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:02:17,438 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2022-07-21 09:02:17,438 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 130 transitions, 785 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:17,438 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:02:17,438 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2022-07-21 09:02:17,439 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:02:17,784 INFO L129 PetriNetUnfolder]: 832/2072 cut-off events. [2022-07-21 09:02:17,784 INFO L130 PetriNetUnfolder]: For 8233/8267 co-relation queries the response was YES. [2022-07-21 09:02:17,793 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6890 conditions, 2072 events. 832/2072 cut-off events. For 8233/8267 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 16208 event pairs, 118 based on Foata normal form. 96/2036 useless extension candidates. Maximal degree in co-relation 6867. Up to 578 conditions per place. [2022-07-21 09:02:17,803 INFO L132 encePairwiseOnDemand]: 100/109 looper letters, 98 selfloop transitions, 49 changer transitions 22/238 dead transitions. [2022-07-21 09:02:17,803 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 238 transitions, 2090 flow [2022-07-21 09:02:17,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 09:02:17,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-21 09:02:17,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 841 transitions. [2022-07-21 09:02:17,805 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8572884811416922 [2022-07-21 09:02:17,805 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 841 transitions. [2022-07-21 09:02:17,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 841 transitions. [2022-07-21 09:02:17,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:02:17,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 841 transitions. [2022-07-21 09:02:17,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 93.44444444444444) internal successors, (841), 9 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:17,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:17,808 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:17,809 INFO L186 Difference]: Start difference. First operand has 130 places, 130 transitions, 785 flow. Second operand 9 states and 841 transitions. [2022-07-21 09:02:17,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 238 transitions, 2090 flow [2022-07-21 09:02:17,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 238 transitions, 2080 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-07-21 09:02:17,832 INFO L242 Difference]: Finished difference. Result has 146 places, 157 transitions, 1337 flow [2022-07-21 09:02:17,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1337, PETRI_PLACES=146, PETRI_TRANSITIONS=157} [2022-07-21 09:02:17,832 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 48 predicate places. [2022-07-21 09:02:17,833 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 157 transitions, 1337 flow [2022-07-21 09:02:17,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:17,833 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:02:17,833 INFO L200 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] [2022-07-21 09:02:17,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 09:02:17,833 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:02:17,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:02:17,834 INFO L85 PathProgramCache]: Analyzing trace with hash 683985028, now seen corresponding path program 5 times [2022-07-21 09:02:17,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:02:17,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242909668] [2022-07-21 09:02:17,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:02:17,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:02:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:02:17,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:02:17,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:02:17,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242909668] [2022-07-21 09:02:17,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242909668] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:02:17,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:02:17,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 09:02:17,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333881717] [2022-07-21 09:02:17,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:02:17,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:02:17,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:02:17,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:02:17,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:02:17,928 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2022-07-21 09:02:17,928 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 157 transitions, 1337 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:17,928 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:02:17,928 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2022-07-21 09:02:17,928 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:02:18,289 INFO L129 PetriNetUnfolder]: 871/2130 cut-off events. [2022-07-21 09:02:18,289 INFO L130 PetriNetUnfolder]: For 11966/12013 co-relation queries the response was YES. [2022-07-21 09:02:18,296 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8342 conditions, 2130 events. 871/2130 cut-off events. For 11966/12013 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 16671 event pairs, 54 based on Foata normal form. 14/1983 useless extension candidates. Maximal degree in co-relation 8311. Up to 621 conditions per place. [2022-07-21 09:02:18,305 INFO L132 encePairwiseOnDemand]: 100/109 looper letters, 88 selfloop transitions, 64 changer transitions 3/224 dead transitions. [2022-07-21 09:02:18,306 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 224 transitions, 2274 flow [2022-07-21 09:02:18,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 09:02:18,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-21 09:02:18,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 833 transitions. [2022-07-21 09:02:18,307 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8491335372069317 [2022-07-21 09:02:18,308 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 833 transitions. [2022-07-21 09:02:18,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 833 transitions. [2022-07-21 09:02:18,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:02:18,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 833 transitions. [2022-07-21 09:02:18,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 92.55555555555556) internal successors, (833), 9 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:18,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:18,311 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:18,311 INFO L186 Difference]: Start difference. First operand has 146 places, 157 transitions, 1337 flow. Second operand 9 states and 833 transitions. [2022-07-21 09:02:18,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 224 transitions, 2274 flow [2022-07-21 09:02:18,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 224 transitions, 2226 flow, removed 24 selfloop flow, removed 1 redundant places. [2022-07-21 09:02:18,343 INFO L242 Difference]: Finished difference. Result has 157 places, 171 transitions, 1734 flow [2022-07-21 09:02:18,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=1260, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1734, PETRI_PLACES=157, PETRI_TRANSITIONS=171} [2022-07-21 09:02:18,343 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 59 predicate places. [2022-07-21 09:02:18,343 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 171 transitions, 1734 flow [2022-07-21 09:02:18,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:18,344 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:02:18,344 INFO L200 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] [2022-07-21 09:02:18,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 09:02:18,344 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:02:18,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:02:18,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1839617844, now seen corresponding path program 6 times [2022-07-21 09:02:18,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:02:18,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692114609] [2022-07-21 09:02:18,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:02:18,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:02:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:02:18,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:02:18,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:02:18,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692114609] [2022-07-21 09:02:18,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692114609] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:02:18,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:02:18,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 09:02:18,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36942777] [2022-07-21 09:02:18,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:02:18,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:02:18,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:02:18,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:02:18,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:02:18,402 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2022-07-21 09:02:18,402 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 171 transitions, 1734 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:18,402 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:02:18,403 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2022-07-21 09:02:18,403 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:02:18,712 INFO L129 PetriNetUnfolder]: 853/2078 cut-off events. [2022-07-21 09:02:18,713 INFO L130 PetriNetUnfolder]: For 15407/15432 co-relation queries the response was YES. [2022-07-21 09:02:18,721 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9036 conditions, 2078 events. 853/2078 cut-off events. For 15407/15432 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 16188 event pairs, 220 based on Foata normal form. 7/1915 useless extension candidates. Maximal degree in co-relation 9000. Up to 1010 conditions per place. [2022-07-21 09:02:18,732 INFO L132 encePairwiseOnDemand]: 99/109 looper letters, 97 selfloop transitions, 38 changer transitions 10/214 dead transitions. [2022-07-21 09:02:18,732 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 214 transitions, 2540 flow [2022-07-21 09:02:18,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 09:02:18,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-21 09:02:18,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 723 transitions. [2022-07-21 09:02:18,734 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8291284403669725 [2022-07-21 09:02:18,734 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 723 transitions. [2022-07-21 09:02:18,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 723 transitions. [2022-07-21 09:02:18,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:02:18,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 723 transitions. [2022-07-21 09:02:18,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 90.375) internal successors, (723), 8 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:18,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 109.0) internal successors, (981), 9 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:18,737 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 109.0) internal successors, (981), 9 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:18,737 INFO L186 Difference]: Start difference. First operand has 157 places, 171 transitions, 1734 flow. Second operand 8 states and 723 transitions. [2022-07-21 09:02:18,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 214 transitions, 2540 flow [2022-07-21 09:02:18,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 214 transitions, 2381 flow, removed 40 selfloop flow, removed 4 redundant places. [2022-07-21 09:02:18,782 INFO L242 Difference]: Finished difference. Result has 162 places, 176 transitions, 1811 flow [2022-07-21 09:02:18,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=1609, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1811, PETRI_PLACES=162, PETRI_TRANSITIONS=176} [2022-07-21 09:02:18,782 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 64 predicate places. [2022-07-21 09:02:18,782 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 176 transitions, 1811 flow [2022-07-21 09:02:18,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:18,783 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:02:18,783 INFO L200 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] [2022-07-21 09:02:18,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 09:02:18,783 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:02:18,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:02:18,784 INFO L85 PathProgramCache]: Analyzing trace with hash -646087402, now seen corresponding path program 7 times [2022-07-21 09:02:18,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:02:18,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686689249] [2022-07-21 09:02:18,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:02:18,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:02:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:02:18,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:02:18,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:02:18,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686689249] [2022-07-21 09:02:18,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686689249] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:02:18,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:02:18,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 09:02:18,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408440180] [2022-07-21 09:02:18,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:02:18,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:02:18,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:02:18,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:02:18,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:02:18,845 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2022-07-21 09:02:18,845 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 176 transitions, 1811 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:18,845 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:02:18,845 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2022-07-21 09:02:18,845 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:02:19,127 INFO L129 PetriNetUnfolder]: 832/1897 cut-off events. [2022-07-21 09:02:19,127 INFO L130 PetriNetUnfolder]: For 14689/14733 co-relation queries the response was YES. [2022-07-21 09:02:19,136 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8526 conditions, 1897 events. 832/1897 cut-off events. For 14689/14733 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 13901 event pairs, 48 based on Foata normal form. 2/1751 useless extension candidates. Maximal degree in co-relation 8487. Up to 615 conditions per place. [2022-07-21 09:02:19,148 INFO L132 encePairwiseOnDemand]: 101/109 looper letters, 110 selfloop transitions, 45 changer transitions 6/230 dead transitions. [2022-07-21 09:02:19,148 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 230 transitions, 2690 flow [2022-07-21 09:02:19,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:02:19,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-21 09:02:19,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 647 transitions. [2022-07-21 09:02:19,150 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8479685452162516 [2022-07-21 09:02:19,150 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 647 transitions. [2022-07-21 09:02:19,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 647 transitions. [2022-07-21 09:02:19,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:02:19,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 647 transitions. [2022-07-21 09:02:19,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 92.42857142857143) internal successors, (647), 7 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:19,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:19,154 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:19,154 INFO L186 Difference]: Start difference. First operand has 162 places, 176 transitions, 1811 flow. Second operand 7 states and 647 transitions. [2022-07-21 09:02:19,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 230 transitions, 2690 flow [2022-07-21 09:02:19,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 230 transitions, 2583 flow, removed 42 selfloop flow, removed 4 redundant places. [2022-07-21 09:02:19,202 INFO L242 Difference]: Finished difference. Result has 165 places, 176 transitions, 1851 flow [2022-07-21 09:02:19,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=1705, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1851, PETRI_PLACES=165, PETRI_TRANSITIONS=176} [2022-07-21 09:02:19,203 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 67 predicate places. [2022-07-21 09:02:19,203 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 176 transitions, 1851 flow [2022-07-21 09:02:19,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:19,203 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:02:19,204 INFO L200 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] [2022-07-21 09:02:19,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 09:02:19,204 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:02:19,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:02:19,204 INFO L85 PathProgramCache]: Analyzing trace with hash 881879063, now seen corresponding path program 1 times [2022-07-21 09:02:19,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:02:19,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082946904] [2022-07-21 09:02:19,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:02:19,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:02:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:02:19,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:02:19,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:02:19,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082946904] [2022-07-21 09:02:19,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082946904] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:02:19,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:02:19,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 09:02:19,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270251518] [2022-07-21 09:02:19,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:02:19,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:02:19,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:02:19,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:02:19,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:02:19,260 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-07-21 09:02:19,260 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 176 transitions, 1851 flow. Second operand has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:19,260 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:02:19,260 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-07-21 09:02:19,261 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:02:19,480 INFO L129 PetriNetUnfolder]: 608/1824 cut-off events. [2022-07-21 09:02:19,480 INFO L130 PetriNetUnfolder]: For 11600/11693 co-relation queries the response was YES. [2022-07-21 09:02:19,494 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7026 conditions, 1824 events. 608/1824 cut-off events. For 11600/11693 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13717 event pairs, 53 based on Foata normal form. 34/1656 useless extension candidates. Maximal degree in co-relation 6987. Up to 381 conditions per place. [2022-07-21 09:02:19,507 INFO L132 encePairwiseOnDemand]: 102/109 looper letters, 18 selfloop transitions, 6 changer transitions 0/181 dead transitions. [2022-07-21 09:02:19,507 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 181 transitions, 1920 flow [2022-07-21 09:02:19,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:02:19,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-21 09:02:19,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-07-21 09:02:19,509 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8458715596330275 [2022-07-21 09:02:19,509 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 461 transitions. [2022-07-21 09:02:19,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 461 transitions. [2022-07-21 09:02:19,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:02:19,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 461 transitions. [2022-07-21 09:02:19,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 92.2) internal successors, (461), 5 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:19,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:19,512 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:19,512 INFO L186 Difference]: Start difference. First operand has 165 places, 176 transitions, 1851 flow. Second operand 5 states and 461 transitions. [2022-07-21 09:02:19,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 181 transitions, 1920 flow [2022-07-21 09:02:19,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 181 transitions, 1845 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-07-21 09:02:19,556 INFO L242 Difference]: Finished difference. Result has 165 places, 177 transitions, 1800 flow [2022-07-21 09:02:19,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=1776, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1800, PETRI_PLACES=165, PETRI_TRANSITIONS=177} [2022-07-21 09:02:19,558 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 67 predicate places. [2022-07-21 09:02:19,558 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 177 transitions, 1800 flow [2022-07-21 09:02:19,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:19,559 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:02:19,559 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 09:02:19,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 09:02:19,559 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:02:19,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:02:19,560 INFO L85 PathProgramCache]: Analyzing trace with hash -222094646, now seen corresponding path program 1 times [2022-07-21 09:02:19,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:02:19,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618940327] [2022-07-21 09:02:19,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:02:19,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:02:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:02:19,636 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:02:19,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:02:19,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618940327] [2022-07-21 09:02:19,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618940327] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:02:19,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218077817] [2022-07-21 09:02:19,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:02:19,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:02:19,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:02:19,639 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:02:19,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 09:02:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:02:19,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 09:02:19,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:02:19,930 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:02:19,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:02:20,052 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:02:20,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218077817] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:02:20,053 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:02:20,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 14 [2022-07-21 09:02:20,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273023515] [2022-07-21 09:02:20,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:02:20,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 09:02:20,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:02:20,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 09:02:20,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-21 09:02:20,055 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 109 [2022-07-21 09:02:20,056 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 177 transitions, 1800 flow. Second operand has 14 states, 14 states have (on average 81.78571428571429) internal successors, (1145), 14 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:20,056 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:02:20,056 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 109 [2022-07-21 09:02:20,056 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:02:20,927 INFO L129 PetriNetUnfolder]: 2093/5285 cut-off events. [2022-07-21 09:02:20,927 INFO L130 PetriNetUnfolder]: For 36424/36566 co-relation queries the response was YES. [2022-07-21 09:02:20,957 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21883 conditions, 5285 events. 2093/5285 cut-off events. For 36424/36566 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 48805 event pairs, 76 based on Foata normal form. 30/4845 useless extension candidates. Maximal degree in co-relation 21845. Up to 767 conditions per place. [2022-07-21 09:02:20,983 INFO L132 encePairwiseOnDemand]: 96/109 looper letters, 101 selfloop transitions, 118 changer transitions 166/465 dead transitions. [2022-07-21 09:02:20,984 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 465 transitions, 6491 flow [2022-07-21 09:02:20,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 09:02:20,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-07-21 09:02:20,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1809 transitions. [2022-07-21 09:02:20,987 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7903014416775884 [2022-07-21 09:02:20,990 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1809 transitions. [2022-07-21 09:02:20,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1809 transitions. [2022-07-21 09:02:20,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:02:20,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1809 transitions. [2022-07-21 09:02:20,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 86.14285714285714) internal successors, (1809), 21 states have internal predecessors, (1809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:21,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 109.0) internal successors, (2398), 22 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:21,001 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 109.0) internal successors, (2398), 22 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:21,001 INFO L186 Difference]: Start difference. First operand has 165 places, 177 transitions, 1800 flow. Second operand 21 states and 1809 transitions. [2022-07-21 09:02:21,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 465 transitions, 6491 flow [2022-07-21 09:02:21,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 465 transitions, 6480 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-21 09:02:21,145 INFO L242 Difference]: Finished difference. Result has 193 places, 258 transitions, 3415 flow [2022-07-21 09:02:21,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=1792, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3415, PETRI_PLACES=193, PETRI_TRANSITIONS=258} [2022-07-21 09:02:21,146 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 95 predicate places. [2022-07-21 09:02:21,146 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 258 transitions, 3415 flow [2022-07-21 09:02:21,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 81.78571428571429) internal successors, (1145), 14 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:21,147 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:02:21,147 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 09:02:21,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-21 09:02:21,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-21 09:02:21,361 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:02:21,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:02:21,361 INFO L85 PathProgramCache]: Analyzing trace with hash 722917089, now seen corresponding path program 1 times [2022-07-21 09:02:21,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:02:21,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928523732] [2022-07-21 09:02:21,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:02:21,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:02:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:02:21,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 09:02:21,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:02:21,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928523732] [2022-07-21 09:02:21,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928523732] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:02:21,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:02:21,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 09:02:21,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302068955] [2022-07-21 09:02:21,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:02:21,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:02:21,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:02:21,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:02:21,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:02:21,447 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-07-21 09:02:21,448 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 258 transitions, 3415 flow. Second operand has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:21,448 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:02:21,448 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-07-21 09:02:21,448 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:02:21,759 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([350] thread3ENTRY-->L96: Formula: (= (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1) v_~v_assert~0_5) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][185], [Black: 122#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 56#L115-4true, Black: 253#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 257#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 259#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 254#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 131#true, Black: 261#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 279#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 154#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 156#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), 72#L96true, Black: 148#(<= 0 ~pos~0), 62#L72true, Black: 294#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 296#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 136#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 304#(<= ~c2~0 0), Black: 171#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 165#true, 291#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 176#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 28#L61true, Black: 174#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 167#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), 169#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 195#(and (<= ~c1~0 ~pos~0) (<= 0 ~pos~0)), 865#true, Black: 830#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 840#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 832#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 850#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 314#(<= 1 ~pos~0), Black: 838#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 836#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 852#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 834#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 213#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 313#(<= 0 ~pos~0), Black: 842#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 219#(and (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 217#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 266#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 115#true, Black: 236#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 229#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 846#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 234#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 230#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 228#(= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|), Black: 232#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|))]) [2022-07-21 09:02:21,759 INFO L384 tUnfolder$Statistics]: this new event has 71 ancestors and is not cut-off event [2022-07-21 09:02:21,759 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-07-21 09:02:21,759 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-07-21 09:02:21,759 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-07-21 09:02:21,912 INFO L129 PetriNetUnfolder]: 1293/4073 cut-off events. [2022-07-21 09:02:21,912 INFO L130 PetriNetUnfolder]: For 41940/42635 co-relation queries the response was YES. [2022-07-21 09:02:21,943 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18787 conditions, 4073 events. 1293/4073 cut-off events. For 41940/42635 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 37842 event pairs, 166 based on Foata normal form. 188/3819 useless extension candidates. Maximal degree in co-relation 18738. Up to 1017 conditions per place. [2022-07-21 09:02:21,964 INFO L132 encePairwiseOnDemand]: 102/109 looper letters, 43 selfloop transitions, 10 changer transitions 4/269 dead transitions. [2022-07-21 09:02:21,965 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 269 transitions, 3602 flow [2022-07-21 09:02:21,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:02:21,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-21 09:02:21,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 465 transitions. [2022-07-21 09:02:21,966 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8532110091743119 [2022-07-21 09:02:21,966 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 465 transitions. [2022-07-21 09:02:21,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 465 transitions. [2022-07-21 09:02:21,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:02:21,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 465 transitions. [2022-07-21 09:02:21,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:21,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:21,968 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:21,968 INFO L186 Difference]: Start difference. First operand has 193 places, 258 transitions, 3415 flow. Second operand 5 states and 465 transitions. [2022-07-21 09:02:21,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 269 transitions, 3602 flow [2022-07-21 09:02:22,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 269 transitions, 3486 flow, removed 55 selfloop flow, removed 5 redundant places. [2022-07-21 09:02:22,179 INFO L242 Difference]: Finished difference. Result has 188 places, 253 transitions, 3239 flow [2022-07-21 09:02:22,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=3271, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3239, PETRI_PLACES=188, PETRI_TRANSITIONS=253} [2022-07-21 09:02:22,180 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 90 predicate places. [2022-07-21 09:02:22,180 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 253 transitions, 3239 flow [2022-07-21 09:02:22,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:22,180 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:02:22,181 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 09:02:22,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 09:02:22,181 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:02:22,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:02:22,181 INFO L85 PathProgramCache]: Analyzing trace with hash -677892328, now seen corresponding path program 2 times [2022-07-21 09:02:22,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:02:22,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880524310] [2022-07-21 09:02:22,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:02:22,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:02:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:02:22,256 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 09:02:22,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:02:22,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880524310] [2022-07-21 09:02:22,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880524310] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:02:22,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588025315] [2022-07-21 09:02:22,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 09:02:22,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:02:22,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:02:22,259 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:02:22,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 09:02:22,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 09:02:22,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 09:02:22,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 09:02:22,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:02:22,405 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:02:22,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:02:22,445 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 09:02:22,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588025315] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:02:22,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:02:22,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 9 [2022-07-21 09:02:22,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014652484] [2022-07-21 09:02:22,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:02:22,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 09:02:22,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:02:22,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 09:02:22,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-21 09:02:22,447 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-07-21 09:02:22,447 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 253 transitions, 3239 flow. Second operand has 9 states, 9 states have (on average 90.55555555555556) internal successors, (815), 9 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:22,448 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:02:22,448 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-07-21 09:02:22,448 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:02:23,532 INFO L129 PetriNetUnfolder]: 2531/7808 cut-off events. [2022-07-21 09:02:23,532 INFO L130 PetriNetUnfolder]: For 80880/81745 co-relation queries the response was YES. [2022-07-21 09:02:23,595 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37012 conditions, 7808 events. 2531/7808 cut-off events. For 80880/81745 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 80543 event pairs, 201 based on Foata normal form. 186/7216 useless extension candidates. Maximal degree in co-relation 36963. Up to 1105 conditions per place. [2022-07-21 09:02:23,639 INFO L132 encePairwiseOnDemand]: 102/109 looper letters, 76 selfloop transitions, 20 changer transitions 0/308 dead transitions. [2022-07-21 09:02:23,639 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 308 transitions, 3938 flow [2022-07-21 09:02:23,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:02:23,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-21 09:02:23,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 652 transitions. [2022-07-21 09:02:23,641 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.854521625163827 [2022-07-21 09:02:23,641 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 652 transitions. [2022-07-21 09:02:23,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 652 transitions. [2022-07-21 09:02:23,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:02:23,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 652 transitions. [2022-07-21 09:02:23,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:23,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:23,644 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:23,644 INFO L186 Difference]: Start difference. First operand has 188 places, 253 transitions, 3239 flow. Second operand 7 states and 652 transitions. [2022-07-21 09:02:23,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 308 transitions, 3938 flow [2022-07-21 09:02:23,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 308 transitions, 3911 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-07-21 09:02:23,938 INFO L242 Difference]: Finished difference. Result has 193 places, 265 transitions, 3437 flow [2022-07-21 09:02:23,938 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=3223, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3437, PETRI_PLACES=193, PETRI_TRANSITIONS=265} [2022-07-21 09:02:23,939 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 95 predicate places. [2022-07-21 09:02:23,939 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 265 transitions, 3437 flow [2022-07-21 09:02:23,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 90.55555555555556) internal successors, (815), 9 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:23,940 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:02:23,940 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 09:02:23,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-21 09:02:24,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-21 09:02:24,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 (and 1 more)] === [2022-07-21 09:02:24,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:02:24,148 INFO L85 PathProgramCache]: Analyzing trace with hash -551060997, now seen corresponding path program 1 times [2022-07-21 09:02:24,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:02:24,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292225269] [2022-07-21 09:02:24,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:02:24,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:02:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:02:24,308 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:02:24,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:02:24,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292225269] [2022-07-21 09:02:24,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292225269] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:02:24,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433513205] [2022-07-21 09:02:24,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:02:24,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:02:24,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:02:24,310 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:02:24,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 09:02:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:02:24,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-21 09:02:24,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:02:24,608 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:02:24,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:02:24,707 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:02:24,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433513205] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:02:24,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:02:24,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 18 [2022-07-21 09:02:24,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517682473] [2022-07-21 09:02:24,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:02:24,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-21 09:02:24,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:02:24,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-21 09:02:24,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-07-21 09:02:24,710 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 109 [2022-07-21 09:02:24,711 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 265 transitions, 3437 flow. Second operand has 18 states, 18 states have (on average 77.94444444444444) internal successors, (1403), 18 states have internal predecessors, (1403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:24,711 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:02:24,712 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 109 [2022-07-21 09:02:24,712 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:02:28,395 INFO L129 PetriNetUnfolder]: 8350/20885 cut-off events. [2022-07-21 09:02:28,395 INFO L130 PetriNetUnfolder]: For 250856/252124 co-relation queries the response was YES. [2022-07-21 09:02:28,574 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112568 conditions, 20885 events. 8350/20885 cut-off events. For 250856/252124 co-relation queries the response was YES. Maximal size of possible extension queue 1034. Compared 231633 event pairs, 273 based on Foata normal form. 343/19701 useless extension candidates. Maximal degree in co-relation 112517. Up to 3153 conditions per place. [2022-07-21 09:02:28,709 INFO L132 encePairwiseOnDemand]: 95/109 looper letters, 286 selfloop transitions, 206 changer transitions 177/745 dead transitions. [2022-07-21 09:02:28,709 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 745 transitions, 12513 flow [2022-07-21 09:02:28,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-21 09:02:28,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-07-21 09:02:28,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1982 transitions. [2022-07-21 09:02:28,713 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7576452599388379 [2022-07-21 09:02:28,713 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 1982 transitions. [2022-07-21 09:02:28,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 1982 transitions. [2022-07-21 09:02:28,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:02:28,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1982 transitions. [2022-07-21 09:02:28,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 82.58333333333333) internal successors, (1982), 24 states have internal predecessors, (1982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:28,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 109.0) internal successors, (2725), 25 states have internal predecessors, (2725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:28,722 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 109.0) internal successors, (2725), 25 states have internal predecessors, (2725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:28,723 INFO L186 Difference]: Start difference. First operand has 193 places, 265 transitions, 3437 flow. Second operand 24 states and 1982 transitions. [2022-07-21 09:02:28,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 745 transitions, 12513 flow [2022-07-21 09:02:29,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 745 transitions, 12425 flow, removed 37 selfloop flow, removed 3 redundant places. [2022-07-21 09:02:29,815 INFO L242 Difference]: Finished difference. Result has 226 places, 416 transitions, 6636 flow [2022-07-21 09:02:29,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=3391, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=6636, PETRI_PLACES=226, PETRI_TRANSITIONS=416} [2022-07-21 09:02:29,816 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 128 predicate places. [2022-07-21 09:02:29,817 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 416 transitions, 6636 flow [2022-07-21 09:02:29,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 77.94444444444444) internal successors, (1403), 18 states have internal predecessors, (1403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:29,826 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:02:29,827 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 09:02:29,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-21 09:02:30,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:02:30,033 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:02:30,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:02:30,033 INFO L85 PathProgramCache]: Analyzing trace with hash 2095513248, now seen corresponding path program 2 times [2022-07-21 09:02:30,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:02:30,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946805917] [2022-07-21 09:02:30,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:02:30,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:02:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:02:30,097 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 09:02:30,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:02:30,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946805917] [2022-07-21 09:02:30,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946805917] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:02:30,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674254925] [2022-07-21 09:02:30,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 09:02:30,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:02:30,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:02:30,100 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:02:30,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 09:02:30,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 09:02:30,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 09:02:30,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 09:02:30,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:02:30,250 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 09:02:30,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:02:30,300 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 09:02:30,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674254925] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:02:30,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:02:30,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 9 [2022-07-21 09:02:30,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810847528] [2022-07-21 09:02:30,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:02:30,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 09:02:30,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:02:30,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 09:02:30,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-21 09:02:30,303 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-07-21 09:02:30,304 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 416 transitions, 6636 flow. Second operand has 9 states, 9 states have (on average 90.77777777777777) internal successors, (817), 9 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:30,304 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:02:30,304 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-07-21 09:02:30,304 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:02:31,004 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([350] thread3ENTRY-->L96: Formula: (= (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1) v_~v_assert~0_5) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][212], [Black: 2025#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 2017#(and (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 122#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 2039#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 127#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 2041#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1768#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 2029#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 2035#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 2021#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (<= (mod ~v_assert~0 256) 0))), Black: 2013#(and (<= 1 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), 56#L115-4true, Black: 253#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 257#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 879#(<= ~c2~0 1), Black: 259#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 254#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 131#true, Black: 261#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 2031#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 279#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 154#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 156#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), 72#L96true, Black: 148#(<= 0 ~pos~0), 62#L72true, Black: 294#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 296#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 987#(= ~c2~0 0), 136#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 171#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 304#(<= ~c2~0 0), 291#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 165#true, Black: 176#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 174#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 28#L61true, Black: 167#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), 169#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 195#(and (<= ~c1~0 ~pos~0) (<= 0 ~pos~0)), 2063#(<= ~c1~0 1), Black: 830#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 840#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 832#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 314#(<= 1 ~pos~0), Black: 838#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 836#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 834#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 213#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 313#(<= 0 ~pos~0), Black: 842#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 219#(and (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 217#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 869#(<= ~c1~0 0), 266#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 115#true, Black: 236#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 229#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 846#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 234#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 230#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 228#(= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|), Black: 232#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 2015#(and (= ~pos~0 0) (= ~pos~0 ~c2~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~pos~0 ~c1~0)), Black: 2043#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= 2 ~pos~0) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1424#true]) [2022-07-21 09:02:31,005 INFO L384 tUnfolder$Statistics]: this new event has 71 ancestors and is not cut-off event [2022-07-21 09:02:31,005 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-07-21 09:02:31,005 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-07-21 09:02:31,005 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-07-21 09:02:31,358 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([350] thread3ENTRY-->L96: Formula: (= (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1) v_~v_assert~0_5) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][285], [Black: 2025#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 2017#(and (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 122#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 2039#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 127#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 2041#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1768#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 2031#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 2029#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 2035#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 2021#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (<= (mod ~v_assert~0 256) 0))), Black: 2013#(and (<= 1 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), 56#L115-4true, Black: 253#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 257#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 259#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 987#(= ~c2~0 0), Black: 131#true, Black: 261#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 279#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 154#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 156#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), 72#L96true, Black: 148#(<= 0 ~pos~0), Black: 294#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 296#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 136#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), 27#L87true, Black: 304#(<= ~c2~0 0), Black: 171#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 291#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 165#true, Black: 176#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 174#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 28#L61true, Black: 167#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), 169#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), 879#(<= ~c2~0 1), Black: 195#(and (<= ~c1~0 ~pos~0) (<= 0 ~pos~0)), 2063#(<= ~c1~0 1), Black: 830#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 840#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 832#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 314#(<= 1 ~pos~0), Black: 838#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 836#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 834#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 213#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 313#(<= 0 ~pos~0), Black: 842#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 219#(and (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 217#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 869#(<= ~c1~0 0), 254#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 115#true, 848#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 236#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 229#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 234#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 230#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 228#(= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|), Black: 232#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 2033#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 2015#(and (= ~pos~0 0) (= ~pos~0 ~c2~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~pos~0 ~c1~0)), Black: 2043#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= 2 ~pos~0) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1424#true]) [2022-07-21 09:02:31,358 INFO L384 tUnfolder$Statistics]: this new event has 75 ancestors and is not cut-off event [2022-07-21 09:02:31,358 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is not cut-off event [2022-07-21 09:02:31,358 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is not cut-off event [2022-07-21 09:02:31,358 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is not cut-off event [2022-07-21 09:02:31,449 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([350] thread3ENTRY-->L96: Formula: (= (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1) v_~v_assert~0_5) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][282], [Black: 2025#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 2017#(and (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 122#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 2039#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 127#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 2041#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1768#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 2031#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 2029#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 2035#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 2021#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (<= (mod ~v_assert~0 256) 0))), Black: 2013#(and (<= 1 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), 56#L115-4true, Black: 253#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 257#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 879#(<= ~c2~0 1), Black: 259#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 254#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 987#(= ~c2~0 0), Black: 131#true, Black: 261#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 279#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 154#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 156#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), 72#L96true, Black: 148#(<= 0 ~pos~0), Black: 294#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), 62#L72true, Black: 296#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 136#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 304#(<= ~c2~0 0), Black: 171#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 291#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 165#true, Black: 176#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 174#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 28#L61true, 169#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 167#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 195#(and (<= ~c1~0 ~pos~0) (<= 0 ~pos~0)), 2063#(<= ~c1~0 1), Black: 830#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 840#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 832#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), 874#true, Black: 314#(<= 1 ~pos~0), Black: 838#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 836#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 834#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 213#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 313#(<= 0 ~pos~0), Black: 219#(and (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 842#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 217#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 869#(<= ~c1~0 0), 266#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 115#true, Black: 236#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 229#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 846#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 234#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 230#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 228#(= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|), Black: 232#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 2033#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 2015#(and (= ~pos~0 0) (= ~pos~0 ~c2~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~pos~0 ~c1~0)), Black: 2043#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= 2 ~pos~0) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1424#true]) [2022-07-21 09:02:31,450 INFO L384 tUnfolder$Statistics]: this new event has 76 ancestors and is not cut-off event [2022-07-21 09:02:31,450 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-07-21 09:02:31,450 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-07-21 09:02:31,450 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-07-21 09:02:34,402 INFO L129 PetriNetUnfolder]: 7517/23503 cut-off events. [2022-07-21 09:02:34,402 INFO L130 PetriNetUnfolder]: For 406186/410623 co-relation queries the response was YES. [2022-07-21 09:02:34,601 INFO L84 FinitePrefix]: Finished finitePrefix Result has 131221 conditions, 23503 events. 7517/23503 cut-off events. For 406186/410623 co-relation queries the response was YES. Maximal size of possible extension queue 1027. Compared 289350 event pairs, 668 based on Foata normal form. 827/22197 useless extension candidates. Maximal degree in co-relation 131157. Up to 3493 conditions per place. [2022-07-21 09:02:34,715 INFO L132 encePairwiseOnDemand]: 102/109 looper letters, 241 selfloop transitions, 52 changer transitions 11/559 dead transitions. [2022-07-21 09:02:34,715 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 559 transitions, 9418 flow [2022-07-21 09:02:34,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:02:34,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-21 09:02:34,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 658 transitions. [2022-07-21 09:02:34,718 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8623853211009175 [2022-07-21 09:02:34,718 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 658 transitions. [2022-07-21 09:02:34,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 658 transitions. [2022-07-21 09:02:34,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:02:34,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 658 transitions. [2022-07-21 09:02:34,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:34,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:34,720 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:34,720 INFO L186 Difference]: Start difference. First operand has 226 places, 416 transitions, 6636 flow. Second operand 7 states and 658 transitions. [2022-07-21 09:02:34,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 559 transitions, 9418 flow [2022-07-21 09:02:37,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 559 transitions, 8475 flow, removed 462 selfloop flow, removed 5 redundant places. [2022-07-21 09:02:37,121 INFO L242 Difference]: Finished difference. Result has 229 places, 432 transitions, 6590 flow [2022-07-21 09:02:37,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=5977, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6590, PETRI_PLACES=229, PETRI_TRANSITIONS=432} [2022-07-21 09:02:37,122 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 131 predicate places. [2022-07-21 09:02:37,123 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 432 transitions, 6590 flow [2022-07-21 09:02:37,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 90.77777777777777) internal successors, (817), 9 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:37,123 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:02:37,123 INFO L200 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 09:02:37,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-21 09:02:37,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-21 09:02:37,333 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:02:37,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:02:37,333 INFO L85 PathProgramCache]: Analyzing trace with hash -2082952329, now seen corresponding path program 3 times [2022-07-21 09:02:37,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:02:37,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705328800] [2022-07-21 09:02:37,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:02:37,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:02:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:02:37,403 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-21 09:02:37,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:02:37,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705328800] [2022-07-21 09:02:37,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705328800] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:02:37,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:02:37,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 09:02:37,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208614663] [2022-07-21 09:02:37,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:02:37,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 09:02:37,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:02:37,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 09:02:37,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-21 09:02:37,405 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 109 [2022-07-21 09:02:37,406 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 432 transitions, 6590 flow. Second operand has 8 states, 8 states have (on average 80.125) internal successors, (641), 8 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:37,406 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:02:37,406 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 109 [2022-07-21 09:02:37,406 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:02:43,495 INFO L129 PetriNetUnfolder]: 13549/34794 cut-off events. [2022-07-21 09:02:43,496 INFO L130 PetriNetUnfolder]: For 607767/611600 co-relation queries the response was YES. [2022-07-21 09:02:43,929 INFO L84 FinitePrefix]: Finished finitePrefix Result has 204166 conditions, 34794 events. 13549/34794 cut-off events. For 607767/611600 co-relation queries the response was YES. Maximal size of possible extension queue 1731. Compared 424557 event pairs, 1437 based on Foata normal form. 841/33167 useless extension candidates. Maximal degree in co-relation 204101. Up to 13330 conditions per place. [2022-07-21 09:02:44,197 INFO L132 encePairwiseOnDemand]: 97/109 looper letters, 285 selfloop transitions, 56 changer transitions 211/665 dead transitions. [2022-07-21 09:02:44,198 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 665 transitions, 12078 flow [2022-07-21 09:02:44,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 09:02:44,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-21 09:02:44,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 914 transitions. [2022-07-21 09:02:44,199 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.762301918265221 [2022-07-21 09:02:44,200 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 914 transitions. [2022-07-21 09:02:44,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 914 transitions. [2022-07-21 09:02:44,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:02:44,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 914 transitions. [2022-07-21 09:02:44,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 83.0909090909091) internal successors, (914), 11 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:44,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 109.0) internal successors, (1308), 12 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:44,202 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 109.0) internal successors, (1308), 12 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:44,203 INFO L186 Difference]: Start difference. First operand has 229 places, 432 transitions, 6590 flow. Second operand 11 states and 914 transitions. [2022-07-21 09:02:44,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 665 transitions, 12078 flow [2022-07-21 09:02:48,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 665 transitions, 11932 flow, removed 63 selfloop flow, removed 3 redundant places. [2022-07-21 09:02:48,763 INFO L242 Difference]: Finished difference. Result has 241 places, 378 transitions, 5577 flow [2022-07-21 09:02:48,764 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=6509, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5577, PETRI_PLACES=241, PETRI_TRANSITIONS=378} [2022-07-21 09:02:48,764 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 143 predicate places. [2022-07-21 09:02:48,764 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 378 transitions, 5577 flow [2022-07-21 09:02:48,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 80.125) internal successors, (641), 8 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:48,765 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:02:48,765 INFO L200 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 09:02:48,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-21 09:02:48,765 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:02:48,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:02:48,766 INFO L85 PathProgramCache]: Analyzing trace with hash -4919890, now seen corresponding path program 3 times [2022-07-21 09:02:48,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:02:48,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399332690] [2022-07-21 09:02:48,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:02:48,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:02:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:02:48,846 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 09:02:48,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:02:48,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399332690] [2022-07-21 09:02:48,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399332690] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:02:48,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965995646] [2022-07-21 09:02:48,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 09:02:48,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:02:48,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:02:48,848 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:02:48,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 09:02:48,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-21 09:02:48,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 09:02:48,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-21 09:02:48,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:02:49,074 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 09:02:49,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:02:49,163 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 09:02:49,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965995646] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:02:49,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:02:49,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 16 [2022-07-21 09:02:49,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058081583] [2022-07-21 09:02:49,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:02:49,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-21 09:02:49,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:02:49,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-21 09:02:49,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-07-21 09:02:49,167 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 109 [2022-07-21 09:02:49,168 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 378 transitions, 5577 flow. Second operand has 16 states, 16 states have (on average 81.9375) internal successors, (1311), 16 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:02:49,168 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:02:49,168 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 109 [2022-07-21 09:02:49,169 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:03:00,192 INFO L129 PetriNetUnfolder]: 23729/57348 cut-off events. [2022-07-21 09:03:00,193 INFO L130 PetriNetUnfolder]: For 1014519/1020302 co-relation queries the response was YES. [2022-07-21 09:03:00,950 INFO L84 FinitePrefix]: Finished finitePrefix Result has 341008 conditions, 57348 events. 23729/57348 cut-off events. For 1014519/1020302 co-relation queries the response was YES. Maximal size of possible extension queue 2560. Compared 713628 event pairs, 326 based on Foata normal form. 1916/54904 useless extension candidates. Maximal degree in co-relation 340937. Up to 8805 conditions per place. [2022-07-21 09:03:01,243 INFO L132 encePairwiseOnDemand]: 96/109 looper letters, 247 selfloop transitions, 558 changer transitions 306/1226 dead transitions. [2022-07-21 09:03:01,243 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 1226 transitions, 23646 flow [2022-07-21 09:03:01,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-21 09:03:01,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-07-21 09:03:01,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2638 transitions. [2022-07-21 09:03:01,246 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7807043503995265 [2022-07-21 09:03:01,246 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 2638 transitions. [2022-07-21 09:03:01,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 2638 transitions. [2022-07-21 09:03:01,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:03:01,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2638 transitions. [2022-07-21 09:03:01,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 85.09677419354838) internal successors, (2638), 31 states have internal predecessors, (2638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:03:01,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 109.0) internal successors, (3488), 32 states have internal predecessors, (3488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:03:01,252 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 109.0) internal successors, (3488), 32 states have internal predecessors, (3488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:03:01,252 INFO L186 Difference]: Start difference. First operand has 241 places, 378 transitions, 5577 flow. Second operand 31 states and 2638 transitions. [2022-07-21 09:03:01,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 1226 transitions, 23646 flow [2022-07-21 09:03:09,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 1226 transitions, 22768 flow, removed 280 selfloop flow, removed 15 redundant places. [2022-07-21 09:03:10,005 INFO L242 Difference]: Finished difference. Result has 266 places, 792 transitions, 14480 flow [2022-07-21 09:03:10,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=5378, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=198, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=14480, PETRI_PLACES=266, PETRI_TRANSITIONS=792} [2022-07-21 09:03:10,005 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 168 predicate places. [2022-07-21 09:03:10,006 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 792 transitions, 14480 flow [2022-07-21 09:03:10,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 81.9375) internal successors, (1311), 16 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:03:10,006 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:03:10,006 INFO L200 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 09:03:10,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 09:03:10,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:03:10,207 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:03:10,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:03:10,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1997142877, now seen corresponding path program 4 times [2022-07-21 09:03:10,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:03:10,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384519205] [2022-07-21 09:03:10,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:03:10,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:03:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:03:10,288 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 31 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-21 09:03:10,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:03:10,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384519205] [2022-07-21 09:03:10,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384519205] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:03:10,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563870386] [2022-07-21 09:03:10,290 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 09:03:10,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:03:10,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:03:10,291 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:03:10,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 09:03:10,374 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 09:03:10,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 09:03:10,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-21 09:03:10,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:03:10,470 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 31 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 09:03:10,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:03:10,532 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 31 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-21 09:03:10,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563870386] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:03:10,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:03:10,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 10 [2022-07-21 09:03:10,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210949760] [2022-07-21 09:03:10,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:03:10,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 09:03:10,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:03:10,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 09:03:10,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-07-21 09:03:10,535 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-07-21 09:03:10,535 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 792 transitions, 14480 flow. Second operand has 10 states, 10 states have (on average 90.7) internal successors, (907), 10 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:03:10,535 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:03:10,535 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-07-21 09:03:10,536 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:03:11,524 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([347] L73-->L83: Formula: (and (= v_~c2~0_37 (+ v_~c2~0_38 1)) (= v_~pos~0_61 (+ v_~pos~0_62 1))) InVars {~c2~0=v_~c2~0_38, ~pos~0=v_~pos~0_62} OutVars{thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, ~pos~0=v_~pos~0_61, ~c2~0=v_~c2~0_37, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post8#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post7#1][241], [Black: 2025#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 2017#(and (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 2682#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 2684#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 1768#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 2031#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 2029#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 2035#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 2021#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (<= (mod ~v_assert~0 256) 0))), Black: 2013#(and (<= 1 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), 56#L115-4true, Black: 253#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 257#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 136#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 254#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 987#(= ~c2~0 0), Black: 131#true, Black: 261#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 3402#(<= ~c1~0 1), Black: 279#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 154#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 156#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 148#(<= 0 ~pos~0), Black: 3348#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 3366#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 3 ~pos~0)), Black: 2698#(<= 1 ~pos~0), Black: 2697#(<= 0 ~pos~0), Black: 171#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3364#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 304#(<= ~c2~0 0), Black: 165#true, Black: 3374#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 3 ~pos~0)), Black: 169#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 3372#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 3 ~pos~0)), Black: 176#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 294#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), 28#L61true, Black: 3360#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 167#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 3342#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 3346#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 3 ~pos~0)), Black: 3354#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 3350#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 3370#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3356#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3340#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 3352#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 879#(<= ~c2~0 1), Black: 3362#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3358#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 3344#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 2 ~pos~0)), Black: 2700#(<= 3 ~pos~0), 259#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 2699#(<= 2 ~pos~0), 275#(= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|), 174#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 195#(and (<= ~c1~0 ~pos~0) (<= 0 ~pos~0)), 2063#(<= ~c1~0 1), Black: 830#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), 236#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 832#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), 2023#(and (<= 2 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (<= (mod ~v_assert~0 256) 0))), Black: 314#(<= 1 ~pos~0), 834#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), 19#L83true, Black: 836#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 213#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 313#(<= 0 ~pos~0), Black: 842#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 869#(<= ~c1~0 0), Black: 2171#(= ~c1~0 0), 217#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 115#true, Black: 241#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 229#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 234#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 230#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), 2677#(and (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 228#(= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|), 64#thread3ENTRYtrue, Black: 232#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 2015#(and (= ~pos~0 0) (= ~pos~0 ~c2~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~pos~0 ~c1~0)), Black: 1424#true]) [2022-07-21 09:03:11,524 INFO L384 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-07-21 09:03:11,524 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-07-21 09:03:11,524 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-07-21 09:03:11,524 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-07-21 09:03:12,464 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([347] L73-->L83: Formula: (and (= v_~c2~0_37 (+ v_~c2~0_38 1)) (= v_~pos~0_61 (+ v_~pos~0_62 1))) InVars {~c2~0=v_~c2~0_38, ~pos~0=v_~pos~0_62} OutVars{thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, ~pos~0=v_~pos~0_61, ~c2~0=v_~c2~0_37, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post8#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post7#1][339], [Black: 2025#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 2017#(and (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 2682#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 2684#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 1768#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 2031#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 2029#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 2035#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 2021#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (<= (mod ~v_assert~0 256) 0))), Black: 2013#(and (<= 1 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), 56#L115-4true, Black: 253#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 257#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 879#(<= ~c2~0 1), Black: 136#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 254#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 131#true, Black: 987#(= ~c2~0 0), Black: 261#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 3402#(<= ~c1~0 1), 2700#(<= 3 ~pos~0), Black: 279#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 154#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 156#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 148#(<= 0 ~pos~0), Black: 3348#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 3366#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 3 ~pos~0)), Black: 2698#(<= 1 ~pos~0), Black: 2697#(<= 0 ~pos~0), Black: 3364#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 304#(<= ~c2~0 0), Black: 171#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 165#true, Black: 3374#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 3 ~pos~0)), Black: 169#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 2699#(<= 2 ~pos~0), Black: 3372#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 3 ~pos~0)), Black: 176#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 294#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 3360#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 2 ~pos~0)), 28#L61true, Black: 3342#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 167#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 3346#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 3 ~pos~0)), Black: 3354#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 3350#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 3370#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3356#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3340#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 3352#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 3362#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3358#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 3344#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 2 ~pos~0)), 259#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 275#(= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|), 174#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 195#(and (<= ~c1~0 ~pos~0) (<= 0 ~pos~0)), 2063#(<= ~c1~0 1), Black: 830#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), 236#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 832#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), 2023#(and (<= 2 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (<= (mod ~v_assert~0 256) 0))), 874#true, Black: 314#(<= 1 ~pos~0), 19#L83true, 834#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 836#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 213#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 313#(<= 0 ~pos~0), Black: 842#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 869#(<= ~c1~0 0), Black: 2171#(= ~c1~0 0), 217#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 115#true, Black: 241#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 229#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 234#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), 2677#(and (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 230#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 228#(= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|), 64#thread3ENTRYtrue, Black: 232#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 2015#(and (= ~pos~0 0) (= ~pos~0 ~c2~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~pos~0 ~c1~0)), Black: 1424#true]) [2022-07-21 09:03:12,464 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-07-21 09:03:12,464 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-07-21 09:03:12,464 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-07-21 09:03:12,464 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-07-21 09:03:13,093 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][340], [Black: 2025#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 2017#(and (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 2682#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 2684#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 1768#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 2031#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 2029#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 2035#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 2013#(and (<= 1 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), 56#L115-4true, Black: 253#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 257#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 879#(<= ~c2~0 1), Black: 136#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 254#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 987#(= ~c2~0 0), Black: 131#true, Black: 261#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 3402#(<= ~c1~0 1), 2021#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (<= (mod ~v_assert~0 256) 0))), Black: 279#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 154#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 156#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 148#(<= 0 ~pos~0), 2698#(<= 1 ~pos~0), Black: 3348#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 3366#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 3 ~pos~0)), Black: 2697#(<= 0 ~pos~0), Black: 171#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 304#(<= ~c2~0 0), Black: 3364#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 3374#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 3 ~pos~0)), Black: 165#true, Black: 169#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 2699#(<= 2 ~pos~0), Black: 176#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3372#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 3 ~pos~0)), Black: 3360#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 2 ~pos~0)), 836#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), 294#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), 28#L61true, Black: 167#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 3342#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 3346#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 3 ~pos~0)), Black: 3354#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 3350#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 3370#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3356#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3340#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 3352#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 3362#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3358#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 3344#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 2 ~pos~0)), Black: 2700#(<= 3 ~pos~0), 259#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 275#(= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|), 174#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 195#(and (<= ~c1~0 ~pos~0) (<= 0 ~pos~0)), 2063#(<= ~c1~0 1), Black: 830#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), 236#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 832#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), 874#true, Black: 314#(<= 1 ~pos~0), 19#L83true, Black: 213#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 834#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 313#(<= 0 ~pos~0), Black: 842#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 869#(<= ~c1~0 0), Black: 2171#(= ~c1~0 0), 217#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 115#true, Black: 241#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 229#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 234#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), 2677#(and (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 230#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 228#(= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|), Black: 232#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 64#thread3ENTRYtrue, Black: 2015#(and (= ~pos~0 0) (= ~pos~0 ~c2~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~pos~0 ~c1~0)), Black: 1424#true]) [2022-07-21 09:03:13,094 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is not cut-off event [2022-07-21 09:03:13,094 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-07-21 09:03:13,094 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-07-21 09:03:13,094 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-07-21 09:03:15,792 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([347] L73-->L83: Formula: (and (= v_~c2~0_37 (+ v_~c2~0_38 1)) (= v_~pos~0_61 (+ v_~pos~0_62 1))) InVars {~c2~0=v_~c2~0_38, ~pos~0=v_~pos~0_62} OutVars{thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, ~pos~0=v_~pos~0_61, ~c2~0=v_~c2~0_37, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post8#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post7#1][339], [Black: 2677#(and (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 2025#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 2017#(and (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 2682#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 2684#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 1768#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 2031#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 2029#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 2035#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 2021#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (<= (mod ~v_assert~0 256) 0))), Black: 2013#(and (<= 1 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), 56#L115-4true, Black: 253#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 257#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 136#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 879#(<= ~c2~0 1), Black: 131#true, Black: 254#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 987#(= ~c2~0 0), Black: 261#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 3402#(<= ~c1~0 1), 2700#(<= 3 ~pos~0), Black: 279#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 154#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 156#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 148#(<= 0 ~pos~0), Black: 3348#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 3366#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 3 ~pos~0)), Black: 2698#(<= 1 ~pos~0), Black: 2697#(<= 0 ~pos~0), Black: 304#(<= ~c2~0 0), Black: 3364#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 171#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3374#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 3 ~pos~0)), Black: 165#true, Black: 2699#(<= 2 ~pos~0), Black: 169#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 3372#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 3 ~pos~0)), Black: 176#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3360#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 2 ~pos~0)), 28#L61true, 294#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 3342#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 167#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 3346#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 3 ~pos~0)), Black: 3354#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 3350#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 3370#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3356#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3340#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 3352#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 3362#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3358#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 3344#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 2 ~pos~0)), 259#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 275#(= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|), 174#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 195#(and (<= ~c1~0 ~pos~0) (<= 0 ~pos~0)), 2063#(<= ~c1~0 1), Black: 830#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), 236#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 832#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), 2023#(and (<= 2 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (<= (mod ~v_assert~0 256) 0))), 874#true, Black: 314#(<= 1 ~pos~0), 19#L83true, 834#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 836#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 213#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 313#(<= 0 ~pos~0), Black: 842#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 869#(<= ~c1~0 0), Black: 2171#(= ~c1~0 0), 217#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 115#true, Black: 241#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 229#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 234#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 230#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 228#(= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|), 64#thread3ENTRYtrue, Black: 232#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 2015#(and (= ~pos~0 0) (= ~pos~0 ~c2~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~pos~0 ~c1~0)), Black: 1424#true]) [2022-07-21 09:03:15,792 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-07-21 09:03:15,792 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-21 09:03:15,792 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-21 09:03:15,792 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-21 09:03:16,873 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][340], [Black: 2677#(and (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 2025#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 2017#(and (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 2682#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 2684#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 1768#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 2031#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 2029#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 2035#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 2013#(and (<= 1 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), 56#L115-4true, Black: 253#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 257#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 879#(<= ~c2~0 1), Black: 136#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 131#true, Black: 254#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 987#(= ~c2~0 0), Black: 261#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 3402#(<= ~c1~0 1), 2021#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (<= (mod ~v_assert~0 256) 0))), Black: 279#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 154#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 156#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 148#(<= 0 ~pos~0), 2698#(<= 1 ~pos~0), Black: 3348#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 3366#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 3 ~pos~0)), Black: 2697#(<= 0 ~pos~0), Black: 304#(<= ~c2~0 0), Black: 3364#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 171#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3374#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 3 ~pos~0)), Black: 165#true, Black: 169#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 2699#(<= 2 ~pos~0), Black: 3372#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 3 ~pos~0)), Black: 176#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3360#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 2 ~pos~0)), 836#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), 294#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), 28#L61true, Black: 167#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 3342#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 3346#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 3 ~pos~0)), Black: 3354#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 3350#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 3370#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3356#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3340#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 3352#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 3362#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3358#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 3344#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 2 ~pos~0)), Black: 2700#(<= 3 ~pos~0), 259#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 275#(= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|), 174#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 195#(and (<= ~c1~0 ~pos~0) (<= 0 ~pos~0)), 2063#(<= ~c1~0 1), 236#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 830#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 832#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), 874#true, Black: 314#(<= 1 ~pos~0), 19#L83true, Black: 834#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 213#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 313#(<= 0 ~pos~0), Black: 842#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 869#(<= ~c1~0 0), Black: 2171#(= ~c1~0 0), 217#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 115#true, Black: 241#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 229#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 234#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 230#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 228#(= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|), Black: 232#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 64#thread3ENTRYtrue, Black: 2015#(and (= ~pos~0 0) (= ~pos~0 ~c2~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~pos~0 ~c1~0)), Black: 1424#true]) [2022-07-21 09:03:16,873 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is not cut-off event [2022-07-21 09:03:16,873 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event [2022-07-21 09:03:16,873 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event [2022-07-21 09:03:16,873 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event [2022-07-21 09:03:24,313 INFO L129 PetriNetUnfolder]: 22448/64236 cut-off events. [2022-07-21 09:03:24,313 INFO L130 PetriNetUnfolder]: For 1277655/1284890 co-relation queries the response was YES. [2022-07-21 09:03:25,777 INFO L84 FinitePrefix]: Finished finitePrefix Result has 394128 conditions, 64236 events. 22448/64236 cut-off events. For 1277655/1284890 co-relation queries the response was YES. Maximal size of possible extension queue 2408. Compared 856545 event pairs, 1201 based on Foata normal form. 2234/60786 useless extension candidates. Maximal degree in co-relation 394044. Up to 10086 conditions per place. [2022-07-21 09:03:26,160 INFO L132 encePairwiseOnDemand]: 102/109 looper letters, 668 selfloop transitions, 304 changer transitions 2/1268 dead transitions. [2022-07-21 09:03:26,161 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 1268 transitions, 25236 flow [2022-07-21 09:03:26,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 09:03:26,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-21 09:03:26,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 752 transitions. [2022-07-21 09:03:26,162 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8623853211009175 [2022-07-21 09:03:26,162 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 752 transitions. [2022-07-21 09:03:26,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 752 transitions. [2022-07-21 09:03:26,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:03:26,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 752 transitions. [2022-07-21 09:03:26,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.0) internal successors, (752), 8 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:03:26,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 109.0) internal successors, (981), 9 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:03:26,164 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 109.0) internal successors, (981), 9 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:03:26,165 INFO L186 Difference]: Start difference. First operand has 266 places, 792 transitions, 14480 flow. Second operand 8 states and 752 transitions. [2022-07-21 09:03:26,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 1268 transitions, 25236 flow