./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/chl-simpl-str-trans.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 0b48bde914fb7ebeda4cbd6fd329f7fd1281e3c3e233b6f5149c7b66a2f709ab --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 22:05:38,403 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:05:38,406 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:05:38,459 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:05:38,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:05:38,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:05:38,463 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:05:38,468 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:05:38,470 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:05:38,475 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:05:38,476 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:05:38,476 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:05:38,477 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:05:38,479 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:05:38,479 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:05:38,481 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:05:38,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:05:38,485 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:05:38,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:05:38,488 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:05:38,492 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:05:38,493 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:05:38,494 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:05:38,495 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:05:38,495 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:05:38,498 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:05:38,499 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:05:38,499 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:05:38,500 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:05:38,501 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:05:38,502 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:05:38,502 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:05:38,503 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:05:38,504 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:05:38,504 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:05:38,505 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:05:38,505 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:05:38,506 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:05:38,506 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:05:38,506 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:05:38,507 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:05:38,508 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:05:38,510 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 22:05:38,542 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:05:38,543 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:05:38,543 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:05:38,543 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:05:38,544 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:05:38,544 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:05:38,545 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:05:38,545 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:05:38,545 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:05:38,546 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:05:38,546 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 22:05:38,546 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 22:05:38,546 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 22:05:38,547 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:05:38,547 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:05:38,547 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:05:38,547 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:05:38,547 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 22:05:38,548 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:05:38,548 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:05:38,548 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:05:38,548 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:05:38,549 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:05:38,549 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:05:38,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:05:38,549 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:05:38,549 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:05:38,550 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:05:38,550 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 22:05:38,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 22:05:38,550 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:05:38,550 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:05:38,551 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:05:38,551 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 -> 0b48bde914fb7ebeda4cbd6fd329f7fd1281e3c3e233b6f5149c7b66a2f709ab [2022-07-13 22:05:38,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:05:38,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:05:38,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:05:38,806 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:05:38,807 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:05:38,808 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c [2022-07-13 22:05:38,861 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33ba30a48/7e2c58d47c504d3e8360053eb5bb91c0/FLAGa0d903b37 [2022-07-13 22:05:39,265 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:05:39,267 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c [2022-07-13 22:05:39,274 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33ba30a48/7e2c58d47c504d3e8360053eb5bb91c0/FLAGa0d903b37 [2022-07-13 22:05:39,658 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33ba30a48/7e2c58d47c504d3e8360053eb5bb91c0 [2022-07-13 22:05:39,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:05:39,662 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:05:39,664 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:05:39,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:05:39,667 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:05:39,667 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:05:39" (1/1) ... [2022-07-13 22:05:39,669 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@676d5768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:05:39, skipping insertion in model container [2022-07-13 22:05:39,669 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:05:39" (1/1) ... [2022-07-13 22:05:39,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:05:39,691 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:05:39,870 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/chl-simpl-str-trans.wvr.c[2514,2527] [2022-07-13 22:05:39,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:05:39,881 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 22:05:39,898 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/chl-simpl-str-trans.wvr.c[2514,2527] [2022-07-13 22:05:39,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:05:39,913 INFO L208 MainTranslator]: Completed translation [2022-07-13 22:05:39,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:05:39 WrapperNode [2022-07-13 22:05:39,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 22:05:39,915 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 22:05:39,915 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 22:05:39,915 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 22:05:39,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:05:39" (1/1) ... [2022-07-13 22:05:39,927 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:05:39" (1/1) ... [2022-07-13 22:05:39,951 INFO L137 Inliner]: procedures = 23, calls = 30, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 175 [2022-07-13 22:05:39,952 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 22:05:39,952 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 22:05:39,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 22:05:39,953 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 22:05:39,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:05:39" (1/1) ... [2022-07-13 22:05:39,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:05:39" (1/1) ... [2022-07-13 22:05:39,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:05:39" (1/1) ... [2022-07-13 22:05:39,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:05:39" (1/1) ... [2022-07-13 22:05:39,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:05:39" (1/1) ... [2022-07-13 22:05:39,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:05:39" (1/1) ... [2022-07-13 22:05:39,971 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:05:39" (1/1) ... [2022-07-13 22:05:39,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 22:05:39,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 22:05:39,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 22:05:39,976 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 22:05:39,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:05:39" (1/1) ... [2022-07-13 22:05:39,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:05:39,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:05:40,003 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-13 22:05:40,019 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-13 22:05:40,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 22:05:40,041 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-13 22:05:40,041 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-13 22:05:40,041 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-13 22:05:40,041 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-13 22:05:40,041 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-13 22:05:40,042 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-13 22:05:40,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 22:05:40,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 22:05:40,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 22:05:40,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 22:05:40,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 22:05:40,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 22:05:40,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 22:05:40,045 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-13 22:05:40,117 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 22:05:40,118 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 22:05:40,364 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 22:05:40,374 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 22:05:40,375 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 22:05:40,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:05:40 BoogieIcfgContainer [2022-07-13 22:05:40,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 22:05:40,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 22:05:40,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 22:05:40,382 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 22:05:40,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:05:39" (1/3) ... [2022-07-13 22:05:40,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46508e45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:05:40, skipping insertion in model container [2022-07-13 22:05:40,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:05:39" (2/3) ... [2022-07-13 22:05:40,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46508e45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:05:40, skipping insertion in model container [2022-07-13 22:05:40,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:05:40" (3/3) ... [2022-07-13 22:05:40,384 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-trans.wvr.c [2022-07-13 22:05:40,388 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-13 22:05:40,396 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 22:05:40,396 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 22:05:40,396 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-13 22:05:40,474 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-13 22:05:40,527 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 221 places, 227 transitions, 478 flow [2022-07-13 22:05:40,612 INFO L129 PetriNetUnfolder]: 16/224 cut-off events. [2022-07-13 22:05:40,612 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-13 22:05:40,630 INFO L84 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 224 events. 16/224 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 503 event pairs, 0 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2022-07-13 22:05:40,630 INFO L82 GeneralOperation]: Start removeDead. Operand has 221 places, 227 transitions, 478 flow [2022-07-13 22:05:40,636 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 213 transitions, 444 flow [2022-07-13 22:05:40,645 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 22:05:40,651 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@2c69817f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6789c94b [2022-07-13 22:05:40,651 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-07-13 22:05:40,711 INFO L129 PetriNetUnfolder]: 16/212 cut-off events. [2022-07-13 22:05:40,712 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-13 22:05:40,712 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:05:40,713 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, 1, 1, 1, 1, 1, 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-13 22:05:40,713 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-13 22:05:40,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:05:40,722 INFO L85 PathProgramCache]: Analyzing trace with hash -483569212, now seen corresponding path program 1 times [2022-07-13 22:05:40,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:05:40,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054731210] [2022-07-13 22:05:40,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:05:40,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:05:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:05:41,077 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-13 22:05:41,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:05:41,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054731210] [2022-07-13 22:05:41,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054731210] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:05:41,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:05:41,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 22:05:41,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106558914] [2022-07-13 22:05:41,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:05:41,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:05:41,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:05:41,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:05:41,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:05:41,121 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 227 [2022-07-13 22:05:41,131 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 213 transitions, 444 flow. Second operand has 7 states, 7 states have (on average 202.28571428571428) internal successors, (1416), 7 states have internal predecessors, (1416), 0 states have call successors, (0), 0 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-13 22:05:41,131 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:05:41,131 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 227 [2022-07-13 22:05:41,132 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:05:41,334 INFO L129 PetriNetUnfolder]: 30/279 cut-off events. [2022-07-13 22:05:41,335 INFO L130 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2022-07-13 22:05:41,339 INFO L84 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 279 events. 30/279 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1076 event pairs, 10 based on Foata normal form. 60/323 useless extension candidates. Maximal degree in co-relation 281. Up to 40 conditions per place. [2022-07-13 22:05:41,342 INFO L132 encePairwiseOnDemand]: 211/227 looper letters, 22 selfloop transitions, 5 changer transitions 11/225 dead transitions. [2022-07-13 22:05:41,343 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 225 transitions, 577 flow [2022-07-13 22:05:41,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:05:41,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-13 22:05:41,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2067 transitions. [2022-07-13 22:05:41,364 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9105726872246696 [2022-07-13 22:05:41,365 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2067 transitions. [2022-07-13 22:05:41,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2067 transitions. [2022-07-13 22:05:41,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:05:41,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2067 transitions. [2022-07-13 22:05:41,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 206.7) internal successors, (2067), 10 states have internal predecessors, (2067), 0 states have call successors, (0), 0 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-13 22:05:41,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 227.0) internal successors, (2497), 11 states have internal predecessors, (2497), 0 states have call successors, (0), 0 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-13 22:05:41,390 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 227.0) internal successors, (2497), 11 states have internal predecessors, (2497), 0 states have call successors, (0), 0 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-13 22:05:41,392 INFO L186 Difference]: Start difference. First operand has 207 places, 213 transitions, 444 flow. Second operand 10 states and 2067 transitions. [2022-07-13 22:05:41,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 225 transitions, 577 flow [2022-07-13 22:05:41,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 225 transitions, 543 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-07-13 22:05:41,403 INFO L242 Difference]: Finished difference. Result has 217 places, 209 transitions, 457 flow [2022-07-13 22:05:41,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=457, PETRI_PLACES=217, PETRI_TRANSITIONS=209} [2022-07-13 22:05:41,410 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 10 predicate places. [2022-07-13 22:05:41,410 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 209 transitions, 457 flow [2022-07-13 22:05:41,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 202.28571428571428) internal successors, (1416), 7 states have internal predecessors, (1416), 0 states have call successors, (0), 0 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-13 22:05:41,412 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:05:41,412 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, 1, 1, 1, 1, 1, 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-13 22:05:41,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 22:05:41,413 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-13 22:05:41,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:05:41,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1802203198, now seen corresponding path program 1 times [2022-07-13 22:05:41,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:05:41,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369001721] [2022-07-13 22:05:41,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:05:41,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:05:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:05:41,515 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-13 22:05:41,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:05:41,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369001721] [2022-07-13 22:05:41,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369001721] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:05:41,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:05:41,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 22:05:41,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010858048] [2022-07-13 22:05:41,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:05:41,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 22:05:41,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:05:41,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 22:05:41,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 22:05:41,519 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 227 [2022-07-13 22:05:41,520 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 209 transitions, 457 flow. Second operand has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 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-13 22:05:41,521 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:05:41,521 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 227 [2022-07-13 22:05:41,521 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:05:41,669 INFO L129 PetriNetUnfolder]: 71/789 cut-off events. [2022-07-13 22:05:41,669 INFO L130 PetriNetUnfolder]: For 45/52 co-relation queries the response was YES. [2022-07-13 22:05:41,686 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1023 conditions, 789 events. 71/789 cut-off events. For 45/52 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4972 event pairs, 24 based on Foata normal form. 1/717 useless extension candidates. Maximal degree in co-relation 1005. Up to 75 conditions per place. [2022-07-13 22:05:41,690 INFO L132 encePairwiseOnDemand]: 217/227 looper letters, 18 selfloop transitions, 6 changer transitions 0/217 dead transitions. [2022-07-13 22:05:41,690 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 217 transitions, 525 flow [2022-07-13 22:05:41,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 22:05:41,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 22:05:41,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 637 transitions. [2022-07-13 22:05:41,692 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9353891336270191 [2022-07-13 22:05:41,692 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 637 transitions. [2022-07-13 22:05:41,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 637 transitions. [2022-07-13 22:05:41,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:05:41,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 637 transitions. [2022-07-13 22:05:41,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 0 states have call successors, (0), 0 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-13 22:05:41,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 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-13 22:05:41,696 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 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-13 22:05:41,697 INFO L186 Difference]: Start difference. First operand has 217 places, 209 transitions, 457 flow. Second operand 3 states and 637 transitions. [2022-07-13 22:05:41,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 217 transitions, 525 flow [2022-07-13 22:05:41,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 217 transitions, 520 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-07-13 22:05:41,708 INFO L242 Difference]: Finished difference. Result has 214 places, 213 transitions, 500 flow [2022-07-13 22:05:41,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=214, PETRI_TRANSITIONS=213} [2022-07-13 22:05:41,710 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 7 predicate places. [2022-07-13 22:05:41,710 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 213 transitions, 500 flow [2022-07-13 22:05:41,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 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-13 22:05:41,711 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:05:41,712 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, 1, 1, 1, 1, 1, 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-13 22:05:41,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 22:05:41,712 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-13 22:05:41,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:05:41,714 INFO L85 PathProgramCache]: Analyzing trace with hash 623842676, now seen corresponding path program 2 times [2022-07-13 22:05:41,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:05:41,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604628940] [2022-07-13 22:05:41,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:05:41,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:05:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:05:41,776 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-13 22:05:41,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:05:41,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604628940] [2022-07-13 22:05:41,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604628940] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:05:41,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:05:41,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 22:05:41,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046396898] [2022-07-13 22:05:41,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:05:41,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 22:05:41,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:05:41,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 22:05:41,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 22:05:41,780 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 227 [2022-07-13 22:05:41,781 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 213 transitions, 500 flow. Second operand has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 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-13 22:05:41,781 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:05:41,781 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 227 [2022-07-13 22:05:41,781 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:05:41,892 INFO L129 PetriNetUnfolder]: 54/633 cut-off events. [2022-07-13 22:05:41,892 INFO L130 PetriNetUnfolder]: For 134/134 co-relation queries the response was YES. [2022-07-13 22:05:41,899 INFO L84 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 633 events. 54/633 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3376 event pairs, 18 based on Foata normal form. 18/612 useless extension candidates. Maximal degree in co-relation 843. Up to 49 conditions per place. [2022-07-13 22:05:41,902 INFO L132 encePairwiseOnDemand]: 219/227 looper letters, 24 selfloop transitions, 4 changer transitions 0/221 dead transitions. [2022-07-13 22:05:41,902 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 221 transitions, 584 flow [2022-07-13 22:05:41,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 22:05:41,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 22:05:41,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 637 transitions. [2022-07-13 22:05:41,905 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9353891336270191 [2022-07-13 22:05:41,905 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 637 transitions. [2022-07-13 22:05:41,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 637 transitions. [2022-07-13 22:05:41,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:05:41,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 637 transitions. [2022-07-13 22:05:41,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 0 states have call successors, (0), 0 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-13 22:05:41,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 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-13 22:05:41,909 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 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-13 22:05:41,909 INFO L186 Difference]: Start difference. First operand has 214 places, 213 transitions, 500 flow. Second operand 3 states and 637 transitions. [2022-07-13 22:05:41,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 221 transitions, 584 flow [2022-07-13 22:05:41,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 221 transitions, 572 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-13 22:05:41,925 INFO L242 Difference]: Finished difference. Result has 216 places, 217 transitions, 536 flow [2022-07-13 22:05:41,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=216, PETRI_TRANSITIONS=217} [2022-07-13 22:05:41,926 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 9 predicate places. [2022-07-13 22:05:41,926 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 217 transitions, 536 flow [2022-07-13 22:05:41,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 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-13 22:05:41,927 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:05:41,927 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, 1, 1, 1, 1, 1, 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-13 22:05:41,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 22:05:41,928 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-13 22:05:41,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:05:41,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1893473444, now seen corresponding path program 1 times [2022-07-13 22:05:41,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:05:41,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561320023] [2022-07-13 22:05:41,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:05:41,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:05:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:05:41,981 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-13 22:05:41,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:05:41,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561320023] [2022-07-13 22:05:41,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561320023] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:05:41,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:05:41,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 22:05:41,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157550129] [2022-07-13 22:05:41,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:05:41,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 22:05:41,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:05:41,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 22:05:41,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 22:05:41,984 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 227 [2022-07-13 22:05:41,985 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 217 transitions, 536 flow. Second operand has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 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-13 22:05:41,986 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:05:41,986 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 227 [2022-07-13 22:05:41,986 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:05:42,232 INFO L129 PetriNetUnfolder]: 105/2022 cut-off events. [2022-07-13 22:05:42,232 INFO L130 PetriNetUnfolder]: For 196/349 co-relation queries the response was YES. [2022-07-13 22:05:42,247 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2762 conditions, 2022 events. 105/2022 cut-off events. For 196/349 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 19108 event pairs, 15 based on Foata normal form. 0/1911 useless extension candidates. Maximal degree in co-relation 2576. Up to 81 conditions per place. [2022-07-13 22:05:42,254 INFO L132 encePairwiseOnDemand]: 221/227 looper letters, 19 selfloop transitions, 3 changer transitions 0/225 dead transitions. [2022-07-13 22:05:42,254 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 225 transitions, 601 flow [2022-07-13 22:05:42,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 22:05:42,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 22:05:42,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 640 transitions. [2022-07-13 22:05:42,256 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9397944199706314 [2022-07-13 22:05:42,257 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 640 transitions. [2022-07-13 22:05:42,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 640 transitions. [2022-07-13 22:05:42,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:05:42,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 640 transitions. [2022-07-13 22:05:42,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:05:42,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 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-13 22:05:42,263 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 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-13 22:05:42,263 INFO L186 Difference]: Start difference. First operand has 216 places, 217 transitions, 536 flow. Second operand 3 states and 640 transitions. [2022-07-13 22:05:42,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 225 transitions, 601 flow [2022-07-13 22:05:42,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 225 transitions, 589 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-07-13 22:05:42,276 INFO L242 Difference]: Finished difference. Result has 219 places, 220 transitions, 554 flow [2022-07-13 22:05:42,276 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=219, PETRI_TRANSITIONS=220} [2022-07-13 22:05:42,277 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 12 predicate places. [2022-07-13 22:05:42,277 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 220 transitions, 554 flow [2022-07-13 22:05:42,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 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-13 22:05:42,283 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:05:42,283 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, 1, 1, 1, 1, 1, 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-13 22:05:42,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 22:05:42,283 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-13 22:05:42,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:05:42,284 INFO L85 PathProgramCache]: Analyzing trace with hash -574075276, now seen corresponding path program 1 times [2022-07-13 22:05:42,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:05:42,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149895704] [2022-07-13 22:05:42,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:05:42,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:05:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:05:42,359 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-13 22:05:42,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:05:42,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149895704] [2022-07-13 22:05:42,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149895704] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:05:42,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:05:42,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 22:05:42,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187113673] [2022-07-13 22:05:42,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:05:42,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 22:05:42,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:05:42,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 22:05:42,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 22:05:42,363 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 227 [2022-07-13 22:05:42,364 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 220 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 0 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-13 22:05:42,364 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:05:42,364 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 227 [2022-07-13 22:05:42,365 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:05:42,675 INFO L129 PetriNetUnfolder]: 124/2513 cut-off events. [2022-07-13 22:05:42,676 INFO L130 PetriNetUnfolder]: For 113/222 co-relation queries the response was YES. [2022-07-13 22:05:42,693 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3382 conditions, 2513 events. 124/2513 cut-off events. For 113/222 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 24116 event pairs, 22 based on Foata normal form. 2/2332 useless extension candidates. Maximal degree in co-relation 3146. Up to 90 conditions per place. [2022-07-13 22:05:42,700 INFO L132 encePairwiseOnDemand]: 221/227 looper letters, 15 selfloop transitions, 4 changer transitions 0/227 dead transitions. [2022-07-13 22:05:42,701 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 227 transitions, 611 flow [2022-07-13 22:05:42,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 22:05:42,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 22:05:42,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 642 transitions. [2022-07-13 22:05:42,703 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9427312775330396 [2022-07-13 22:05:42,703 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 642 transitions. [2022-07-13 22:05:42,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 642 transitions. [2022-07-13 22:05:42,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:05:42,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 642 transitions. [2022-07-13 22:05:42,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 0 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-13 22:05:42,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 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-13 22:05:42,708 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 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-13 22:05:42,708 INFO L186 Difference]: Start difference. First operand has 219 places, 220 transitions, 554 flow. Second operand 3 states and 642 transitions. [2022-07-13 22:05:42,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 227 transitions, 611 flow [2022-07-13 22:05:42,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 227 transitions, 608 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-13 22:05:42,720 INFO L242 Difference]: Finished difference. Result has 222 places, 222 transitions, 579 flow [2022-07-13 22:05:42,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=579, PETRI_PLACES=222, PETRI_TRANSITIONS=222} [2022-07-13 22:05:42,723 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 15 predicate places. [2022-07-13 22:05:42,723 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 222 transitions, 579 flow [2022-07-13 22:05:42,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 0 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-13 22:05:42,724 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:05:42,724 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, 1, 1, 1, 1, 1, 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-13 22:05:42,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 22:05:42,724 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-13 22:05:42,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:05:42,727 INFO L85 PathProgramCache]: Analyzing trace with hash -720449500, now seen corresponding path program 1 times [2022-07-13 22:05:42,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:05:42,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421787657] [2022-07-13 22:05:42,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:05:42,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:05:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:05:42,887 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-13 22:05:42,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:05:42,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421787657] [2022-07-13 22:05:42,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421787657] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:05:42,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:05:42,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:05:42,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833185075] [2022-07-13 22:05:42,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:05:42,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:05:42,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:05:42,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:05:42,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:05:42,896 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 227 [2022-07-13 22:05:42,898 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 222 transitions, 579 flow. Second operand has 8 states, 8 states have (on average 198.5) internal successors, (1588), 8 states have internal predecessors, (1588), 0 states have call successors, (0), 0 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-13 22:05:42,898 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:05:42,899 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 227 [2022-07-13 22:05:42,899 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:05:43,206 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][112], [Black: 252#true, Black: 260#(not (= ~length_4~0 0)), 276#true, 56#L74-4true, 117#L43-18true, 266#(not (= ~length_2~0 0)), Black: 264#true, 177#L49-20true, Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), Black: 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 272#(= ~length_0~0 0)]) [2022-07-13 22:05:43,207 INFO L384 tUnfolder$Statistics]: this new event has 97 ancestors and is cut-off event [2022-07-13 22:05:43,207 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-07-13 22:05:43,207 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-07-13 22:05:43,207 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-07-13 22:05:43,207 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][112], [Black: 252#true, Black: 260#(not (= ~length_4~0 0)), 276#true, 56#L74-4true, 117#L43-18true, 266#(not (= ~length_2~0 0)), Black: 264#true, 95#L49-18true, Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), Black: 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 272#(= ~length_0~0 0)]) [2022-07-13 22:05:43,207 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-07-13 22:05:43,208 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-07-13 22:05:43,208 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-07-13 22:05:43,208 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-07-13 22:05:43,208 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][112], [Black: 252#true, Black: 260#(not (= ~length_4~0 0)), 276#true, 56#L74-4true, 117#L43-18true, 266#(not (= ~length_2~0 0)), 118#L49-19true, Black: 264#true, Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), Black: 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 272#(= ~length_0~0 0)]) [2022-07-13 22:05:43,208 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2022-07-13 22:05:43,208 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-13 22:05:43,208 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-13 22:05:43,208 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-13 22:05:43,209 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][63], [Black: 254#(= ~length_4~0 0), Black: 258#true, 56#L74-4true, 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 117#L43-18true, 266#(not (= ~length_2~0 0)), Black: 264#true, 260#(not (= ~length_4~0 0)), Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 280#(= ~result_7~0 0), 176#L49-9true, 272#(= ~length_0~0 0)]) [2022-07-13 22:05:43,209 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-07-13 22:05:43,209 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-13 22:05:43,209 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-13 22:05:43,209 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-13 22:05:43,209 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][63], [Black: 252#true, Black: 260#(not (= ~length_4~0 0)), 56#L74-4true, 266#(not (= ~length_2~0 0)), 117#L43-18true, Black: 264#true, 150#L49-17true, Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), Black: 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 280#(= ~result_7~0 0), 272#(= ~length_0~0 0)]) [2022-07-13 22:05:43,210 INFO L384 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-07-13 22:05:43,210 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-07-13 22:05:43,210 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-07-13 22:05:43,210 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-07-13 22:05:43,210 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][63], [Black: 252#true, Black: 260#(not (= ~length_4~0 0)), 56#L74-4true, 266#(not (= ~length_2~0 0)), 117#L43-18true, Black: 264#true, Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), Black: 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, 76#L49-7true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 280#(= ~result_7~0 0), 272#(= ~length_0~0 0)]) [2022-07-13 22:05:43,210 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-07-13 22:05:43,210 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-13 22:05:43,210 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-13 22:05:43,210 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-13 22:05:43,464 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][63], [Black: 254#(= ~length_4~0 0), Black: 258#true, 56#L74-4true, 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 117#L43-18true, 266#(not (= ~length_2~0 0)), Black: 264#true, 150#L49-17true, 260#(not (= ~length_4~0 0)), Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 280#(= ~result_7~0 0), 272#(= ~length_0~0 0)]) [2022-07-13 22:05:43,464 INFO L384 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-07-13 22:05:43,465 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-07-13 22:05:43,465 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-13 22:05:43,465 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-13 22:05:43,467 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([620] L55-17-->L55-18: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork0_#t~ite12#1_5|) InVars {thread3Thread1of1ForFork0_#t~ite12#1=|v_thread3Thread1of1ForFork0_#t~ite12#1_5|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork0_#t~ite12#1=|v_thread3Thread1of1ForFork0_#t~ite12#1_5|} AuxVars[] AssignedVars[~result_8~0][157], [Black: 254#(= ~length_4~0 0), Black: 258#true, 56#L74-4true, 117#L43-18true, 266#(not (= ~length_2~0 0)), 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), Black: 264#true, 260#(not (= ~length_4~0 0)), Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 280#(= ~result_7~0 0), 176#L49-9true, 272#(= ~length_0~0 0)]) [2022-07-13 22:05:43,468 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-07-13 22:05:43,469 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-13 22:05:43,469 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-13 22:05:43,470 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-13 22:05:43,470 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([620] L55-17-->L55-18: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork0_#t~ite12#1_5|) InVars {thread3Thread1of1ForFork0_#t~ite12#1=|v_thread3Thread1of1ForFork0_#t~ite12#1_5|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork0_#t~ite12#1=|v_thread3Thread1of1ForFork0_#t~ite12#1_5|} AuxVars[] AssignedVars[~result_8~0][156], [Black: 252#true, Black: 260#(not (= ~length_4~0 0)), 56#L74-4true, 117#L43-18true, 266#(not (= ~length_2~0 0)), Black: 264#true, Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), Black: 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, 76#L49-7true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 280#(= ~result_7~0 0), 272#(= ~length_0~0 0)]) [2022-07-13 22:05:43,470 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-07-13 22:05:43,470 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-13 22:05:43,470 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-13 22:05:43,470 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-13 22:05:43,474 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][63], [Black: 254#(= ~length_4~0 0), Black: 258#true, 56#L74-4true, 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 266#(not (= ~length_2~0 0)), 117#L43-18true, Black: 264#true, 150#L49-17true, 260#(not (= ~length_4~0 0)), Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 280#(= ~result_7~0 0), 272#(= ~length_0~0 0)]) [2022-07-13 22:05:43,475 INFO L384 tUnfolder$Statistics]: this new event has 116 ancestors and is cut-off event [2022-07-13 22:05:43,475 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-07-13 22:05:43,475 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-13 22:05:43,475 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-13 22:05:43,475 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-13 22:05:43,476 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][63], [Black: 254#(= ~length_4~0 0), Black: 258#true, 56#L74-4true, 266#(not (= ~length_2~0 0)), 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 117#L43-18true, Black: 264#true, 150#L49-17true, 260#(not (= ~length_4~0 0)), Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 280#(= ~result_7~0 0), 272#(= ~length_0~0 0)]) [2022-07-13 22:05:43,477 INFO L384 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-07-13 22:05:43,477 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-07-13 22:05:43,477 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-07-13 22:05:43,477 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-13 22:05:43,477 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-13 22:05:43,477 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-13 22:05:43,483 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][112], [Black: 254#(= ~length_4~0 0), Black: 258#true, 276#true, 56#L74-4true, 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 266#(not (= ~length_2~0 0)), 117#L43-18true, 95#L49-18true, Black: 264#true, 260#(not (= ~length_4~0 0)), Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 272#(= ~length_0~0 0)]) [2022-07-13 22:05:43,483 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-07-13 22:05:43,483 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-07-13 22:05:43,483 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-07-13 22:05:43,483 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-07-13 22:05:43,488 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][112], [Black: 254#(= ~length_4~0 0), Black: 258#true, 276#true, 56#L74-4true, 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 266#(not (= ~length_2~0 0)), 117#L43-18true, Black: 264#true, 95#L49-18true, 260#(not (= ~length_4~0 0)), Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 272#(= ~length_0~0 0)]) [2022-07-13 22:05:43,489 INFO L384 tUnfolder$Statistics]: this new event has 117 ancestors and is cut-off event [2022-07-13 22:05:43,489 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-07-13 22:05:43,489 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-07-13 22:05:43,489 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-07-13 22:05:43,489 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-07-13 22:05:43,491 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][112], [Black: 254#(= ~length_4~0 0), Black: 258#true, 276#true, 56#L74-4true, 117#L43-18true, 266#(not (= ~length_2~0 0)), 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 95#L49-18true, Black: 264#true, 260#(not (= ~length_4~0 0)), Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 272#(= ~length_0~0 0)]) [2022-07-13 22:05:43,491 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-07-13 22:05:43,491 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-07-13 22:05:43,491 INFO L387 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-07-13 22:05:43,492 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-07-13 22:05:43,492 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-07-13 22:05:43,492 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-07-13 22:05:43,496 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][112], [Black: 254#(= ~length_4~0 0), Black: 258#true, 276#true, 56#L74-4true, 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 266#(not (= ~length_2~0 0)), 117#L43-18true, 118#L49-19true, Black: 264#true, 260#(not (= ~length_4~0 0)), Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 272#(= ~length_0~0 0)]) [2022-07-13 22:05:43,496 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2022-07-13 22:05:43,496 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-13 22:05:43,496 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-13 22:05:43,497 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-13 22:05:43,501 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][112], [Black: 254#(= ~length_4~0 0), Black: 258#true, 276#true, 56#L74-4true, 117#L43-18true, 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 266#(not (= ~length_2~0 0)), 118#L49-19true, Black: 264#true, 260#(not (= ~length_4~0 0)), Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 272#(= ~length_0~0 0)]) [2022-07-13 22:05:43,501 INFO L384 tUnfolder$Statistics]: this new event has 118 ancestors and is cut-off event [2022-07-13 22:05:43,501 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-13 22:05:43,501 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-13 22:05:43,501 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-13 22:05:43,501 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-13 22:05:43,503 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][112], [Black: 254#(= ~length_4~0 0), Black: 258#true, 276#true, 56#L74-4true, 117#L43-18true, 266#(not (= ~length_2~0 0)), 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 118#L49-19true, Black: 264#true, 260#(not (= ~length_4~0 0)), Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 272#(= ~length_0~0 0)]) [2022-07-13 22:05:43,503 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2022-07-13 22:05:43,503 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-13 22:05:43,503 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-13 22:05:43,503 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-13 22:05:43,503 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-13 22:05:43,503 INFO L387 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-07-13 22:05:43,514 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][112], [Black: 254#(= ~length_4~0 0), Black: 258#true, 276#true, 56#L74-4true, 117#L43-18true, 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 266#(not (= ~length_2~0 0)), Black: 264#true, 260#(not (= ~length_4~0 0)), 177#L49-20true, Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 272#(= ~length_0~0 0)]) [2022-07-13 22:05:43,514 INFO L384 tUnfolder$Statistics]: this new event has 97 ancestors and is cut-off event [2022-07-13 22:05:43,514 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-13 22:05:43,514 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-07-13 22:05:43,514 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-13 22:05:43,517 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][112], [Black: 254#(= ~length_4~0 0), Black: 258#true, 276#true, 56#L74-4true, 117#L43-18true, 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 266#(not (= ~length_2~0 0)), Black: 264#true, 260#(not (= ~length_4~0 0)), 177#L49-20true, Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 272#(= ~length_0~0 0)]) [2022-07-13 22:05:43,517 INFO L384 tUnfolder$Statistics]: this new event has 119 ancestors and is cut-off event [2022-07-13 22:05:43,517 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-13 22:05:43,517 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-13 22:05:43,517 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-07-13 22:05:43,517 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-13 22:05:43,519 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][112], [Black: 254#(= ~length_4~0 0), Black: 258#true, 276#true, 56#L74-4true, 266#(not (= ~length_2~0 0)), 117#L43-18true, 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), Black: 264#true, 260#(not (= ~length_4~0 0)), 177#L49-20true, Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 272#(= ~length_0~0 0)]) [2022-07-13 22:05:43,519 INFO L384 tUnfolder$Statistics]: this new event has 97 ancestors and is cut-off event [2022-07-13 22:05:43,519 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-13 22:05:43,520 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-13 22:05:43,520 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-07-13 22:05:43,520 INFO L387 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-07-13 22:05:43,520 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-13 22:05:43,524 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([620] L55-17-->L55-18: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork0_#t~ite12#1_5|) InVars {thread3Thread1of1ForFork0_#t~ite12#1=|v_thread3Thread1of1ForFork0_#t~ite12#1_5|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork0_#t~ite12#1=|v_thread3Thread1of1ForFork0_#t~ite12#1_5|} AuxVars[] AssignedVars[~result_8~0][157], [Black: 254#(= ~length_4~0 0), Black: 258#true, 88#L75-2true, 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 266#(not (= ~length_2~0 0)), Black: 264#true, 260#(not (= ~length_4~0 0)), Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 280#(= ~result_7~0 0), 176#L49-9true, 272#(= ~length_0~0 0)]) [2022-07-13 22:05:43,524 INFO L384 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-07-13 22:05:43,524 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-13 22:05:43,525 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-13 22:05:43,525 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-13 22:05:43,525 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([620] L55-17-->L55-18: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork0_#t~ite12#1_5|) InVars {thread3Thread1of1ForFork0_#t~ite12#1=|v_thread3Thread1of1ForFork0_#t~ite12#1_5|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork0_#t~ite12#1=|v_thread3Thread1of1ForFork0_#t~ite12#1_5|} AuxVars[] AssignedVars[~result_8~0][156], [Black: 252#true, Black: 260#(not (= ~length_4~0 0)), 88#L75-2true, 266#(not (= ~length_2~0 0)), Black: 264#true, Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 76#L49-7true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 280#(= ~result_7~0 0), 272#(= ~length_0~0 0)]) [2022-07-13 22:05:43,525 INFO L384 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-07-13 22:05:43,525 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-13 22:05:43,525 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-13 22:05:43,525 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-13 22:05:43,662 INFO L129 PetriNetUnfolder]: 1208/4597 cut-off events. [2022-07-13 22:05:43,662 INFO L130 PetriNetUnfolder]: For 920/1126 co-relation queries the response was YES. [2022-07-13 22:05:43,689 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7974 conditions, 4597 events. 1208/4597 cut-off events. For 920/1126 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 46221 event pairs, 342 based on Foata normal form. 44/4054 useless extension candidates. Maximal degree in co-relation 7720. Up to 817 conditions per place. [2022-07-13 22:05:43,706 INFO L132 encePairwiseOnDemand]: 217/227 looper letters, 34 selfloop transitions, 7 changer transitions 4/244 dead transitions. [2022-07-13 22:05:43,706 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 244 transitions, 733 flow [2022-07-13 22:05:43,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:05:43,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-13 22:05:43,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1612 transitions. [2022-07-13 22:05:43,710 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8876651982378855 [2022-07-13 22:05:43,711 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1612 transitions. [2022-07-13 22:05:43,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1612 transitions. [2022-07-13 22:05:43,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:05:43,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1612 transitions. [2022-07-13 22:05:43,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 201.5) internal successors, (1612), 8 states have internal predecessors, (1612), 0 states have call successors, (0), 0 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-13 22:05:43,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 227.0) internal successors, (2043), 9 states have internal predecessors, (2043), 0 states have call successors, (0), 0 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-13 22:05:43,719 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 227.0) internal successors, (2043), 9 states have internal predecessors, (2043), 0 states have call successors, (0), 0 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-13 22:05:43,719 INFO L186 Difference]: Start difference. First operand has 222 places, 222 transitions, 579 flow. Second operand 8 states and 1612 transitions. [2022-07-13 22:05:43,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 244 transitions, 733 flow [2022-07-13 22:05:43,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 244 transitions, 725 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-13 22:05:43,733 INFO L242 Difference]: Finished difference. Result has 232 places, 226 transitions, 617 flow [2022-07-13 22:05:43,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=617, PETRI_PLACES=232, PETRI_TRANSITIONS=226} [2022-07-13 22:05:43,735 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 25 predicate places. [2022-07-13 22:05:43,735 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 226 transitions, 617 flow [2022-07-13 22:05:43,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 198.5) internal successors, (1588), 8 states have internal predecessors, (1588), 0 states have call successors, (0), 0 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-13 22:05:43,737 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:05:43,738 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, 1, 1, 1, 1, 1, 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-13 22:05:43,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 22:05:43,738 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-13 22:05:43,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:05:43,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1306237264, now seen corresponding path program 1 times [2022-07-13 22:05:43,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:05:43,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976492126] [2022-07-13 22:05:43,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:05:43,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:05:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:05:43,854 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-13 22:05:43,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:05:43,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976492126] [2022-07-13 22:05:43,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976492126] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:05:43,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:05:43,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 22:05:43,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415558600] [2022-07-13 22:05:43,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:05:43,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:05:43,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:05:43,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:05:43,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:05:43,863 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 227 [2022-07-13 22:05:43,864 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 226 transitions, 617 flow. Second operand has 7 states, 7 states have (on average 202.28571428571428) internal successors, (1416), 7 states have internal predecessors, (1416), 0 states have call successors, (0), 0 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-13 22:05:43,864 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:05:43,865 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 227 [2022-07-13 22:05:43,865 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:05:44,304 INFO L129 PetriNetUnfolder]: 276/2516 cut-off events. [2022-07-13 22:05:44,304 INFO L130 PetriNetUnfolder]: For 289/491 co-relation queries the response was YES. [2022-07-13 22:05:44,328 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4070 conditions, 2516 events. 276/2516 cut-off events. For 289/491 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 26020 event pairs, 111 based on Foata normal form. 2/2290 useless extension candidates. Maximal degree in co-relation 4033. Up to 382 conditions per place. [2022-07-13 22:05:44,335 INFO L132 encePairwiseOnDemand]: 219/227 looper letters, 25 selfloop transitions, 5 changer transitions 10/245 dead transitions. [2022-07-13 22:05:44,335 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 245 transitions, 758 flow [2022-07-13 22:05:44,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:05:44,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 22:05:44,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1838 transitions. [2022-07-13 22:05:44,339 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.899657366617719 [2022-07-13 22:05:44,340 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1838 transitions. [2022-07-13 22:05:44,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1838 transitions. [2022-07-13 22:05:44,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:05:44,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1838 transitions. [2022-07-13 22:05:44,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 204.22222222222223) internal successors, (1838), 9 states have internal predecessors, (1838), 0 states have call successors, (0), 0 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-13 22:05:44,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 227.0) internal successors, (2270), 10 states have internal predecessors, (2270), 0 states have call successors, (0), 0 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-13 22:05:44,349 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 227.0) internal successors, (2270), 10 states have internal predecessors, (2270), 0 states have call successors, (0), 0 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-13 22:05:44,349 INFO L186 Difference]: Start difference. First operand has 232 places, 226 transitions, 617 flow. Second operand 9 states and 1838 transitions. [2022-07-13 22:05:44,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 245 transitions, 758 flow [2022-07-13 22:05:44,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 245 transitions, 747 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-07-13 22:05:44,360 INFO L242 Difference]: Finished difference. Result has 241 places, 230 transitions, 654 flow [2022-07-13 22:05:44,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=654, PETRI_PLACES=241, PETRI_TRANSITIONS=230} [2022-07-13 22:05:44,361 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 34 predicate places. [2022-07-13 22:05:44,361 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 230 transitions, 654 flow [2022-07-13 22:05:44,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 202.28571428571428) internal successors, (1416), 7 states have internal predecessors, (1416), 0 states have call successors, (0), 0 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-13 22:05:44,362 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:05:44,363 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:05:44,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 22:05:44,363 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-13 22:05:44,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:05:44,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1315973783, now seen corresponding path program 1 times [2022-07-13 22:05:44,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:05:44,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897894545] [2022-07-13 22:05:44,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:05:44,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:05:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:05:44,470 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-13 22:05:44,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:05:44,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897894545] [2022-07-13 22:05:44,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897894545] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:05:44,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:05:44,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:05:44,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464444979] [2022-07-13 22:05:44,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:05:44,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:05:44,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:05:44,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:05:44,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:05:44,474 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 227 [2022-07-13 22:05:44,476 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 230 transitions, 654 flow. Second operand has 8 states, 8 states have (on average 198.5) internal successors, (1588), 8 states have internal predecessors, (1588), 0 states have call successors, (0), 0 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-13 22:05:44,476 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:05:44,476 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 227 [2022-07-13 22:05:44,476 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:05:45,295 INFO L129 PetriNetUnfolder]: 1123/5216 cut-off events. [2022-07-13 22:05:45,296 INFO L130 PetriNetUnfolder]: For 2494/3022 co-relation queries the response was YES. [2022-07-13 22:05:45,332 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10290 conditions, 5216 events. 1123/5216 cut-off events. For 2494/3022 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 56776 event pairs, 543 based on Foata normal form. 119/4760 useless extension candidates. Maximal degree in co-relation 10253. Up to 1341 conditions per place. [2022-07-13 22:05:45,344 INFO L132 encePairwiseOnDemand]: 217/227 looper letters, 46 selfloop transitions, 7 changer transitions 17/275 dead transitions. [2022-07-13 22:05:45,344 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 275 transitions, 995 flow [2022-07-13 22:05:45,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:05:45,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-13 22:05:45,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2013 transitions. [2022-07-13 22:05:45,349 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.886784140969163 [2022-07-13 22:05:45,349 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2013 transitions. [2022-07-13 22:05:45,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2013 transitions. [2022-07-13 22:05:45,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:05:45,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2013 transitions. [2022-07-13 22:05:45,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 201.3) internal successors, (2013), 10 states have internal predecessors, (2013), 0 states have call successors, (0), 0 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-13 22:05:45,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 227.0) internal successors, (2497), 11 states have internal predecessors, (2497), 0 states have call successors, (0), 0 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-13 22:05:45,360 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 227.0) internal successors, (2497), 11 states have internal predecessors, (2497), 0 states have call successors, (0), 0 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-13 22:05:45,360 INFO L186 Difference]: Start difference. First operand has 241 places, 230 transitions, 654 flow. Second operand 10 states and 2013 transitions. [2022-07-13 22:05:45,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 275 transitions, 995 flow [2022-07-13 22:05:45,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 275 transitions, 986 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-07-13 22:05:45,388 INFO L242 Difference]: Finished difference. Result has 252 places, 234 transitions, 692 flow [2022-07-13 22:05:45,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=692, PETRI_PLACES=252, PETRI_TRANSITIONS=234} [2022-07-13 22:05:45,391 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 45 predicate places. [2022-07-13 22:05:45,391 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 234 transitions, 692 flow [2022-07-13 22:05:45,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 198.5) internal successors, (1588), 8 states have internal predecessors, (1588), 0 states have call successors, (0), 0 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-13 22:05:45,392 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:05:45,392 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:05:45,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 22:05:45,392 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-13 22:05:45,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:05:45,393 INFO L85 PathProgramCache]: Analyzing trace with hash 339156639, now seen corresponding path program 1 times [2022-07-13 22:05:45,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:05:45,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030317220] [2022-07-13 22:05:45,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:05:45,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:05:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:05:45,433 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-13 22:05:45,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:05:45,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030317220] [2022-07-13 22:05:45,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030317220] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:05:45,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:05:45,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 22:05:45,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058437357] [2022-07-13 22:05:45,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:05:45,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 22:05:45,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:05:45,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 22:05:45,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 22:05:45,437 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 227 [2022-07-13 22:05:45,438 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 234 transitions, 692 flow. Second operand has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 0 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-13 22:05:45,438 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:05:45,438 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 227 [2022-07-13 22:05:45,438 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:05:45,724 INFO L129 PetriNetUnfolder]: 83/2088 cut-off events. [2022-07-13 22:05:45,724 INFO L130 PetriNetUnfolder]: For 162/247 co-relation queries the response was YES. [2022-07-13 22:05:45,744 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3121 conditions, 2088 events. 83/2088 cut-off events. For 162/247 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 18234 event pairs, 24 based on Foata normal form. 0/1934 useless extension candidates. Maximal degree in co-relation 3090. Up to 75 conditions per place. [2022-07-13 22:05:45,748 INFO L132 encePairwiseOnDemand]: 223/227 looper letters, 12 selfloop transitions, 2 changer transitions 24/241 dead transitions. [2022-07-13 22:05:45,748 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 241 transitions, 757 flow [2022-07-13 22:05:45,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 22:05:45,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 22:05:45,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 642 transitions. [2022-07-13 22:05:45,751 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9427312775330396 [2022-07-13 22:05:45,751 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 642 transitions. [2022-07-13 22:05:45,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 642 transitions. [2022-07-13 22:05:45,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:05:45,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 642 transitions. [2022-07-13 22:05:45,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 0 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-13 22:05:45,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 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-13 22:05:45,755 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 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-13 22:05:45,755 INFO L186 Difference]: Start difference. First operand has 252 places, 234 transitions, 692 flow. Second operand 3 states and 642 transitions. [2022-07-13 22:05:45,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 241 transitions, 757 flow [2022-07-13 22:05:45,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 241 transitions, 748 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-07-13 22:05:45,768 INFO L242 Difference]: Finished difference. Result has 249 places, 215 transitions, 611 flow [2022-07-13 22:05:45,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=611, PETRI_PLACES=249, PETRI_TRANSITIONS=215} [2022-07-13 22:05:45,769 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 42 predicate places. [2022-07-13 22:05:45,769 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 215 transitions, 611 flow [2022-07-13 22:05:45,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 0 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-13 22:05:45,770 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:05:45,770 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:05:45,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 22:05:45,771 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-13 22:05:45,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:05:45,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1101089880, now seen corresponding path program 1 times [2022-07-13 22:05:45,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:05:45,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781706485] [2022-07-13 22:05:45,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:05:45,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:05:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:05:45,810 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-13 22:05:45,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:05:45,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781706485] [2022-07-13 22:05:45,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781706485] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:05:45,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:05:45,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 22:05:45,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192364634] [2022-07-13 22:05:45,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:05:45,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 22:05:45,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:05:45,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 22:05:45,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 22:05:45,818 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 227 [2022-07-13 22:05:45,819 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 215 transitions, 611 flow. Second operand has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 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-13 22:05:45,819 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:05:45,819 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 227 [2022-07-13 22:05:45,819 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:05:46,030 INFO L129 PetriNetUnfolder]: 31/1033 cut-off events. [2022-07-13 22:05:46,031 INFO L130 PetriNetUnfolder]: For 82/91 co-relation queries the response was YES. [2022-07-13 22:05:46,036 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1524 conditions, 1033 events. 31/1033 cut-off events. For 82/91 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 7074 event pairs, 6 based on Foata normal form. 0/964 useless extension candidates. Maximal degree in co-relation 1499. Up to 31 conditions per place. [2022-07-13 22:05:46,038 INFO L132 encePairwiseOnDemand]: 221/227 looper letters, 11 selfloop transitions, 3 changer transitions 12/222 dead transitions. [2022-07-13 22:05:46,038 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 222 transitions, 676 flow [2022-07-13 22:05:46,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 22:05:46,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 22:05:46,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2022-07-13 22:05:46,040 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.933920704845815 [2022-07-13 22:05:46,040 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 636 transitions. [2022-07-13 22:05:46,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 636 transitions. [2022-07-13 22:05:46,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:05:46,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 636 transitions. [2022-07-13 22:05:46,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:05:46,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 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-13 22:05:46,043 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 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-13 22:05:46,043 INFO L186 Difference]: Start difference. First operand has 249 places, 215 transitions, 611 flow. Second operand 3 states and 636 transitions. [2022-07-13 22:05:46,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 222 transitions, 676 flow [2022-07-13 22:05:46,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 222 transitions, 662 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-07-13 22:05:46,049 INFO L242 Difference]: Finished difference. Result has 234 places, 209 transitions, 578 flow [2022-07-13 22:05:46,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=234, PETRI_TRANSITIONS=209} [2022-07-13 22:05:46,051 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 27 predicate places. [2022-07-13 22:05:46,051 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 209 transitions, 578 flow [2022-07-13 22:05:46,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 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-13 22:05:46,052 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:05:46,052 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:05:46,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 22:05:46,052 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-13 22:05:46,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:05:46,053 INFO L85 PathProgramCache]: Analyzing trace with hash -141531245, now seen corresponding path program 1 times [2022-07-13 22:05:46,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:05:46,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894538747] [2022-07-13 22:05:46,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:05:46,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:05:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:05:46,569 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-13 22:05:46,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:05:46,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894538747] [2022-07-13 22:05:46,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894538747] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:05:46,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:05:46,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-07-13 22:05:46,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627539583] [2022-07-13 22:05:46,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:05:46,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-13 22:05:46,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:05:46,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-13 22:05:46,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2022-07-13 22:05:46,574 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 227 [2022-07-13 22:05:46,578 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 209 transitions, 578 flow. Second operand has 28 states, 28 states have (on average 147.39285714285714) internal successors, (4127), 28 states have internal predecessors, (4127), 0 states have call successors, (0), 0 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-13 22:05:46,578 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:05:46,578 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 227 [2022-07-13 22:05:46,578 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:06:05,134 INFO L129 PetriNetUnfolder]: 15870/36360 cut-off events. [2022-07-13 22:06:05,134 INFO L130 PetriNetUnfolder]: For 7726/7769 co-relation queries the response was YES. [2022-07-13 22:06:05,439 INFO L84 FinitePrefix]: Finished finitePrefix Result has 69705 conditions, 36360 events. 15870/36360 cut-off events. For 7726/7769 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 371610 event pairs, 2856 based on Foata normal form. 13/34966 useless extension candidates. Maximal degree in co-relation 69682. Up to 3237 conditions per place. [2022-07-13 22:06:05,572 INFO L132 encePairwiseOnDemand]: 191/227 looper letters, 1189 selfloop transitions, 88 changer transitions 661/2070 dead transitions. [2022-07-13 22:06:05,572 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 2070 transitions, 9207 flow [2022-07-13 22:06:05,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 235 states. [2022-07-13 22:06:05,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2022-07-13 22:06:05,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 35963 transitions. [2022-07-13 22:06:05,757 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6741587777673634 [2022-07-13 22:06:05,757 INFO L72 ComplementDD]: Start complementDD. Operand 235 states and 35963 transitions. [2022-07-13 22:06:05,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 235 states and 35963 transitions. [2022-07-13 22:06:05,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:06:05,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 235 states and 35963 transitions. [2022-07-13 22:06:05,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 236 states, 235 states have (on average 153.03404255319148) internal successors, (35963), 235 states have internal predecessors, (35963), 0 states have call successors, (0), 0 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-13 22:06:05,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 236 states, 236 states have (on average 227.0) internal successors, (53572), 236 states have internal predecessors, (53572), 0 states have call successors, (0), 0 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-13 22:06:05,955 INFO L81 ComplementDD]: Finished complementDD. Result has 236 states, 236 states have (on average 227.0) internal successors, (53572), 236 states have internal predecessors, (53572), 0 states have call successors, (0), 0 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-13 22:06:05,955 INFO L186 Difference]: Start difference. First operand has 234 places, 209 transitions, 578 flow. Second operand 235 states and 35963 transitions. [2022-07-13 22:06:05,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 2070 transitions, 9207 flow [2022-07-13 22:06:06,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 2070 transitions, 8961 flow, removed 120 selfloop flow, removed 7 redundant places. [2022-07-13 22:06:06,204 INFO L242 Difference]: Finished difference. Result has 678 places, 286 transitions, 1809 flow [2022-07-13 22:06:06,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=235, PETRI_FLOW=1809, PETRI_PLACES=678, PETRI_TRANSITIONS=286} [2022-07-13 22:06:06,206 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 471 predicate places. [2022-07-13 22:06:06,206 INFO L495 AbstractCegarLoop]: Abstraction has has 678 places, 286 transitions, 1809 flow [2022-07-13 22:06:06,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 147.39285714285714) internal successors, (4127), 28 states have internal predecessors, (4127), 0 states have call successors, (0), 0 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-13 22:06:06,207 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:06:06,207 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:06:06,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 22:06:06,208 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-13 22:06:06,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:06:06,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1967864813, now seen corresponding path program 2 times [2022-07-13 22:06:06,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:06:06,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953208025] [2022-07-13 22:06:06,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:06:06,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:06:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:06:06,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:06:06,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:06:06,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953208025] [2022-07-13 22:06:06,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953208025] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:06:06,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:06:06,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-07-13 22:06:06,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358838724] [2022-07-13 22:06:06,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:06:06,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-13 22:06:06,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:06:06,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-13 22:06:06,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2022-07-13 22:06:06,703 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 227 [2022-07-13 22:06:06,705 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 678 places, 286 transitions, 1809 flow. Second operand has 28 states, 28 states have (on average 147.39285714285714) internal successors, (4127), 28 states have internal predecessors, (4127), 0 states have call successors, (0), 0 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-13 22:06:06,706 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:06:06,706 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 227 [2022-07-13 22:06:06,706 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand