./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 791161d1 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-?-791161d [2022-07-22 21:42:09,060 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 21:42:09,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 21:42:09,114 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 21:42:09,115 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 21:42:09,116 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 21:42:09,117 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 21:42:09,119 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 21:42:09,120 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 21:42:09,123 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 21:42:09,124 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 21:42:09,125 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 21:42:09,125 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 21:42:09,127 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 21:42:09,128 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 21:42:09,129 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 21:42:09,129 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 21:42:09,130 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 21:42:09,133 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 21:42:09,137 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 21:42:09,139 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 21:42:09,140 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 21:42:09,140 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 21:42:09,141 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 21:42:09,142 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 21:42:09,147 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 21:42:09,147 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 21:42:09,147 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 21:42:09,148 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 21:42:09,148 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 21:42:09,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 21:42:09,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 21:42:09,150 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 21:42:09,151 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 21:42:09,151 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 21:42:09,152 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 21:42:09,152 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 21:42:09,152 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 21:42:09,153 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 21:42:09,153 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 21:42:09,153 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 21:42:09,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 21:42:09,156 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 21:42:09,178 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 21:42:09,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 21:42:09,179 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 21:42:09,179 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 21:42:09,181 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 21:42:09,181 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 21:42:09,182 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 21:42:09,182 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 21:42:09,182 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 21:42:09,183 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 21:42:09,183 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 21:42:09,183 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 21:42:09,183 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 21:42:09,183 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 21:42:09,183 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 21:42:09,184 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 21:42:09,184 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 21:42:09,184 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 21:42:09,184 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 21:42:09,185 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 21:42:09,186 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 21:42:09,186 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 21:42:09,187 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 21:42:09,190 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 21:42:09,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:42:09,190 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 21:42:09,191 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 21:42:09,191 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 21:42:09,191 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 21:42:09,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 21:42:09,191 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 21:42:09,192 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 21:42:09,192 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 21:42:09,192 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-22 21:42:09,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 21:42:09,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 21:42:09,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 21:42:09,391 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 21:42:09,391 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 21:42:09,392 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-22 21:42:09,445 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/900ee38c9/289e8645cac24dc585c867fb427ae5c0/FLAG214e22e88 [2022-07-22 21:42:09,802 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 21:42:09,803 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c [2022-07-22 21:42:09,810 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/900ee38c9/289e8645cac24dc585c867fb427ae5c0/FLAG214e22e88 [2022-07-22 21:42:09,818 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/900ee38c9/289e8645cac24dc585c867fb427ae5c0 [2022-07-22 21:42:09,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 21:42:09,821 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 21:42:09,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 21:42:09,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 21:42:09,838 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 21:42:09,838 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:42:09" (1/1) ... [2022-07-22 21:42:09,839 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bd12978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:42:09, skipping insertion in model container [2022-07-22 21:42:09,839 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:42:09" (1/1) ... [2022-07-22 21:42:09,843 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 21:42:09,855 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 21:42:09,984 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-22 21:42:09,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:42:09,992 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 21:42:10,007 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-22 21:42:10,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:42:10,028 INFO L208 MainTranslator]: Completed translation [2022-07-22 21:42:10,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:42:10 WrapperNode [2022-07-22 21:42:10,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 21:42:10,030 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 21:42:10,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 21:42:10,031 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 21:42:10,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:42:10" (1/1) ... [2022-07-22 21:42:10,043 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:42:10" (1/1) ... [2022-07-22 21:42:10,063 INFO L137 Inliner]: procedures = 23, calls = 30, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 175 [2022-07-22 21:42:10,063 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 21:42:10,064 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 21:42:10,064 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 21:42:10,064 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 21:42:10,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:42:10" (1/1) ... [2022-07-22 21:42:10,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:42:10" (1/1) ... [2022-07-22 21:42:10,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:42:10" (1/1) ... [2022-07-22 21:42:10,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:42:10" (1/1) ... [2022-07-22 21:42:10,081 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:42:10" (1/1) ... [2022-07-22 21:42:10,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:42:10" (1/1) ... [2022-07-22 21:42:10,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:42:10" (1/1) ... [2022-07-22 21:42:10,086 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 21:42:10,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 21:42:10,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 21:42:10,091 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 21:42:10,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:42:10" (1/1) ... [2022-07-22 21:42:10,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:42:10,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:42:10,115 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-22 21:42:10,119 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-22 21:42:10,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 21:42:10,147 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 21:42:10,147 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 21:42:10,147 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 21:42:10,147 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 21:42:10,147 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-22 21:42:10,147 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-22 21:42:10,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 21:42:10,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 21:42:10,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 21:42:10,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 21:42:10,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 21:42:10,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 21:42:10,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 21:42:10,150 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 21:42:10,214 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 21:42:10,215 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 21:42:10,471 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 21:42:10,479 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 21:42:10,479 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-22 21:42:10,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:42:10 BoogieIcfgContainer [2022-07-22 21:42:10,481 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 21:42:10,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 21:42:10,483 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 21:42:10,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 21:42:10,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 09:42:09" (1/3) ... [2022-07-22 21:42:10,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75826edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:42:10, skipping insertion in model container [2022-07-22 21:42:10,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:42:10" (2/3) ... [2022-07-22 21:42:10,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75826edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:42:10, skipping insertion in model container [2022-07-22 21:42:10,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:42:10" (3/3) ... [2022-07-22 21:42:10,491 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-trans.wvr.c [2022-07-22 21:42:10,499 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-22 21:42:10,504 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 21:42:10,505 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 21:42:10,505 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-22 21:42:10,567 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-22 21:42:10,596 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 221 places, 227 transitions, 478 flow [2022-07-22 21:42:10,683 INFO L129 PetriNetUnfolder]: 16/224 cut-off events. [2022-07-22 21:42:10,684 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 21:42:10,699 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-22 21:42:10,699 INFO L82 GeneralOperation]: Start removeDead. Operand has 221 places, 227 transitions, 478 flow [2022-07-22 21:42:10,703 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 213 transitions, 444 flow [2022-07-22 21:42:10,710 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 21:42:10,714 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@7b7f1ccf, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7fce9a10 [2022-07-22 21:42:10,714 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-07-22 21:42:10,744 INFO L129 PetriNetUnfolder]: 16/212 cut-off events. [2022-07-22 21:42:10,745 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 21:42:10,745 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:42:10,745 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-22 21:42:10,746 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-22 21:42:10,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:42:10,749 INFO L85 PathProgramCache]: Analyzing trace with hash -483569212, now seen corresponding path program 1 times [2022-07-22 21:42:10,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:42:10,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491146899] [2022-07-22 21:42:10,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:42:10,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:42:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:42:11,011 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-22 21:42:11,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:42:11,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491146899] [2022-07-22 21:42:11,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491146899] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:42:11,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:42:11,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:42:11,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714650946] [2022-07-22 21:42:11,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:42:11,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:42:11,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:42:11,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:42:11,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:42:11,055 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 227 [2022-07-22 21:42:11,060 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-22 21:42:11,060 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:42:11,060 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 227 [2022-07-22 21:42:11,061 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:42:11,264 INFO L129 PetriNetUnfolder]: 30/279 cut-off events. [2022-07-22 21:42:11,268 INFO L130 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2022-07-22 21:42:11,271 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-22 21:42:11,274 INFO L132 encePairwiseOnDemand]: 211/227 looper letters, 22 selfloop transitions, 5 changer transitions 11/225 dead transitions. [2022-07-22 21:42:11,274 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 225 transitions, 577 flow [2022-07-22 21:42:11,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 21:42:11,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-22 21:42:11,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2067 transitions. [2022-07-22 21:42:11,295 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9105726872246696 [2022-07-22 21:42:11,296 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2067 transitions. [2022-07-22 21:42:11,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2067 transitions. [2022-07-22 21:42:11,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:42:11,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2067 transitions. [2022-07-22 21:42:11,309 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-22 21:42:11,317 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-22 21:42:11,318 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-22 21:42:11,319 INFO L186 Difference]: Start difference. First operand has 207 places, 213 transitions, 444 flow. Second operand 10 states and 2067 transitions. [2022-07-22 21:42:11,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 225 transitions, 577 flow [2022-07-22 21:42:11,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 225 transitions, 543 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-07-22 21:42:11,328 INFO L242 Difference]: Finished difference. Result has 217 places, 209 transitions, 457 flow [2022-07-22 21:42:11,331 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-22 21:42:11,333 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 10 predicate places. [2022-07-22 21:42:11,334 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 209 transitions, 457 flow [2022-07-22 21:42:11,335 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-22 21:42:11,335 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:42:11,335 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-22 21:42:11,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 21:42:11,336 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-22 21:42:11,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:42:11,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1802203198, now seen corresponding path program 1 times [2022-07-22 21:42:11,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:42:11,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753292042] [2022-07-22 21:42:11,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:42:11,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:42:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:42:11,397 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-22 21:42:11,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:42:11,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753292042] [2022-07-22 21:42:11,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753292042] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:42:11,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:42:11,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 21:42:11,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207930380] [2022-07-22 21:42:11,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:42:11,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 21:42:11,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:42:11,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 21:42:11,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 21:42:11,401 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 227 [2022-07-22 21:42:11,402 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-22 21:42:11,402 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:42:11,402 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 227 [2022-07-22 21:42:11,402 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:42:11,532 INFO L129 PetriNetUnfolder]: 71/789 cut-off events. [2022-07-22 21:42:11,532 INFO L130 PetriNetUnfolder]: For 45/52 co-relation queries the response was YES. [2022-07-22 21:42:11,538 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-22 21:42:11,541 INFO L132 encePairwiseOnDemand]: 217/227 looper letters, 18 selfloop transitions, 6 changer transitions 0/217 dead transitions. [2022-07-22 21:42:11,541 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 217 transitions, 525 flow [2022-07-22 21:42:11,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 21:42:11,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-22 21:42:11,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 637 transitions. [2022-07-22 21:42:11,543 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9353891336270191 [2022-07-22 21:42:11,543 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 637 transitions. [2022-07-22 21:42:11,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 637 transitions. [2022-07-22 21:42:11,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:42:11,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 637 transitions. [2022-07-22 21:42:11,545 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-22 21:42:11,546 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-22 21:42:11,547 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-22 21:42:11,547 INFO L186 Difference]: Start difference. First operand has 217 places, 209 transitions, 457 flow. Second operand 3 states and 637 transitions. [2022-07-22 21:42:11,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 217 transitions, 525 flow [2022-07-22 21:42:11,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 217 transitions, 520 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-07-22 21:42:11,560 INFO L242 Difference]: Finished difference. Result has 214 places, 213 transitions, 500 flow [2022-07-22 21:42:11,560 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-22 21:42:11,561 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 7 predicate places. [2022-07-22 21:42:11,561 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 213 transitions, 500 flow [2022-07-22 21:42:11,561 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-22 21:42:11,561 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:42:11,562 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-22 21:42:11,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 21:42:11,562 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-22 21:42:11,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:42:11,564 INFO L85 PathProgramCache]: Analyzing trace with hash 623842676, now seen corresponding path program 2 times [2022-07-22 21:42:11,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:42:11,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66628456] [2022-07-22 21:42:11,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:42:11,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:42:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:42:11,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:42:11,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:42:11,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66628456] [2022-07-22 21:42:11,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66628456] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:42:11,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:42:11,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 21:42:11,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564844424] [2022-07-22 21:42:11,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:42:11,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 21:42:11,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:42:11,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 21:42:11,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 21:42:11,654 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 227 [2022-07-22 21:42:11,655 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-22 21:42:11,656 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:42:11,656 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 227 [2022-07-22 21:42:11,656 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:42:11,753 INFO L129 PetriNetUnfolder]: 54/633 cut-off events. [2022-07-22 21:42:11,753 INFO L130 PetriNetUnfolder]: For 134/134 co-relation queries the response was YES. [2022-07-22 21:42:11,757 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-22 21:42:11,759 INFO L132 encePairwiseOnDemand]: 219/227 looper letters, 24 selfloop transitions, 4 changer transitions 0/221 dead transitions. [2022-07-22 21:42:11,760 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 221 transitions, 584 flow [2022-07-22 21:42:11,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 21:42:11,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-22 21:42:11,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 637 transitions. [2022-07-22 21:42:11,762 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9353891336270191 [2022-07-22 21:42:11,762 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 637 transitions. [2022-07-22 21:42:11,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 637 transitions. [2022-07-22 21:42:11,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:42:11,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 637 transitions. [2022-07-22 21:42:11,765 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-22 21:42:11,766 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-22 21:42:11,767 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-22 21:42:11,767 INFO L186 Difference]: Start difference. First operand has 214 places, 213 transitions, 500 flow. Second operand 3 states and 637 transitions. [2022-07-22 21:42:11,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 221 transitions, 584 flow [2022-07-22 21:42:11,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 221 transitions, 572 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-22 21:42:11,773 INFO L242 Difference]: Finished difference. Result has 216 places, 217 transitions, 536 flow [2022-07-22 21:42:11,773 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-22 21:42:11,775 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 9 predicate places. [2022-07-22 21:42:11,775 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 217 transitions, 536 flow [2022-07-22 21:42:11,776 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-22 21:42:11,776 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:42:11,776 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-22 21:42:11,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 21:42:11,776 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-22 21:42:11,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:42:11,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1893473444, now seen corresponding path program 1 times [2022-07-22 21:42:11,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:42:11,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903014894] [2022-07-22 21:42:11,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:42:11,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:42:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:42:11,857 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-22 21:42:11,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:42:11,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903014894] [2022-07-22 21:42:11,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903014894] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:42:11,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:42:11,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 21:42:11,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582548618] [2022-07-22 21:42:11,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:42:11,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 21:42:11,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:42:11,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 21:42:11,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 21:42:11,860 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 227 [2022-07-22 21:42:11,861 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-22 21:42:11,861 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:42:11,861 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 227 [2022-07-22 21:42:11,861 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:42:12,045 INFO L129 PetriNetUnfolder]: 105/2022 cut-off events. [2022-07-22 21:42:12,045 INFO L130 PetriNetUnfolder]: For 196/349 co-relation queries the response was YES. [2022-07-22 21:42:12,053 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-22 21:42:12,059 INFO L132 encePairwiseOnDemand]: 221/227 looper letters, 19 selfloop transitions, 3 changer transitions 0/225 dead transitions. [2022-07-22 21:42:12,059 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 225 transitions, 601 flow [2022-07-22 21:42:12,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 21:42:12,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-22 21:42:12,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 640 transitions. [2022-07-22 21:42:12,061 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9397944199706314 [2022-07-22 21:42:12,061 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 640 transitions. [2022-07-22 21:42:12,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 640 transitions. [2022-07-22 21:42:12,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:42:12,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 640 transitions. [2022-07-22 21:42:12,064 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-22 21:42:12,068 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-22 21:42:12,068 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-22 21:42:12,069 INFO L186 Difference]: Start difference. First operand has 216 places, 217 transitions, 536 flow. Second operand 3 states and 640 transitions. [2022-07-22 21:42:12,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 225 transitions, 601 flow [2022-07-22 21:42:12,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 225 transitions, 589 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-07-22 21:42:12,080 INFO L242 Difference]: Finished difference. Result has 219 places, 220 transitions, 554 flow [2022-07-22 21:42:12,080 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-22 21:42:12,081 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 12 predicate places. [2022-07-22 21:42:12,081 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 220 transitions, 554 flow [2022-07-22 21:42:12,085 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-22 21:42:12,085 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:42:12,085 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-22 21:42:12,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 21:42:12,089 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-22 21:42:12,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:42:12,089 INFO L85 PathProgramCache]: Analyzing trace with hash -574075276, now seen corresponding path program 1 times [2022-07-22 21:42:12,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:42:12,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258200345] [2022-07-22 21:42:12,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:42:12,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:42:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:42:12,166 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-22 21:42:12,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:42:12,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258200345] [2022-07-22 21:42:12,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258200345] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:42:12,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:42:12,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 21:42:12,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197891334] [2022-07-22 21:42:12,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:42:12,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 21:42:12,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:42:12,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 21:42:12,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 21:42:12,169 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 227 [2022-07-22 21:42:12,170 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-22 21:42:12,171 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:42:12,171 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 227 [2022-07-22 21:42:12,171 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:42:12,458 INFO L129 PetriNetUnfolder]: 124/2513 cut-off events. [2022-07-22 21:42:12,458 INFO L130 PetriNetUnfolder]: For 113/222 co-relation queries the response was YES. [2022-07-22 21:42:12,472 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-22 21:42:12,478 INFO L132 encePairwiseOnDemand]: 221/227 looper letters, 15 selfloop transitions, 4 changer transitions 0/227 dead transitions. [2022-07-22 21:42:12,478 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 227 transitions, 611 flow [2022-07-22 21:42:12,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 21:42:12,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-22 21:42:12,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 642 transitions. [2022-07-22 21:42:12,480 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9427312775330396 [2022-07-22 21:42:12,480 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 642 transitions. [2022-07-22 21:42:12,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 642 transitions. [2022-07-22 21:42:12,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:42:12,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 642 transitions. [2022-07-22 21:42:12,482 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-22 21:42:12,483 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-22 21:42:12,483 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-22 21:42:12,484 INFO L186 Difference]: Start difference. First operand has 219 places, 220 transitions, 554 flow. Second operand 3 states and 642 transitions. [2022-07-22 21:42:12,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 227 transitions, 611 flow [2022-07-22 21:42:12,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 227 transitions, 608 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-22 21:42:12,493 INFO L242 Difference]: Finished difference. Result has 222 places, 222 transitions, 579 flow [2022-07-22 21:42:12,494 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-22 21:42:12,495 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 15 predicate places. [2022-07-22 21:42:12,496 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 222 transitions, 579 flow [2022-07-22 21:42:12,496 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-22 21:42:12,496 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:42:12,496 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-22 21:42:12,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 21:42:12,497 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-22 21:42:12,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:42:12,498 INFO L85 PathProgramCache]: Analyzing trace with hash -720449500, now seen corresponding path program 1 times [2022-07-22 21:42:12,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:42:12,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724110223] [2022-07-22 21:42:12,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:42:12,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:42:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:42:12,630 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-22 21:42:12,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:42:12,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724110223] [2022-07-22 21:42:12,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724110223] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:42:12,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:42:12,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 21:42:12,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134306838] [2022-07-22 21:42:12,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:42:12,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 21:42:12,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:42:12,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 21:42:12,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-22 21:42:12,634 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 227 [2022-07-22 21:42:12,636 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-22 21:42:12,636 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:42:12,636 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 227 [2022-07-22 21:42:12,636 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:42:12,881 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-22 21:42:12,881 INFO L384 tUnfolder$Statistics]: this new event has 97 ancestors and is cut-off event [2022-07-22 21:42:12,881 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-07-22 21:42:12,881 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-07-22 21:42:12,882 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-07-22 21:42:12,882 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-22 21:42:12,882 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-07-22 21:42:12,882 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-07-22 21:42:12,882 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-07-22 21:42:12,882 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-07-22 21:42:12,882 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-22 21:42:12,883 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2022-07-22 21:42:12,883 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-22 21:42:12,883 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-22 21:42:12,883 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-22 21:42:12,883 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-22 21:42:12,883 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-07-22 21:42:12,883 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-22 21:42:12,884 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-22 21:42:12,884 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-22 21:42:12,884 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-22 21:42:12,884 INFO L384 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-07-22 21:42:12,884 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-07-22 21:42:12,884 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-07-22 21:42:12,884 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-07-22 21:42:12,884 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-22 21:42:12,885 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-07-22 21:42:12,885 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-22 21:42:12,885 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-22 21:42:12,885 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-22 21:42:13,092 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-22 21:42:13,093 INFO L384 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-07-22 21:42:13,093 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-07-22 21:42:13,093 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-22 21:42:13,093 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-22 21:42:13,095 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-22 21:42:13,096 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-07-22 21:42:13,096 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-22 21:42:13,096 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-22 21:42:13,096 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-22 21:42:13,096 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-22 21:42:13,096 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-07-22 21:42:13,097 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-22 21:42:13,097 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-22 21:42:13,097 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-22 21:42:13,100 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-22 21:42:13,101 INFO L384 tUnfolder$Statistics]: this new event has 116 ancestors and is cut-off event [2022-07-22 21:42:13,101 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-07-22 21:42:13,101 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-22 21:42:13,101 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-22 21:42:13,101 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-22 21:42:13,102 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-22 21:42:13,103 INFO L384 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-07-22 21:42:13,103 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-07-22 21:42:13,103 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-07-22 21:42:13,103 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-22 21:42:13,103 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-22 21:42:13,103 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-22 21:42:13,108 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-22 21:42:13,108 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-07-22 21:42:13,108 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-07-22 21:42:13,108 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-07-22 21:42:13,109 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-07-22 21:42:13,113 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-22 21:42:13,113 INFO L384 tUnfolder$Statistics]: this new event has 117 ancestors and is cut-off event [2022-07-22 21:42:13,113 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-07-22 21:42:13,113 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-07-22 21:42:13,113 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-07-22 21:42:13,113 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-07-22 21:42:13,115 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-22 21:42:13,115 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-07-22 21:42:13,115 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-07-22 21:42:13,116 INFO L387 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-07-22 21:42:13,116 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-07-22 21:42:13,116 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-07-22 21:42:13,116 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-07-22 21:42:13,120 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-22 21:42:13,120 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2022-07-22 21:42:13,120 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-22 21:42:13,120 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-22 21:42:13,120 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-22 21:42:13,124 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-22 21:42:13,124 INFO L384 tUnfolder$Statistics]: this new event has 118 ancestors and is cut-off event [2022-07-22 21:42:13,124 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-22 21:42:13,125 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-22 21:42:13,125 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-22 21:42:13,125 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-22 21:42:13,126 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-22 21:42:13,127 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2022-07-22 21:42:13,127 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-22 21:42:13,127 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-22 21:42:13,127 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-22 21:42:13,127 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-22 21:42:13,127 INFO L387 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-07-22 21:42:13,136 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-22 21:42:13,136 INFO L384 tUnfolder$Statistics]: this new event has 97 ancestors and is cut-off event [2022-07-22 21:42:13,136 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-22 21:42:13,136 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-07-22 21:42:13,136 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-22 21:42:13,139 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-22 21:42:13,139 INFO L384 tUnfolder$Statistics]: this new event has 119 ancestors and is cut-off event [2022-07-22 21:42:13,139 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-22 21:42:13,139 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-22 21:42:13,139 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-07-22 21:42:13,140 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-22 21:42:13,141 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-22 21:42:13,141 INFO L384 tUnfolder$Statistics]: this new event has 97 ancestors and is cut-off event [2022-07-22 21:42:13,141 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-22 21:42:13,141 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-22 21:42:13,142 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-07-22 21:42:13,142 INFO L387 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-07-22 21:42:13,142 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-22 21:42:13,146 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-22 21:42:13,146 INFO L384 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-07-22 21:42:13,146 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-22 21:42:13,146 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-22 21:42:13,146 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-22 21:42:13,147 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-22 21:42:13,147 INFO L384 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-07-22 21:42:13,147 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-22 21:42:13,147 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-22 21:42:13,147 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-22 21:42:13,234 INFO L129 PetriNetUnfolder]: 1208/4597 cut-off events. [2022-07-22 21:42:13,235 INFO L130 PetriNetUnfolder]: For 920/1126 co-relation queries the response was YES. [2022-07-22 21:42:13,281 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-22 21:42:13,293 INFO L132 encePairwiseOnDemand]: 217/227 looper letters, 34 selfloop transitions, 7 changer transitions 4/244 dead transitions. [2022-07-22 21:42:13,293 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 244 transitions, 733 flow [2022-07-22 21:42:13,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 21:42:13,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-22 21:42:13,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1612 transitions. [2022-07-22 21:42:13,296 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8876651982378855 [2022-07-22 21:42:13,296 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1612 transitions. [2022-07-22 21:42:13,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1612 transitions. [2022-07-22 21:42:13,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:42:13,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1612 transitions. [2022-07-22 21:42:13,299 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-22 21:42:13,301 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-22 21:42:13,302 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-22 21:42:13,302 INFO L186 Difference]: Start difference. First operand has 222 places, 222 transitions, 579 flow. Second operand 8 states and 1612 transitions. [2022-07-22 21:42:13,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 244 transitions, 733 flow [2022-07-22 21:42:13,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 244 transitions, 725 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-22 21:42:13,312 INFO L242 Difference]: Finished difference. Result has 232 places, 226 transitions, 617 flow [2022-07-22 21:42:13,312 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-22 21:42:13,314 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 25 predicate places. [2022-07-22 21:42:13,315 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 226 transitions, 617 flow [2022-07-22 21:42:13,316 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-22 21:42:13,316 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:42:13,316 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-22 21:42:13,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 21:42:13,317 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-22 21:42:13,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:42:13,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1306237264, now seen corresponding path program 1 times [2022-07-22 21:42:13,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:42:13,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414570764] [2022-07-22 21:42:13,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:42:13,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:42:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:42:13,393 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-22 21:42:13,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:42:13,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414570764] [2022-07-22 21:42:13,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414570764] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:42:13,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:42:13,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:42:13,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34285213] [2022-07-22 21:42:13,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:42:13,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:42:13,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:42:13,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:42:13,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:42:13,399 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 227 [2022-07-22 21:42:13,400 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-22 21:42:13,400 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:42:13,400 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 227 [2022-07-22 21:42:13,400 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:42:13,729 INFO L129 PetriNetUnfolder]: 276/2516 cut-off events. [2022-07-22 21:42:13,730 INFO L130 PetriNetUnfolder]: For 289/491 co-relation queries the response was YES. [2022-07-22 21:42:13,746 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-22 21:42:13,753 INFO L132 encePairwiseOnDemand]: 219/227 looper letters, 25 selfloop transitions, 5 changer transitions 10/245 dead transitions. [2022-07-22 21:42:13,753 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 245 transitions, 758 flow [2022-07-22 21:42:13,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 21:42:13,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-22 21:42:13,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1838 transitions. [2022-07-22 21:42:13,757 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.899657366617719 [2022-07-22 21:42:13,757 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1838 transitions. [2022-07-22 21:42:13,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1838 transitions. [2022-07-22 21:42:13,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:42:13,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1838 transitions. [2022-07-22 21:42:13,760 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-22 21:42:13,763 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-22 21:42:13,763 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-22 21:42:13,763 INFO L186 Difference]: Start difference. First operand has 232 places, 226 transitions, 617 flow. Second operand 9 states and 1838 transitions. [2022-07-22 21:42:13,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 245 transitions, 758 flow [2022-07-22 21:42:13,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 245 transitions, 747 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-07-22 21:42:13,771 INFO L242 Difference]: Finished difference. Result has 241 places, 230 transitions, 654 flow [2022-07-22 21:42:13,771 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-22 21:42:13,771 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 34 predicate places. [2022-07-22 21:42:13,772 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 230 transitions, 654 flow [2022-07-22 21:42:13,772 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-22 21:42:13,772 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:42:13,772 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-22 21:42:13,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 21:42:13,772 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-22 21:42:13,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:42:13,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1315973783, now seen corresponding path program 1 times [2022-07-22 21:42:13,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:42:13,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295253276] [2022-07-22 21:42:13,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:42:13,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:42:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:42:13,870 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-22 21:42:13,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:42:13,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295253276] [2022-07-22 21:42:13,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295253276] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:42:13,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:42:13,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 21:42:13,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584556924] [2022-07-22 21:42:13,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:42:13,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 21:42:13,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:42:13,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 21:42:13,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-22 21:42:13,873 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 227 [2022-07-22 21:42:13,875 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-22 21:42:13,875 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:42:13,875 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 227 [2022-07-22 21:42:13,875 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:42:14,450 INFO L129 PetriNetUnfolder]: 1123/5216 cut-off events. [2022-07-22 21:42:14,451 INFO L130 PetriNetUnfolder]: For 2494/3022 co-relation queries the response was YES. [2022-07-22 21:42:14,485 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-22 21:42:14,495 INFO L132 encePairwiseOnDemand]: 217/227 looper letters, 46 selfloop transitions, 7 changer transitions 17/275 dead transitions. [2022-07-22 21:42:14,495 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 275 transitions, 995 flow [2022-07-22 21:42:14,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 21:42:14,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-22 21:42:14,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2013 transitions. [2022-07-22 21:42:14,499 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.886784140969163 [2022-07-22 21:42:14,499 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2013 transitions. [2022-07-22 21:42:14,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2013 transitions. [2022-07-22 21:42:14,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:42:14,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2013 transitions. [2022-07-22 21:42:14,503 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-22 21:42:14,507 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-22 21:42:14,507 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-22 21:42:14,507 INFO L186 Difference]: Start difference. First operand has 241 places, 230 transitions, 654 flow. Second operand 10 states and 2013 transitions. [2022-07-22 21:42:14,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 275 transitions, 995 flow [2022-07-22 21:42:14,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 275 transitions, 986 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-07-22 21:42:14,527 INFO L242 Difference]: Finished difference. Result has 252 places, 234 transitions, 692 flow [2022-07-22 21:42:14,527 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-22 21:42:14,529 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 45 predicate places. [2022-07-22 21:42:14,529 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 234 transitions, 692 flow [2022-07-22 21:42:14,530 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-22 21:42:14,530 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:42:14,530 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-22 21:42:14,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 21:42:14,531 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-22 21:42:14,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:42:14,531 INFO L85 PathProgramCache]: Analyzing trace with hash 339156639, now seen corresponding path program 1 times [2022-07-22 21:42:14,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:42:14,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107708443] [2022-07-22 21:42:14,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:42:14,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:42:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:42:14,560 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-22 21:42:14,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:42:14,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107708443] [2022-07-22 21:42:14,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107708443] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:42:14,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:42:14,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 21:42:14,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323384216] [2022-07-22 21:42:14,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:42:14,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 21:42:14,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:42:14,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 21:42:14,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 21:42:14,562 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 227 [2022-07-22 21:42:14,562 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-22 21:42:14,562 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:42:14,562 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 227 [2022-07-22 21:42:14,562 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:42:14,811 INFO L129 PetriNetUnfolder]: 83/2088 cut-off events. [2022-07-22 21:42:14,811 INFO L130 PetriNetUnfolder]: For 162/247 co-relation queries the response was YES. [2022-07-22 21:42:14,821 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-22 21:42:14,823 INFO L132 encePairwiseOnDemand]: 223/227 looper letters, 12 selfloop transitions, 2 changer transitions 24/241 dead transitions. [2022-07-22 21:42:14,823 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 241 transitions, 757 flow [2022-07-22 21:42:14,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 21:42:14,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-22 21:42:14,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 642 transitions. [2022-07-22 21:42:14,825 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9427312775330396 [2022-07-22 21:42:14,825 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 642 transitions. [2022-07-22 21:42:14,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 642 transitions. [2022-07-22 21:42:14,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:42:14,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 642 transitions. [2022-07-22 21:42:14,826 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-22 21:42:14,827 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-22 21:42:14,827 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-22 21:42:14,827 INFO L186 Difference]: Start difference. First operand has 252 places, 234 transitions, 692 flow. Second operand 3 states and 642 transitions. [2022-07-22 21:42:14,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 241 transitions, 757 flow [2022-07-22 21:42:14,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 241 transitions, 748 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-07-22 21:42:14,834 INFO L242 Difference]: Finished difference. Result has 249 places, 215 transitions, 611 flow [2022-07-22 21:42:14,835 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-22 21:42:14,835 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 42 predicate places. [2022-07-22 21:42:14,835 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 215 transitions, 611 flow [2022-07-22 21:42:14,836 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-22 21:42:14,836 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:42:14,836 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-22 21:42:14,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 21:42:14,836 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-22 21:42:14,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:42:14,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1101089880, now seen corresponding path program 1 times [2022-07-22 21:42:14,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:42:14,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184136730] [2022-07-22 21:42:14,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:42:14,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:42:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:42:14,870 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-22 21:42:14,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:42:14,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184136730] [2022-07-22 21:42:14,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184136730] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:42:14,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:42:14,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 21:42:14,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926351410] [2022-07-22 21:42:14,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:42:14,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 21:42:14,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:42:14,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 21:42:14,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 21:42:14,877 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 227 [2022-07-22 21:42:14,878 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-22 21:42:14,878 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:42:14,878 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 227 [2022-07-22 21:42:14,878 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:42:14,977 INFO L129 PetriNetUnfolder]: 31/1033 cut-off events. [2022-07-22 21:42:14,977 INFO L130 PetriNetUnfolder]: For 82/91 co-relation queries the response was YES. [2022-07-22 21:42:14,983 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-22 21:42:14,985 INFO L132 encePairwiseOnDemand]: 221/227 looper letters, 11 selfloop transitions, 3 changer transitions 12/222 dead transitions. [2022-07-22 21:42:14,985 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 222 transitions, 676 flow [2022-07-22 21:42:14,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 21:42:14,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-22 21:42:14,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2022-07-22 21:42:14,987 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.933920704845815 [2022-07-22 21:42:14,987 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 636 transitions. [2022-07-22 21:42:14,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 636 transitions. [2022-07-22 21:42:14,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:42:14,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 636 transitions. [2022-07-22 21:42:14,988 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-22 21:42:14,989 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-22 21:42:14,990 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-22 21:42:14,990 INFO L186 Difference]: Start difference. First operand has 249 places, 215 transitions, 611 flow. Second operand 3 states and 636 transitions. [2022-07-22 21:42:14,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 222 transitions, 676 flow [2022-07-22 21:42:14,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 222 transitions, 662 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-07-22 21:42:14,995 INFO L242 Difference]: Finished difference. Result has 234 places, 209 transitions, 578 flow [2022-07-22 21:42:14,996 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-22 21:42:14,997 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 27 predicate places. [2022-07-22 21:42:14,997 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 209 transitions, 578 flow [2022-07-22 21:42:14,997 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-22 21:42:14,998 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:42:14,998 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-22 21:42:14,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 21:42:14,998 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-22 21:42:14,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:42:14,999 INFO L85 PathProgramCache]: Analyzing trace with hash -141531245, now seen corresponding path program 1 times [2022-07-22 21:42:14,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:42:15,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681895246] [2022-07-22 21:42:15,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:42:15,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:42:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:42:15,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-22 21:42:15,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:42:15,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681895246] [2022-07-22 21:42:15,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681895246] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:42:15,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:42:15,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-07-22 21:42:15,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378888527] [2022-07-22 21:42:15,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:42:15,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-22 21:42:15,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:42:15,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-22 21:42:15,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2022-07-22 21:42:15,437 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 227 [2022-07-22 21:42:15,445 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-22 21:42:15,450 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:42:15,450 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 227 [2022-07-22 21:42:15,450 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:42:31,920 INFO L129 PetriNetUnfolder]: 15870/36360 cut-off events. [2022-07-22 21:42:31,921 INFO L130 PetriNetUnfolder]: For 7726/7769 co-relation queries the response was YES. [2022-07-22 21:42:32,088 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-22 21:42:32,181 INFO L132 encePairwiseOnDemand]: 191/227 looper letters, 1189 selfloop transitions, 88 changer transitions 661/2070 dead transitions. [2022-07-22 21:42:32,181 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 2070 transitions, 9207 flow [2022-07-22 21:42:32,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 235 states. [2022-07-22 21:42:32,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2022-07-22 21:42:32,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 35963 transitions. [2022-07-22 21:42:32,225 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6741587777673634 [2022-07-22 21:42:32,225 INFO L72 ComplementDD]: Start complementDD. Operand 235 states and 35963 transitions. [2022-07-22 21:42:32,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 235 states and 35963 transitions. [2022-07-22 21:42:32,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:42:32,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 235 states and 35963 transitions. [2022-07-22 21:42:32,289 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-22 21:42:32,364 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-22 21:42:32,386 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-22 21:42:32,386 INFO L186 Difference]: Start difference. First operand has 234 places, 209 transitions, 578 flow. Second operand 235 states and 35963 transitions. [2022-07-22 21:42:32,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 2070 transitions, 9207 flow [2022-07-22 21:42:32,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 2070 transitions, 8961 flow, removed 120 selfloop flow, removed 7 redundant places. [2022-07-22 21:42:32,572 INFO L242 Difference]: Finished difference. Result has 678 places, 286 transitions, 1809 flow [2022-07-22 21:42:32,572 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-22 21:42:32,573 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 471 predicate places. [2022-07-22 21:42:32,573 INFO L495 AbstractCegarLoop]: Abstraction has has 678 places, 286 transitions, 1809 flow [2022-07-22 21:42:32,574 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-22 21:42:32,574 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:42:32,574 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-22 21:42:32,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 21:42:32,575 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-22 21:42:32,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:42:32,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1967864813, now seen corresponding path program 2 times [2022-07-22 21:42:32,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:42:32,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229358734] [2022-07-22 21:42:32,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:42:32,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:42:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:42:32,956 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-22 21:42:32,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:42:32,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229358734] [2022-07-22 21:42:32,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229358734] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:42:32,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:42:32,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-07-22 21:42:32,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141954182] [2022-07-22 21:42:32,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:42:32,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-22 21:42:32,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:42:32,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-22 21:42:32,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2022-07-22 21:42:32,961 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 227 [2022-07-22 21:42:32,963 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-22 21:42:32,964 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:42:32,964 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 227 [2022-07-22 21:42:32,964 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand