/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-word-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:24:41,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:24:41,354 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:24:41,382 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:24:41,383 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:24:41,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:24:41,392 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:24:41,396 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:24:41,400 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:24:41,404 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:24:41,404 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:24:41,413 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:24:41,413 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:24:41,413 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:24:41,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:24:41,415 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:24:41,415 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:24:41,416 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:24:41,418 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:24:41,422 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:24:41,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:24:41,425 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:24:41,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:24:41,426 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:24:41,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:24:41,432 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:24:41,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:24:41,434 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:24:41,434 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:24:41,435 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:24:41,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:24:41,436 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:24:41,437 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:24:41,438 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:24:41,438 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:24:41,438 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:24:41,439 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:24:41,439 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:24:41,439 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:24:41,440 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:24:41,440 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:24:41,441 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:24:41,467 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:24:41,468 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:24:41,469 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:24:41,469 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:24:41,469 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:24:41,470 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:24:41,470 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:24:41,470 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:24:41,470 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:24:41,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:24:41,471 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:24:41,471 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:24:41,471 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:24:41,471 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:24:41,471 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:24:41,471 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:24:41,472 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:24:41,472 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:24:41,472 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:24:41,472 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:24:41,472 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:24:41,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:24:41,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:24:41,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:24:41,472 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:24:41,472 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:24:41,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:24:41,473 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:24:41,473 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 [2022-12-06 07:24:41,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:24:41,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:24:41,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:24:41,811 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:24:41,812 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:24:41,814 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-word-trans.wvr.c [2022-12-06 07:24:43,087 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:24:43,325 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:24:43,325 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-word-trans.wvr.c [2022-12-06 07:24:43,330 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11709a1ce/8155b6513505465eada12c7a3349f240/FLAGbfa26126a [2022-12-06 07:24:43,341 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11709a1ce/8155b6513505465eada12c7a3349f240 [2022-12-06 07:24:43,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:24:43,344 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:24:43,344 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:24:43,344 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:24:43,346 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:24:43,347 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:24:43" (1/1) ... [2022-12-06 07:24:43,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e1de4f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:43, skipping insertion in model container [2022-12-06 07:24:43,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:24:43" (1/1) ... [2022-12-06 07:24:43,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:24:43,366 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:24:43,530 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-word-trans.wvr.c[3292,3305] [2022-12-06 07:24:43,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:24:43,544 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:24:43,565 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-word-trans.wvr.c[3292,3305] [2022-12-06 07:24:43,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:24:43,582 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:24:43,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:43 WrapperNode [2022-12-06 07:24:43,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:24:43,584 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:24:43,584 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:24:43,584 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:24:43,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:43" (1/1) ... [2022-12-06 07:24:43,610 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:43" (1/1) ... [2022-12-06 07:24:43,636 INFO L138 Inliner]: procedures = 25, calls = 44, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 172 [2022-12-06 07:24:43,636 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:24:43,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:24:43,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:24:43,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:24:43,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:43" (1/1) ... [2022-12-06 07:24:43,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:43" (1/1) ... [2022-12-06 07:24:43,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:43" (1/1) ... [2022-12-06 07:24:43,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:43" (1/1) ... [2022-12-06 07:24:43,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:43" (1/1) ... [2022-12-06 07:24:43,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:43" (1/1) ... [2022-12-06 07:24:43,678 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:43" (1/1) ... [2022-12-06 07:24:43,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:43" (1/1) ... [2022-12-06 07:24:43,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:24:43,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:24:43,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:24:43,697 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:24:43,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:43" (1/1) ... [2022-12-06 07:24:43,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:24:43,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:24:43,741 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-12-06 07:24:43,753 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-12-06 07:24:43,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:24:43,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:24:43,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:24:43,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:24:43,777 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:24:43,777 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:24:43,777 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:24:43,777 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:24:43,777 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 07:24:43,777 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 07:24:43,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:24:43,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 07:24:43,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:24:43,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:24:43,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:24:43,779 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 07:24:43,912 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:24:43,913 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:24:44,150 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:24:44,157 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:24:44,157 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 07:24:44,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:24:44 BoogieIcfgContainer [2022-12-06 07:24:44,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:24:44,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:24:44,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:24:44,162 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:24:44,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:24:43" (1/3) ... [2022-12-06 07:24:44,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f67dcb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:24:44, skipping insertion in model container [2022-12-06 07:24:44,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:43" (2/3) ... [2022-12-06 07:24:44,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f67dcb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:24:44, skipping insertion in model container [2022-12-06 07:24:44,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:24:44" (3/3) ... [2022-12-06 07:24:44,164 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-word-trans.wvr.c [2022-12-06 07:24:44,176 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:24:44,176 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:24:44,176 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:24:44,295 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 07:24:44,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 264 places, 282 transitions, 588 flow [2022-12-06 07:24:44,412 INFO L130 PetriNetUnfolder]: 28/279 cut-off events. [2022-12-06 07:24:44,413 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:24:44,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 279 events. 28/279 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 368 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 223. Up to 3 conditions per place. [2022-12-06 07:24:44,421 INFO L82 GeneralOperation]: Start removeDead. Operand has 264 places, 282 transitions, 588 flow [2022-12-06 07:24:44,433 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 251 places, 269 transitions, 556 flow [2022-12-06 07:24:44,434 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:44,452 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 251 places, 269 transitions, 556 flow [2022-12-06 07:24:44,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 251 places, 269 transitions, 556 flow [2022-12-06 07:24:44,503 INFO L130 PetriNetUnfolder]: 28/269 cut-off events. [2022-12-06 07:24:44,503 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:24:44,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 269 events. 28/269 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 367 event pairs, 0 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 223. Up to 3 conditions per place. [2022-12-06 07:24:44,511 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 251 places, 269 transitions, 556 flow [2022-12-06 07:24:44,512 INFO L188 LiptonReduction]: Number of co-enabled transitions 7560 [2022-12-06 07:24:53,647 INFO L203 LiptonReduction]: Total number of compositions: 230 [2022-12-06 07:24:53,668 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:24:53,675 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=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@14c11525, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:24:53,675 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 07:24:53,692 INFO L130 PetriNetUnfolder]: 11/38 cut-off events. [2022-12-06 07:24:53,692 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:24:53,692 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:53,693 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:53,693 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-12-06 07:24:53,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:53,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1480647140, now seen corresponding path program 1 times [2022-12-06 07:24:53,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:53,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91597762] [2022-12-06 07:24:53,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:53,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:54,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:24:54,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:54,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91597762] [2022-12-06 07:24:54,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91597762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:24:54,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:24:54,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:24:54,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9885794] [2022-12-06 07:24:54,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:24:54,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:24:54,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:54,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:24:54,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:24:54,474 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 39 [2022-12-06 07:24:54,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 39 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:54,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:54,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 39 [2022-12-06 07:24:54,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:54,837 INFO L130 PetriNetUnfolder]: 1171/1614 cut-off events. [2022-12-06 07:24:54,837 INFO L131 PetriNetUnfolder]: For 97/97 co-relation queries the response was YES. [2022-12-06 07:24:54,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3347 conditions, 1614 events. 1171/1614 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6034 event pairs, 283 based on Foata normal form. 1/1101 useless extension candidates. Maximal degree in co-relation 2876. Up to 593 conditions per place. [2022-12-06 07:24:54,854 INFO L137 encePairwiseOnDemand]: 28/39 looper letters, 100 selfloop transitions, 18 changer transitions 2/121 dead transitions. [2022-12-06 07:24:54,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 121 transitions, 539 flow [2022-12-06 07:24:54,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:24:54,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:24:54,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2022-12-06 07:24:54,870 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46886446886446886 [2022-12-06 07:24:54,872 INFO L175 Difference]: Start difference. First operand has 38 places, 39 transitions, 96 flow. Second operand 7 states and 128 transitions. [2022-12-06 07:24:54,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 121 transitions, 539 flow [2022-12-06 07:24:54,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 121 transitions, 501 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 07:24:54,882 INFO L231 Difference]: Finished difference. Result has 42 places, 55 transitions, 196 flow [2022-12-06 07:24:54,884 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=196, PETRI_PLACES=42, PETRI_TRANSITIONS=55} [2022-12-06 07:24:54,887 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2022-12-06 07:24:54,888 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:54,888 INFO L89 Accepts]: Start accepts. Operand has 42 places, 55 transitions, 196 flow [2022-12-06 07:24:54,892 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:54,892 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:54,892 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 55 transitions, 196 flow [2022-12-06 07:24:54,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 55 transitions, 196 flow [2022-12-06 07:24:54,905 INFO L130 PetriNetUnfolder]: 30/97 cut-off events. [2022-12-06 07:24:54,905 INFO L131 PetriNetUnfolder]: For 16/18 co-relation queries the response was YES. [2022-12-06 07:24:54,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 97 events. 30/97 cut-off events. For 16/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 285 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 118. Up to 19 conditions per place. [2022-12-06 07:24:54,907 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 55 transitions, 196 flow [2022-12-06 07:24:54,907 INFO L188 LiptonReduction]: Number of co-enabled transitions 630 [2022-12-06 07:24:54,911 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] [2022-12-06 07:24:55,224 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1052] L49-6-->thread1EXIT: Formula: (and (let ((.cse1 (= |v_thread1Thread1of1ForFork0_#res.offset_17| 0)) (.cse2 (= |v_thread1Thread1of1ForFork0_#res.base_17| 0)) (.cse0 (= 0 (mod v_thread1Thread1of1ForFork0_~stop~0_41 256)))) (or (and (= (+ v_~n2~0_80 v_~res1~0_58) v_~n1~0_94) .cse0 .cse1 .cse2) (and .cse1 (= v_~res1~0_59 v_~res1~0_58) .cse2 (not .cse0)))) (or (not (< v_thread1Thread1of1ForFork0_~i~0_81 v_~n2~0_80)) (not (< v_thread1Thread1of1ForFork0_~i~0_81 v_~n1~0_94)))) InVars {~res1~0=v_~res1~0_59, ~n2~0=v_~n2~0_80, ~n1~0=v_~n1~0_94, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_81, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_41} OutVars{~res1~0=v_~res1~0_58, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_17|, ~n2~0=v_~n2~0_80, ~n1~0=v_~n1~0_94, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_81, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_17|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_41} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] [2022-12-06 07:24:55,653 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1055] L71-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= v_thread2Thread1of1ForFork1_~stop~1_35 1) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0) (= v_~res2~0_60 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_42| (select (select |v_#memory_int_304| v_~get3~0.base_81) (+ v_~get3~0.offset_81 (* v_thread2Thread1of1ForFork1_~i~1_83 4)))) (- 1) 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_42|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_35, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81, ~res2~0=v_~res2~0_60, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-06 07:24:55,902 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 07:24:56,141 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1053] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_19| 0) (= v_~res1~0_62 (ite (< |v_thread1Thread1of1ForFork0_#t~mem4_40| (select (select |v_#memory_int_298| v_~get2~0.base_87) (+ v_~get2~0.offset_87 (* v_thread1Thread1of1ForFork0_~i~0_83 4)))) (- 1) 1)) (= v_thread1Thread1of1ForFork0_~stop~0_43 1) (= |v_thread1Thread1of1ForFork0_#res.base_19| 0)) InVars {thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_40|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, ~get2~0.base=v_~get2~0.base_87} OutVars{~res1~0=v_~res1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_19|, thread1Thread1of1ForFork0_#t~mem5=|v_thread1Thread1of1ForFork0_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_19|, ~get2~0.base=v_~get2~0.base_87, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_43} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~mem5, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] [2022-12-06 07:24:56,303 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] [2022-12-06 07:24:56,537 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1054] L69-6-->thread2EXIT: Formula: (and (or (not (< v_thread2Thread1of1ForFork1_~i~1_81 v_~n3~0_88)) (not (< v_thread2Thread1of1ForFork1_~i~1_81 v_~n2~0_84))) (let ((.cse2 (= (mod v_thread2Thread1of1ForFork1_~stop~1_33 256) 0)) (.cse0 (= |v_thread2Thread1of1ForFork1_#res.offset_13| 0)) (.cse1 (= |v_thread2Thread1of1ForFork1_#res.base_13| 0))) (or (and .cse0 (= (+ v_~n3~0_88 v_~res2~0_56) v_~n2~0_84) .cse1 .cse2) (and (not .cse2) (= v_~res2~0_57 v_~res2~0_56) .cse0 .cse1)))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_81, ~n2~0=v_~n2~0_84, ~n3~0=v_~n3~0_88, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_33, ~res2~0=v_~res2~0_57} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_13|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_81, ~n2~0=v_~n2~0_84, ~n3~0=v_~n3~0_88, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_33, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_13|, ~res2~0=v_~res2~0_56} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 07:24:56,873 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] and [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] [2022-12-06 07:24:56,925 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:24:56,926 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2038 [2022-12-06 07:24:56,926 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 55 transitions, 223 flow [2022-12-06 07:24:56,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:56,926 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:56,926 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:56,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:24:56,927 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-12-06 07:24:56,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:56,927 INFO L85 PathProgramCache]: Analyzing trace with hash -404154940, now seen corresponding path program 2 times [2022-12-06 07:24:56,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:56,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409037749] [2022-12-06 07:24:56,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:56,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:57,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:24:57,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:57,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409037749] [2022-12-06 07:24:57,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409037749] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:24:57,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:24:57,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:24:57,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875785613] [2022-12-06 07:24:57,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:24:57,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:24:57,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:57,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:24:57,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:24:57,143 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 07:24:57,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 55 transitions, 223 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:57,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:57,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 07:24:57,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:57,467 INFO L130 PetriNetUnfolder]: 1281/1861 cut-off events. [2022-12-06 07:24:57,467 INFO L131 PetriNetUnfolder]: For 813/813 co-relation queries the response was YES. [2022-12-06 07:24:57,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5015 conditions, 1861 events. 1281/1861 cut-off events. For 813/813 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7923 event pairs, 273 based on Foata normal form. 1/1698 useless extension candidates. Maximal degree in co-relation 4535. Up to 813 conditions per place. [2022-12-06 07:24:57,477 INFO L137 encePairwiseOnDemand]: 32/47 looper letters, 90 selfloop transitions, 18 changer transitions 2/111 dead transitions. [2022-12-06 07:24:57,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 111 transitions, 612 flow [2022-12-06 07:24:57,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:24:57,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:24:57,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2022-12-06 07:24:57,479 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4297872340425532 [2022-12-06 07:24:57,480 INFO L175 Difference]: Start difference. First operand has 42 places, 55 transitions, 223 flow. Second operand 5 states and 101 transitions. [2022-12-06 07:24:57,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 111 transitions, 612 flow [2022-12-06 07:24:57,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 111 transitions, 586 flow, removed 13 selfloop flow, removed 1 redundant places. [2022-12-06 07:24:57,490 INFO L231 Difference]: Finished difference. Result has 48 places, 61 transitions, 301 flow [2022-12-06 07:24:57,490 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=301, PETRI_PLACES=48, PETRI_TRANSITIONS=61} [2022-12-06 07:24:57,491 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2022-12-06 07:24:57,491 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:57,491 INFO L89 Accepts]: Start accepts. Operand has 48 places, 61 transitions, 301 flow [2022-12-06 07:24:57,493 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:57,493 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:57,493 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 61 transitions, 301 flow [2022-12-06 07:24:57,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 61 transitions, 301 flow [2022-12-06 07:24:57,506 INFO L130 PetriNetUnfolder]: 44/170 cut-off events. [2022-12-06 07:24:57,506 INFO L131 PetriNetUnfolder]: For 85/95 co-relation queries the response was YES. [2022-12-06 07:24:57,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 170 events. 44/170 cut-off events. For 85/95 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 820 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 309. Up to 35 conditions per place. [2022-12-06 07:24:57,507 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 61 transitions, 301 flow [2022-12-06 07:24:57,507 INFO L188 LiptonReduction]: Number of co-enabled transitions 662 [2022-12-06 07:24:57,510 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:24:57,511 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 07:24:57,512 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 61 transitions, 301 flow [2022-12-06 07:24:57,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:57,512 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:57,512 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:57,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:24:57,512 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-12-06 07:24:57,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:57,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1255969656, now seen corresponding path program 3 times [2022-12-06 07:24:57,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:57,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79664018] [2022-12-06 07:24:57,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:57,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:57,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:24:57,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:57,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79664018] [2022-12-06 07:24:57,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79664018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:24:57,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:24:57,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:24:57,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697755525] [2022-12-06 07:24:57,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:24:57,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:24:57,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:57,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:24:57,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:24:57,823 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-06 07:24:57,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 61 transitions, 301 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:57,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:57,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-06 07:24:57,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:58,222 INFO L130 PetriNetUnfolder]: 1494/2210 cut-off events. [2022-12-06 07:24:58,223 INFO L131 PetriNetUnfolder]: For 2241/2241 co-relation queries the response was YES. [2022-12-06 07:24:58,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6766 conditions, 2210 events. 1494/2210 cut-off events. For 2241/2241 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 10065 event pairs, 355 based on Foata normal form. 1/2017 useless extension candidates. Maximal degree in co-relation 5952. Up to 913 conditions per place. [2022-12-06 07:24:58,233 INFO L137 encePairwiseOnDemand]: 28/45 looper letters, 97 selfloop transitions, 22 changer transitions 2/122 dead transitions. [2022-12-06 07:24:58,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 122 transitions, 757 flow [2022-12-06 07:24:58,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:24:58,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:24:58,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2022-12-06 07:24:58,236 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-06 07:24:58,236 INFO L175 Difference]: Start difference. First operand has 47 places, 61 transitions, 301 flow. Second operand 6 states and 117 transitions. [2022-12-06 07:24:58,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 122 transitions, 757 flow [2022-12-06 07:24:58,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 122 transitions, 716 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-06 07:24:58,245 INFO L231 Difference]: Finished difference. Result has 53 places, 64 transitions, 367 flow [2022-12-06 07:24:58,245 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=367, PETRI_PLACES=53, PETRI_TRANSITIONS=64} [2022-12-06 07:24:58,246 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2022-12-06 07:24:58,246 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:58,246 INFO L89 Accepts]: Start accepts. Operand has 53 places, 64 transitions, 367 flow [2022-12-06 07:24:58,247 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:58,247 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:58,247 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 64 transitions, 367 flow [2022-12-06 07:24:58,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 64 transitions, 367 flow [2022-12-06 07:24:58,262 INFO L130 PetriNetUnfolder]: 45/210 cut-off events. [2022-12-06 07:24:58,262 INFO L131 PetriNetUnfolder]: For 236/290 co-relation queries the response was YES. [2022-12-06 07:24:58,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 210 events. 45/210 cut-off events. For 236/290 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1193 event pairs, 0 based on Foata normal form. 1/184 useless extension candidates. Maximal degree in co-relation 390. Up to 35 conditions per place. [2022-12-06 07:24:58,264 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 64 transitions, 367 flow [2022-12-06 07:24:58,264 INFO L188 LiptonReduction]: Number of co-enabled transitions 696 [2022-12-06 07:24:58,267 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] [2022-12-06 07:24:58,471 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:24:58,472 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 226 [2022-12-06 07:24:58,472 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 64 transitions, 371 flow [2022-12-06 07:24:58,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:58,473 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:58,473 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:58,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:24:58,473 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-12-06 07:24:58,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:58,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1269268782, now seen corresponding path program 4 times [2022-12-06 07:24:58,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:58,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510947188] [2022-12-06 07:24:58,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:58,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:58,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:24:58,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:58,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510947188] [2022-12-06 07:24:58,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510947188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:24:58,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:24:58,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:24:58,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640999016] [2022-12-06 07:24:58,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:24:58,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:24:58,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:58,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:24:58,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:24:58,731 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 46 [2022-12-06 07:24:58,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 64 transitions, 371 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:58,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:58,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 46 [2022-12-06 07:24:58,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:59,206 INFO L130 PetriNetUnfolder]: 1541/2284 cut-off events. [2022-12-06 07:24:59,207 INFO L131 PetriNetUnfolder]: For 2894/2894 co-relation queries the response was YES. [2022-12-06 07:24:59,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7285 conditions, 2284 events. 1541/2284 cut-off events. For 2894/2894 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10362 event pairs, 669 based on Foata normal form. 1/2094 useless extension candidates. Maximal degree in co-relation 6697. Up to 1481 conditions per place. [2022-12-06 07:24:59,222 INFO L137 encePairwiseOnDemand]: 36/46 looper letters, 94 selfloop transitions, 15 changer transitions 2/112 dead transitions. [2022-12-06 07:24:59,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 112 transitions, 756 flow [2022-12-06 07:24:59,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:24:59,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:24:59,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2022-12-06 07:24:59,224 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4391304347826087 [2022-12-06 07:24:59,224 INFO L175 Difference]: Start difference. First operand has 53 places, 64 transitions, 371 flow. Second operand 5 states and 101 transitions. [2022-12-06 07:24:59,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 112 transitions, 756 flow [2022-12-06 07:24:59,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 112 transitions, 734 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 07:24:59,238 INFO L231 Difference]: Finished difference. Result has 59 places, 70 transitions, 458 flow [2022-12-06 07:24:59,239 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=458, PETRI_PLACES=59, PETRI_TRANSITIONS=70} [2022-12-06 07:24:59,240 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 21 predicate places. [2022-12-06 07:24:59,240 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:59,241 INFO L89 Accepts]: Start accepts. Operand has 59 places, 70 transitions, 458 flow [2022-12-06 07:24:59,242 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:59,242 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:59,242 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 70 transitions, 458 flow [2022-12-06 07:24:59,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 70 transitions, 458 flow [2022-12-06 07:24:59,263 INFO L130 PetriNetUnfolder]: 55/232 cut-off events. [2022-12-06 07:24:59,264 INFO L131 PetriNetUnfolder]: For 446/495 co-relation queries the response was YES. [2022-12-06 07:24:59,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 232 events. 55/232 cut-off events. For 446/495 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1327 event pairs, 0 based on Foata normal form. 1/200 useless extension candidates. Maximal degree in co-relation 516. Up to 41 conditions per place. [2022-12-06 07:24:59,266 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 70 transitions, 458 flow [2022-12-06 07:24:59,266 INFO L188 LiptonReduction]: Number of co-enabled transitions 788 [2022-12-06 07:24:59,269 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:24:59,276 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-06 07:24:59,276 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 70 transitions, 458 flow [2022-12-06 07:24:59,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:59,277 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:59,277 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:59,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 07:24:59,277 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-12-06 07:24:59,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:59,278 INFO L85 PathProgramCache]: Analyzing trace with hash -726260692, now seen corresponding path program 5 times [2022-12-06 07:24:59,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:59,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572954637] [2022-12-06 07:24:59,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:59,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:59,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:24:59,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:59,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572954637] [2022-12-06 07:24:59,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572954637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:24:59,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:24:59,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:24:59,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116376124] [2022-12-06 07:24:59,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:24:59,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:24:59,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:59,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:24:59,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:24:59,537 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-06 07:24:59,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 70 transitions, 458 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:59,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:59,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-06 07:24:59,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:59,943 INFO L130 PetriNetUnfolder]: 1634/2443 cut-off events. [2022-12-06 07:24:59,944 INFO L131 PetriNetUnfolder]: For 4663/4663 co-relation queries the response was YES. [2022-12-06 07:24:59,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8455 conditions, 2443 events. 1634/2443 cut-off events. For 4663/4663 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 11628 event pairs, 277 based on Foata normal form. 1/2250 useless extension candidates. Maximal degree in co-relation 7655. Up to 1369 conditions per place. [2022-12-06 07:24:59,959 INFO L137 encePairwiseOnDemand]: 27/45 looper letters, 117 selfloop transitions, 29 changer transitions 1/148 dead transitions. [2022-12-06 07:24:59,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 148 transitions, 1061 flow [2022-12-06 07:24:59,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:24:59,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:24:59,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2022-12-06 07:24:59,960 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-06 07:24:59,961 INFO L175 Difference]: Start difference. First operand has 58 places, 70 transitions, 458 flow. Second operand 6 states and 126 transitions. [2022-12-06 07:24:59,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 148 transitions, 1061 flow [2022-12-06 07:24:59,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 148 transitions, 1021 flow, removed 20 selfloop flow, removed 1 redundant places. [2022-12-06 07:24:59,988 INFO L231 Difference]: Finished difference. Result has 66 places, 86 transitions, 677 flow [2022-12-06 07:24:59,988 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=677, PETRI_PLACES=66, PETRI_TRANSITIONS=86} [2022-12-06 07:24:59,992 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 28 predicate places. [2022-12-06 07:24:59,992 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:59,992 INFO L89 Accepts]: Start accepts. Operand has 66 places, 86 transitions, 677 flow [2022-12-06 07:24:59,993 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:59,994 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:59,994 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 86 transitions, 677 flow [2022-12-06 07:24:59,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 86 transitions, 677 flow [2022-12-06 07:25:00,018 INFO L130 PetriNetUnfolder]: 79/319 cut-off events. [2022-12-06 07:25:00,018 INFO L131 PetriNetUnfolder]: For 749/793 co-relation queries the response was YES. [2022-12-06 07:25:00,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 893 conditions, 319 events. 79/319 cut-off events. For 749/793 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2093 event pairs, 0 based on Foata normal form. 6/286 useless extension candidates. Maximal degree in co-relation 707. Up to 55 conditions per place. [2022-12-06 07:25:00,021 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 86 transitions, 677 flow [2022-12-06 07:25:00,021 INFO L188 LiptonReduction]: Number of co-enabled transitions 960 [2022-12-06 07:25:00,023 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:00,023 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-06 07:25:00,023 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 86 transitions, 677 flow [2022-12-06 07:25:00,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:00,024 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:00,024 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:00,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 07:25:00,024 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-12-06 07:25:00,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:00,025 INFO L85 PathProgramCache]: Analyzing trace with hash -810105417, now seen corresponding path program 1 times [2022-12-06 07:25:00,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:00,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288067909] [2022-12-06 07:25:00,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:00,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:00,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:00,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:00,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288067909] [2022-12-06 07:25:00,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288067909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:00,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:00,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:00,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884197282] [2022-12-06 07:25:00,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:00,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:25:00,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:00,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:25:00,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:25:00,186 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-06 07:25:00,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 86 transitions, 677 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:00,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:00,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-06 07:25:00,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:00,528 INFO L130 PetriNetUnfolder]: 1672/2541 cut-off events. [2022-12-06 07:25:00,528 INFO L131 PetriNetUnfolder]: For 6135/6135 co-relation queries the response was YES. [2022-12-06 07:25:00,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9523 conditions, 2541 events. 1672/2541 cut-off events. For 6135/6135 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 12376 event pairs, 205 based on Foata normal form. 1/2426 useless extension candidates. Maximal degree in co-relation 8244. Up to 980 conditions per place. [2022-12-06 07:25:00,550 INFO L137 encePairwiseOnDemand]: 27/45 looper letters, 137 selfloop transitions, 37 changer transitions 7/182 dead transitions. [2022-12-06 07:25:00,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 182 transitions, 1538 flow [2022-12-06 07:25:00,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:25:00,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:25:00,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2022-12-06 07:25:00,551 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4507936507936508 [2022-12-06 07:25:00,551 INFO L175 Difference]: Start difference. First operand has 66 places, 86 transitions, 677 flow. Second operand 7 states and 142 transitions. [2022-12-06 07:25:00,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 182 transitions, 1538 flow [2022-12-06 07:25:00,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 182 transitions, 1526 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-12-06 07:25:00,568 INFO L231 Difference]: Finished difference. Result has 75 places, 101 transitions, 949 flow [2022-12-06 07:25:00,568 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=949, PETRI_PLACES=75, PETRI_TRANSITIONS=101} [2022-12-06 07:25:00,569 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 37 predicate places. [2022-12-06 07:25:00,569 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:00,569 INFO L89 Accepts]: Start accepts. Operand has 75 places, 101 transitions, 949 flow [2022-12-06 07:25:00,570 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:00,570 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:00,570 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 101 transitions, 949 flow [2022-12-06 07:25:00,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 101 transitions, 949 flow [2022-12-06 07:25:00,607 INFO L130 PetriNetUnfolder]: 89/340 cut-off events. [2022-12-06 07:25:00,608 INFO L131 PetriNetUnfolder]: For 1199/1251 co-relation queries the response was YES. [2022-12-06 07:25:00,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 340 events. 89/340 cut-off events. For 1199/1251 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2192 event pairs, 1 based on Foata normal form. 3/309 useless extension candidates. Maximal degree in co-relation 817. Up to 57 conditions per place. [2022-12-06 07:25:00,610 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 101 transitions, 949 flow [2022-12-06 07:25:00,610 INFO L188 LiptonReduction]: Number of co-enabled transitions 1070 [2022-12-06 07:25:00,612 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:00,612 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-06 07:25:00,612 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 101 transitions, 949 flow [2022-12-06 07:25:00,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:00,612 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:00,613 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:00,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 07:25:00,613 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-12-06 07:25:00,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:00,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1050640634, now seen corresponding path program 6 times [2022-12-06 07:25:00,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:00,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174339129] [2022-12-06 07:25:00,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:00,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:00,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:00,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:00,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174339129] [2022-12-06 07:25:00,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174339129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:00,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:00,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:00,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453561154] [2022-12-06 07:25:00,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:00,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:25:00,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:00,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:25:00,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:25:00,763 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-06 07:25:00,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 101 transitions, 949 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:00,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:00,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-06 07:25:00,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:01,187 INFO L130 PetriNetUnfolder]: 1694/2546 cut-off events. [2022-12-06 07:25:01,187 INFO L131 PetriNetUnfolder]: For 9291/9291 co-relation queries the response was YES. [2022-12-06 07:25:01,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10176 conditions, 2546 events. 1694/2546 cut-off events. For 9291/9291 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 12221 event pairs, 173 based on Foata normal form. 1/2473 useless extension candidates. Maximal degree in co-relation 8825. Up to 1027 conditions per place. [2022-12-06 07:25:01,200 INFO L137 encePairwiseOnDemand]: 27/45 looper letters, 129 selfloop transitions, 48 changer transitions 2/180 dead transitions. [2022-12-06 07:25:01,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 180 transitions, 1603 flow [2022-12-06 07:25:01,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:25:01,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:25:01,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2022-12-06 07:25:01,202 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2022-12-06 07:25:01,202 INFO L175 Difference]: Start difference. First operand has 75 places, 101 transitions, 949 flow. Second operand 7 states and 144 transitions. [2022-12-06 07:25:01,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 180 transitions, 1603 flow [2022-12-06 07:25:01,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 180 transitions, 1539 flow, removed 20 selfloop flow, removed 2 redundant places. [2022-12-06 07:25:01,226 INFO L231 Difference]: Finished difference. Result has 82 places, 109 transitions, 1100 flow [2022-12-06 07:25:01,226 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1100, PETRI_PLACES=82, PETRI_TRANSITIONS=109} [2022-12-06 07:25:01,227 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 44 predicate places. [2022-12-06 07:25:01,227 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:01,227 INFO L89 Accepts]: Start accepts. Operand has 82 places, 109 transitions, 1100 flow [2022-12-06 07:25:01,228 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:01,228 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:01,228 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 109 transitions, 1100 flow [2022-12-06 07:25:01,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 109 transitions, 1100 flow [2022-12-06 07:25:01,251 INFO L130 PetriNetUnfolder]: 96/345 cut-off events. [2022-12-06 07:25:01,251 INFO L131 PetriNetUnfolder]: For 1337/1402 co-relation queries the response was YES. [2022-12-06 07:25:01,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1167 conditions, 345 events. 96/345 cut-off events. For 1337/1402 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2177 event pairs, 1 based on Foata normal form. 2/310 useless extension candidates. Maximal degree in co-relation 969. Up to 63 conditions per place. [2022-12-06 07:25:01,254 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 109 transitions, 1100 flow [2022-12-06 07:25:01,254 INFO L188 LiptonReduction]: Number of co-enabled transitions 1130 [2022-12-06 07:25:01,256 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:01,257 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 07:25:01,257 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 109 transitions, 1100 flow [2022-12-06 07:25:01,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:01,257 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:01,257 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:01,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 07:25:01,258 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-12-06 07:25:01,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:01,258 INFO L85 PathProgramCache]: Analyzing trace with hash 722248821, now seen corresponding path program 1 times [2022-12-06 07:25:01,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:01,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899896660] [2022-12-06 07:25:01,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:01,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:01,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:01,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:01,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899896660] [2022-12-06 07:25:01,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899896660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:01,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:01,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:01,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407774065] [2022-12-06 07:25:01,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:01,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:25:01,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:01,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:25:01,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:25:01,413 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-06 07:25:01,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 109 transitions, 1100 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:01,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:01,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-06 07:25:01,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:01,830 INFO L130 PetriNetUnfolder]: 1709/2597 cut-off events. [2022-12-06 07:25:01,830 INFO L131 PetriNetUnfolder]: For 10776/10776 co-relation queries the response was YES. [2022-12-06 07:25:01,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11023 conditions, 2597 events. 1709/2597 cut-off events. For 10776/10776 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 12791 event pairs, 311 based on Foata normal form. 1/2514 useless extension candidates. Maximal degree in co-relation 10051. Up to 574 conditions per place. [2022-12-06 07:25:01,849 INFO L137 encePairwiseOnDemand]: 30/45 looper letters, 143 selfloop transitions, 56 changer transitions 8/208 dead transitions. [2022-12-06 07:25:01,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 208 transitions, 2051 flow [2022-12-06 07:25:01,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:25:01,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:25:01,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2022-12-06 07:25:01,851 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2022-12-06 07:25:01,851 INFO L175 Difference]: Start difference. First operand has 82 places, 109 transitions, 1100 flow. Second operand 7 states and 145 transitions. [2022-12-06 07:25:01,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 208 transitions, 2051 flow [2022-12-06 07:25:01,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 208 transitions, 1991 flow, removed 19 selfloop flow, removed 2 redundant places. [2022-12-06 07:25:01,890 INFO L231 Difference]: Finished difference. Result has 89 places, 125 transitions, 1389 flow [2022-12-06 07:25:01,890 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1389, PETRI_PLACES=89, PETRI_TRANSITIONS=125} [2022-12-06 07:25:01,892 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 51 predicate places. [2022-12-06 07:25:01,892 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:01,892 INFO L89 Accepts]: Start accepts. Operand has 89 places, 125 transitions, 1389 flow [2022-12-06 07:25:01,893 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:01,893 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:01,893 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 125 transitions, 1389 flow [2022-12-06 07:25:01,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 125 transitions, 1389 flow [2022-12-06 07:25:01,921 INFO L130 PetriNetUnfolder]: 103/360 cut-off events. [2022-12-06 07:25:01,921 INFO L131 PetriNetUnfolder]: For 1774/1853 co-relation queries the response was YES. [2022-12-06 07:25:01,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1332 conditions, 360 events. 103/360 cut-off events. For 1774/1853 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2272 event pairs, 3 based on Foata normal form. 7/329 useless extension candidates. Maximal degree in co-relation 1121. Up to 69 conditions per place. [2022-12-06 07:25:01,924 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 125 transitions, 1389 flow [2022-12-06 07:25:01,924 INFO L188 LiptonReduction]: Number of co-enabled transitions 1198 [2022-12-06 07:25:01,926 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:01,928 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-06 07:25:01,928 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 125 transitions, 1389 flow [2022-12-06 07:25:01,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:01,928 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:01,928 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:01,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 07:25:01,928 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-12-06 07:25:01,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:01,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1452685032, now seen corresponding path program 1 times [2022-12-06 07:25:01,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:01,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387726754] [2022-12-06 07:25:01,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:01,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:02,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:02,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:02,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387726754] [2022-12-06 07:25:02,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387726754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:02,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:02,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:02,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853470555] [2022-12-06 07:25:02,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:02,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:25:02,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:02,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:25:02,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:25:02,107 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-06 07:25:02,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 125 transitions, 1389 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:02,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:02,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-06 07:25:02,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:03,233 INFO L130 PetriNetUnfolder]: 5562/8507 cut-off events. [2022-12-06 07:25:03,234 INFO L131 PetriNetUnfolder]: For 49448/49448 co-relation queries the response was YES. [2022-12-06 07:25:03,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38680 conditions, 8507 events. 5562/8507 cut-off events. For 49448/49448 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 51705 event pairs, 1124 based on Foata normal form. 20/8306 useless extension candidates. Maximal degree in co-relation 35014. Up to 1492 conditions per place. [2022-12-06 07:25:03,291 INFO L137 encePairwiseOnDemand]: 32/45 looper letters, 414 selfloop transitions, 81 changer transitions 46/542 dead transitions. [2022-12-06 07:25:03,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 542 transitions, 6692 flow [2022-12-06 07:25:03,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:25:03,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:25:03,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 282 transitions. [2022-12-06 07:25:03,294 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2022-12-06 07:25:03,294 INFO L175 Difference]: Start difference. First operand has 89 places, 125 transitions, 1389 flow. Second operand 12 states and 282 transitions. [2022-12-06 07:25:03,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 542 transitions, 6692 flow [2022-12-06 07:25:03,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 542 transitions, 6431 flow, removed 126 selfloop flow, removed 1 redundant places. [2022-12-06 07:25:03,529 INFO L231 Difference]: Finished difference. Result has 103 places, 177 transitions, 2227 flow [2022-12-06 07:25:03,529 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1334, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2227, PETRI_PLACES=103, PETRI_TRANSITIONS=177} [2022-12-06 07:25:03,530 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 65 predicate places. [2022-12-06 07:25:03,530 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:03,530 INFO L89 Accepts]: Start accepts. Operand has 103 places, 177 transitions, 2227 flow [2022-12-06 07:25:03,531 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:03,531 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:03,532 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 177 transitions, 2227 flow [2022-12-06 07:25:03,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 177 transitions, 2227 flow [2022-12-06 07:25:03,663 INFO L130 PetriNetUnfolder]: 274/1040 cut-off events. [2022-12-06 07:25:03,663 INFO L131 PetriNetUnfolder]: For 5096/5294 co-relation queries the response was YES. [2022-12-06 07:25:03,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3830 conditions, 1040 events. 274/1040 cut-off events. For 5096/5294 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 8874 event pairs, 9 based on Foata normal form. 23/964 useless extension candidates. Maximal degree in co-relation 3320. Up to 158 conditions per place. [2022-12-06 07:25:03,683 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 177 transitions, 2227 flow [2022-12-06 07:25:03,683 INFO L188 LiptonReduction]: Number of co-enabled transitions 1634 [2022-12-06 07:25:09,453 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:25:09,454 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5924 [2022-12-06 07:25:09,454 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 177 transitions, 2265 flow [2022-12-06 07:25:09,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:09,454 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:09,454 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:09,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 07:25:09,455 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-12-06 07:25:09,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:09,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1963135850, now seen corresponding path program 1 times [2022-12-06 07:25:09,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:09,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824998404] [2022-12-06 07:25:09,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:09,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:09,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:09,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:09,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824998404] [2022-12-06 07:25:09,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824998404] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:09,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:09,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:09,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32214824] [2022-12-06 07:25:09,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:09,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:25:09,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:09,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:25:09,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:25:09,600 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 48 [2022-12-06 07:25:09,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 177 transitions, 2265 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:09,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:09,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 48 [2022-12-06 07:25:09,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:10,562 INFO L130 PetriNetUnfolder]: 5418/8476 cut-off events. [2022-12-06 07:25:10,562 INFO L131 PetriNetUnfolder]: For 42468/42468 co-relation queries the response was YES. [2022-12-06 07:25:10,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36839 conditions, 8476 events. 5418/8476 cut-off events. For 42468/42468 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 53063 event pairs, 713 based on Foata normal form. 3/8266 useless extension candidates. Maximal degree in co-relation 34075. Up to 2443 conditions per place. [2022-12-06 07:25:10,641 INFO L137 encePairwiseOnDemand]: 30/48 looper letters, 181 selfloop transitions, 123 changer transitions 5/310 dead transitions. [2022-12-06 07:25:10,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 310 transitions, 4166 flow [2022-12-06 07:25:10,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:25:10,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:25:10,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2022-12-06 07:25:10,642 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4226190476190476 [2022-12-06 07:25:10,642 INFO L175 Difference]: Start difference. First operand has 103 places, 177 transitions, 2265 flow. Second operand 7 states and 142 transitions. [2022-12-06 07:25:10,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 310 transitions, 4166 flow [2022-12-06 07:25:10,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 310 transitions, 4048 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:10,915 INFO L231 Difference]: Finished difference. Result has 109 places, 223 transitions, 3318 flow [2022-12-06 07:25:10,915 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2193, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3318, PETRI_PLACES=109, PETRI_TRANSITIONS=223} [2022-12-06 07:25:10,915 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 71 predicate places. [2022-12-06 07:25:10,916 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:10,916 INFO L89 Accepts]: Start accepts. Operand has 109 places, 223 transitions, 3318 flow [2022-12-06 07:25:10,917 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:10,917 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:10,917 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 223 transitions, 3318 flow [2022-12-06 07:25:10,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 223 transitions, 3318 flow [2022-12-06 07:25:11,007 INFO L130 PetriNetUnfolder]: 317/1218 cut-off events. [2022-12-06 07:25:11,007 INFO L131 PetriNetUnfolder]: For 8108/8497 co-relation queries the response was YES. [2022-12-06 07:25:11,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4748 conditions, 1218 events. 317/1218 cut-off events. For 8108/8497 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 11003 event pairs, 6 based on Foata normal form. 29/1154 useless extension candidates. Maximal degree in co-relation 4125. Up to 191 conditions per place. [2022-12-06 07:25:11,018 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 223 transitions, 3318 flow [2022-12-06 07:25:11,018 INFO L188 LiptonReduction]: Number of co-enabled transitions 1802 [2022-12-06 07:25:11,023 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:11,023 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-06 07:25:11,023 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 223 transitions, 3318 flow [2022-12-06 07:25:11,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:11,023 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:11,024 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:11,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 07:25:11,024 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-12-06 07:25:11,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:11,024 INFO L85 PathProgramCache]: Analyzing trace with hash -2040974071, now seen corresponding path program 1 times [2022-12-06 07:25:11,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:11,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177536173] [2022-12-06 07:25:11,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:11,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:11,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:11,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:11,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177536173] [2022-12-06 07:25:11,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177536173] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:11,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:11,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:11,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068679423] [2022-12-06 07:25:11,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:11,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:25:11,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:11,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:25:11,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:25:11,127 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 07:25:11,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 223 transitions, 3318 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:11,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:11,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 07:25:11,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:12,061 INFO L130 PetriNetUnfolder]: 5346/8300 cut-off events. [2022-12-06 07:25:12,062 INFO L131 PetriNetUnfolder]: For 47791/47791 co-relation queries the response was YES. [2022-12-06 07:25:12,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38246 conditions, 8300 events. 5346/8300 cut-off events. For 47791/47791 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 50863 event pairs, 1958 based on Foata normal form. 3/8046 useless extension candidates. Maximal degree in co-relation 35298. Up to 5033 conditions per place. [2022-12-06 07:25:12,115 INFO L137 encePairwiseOnDemand]: 40/47 looper letters, 220 selfloop transitions, 50 changer transitions 4/275 dead transitions. [2022-12-06 07:25:12,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 275 transitions, 4127 flow [2022-12-06 07:25:12,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:25:12,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:25:12,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2022-12-06 07:25:12,116 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44680851063829785 [2022-12-06 07:25:12,116 INFO L175 Difference]: Start difference. First operand has 108 places, 223 transitions, 3318 flow. Second operand 5 states and 105 transitions. [2022-12-06 07:25:12,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 275 transitions, 4127 flow [2022-12-06 07:25:12,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 275 transitions, 4019 flow, removed 54 selfloop flow, removed 1 redundant places. [2022-12-06 07:25:12,404 INFO L231 Difference]: Finished difference. Result has 114 places, 226 transitions, 3424 flow [2022-12-06 07:25:12,404 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3214, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3424, PETRI_PLACES=114, PETRI_TRANSITIONS=226} [2022-12-06 07:25:12,405 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 76 predicate places. [2022-12-06 07:25:12,405 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:12,405 INFO L89 Accepts]: Start accepts. Operand has 114 places, 226 transitions, 3424 flow [2022-12-06 07:25:12,406 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:12,406 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:12,407 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 226 transitions, 3424 flow [2022-12-06 07:25:12,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 226 transitions, 3424 flow [2022-12-06 07:25:12,516 INFO L130 PetriNetUnfolder]: 304/1210 cut-off events. [2022-12-06 07:25:12,516 INFO L131 PetriNetUnfolder]: For 8115/8324 co-relation queries the response was YES. [2022-12-06 07:25:12,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4741 conditions, 1210 events. 304/1210 cut-off events. For 8115/8324 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 11078 event pairs, 3 based on Foata normal form. 30/1156 useless extension candidates. Maximal degree in co-relation 4375. Up to 185 conditions per place. [2022-12-06 07:25:12,527 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 226 transitions, 3424 flow [2022-12-06 07:25:12,527 INFO L188 LiptonReduction]: Number of co-enabled transitions 1812 [2022-12-06 07:25:12,531 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:12,532 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-06 07:25:12,532 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 226 transitions, 3424 flow [2022-12-06 07:25:12,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:12,532 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:12,532 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:12,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 07:25:12,532 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-12-06 07:25:12,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:12,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1681893315, now seen corresponding path program 2 times [2022-12-06 07:25:12,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:12,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688452178] [2022-12-06 07:25:12,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:12,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:12,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:12,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:12,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688452178] [2022-12-06 07:25:12,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688452178] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:12,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:12,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:25:12,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595055317] [2022-12-06 07:25:12,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:12,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:25:12,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:12,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:25:12,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:25:12,740 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 07:25:12,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 226 transitions, 3424 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:12,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:12,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 07:25:12,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:13,787 INFO L130 PetriNetUnfolder]: 5244/8117 cut-off events. [2022-12-06 07:25:13,788 INFO L131 PetriNetUnfolder]: For 49451/49451 co-relation queries the response was YES. [2022-12-06 07:25:13,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37603 conditions, 8117 events. 5244/8117 cut-off events. For 49451/49451 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 49109 event pairs, 1296 based on Foata normal form. 3/7878 useless extension candidates. Maximal degree in co-relation 35692. Up to 2868 conditions per place. [2022-12-06 07:25:13,846 INFO L137 encePairwiseOnDemand]: 30/47 looper letters, 186 selfloop transitions, 108 changer transitions 4/299 dead transitions. [2022-12-06 07:25:13,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 299 transitions, 4431 flow [2022-12-06 07:25:13,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:25:13,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:25:13,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2022-12-06 07:25:13,847 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3860182370820669 [2022-12-06 07:25:13,847 INFO L175 Difference]: Start difference. First operand has 114 places, 226 transitions, 3424 flow. Second operand 7 states and 127 transitions. [2022-12-06 07:25:13,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 299 transitions, 4431 flow [2022-12-06 07:25:14,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 299 transitions, 4379 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-06 07:25:14,180 INFO L231 Difference]: Finished difference. Result has 121 places, 238 transitions, 3850 flow [2022-12-06 07:25:14,180 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3374, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3850, PETRI_PLACES=121, PETRI_TRANSITIONS=238} [2022-12-06 07:25:14,181 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 83 predicate places. [2022-12-06 07:25:14,181 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:14,181 INFO L89 Accepts]: Start accepts. Operand has 121 places, 238 transitions, 3850 flow [2022-12-06 07:25:14,182 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:14,182 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:14,182 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 238 transitions, 3850 flow [2022-12-06 07:25:14,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 238 transitions, 3850 flow [2022-12-06 07:25:14,275 INFO L130 PetriNetUnfolder]: 315/1206 cut-off events. [2022-12-06 07:25:14,275 INFO L131 PetriNetUnfolder]: For 8793/9009 co-relation queries the response was YES. [2022-12-06 07:25:14,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5103 conditions, 1206 events. 315/1206 cut-off events. For 8793/9009 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 10882 event pairs, 3 based on Foata normal form. 36/1158 useless extension candidates. Maximal degree in co-relation 4820. Up to 185 conditions per place. [2022-12-06 07:25:14,287 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 238 transitions, 3850 flow [2022-12-06 07:25:14,287 INFO L188 LiptonReduction]: Number of co-enabled transitions 1812 [2022-12-06 07:25:14,291 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:14,292 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-06 07:25:14,292 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 238 transitions, 3850 flow [2022-12-06 07:25:14,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:14,292 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:14,292 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:14,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 07:25:14,292 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:14,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:14,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1206726507, now seen corresponding path program 1 times [2022-12-06 07:25:14,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:14,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599791533] [2022-12-06 07:25:14,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:14,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:14,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:14,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:14,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599791533] [2022-12-06 07:25:14,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599791533] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:14,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:14,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:14,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557084351] [2022-12-06 07:25:14,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:14,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:25:14,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:14,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:25:14,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:25:14,461 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 07:25:14,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 238 transitions, 3850 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:14,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:14,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 07:25:14,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:15,435 INFO L130 PetriNetUnfolder]: 5226/8045 cut-off events. [2022-12-06 07:25:15,436 INFO L131 PetriNetUnfolder]: For 53101/53101 co-relation queries the response was YES. [2022-12-06 07:25:15,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39325 conditions, 8045 events. 5226/8045 cut-off events. For 53101/53101 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 48422 event pairs, 1506 based on Foata normal form. 3/7791 useless extension candidates. Maximal degree in co-relation 37742. Up to 2680 conditions per place. [2022-12-06 07:25:15,483 INFO L137 encePairwiseOnDemand]: 30/47 looper letters, 154 selfloop transitions, 140 changer transitions 6/301 dead transitions. [2022-12-06 07:25:15,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 301 transitions, 4705 flow [2022-12-06 07:25:15,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:25:15,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:25:15,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2022-12-06 07:25:15,484 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41033434650455924 [2022-12-06 07:25:15,484 INFO L175 Difference]: Start difference. First operand has 121 places, 238 transitions, 3850 flow. Second operand 7 states and 135 transitions. [2022-12-06 07:25:15,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 301 transitions, 4705 flow [2022-12-06 07:25:15,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 301 transitions, 4630 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:15,712 INFO L231 Difference]: Finished difference. Result has 126 places, 238 transitions, 4070 flow [2022-12-06 07:25:15,713 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3779, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4070, PETRI_PLACES=126, PETRI_TRANSITIONS=238} [2022-12-06 07:25:15,713 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 88 predicate places. [2022-12-06 07:25:15,713 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:15,713 INFO L89 Accepts]: Start accepts. Operand has 126 places, 238 transitions, 4070 flow [2022-12-06 07:25:15,714 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:15,714 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:15,714 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 238 transitions, 4070 flow [2022-12-06 07:25:15,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 238 transitions, 4070 flow [2022-12-06 07:25:15,805 INFO L130 PetriNetUnfolder]: 309/1179 cut-off events. [2022-12-06 07:25:15,805 INFO L131 PetriNetUnfolder]: For 10091/10315 co-relation queries the response was YES. [2022-12-06 07:25:15,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5145 conditions, 1179 events. 309/1179 cut-off events. For 10091/10315 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 10531 event pairs, 3 based on Foata normal form. 35/1133 useless extension candidates. Maximal degree in co-relation 4804. Up to 185 conditions per place. [2022-12-06 07:25:15,817 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 238 transitions, 4070 flow [2022-12-06 07:25:15,817 INFO L188 LiptonReduction]: Number of co-enabled transitions 1806 [2022-12-06 07:25:15,837 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1061] L89-6-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_27| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_27| 0) (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_25| 0)) (.cse1 (= |v_thread3Thread1of1ForFork2_#res.offset_25| 0)) (.cse2 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_61 256)))) (or (and (= v_~n1~0_108 (+ v_~res3~0_76 v_~n3~0_102)) .cse0 .cse1 .cse2) (and .cse0 .cse1 (= v_~res3~0_78 v_~res3~0_76) (not .cse2)))) (let ((.cse6 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n3~0_102)) (.cse5 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n1~0_108))) (or (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_65 4))) (let ((.cse3 (select (select |v_#memory_int_332| v_~get1~0.base_91) (+ v_~get1~0.offset_91 .cse7))) (.cse4 (select (select |v_#memory_int_332| v_~get3~0.base_95) (+ v_~get3~0.offset_95 .cse7)))) (and (not (= .cse3 .cse4)) .cse5 (= v_thread3Thread1of1ForFork2_~stop~2_61 1) (= v_~res3~0_78 (ite (< .cse3 .cse4) (- 1) 1)) .cse6))) (and (= |v_thread3Thread1of1ForFork2_#t~mem12_68| |v_thread3Thread1of1ForFork2_#t~mem12_67|) (or (not .cse6) (not .cse5)) (= |v_thread3Thread1of1ForFork2_#t~mem15_50| |v_thread3Thread1of1ForFork2_#t~mem15_49|) (= |v_thread3Thread1of1ForFork2_#t~mem13_70| |v_thread3Thread1of1ForFork2_#t~mem13_69|) (= v_~res3~0_78 v_~res3~0_77) (= |v_thread3Thread1of1ForFork2_#t~mem14_54| |v_thread3Thread1of1ForFork2_#t~mem14_53|) (= v_thread3Thread1of1ForFork2_~stop~2_62 v_thread3Thread1of1ForFork2_~stop~2_61)))) (= v_~res1~0_74 (ite (< v_~count2~0_61 v_~count1~0_69) 1 (- 1))) (not (= v_~count1~0_69 v_~count2~0_61)) (= v_thread1Thread1of1ForFork0_~stop~0_51 0)) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_70|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_68|, ~get3~0.base=v_~get3~0.base_95, ~n3~0=v_~n3~0_102, ~count2~0=v_~count2~0_61, ~n1~0=v_~n1~0_108, ~count1~0=v_~count1~0_69, ~get3~0.offset=v_~get3~0.offset_95, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_50|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_54|, ~get1~0.base=v_~get1~0.base_91, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_62, #memory_int=|v_#memory_int_332|, ~get1~0.offset=v_~get1~0.offset_91, ~res3~0=v_~res3~0_77} OutVars{~res1~0=v_~res1~0_74, thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_69|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_67|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_27|, ~get3~0.base=v_~get3~0.base_95, ~n3~0=v_~n3~0_102, ~count2~0=v_~count2~0_61, ~n1~0=v_~n1~0_108, ~count1~0=v_~count1~0_69, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_25|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_27|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_25|, ~get3~0.offset=v_~get3~0.offset_95, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_49|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_53|, ~get1~0.base=v_~get1~0.base_91, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_61, #memory_int=|v_#memory_int_332|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_51, ~get1~0.offset=v_~get1~0.offset_91, ~res3~0=v_~res3~0_76} AuxVars[v_~res3~0_78] AssignedVars[~res1~0, thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread1Thread1of1ForFork0_#res.base, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork0_~stop~0, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 07:25:16,078 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 07:25:16,123 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 07:25:16,167 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 07:25:16,205 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 07:25:16,244 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 07:25:16,282 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1061] L89-6-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_27| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_27| 0) (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_25| 0)) (.cse1 (= |v_thread3Thread1of1ForFork2_#res.offset_25| 0)) (.cse2 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_61 256)))) (or (and (= v_~n1~0_108 (+ v_~res3~0_76 v_~n3~0_102)) .cse0 .cse1 .cse2) (and .cse0 .cse1 (= v_~res3~0_78 v_~res3~0_76) (not .cse2)))) (let ((.cse6 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n3~0_102)) (.cse5 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n1~0_108))) (or (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_65 4))) (let ((.cse3 (select (select |v_#memory_int_332| v_~get1~0.base_91) (+ v_~get1~0.offset_91 .cse7))) (.cse4 (select (select |v_#memory_int_332| v_~get3~0.base_95) (+ v_~get3~0.offset_95 .cse7)))) (and (not (= .cse3 .cse4)) .cse5 (= v_thread3Thread1of1ForFork2_~stop~2_61 1) (= v_~res3~0_78 (ite (< .cse3 .cse4) (- 1) 1)) .cse6))) (and (= |v_thread3Thread1of1ForFork2_#t~mem12_68| |v_thread3Thread1of1ForFork2_#t~mem12_67|) (or (not .cse6) (not .cse5)) (= |v_thread3Thread1of1ForFork2_#t~mem15_50| |v_thread3Thread1of1ForFork2_#t~mem15_49|) (= |v_thread3Thread1of1ForFork2_#t~mem13_70| |v_thread3Thread1of1ForFork2_#t~mem13_69|) (= v_~res3~0_78 v_~res3~0_77) (= |v_thread3Thread1of1ForFork2_#t~mem14_54| |v_thread3Thread1of1ForFork2_#t~mem14_53|) (= v_thread3Thread1of1ForFork2_~stop~2_62 v_thread3Thread1of1ForFork2_~stop~2_61)))) (= v_~res1~0_74 (ite (< v_~count2~0_61 v_~count1~0_69) 1 (- 1))) (not (= v_~count1~0_69 v_~count2~0_61)) (= v_thread1Thread1of1ForFork0_~stop~0_51 0)) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_70|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_68|, ~get3~0.base=v_~get3~0.base_95, ~n3~0=v_~n3~0_102, ~count2~0=v_~count2~0_61, ~n1~0=v_~n1~0_108, ~count1~0=v_~count1~0_69, ~get3~0.offset=v_~get3~0.offset_95, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_50|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_54|, ~get1~0.base=v_~get1~0.base_91, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_62, #memory_int=|v_#memory_int_332|, ~get1~0.offset=v_~get1~0.offset_91, ~res3~0=v_~res3~0_77} OutVars{~res1~0=v_~res1~0_74, thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_69|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_67|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_27|, ~get3~0.base=v_~get3~0.base_95, ~n3~0=v_~n3~0_102, ~count2~0=v_~count2~0_61, ~n1~0=v_~n1~0_108, ~count1~0=v_~count1~0_69, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_25|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_27|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_25|, ~get3~0.offset=v_~get3~0.offset_95, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_49|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_53|, ~get1~0.base=v_~get1~0.base_91, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_61, #memory_int=|v_#memory_int_332|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_51, ~get1~0.offset=v_~get1~0.offset_91, ~res3~0=v_~res3~0_76} AuxVars[v_~res3~0_78] AssignedVars[~res1~0, thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread1Thread1of1ForFork0_#res.base, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork0_~stop~0, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 07:25:16,529 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 07:25:16,567 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 07:25:16,605 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 07:25:16,643 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 07:25:16,687 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 07:25:16,728 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 07:25:16,787 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 07:25:16,832 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 07:25:16,876 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 07:25:16,921 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 07:25:16,964 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 07:25:17,008 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 07:25:17,050 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 07:25:17,093 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 07:25:17,139 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1061] L89-6-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_27| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_27| 0) (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_25| 0)) (.cse1 (= |v_thread3Thread1of1ForFork2_#res.offset_25| 0)) (.cse2 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_61 256)))) (or (and (= v_~n1~0_108 (+ v_~res3~0_76 v_~n3~0_102)) .cse0 .cse1 .cse2) (and .cse0 .cse1 (= v_~res3~0_78 v_~res3~0_76) (not .cse2)))) (let ((.cse6 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n3~0_102)) (.cse5 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n1~0_108))) (or (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_65 4))) (let ((.cse3 (select (select |v_#memory_int_332| v_~get1~0.base_91) (+ v_~get1~0.offset_91 .cse7))) (.cse4 (select (select |v_#memory_int_332| v_~get3~0.base_95) (+ v_~get3~0.offset_95 .cse7)))) (and (not (= .cse3 .cse4)) .cse5 (= v_thread3Thread1of1ForFork2_~stop~2_61 1) (= v_~res3~0_78 (ite (< .cse3 .cse4) (- 1) 1)) .cse6))) (and (= |v_thread3Thread1of1ForFork2_#t~mem12_68| |v_thread3Thread1of1ForFork2_#t~mem12_67|) (or (not .cse6) (not .cse5)) (= |v_thread3Thread1of1ForFork2_#t~mem15_50| |v_thread3Thread1of1ForFork2_#t~mem15_49|) (= |v_thread3Thread1of1ForFork2_#t~mem13_70| |v_thread3Thread1of1ForFork2_#t~mem13_69|) (= v_~res3~0_78 v_~res3~0_77) (= |v_thread3Thread1of1ForFork2_#t~mem14_54| |v_thread3Thread1of1ForFork2_#t~mem14_53|) (= v_thread3Thread1of1ForFork2_~stop~2_62 v_thread3Thread1of1ForFork2_~stop~2_61)))) (= v_~res1~0_74 (ite (< v_~count2~0_61 v_~count1~0_69) 1 (- 1))) (not (= v_~count1~0_69 v_~count2~0_61)) (= v_thread1Thread1of1ForFork0_~stop~0_51 0)) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_70|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_68|, ~get3~0.base=v_~get3~0.base_95, ~n3~0=v_~n3~0_102, ~count2~0=v_~count2~0_61, ~n1~0=v_~n1~0_108, ~count1~0=v_~count1~0_69, ~get3~0.offset=v_~get3~0.offset_95, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_50|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_54|, ~get1~0.base=v_~get1~0.base_91, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_62, #memory_int=|v_#memory_int_332|, ~get1~0.offset=v_~get1~0.offset_91, ~res3~0=v_~res3~0_77} OutVars{~res1~0=v_~res1~0_74, thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_69|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_67|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_27|, ~get3~0.base=v_~get3~0.base_95, ~n3~0=v_~n3~0_102, ~count2~0=v_~count2~0_61, ~n1~0=v_~n1~0_108, ~count1~0=v_~count1~0_69, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_25|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_27|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_25|, ~get3~0.offset=v_~get3~0.offset_95, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_49|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_53|, ~get1~0.base=v_~get1~0.base_91, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_61, #memory_int=|v_#memory_int_332|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_51, ~get1~0.offset=v_~get1~0.offset_91, ~res3~0=v_~res3~0_76} AuxVars[v_~res3~0_78] AssignedVars[~res1~0, thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread1Thread1of1ForFork0_#res.base, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork0_~stop~0, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 07:25:17,418 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 07:25:17,473 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 07:25:17,529 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:17,530 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1817 [2022-12-06 07:25:17,530 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 260 transitions, 5153 flow [2022-12-06 07:25:17,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:17,530 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:17,530 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:17,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 07:25:17,531 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:17,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:17,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1218545451, now seen corresponding path program 3 times [2022-12-06 07:25:17,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:17,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656416326] [2022-12-06 07:25:17,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:17,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:17,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:17,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656416326] [2022-12-06 07:25:17,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656416326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:17,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:17,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:17,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107087222] [2022-12-06 07:25:17,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:17,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:25:17,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:17,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:25:17,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:25:17,643 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 71 [2022-12-06 07:25:17,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 260 transitions, 5153 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:17,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:17,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 71 [2022-12-06 07:25:17,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:19,002 INFO L130 PetriNetUnfolder]: 6014/9600 cut-off events. [2022-12-06 07:25:19,003 INFO L131 PetriNetUnfolder]: For 73387/73387 co-relation queries the response was YES. [2022-12-06 07:25:19,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46026 conditions, 9600 events. 6014/9600 cut-off events. For 73387/73387 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 63145 event pairs, 384 based on Foata normal form. 6/9340 useless extension candidates. Maximal degree in co-relation 43737. Up to 3092 conditions per place. [2022-12-06 07:25:19,167 INFO L137 encePairwiseOnDemand]: 50/71 looper letters, 270 selfloop transitions, 152 changer transitions 9/432 dead transitions. [2022-12-06 07:25:19,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 432 transitions, 6889 flow [2022-12-06 07:25:19,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:25:19,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:25:19,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 203 transitions. [2022-12-06 07:25:19,170 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31768388106416273 [2022-12-06 07:25:19,171 INFO L175 Difference]: Start difference. First operand has 127 places, 260 transitions, 5153 flow. Second operand 9 states and 203 transitions. [2022-12-06 07:25:19,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 432 transitions, 6889 flow [2022-12-06 07:25:19,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 432 transitions, 6331 flow, removed 75 selfloop flow, removed 4 redundant places. [2022-12-06 07:25:19,645 INFO L231 Difference]: Finished difference. Result has 135 places, 285 transitions, 4938 flow [2022-12-06 07:25:19,645 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=3728, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4938, PETRI_PLACES=135, PETRI_TRANSITIONS=285} [2022-12-06 07:25:19,646 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 97 predicate places. [2022-12-06 07:25:19,646 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:19,646 INFO L89 Accepts]: Start accepts. Operand has 135 places, 285 transitions, 4938 flow [2022-12-06 07:25:19,649 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:19,649 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:19,650 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 285 transitions, 4938 flow [2022-12-06 07:25:19,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 285 transitions, 4938 flow [2022-12-06 07:25:19,852 INFO L130 PetriNetUnfolder]: 401/1637 cut-off events. [2022-12-06 07:25:19,852 INFO L131 PetriNetUnfolder]: For 13337/13624 co-relation queries the response was YES. [2022-12-06 07:25:19,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6918 conditions, 1637 events. 401/1637 cut-off events. For 13337/13624 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 16102 event pairs, 3 based on Foata normal form. 52/1603 useless extension candidates. Maximal degree in co-relation 6640. Up to 243 conditions per place. [2022-12-06 07:25:19,878 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 285 transitions, 4938 flow [2022-12-06 07:25:19,878 INFO L188 LiptonReduction]: Number of co-enabled transitions 2116 [2022-12-06 07:25:19,889 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:19,890 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 244 [2022-12-06 07:25:19,890 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 285 transitions, 4938 flow [2022-12-06 07:25:19,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:19,890 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:19,890 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:19,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 07:25:19,890 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:19,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:19,891 INFO L85 PathProgramCache]: Analyzing trace with hash 538423394, now seen corresponding path program 1 times [2022-12-06 07:25:19,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:19,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860778690] [2022-12-06 07:25:19,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:19,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:20,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:20,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:20,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860778690] [2022-12-06 07:25:20,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860778690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:20,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:20,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:25:20,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923435305] [2022-12-06 07:25:20,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:20,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:20,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:20,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:20,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:20,079 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2022-12-06 07:25:20,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 285 transitions, 4938 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:20,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:20,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2022-12-06 07:25:20,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:21,216 INFO L130 PetriNetUnfolder]: 5945/9365 cut-off events. [2022-12-06 07:25:21,216 INFO L131 PetriNetUnfolder]: For 73466/73466 co-relation queries the response was YES. [2022-12-06 07:25:21,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46591 conditions, 9365 events. 5945/9365 cut-off events. For 73466/73466 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 59859 event pairs, 954 based on Foata normal form. 3/9081 useless extension candidates. Maximal degree in co-relation 44215. Up to 4491 conditions per place. [2022-12-06 07:25:21,279 INFO L137 encePairwiseOnDemand]: 33/50 looper letters, 266 selfloop transitions, 91 changer transitions 9/367 dead transitions. [2022-12-06 07:25:21,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 367 transitions, 6353 flow [2022-12-06 07:25:21,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:25:21,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:25:21,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2022-12-06 07:25:21,280 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.488 [2022-12-06 07:25:21,280 INFO L175 Difference]: Start difference. First operand has 135 places, 285 transitions, 4938 flow. Second operand 5 states and 122 transitions. [2022-12-06 07:25:21,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 367 transitions, 6353 flow [2022-12-06 07:25:21,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 367 transitions, 6141 flow, removed 106 selfloop flow, removed 0 redundant places. [2022-12-06 07:25:21,702 INFO L231 Difference]: Finished difference. Result has 140 places, 281 transitions, 4946 flow [2022-12-06 07:25:21,703 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=4842, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4946, PETRI_PLACES=140, PETRI_TRANSITIONS=281} [2022-12-06 07:25:21,703 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 102 predicate places. [2022-12-06 07:25:21,703 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:21,703 INFO L89 Accepts]: Start accepts. Operand has 140 places, 281 transitions, 4946 flow [2022-12-06 07:25:21,705 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:21,705 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:21,705 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 281 transitions, 4946 flow [2022-12-06 07:25:21,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 281 transitions, 4946 flow [2022-12-06 07:25:21,857 INFO L130 PetriNetUnfolder]: 423/1599 cut-off events. [2022-12-06 07:25:21,857 INFO L131 PetriNetUnfolder]: For 14259/14527 co-relation queries the response was YES. [2022-12-06 07:25:21,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7261 conditions, 1599 events. 423/1599 cut-off events. For 14259/14527 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 15163 event pairs, 0 based on Foata normal form. 54/1564 useless extension candidates. Maximal degree in co-relation 7059. Up to 266 conditions per place. [2022-12-06 07:25:21,879 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 281 transitions, 4946 flow [2022-12-06 07:25:21,880 INFO L188 LiptonReduction]: Number of co-enabled transitions 2094 [2022-12-06 07:25:21,888 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:21,889 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 07:25:21,889 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 281 transitions, 4946 flow [2022-12-06 07:25:21,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:21,889 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:21,889 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:21,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 07:25:21,889 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:21,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:21,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1844788331, now seen corresponding path program 1 times [2022-12-06 07:25:21,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:21,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299335446] [2022-12-06 07:25:21,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:21,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:21,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-12-06 07:25:21,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:21,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299335446] [2022-12-06 07:25:21,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299335446] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:21,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:21,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:21,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979707553] [2022-12-06 07:25:21,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:21,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:21,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:21,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:21,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:21,957 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 07:25:21,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 281 transitions, 4946 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:21,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:21,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 07:25:21,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:23,400 INFO L130 PetriNetUnfolder]: 5678/9095 cut-off events. [2022-12-06 07:25:23,400 INFO L131 PetriNetUnfolder]: For 82525/82525 co-relation queries the response was YES. [2022-12-06 07:25:23,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45215 conditions, 9095 events. 5678/9095 cut-off events. For 82525/82525 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 59628 event pairs, 1147 based on Foata normal form. 46/8871 useless extension candidates. Maximal degree in co-relation 43905. Up to 6324 conditions per place. [2022-12-06 07:25:23,565 INFO L137 encePairwiseOnDemand]: 42/47 looper letters, 269 selfloop transitions, 44 changer transitions 0/314 dead transitions. [2022-12-06 07:25:23,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 314 transitions, 5575 flow [2022-12-06 07:25:23,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:23,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:23,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-12-06 07:25:23,567 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 07:25:23,567 INFO L175 Difference]: Start difference. First operand has 139 places, 281 transitions, 4946 flow. Second operand 4 states and 94 transitions. [2022-12-06 07:25:23,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 314 transitions, 5575 flow [2022-12-06 07:25:24,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 314 transitions, 5220 flow, removed 15 selfloop flow, removed 6 redundant places. [2022-12-06 07:25:24,066 INFO L231 Difference]: Finished difference. Result has 139 places, 275 transitions, 4532 flow [2022-12-06 07:25:24,066 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=4308, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4532, PETRI_PLACES=139, PETRI_TRANSITIONS=275} [2022-12-06 07:25:24,066 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 101 predicate places. [2022-12-06 07:25:24,067 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:24,067 INFO L89 Accepts]: Start accepts. Operand has 139 places, 275 transitions, 4532 flow [2022-12-06 07:25:24,068 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:24,068 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:24,068 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 275 transitions, 4532 flow [2022-12-06 07:25:24,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 275 transitions, 4532 flow [2022-12-06 07:25:24,299 INFO L130 PetriNetUnfolder]: 408/1561 cut-off events. [2022-12-06 07:25:24,300 INFO L131 PetriNetUnfolder]: For 11008/11248 co-relation queries the response was YES. [2022-12-06 07:25:24,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6862 conditions, 1561 events. 408/1561 cut-off events. For 11008/11248 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 14757 event pairs, 0 based on Foata normal form. 48/1520 useless extension candidates. Maximal degree in co-relation 6648. Up to 260 conditions per place. [2022-12-06 07:25:24,315 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 275 transitions, 4532 flow [2022-12-06 07:25:24,316 INFO L188 LiptonReduction]: Number of co-enabled transitions 2002 [2022-12-06 07:25:24,333 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:24,334 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 267 [2022-12-06 07:25:24,334 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 275 transitions, 4532 flow [2022-12-06 07:25:24,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:24,334 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:24,334 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:24,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 07:25:24,335 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:24,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:24,335 INFO L85 PathProgramCache]: Analyzing trace with hash -380477884, now seen corresponding path program 1 times [2022-12-06 07:25:24,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:24,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774401658] [2022-12-06 07:25:24,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:24,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:24,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:24,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:24,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774401658] [2022-12-06 07:25:24,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774401658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:24,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:24,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:24,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839659566] [2022-12-06 07:25:24,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:24,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:25:24,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:24,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:25:24,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:25:24,440 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 07:25:24,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 275 transitions, 4532 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:24,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:24,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 07:25:24,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:25,593 INFO L130 PetriNetUnfolder]: 5698/9066 cut-off events. [2022-12-06 07:25:25,593 INFO L131 PetriNetUnfolder]: For 69167/69167 co-relation queries the response was YES. [2022-12-06 07:25:25,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44632 conditions, 9066 events. 5698/9066 cut-off events. For 69167/69167 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 58417 event pairs, 2252 based on Foata normal form. 3/8757 useless extension candidates. Maximal degree in co-relation 43304. Up to 6913 conditions per place. [2022-12-06 07:25:25,675 INFO L137 encePairwiseOnDemand]: 39/47 looper letters, 294 selfloop transitions, 24 changer transitions 11/330 dead transitions. [2022-12-06 07:25:25,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 330 transitions, 5513 flow [2022-12-06 07:25:25,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:25:25,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:25:25,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2022-12-06 07:25:25,677 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43829787234042555 [2022-12-06 07:25:25,677 INFO L175 Difference]: Start difference. First operand has 139 places, 275 transitions, 4532 flow. Second operand 5 states and 103 transitions. [2022-12-06 07:25:25,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 330 transitions, 5513 flow [2022-12-06 07:25:26,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 330 transitions, 5501 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-12-06 07:25:26,040 INFO L231 Difference]: Finished difference. Result has 145 places, 276 transitions, 4547 flow [2022-12-06 07:25:26,041 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=4520, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4547, PETRI_PLACES=145, PETRI_TRANSITIONS=276} [2022-12-06 07:25:26,046 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 107 predicate places. [2022-12-06 07:25:26,047 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:26,047 INFO L89 Accepts]: Start accepts. Operand has 145 places, 276 transitions, 4547 flow [2022-12-06 07:25:26,054 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:26,054 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:26,054 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 276 transitions, 4547 flow [2022-12-06 07:25:26,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 276 transitions, 4547 flow [2022-12-06 07:25:26,181 INFO L130 PetriNetUnfolder]: 407/1535 cut-off events. [2022-12-06 07:25:26,181 INFO L131 PetriNetUnfolder]: For 11350/11599 co-relation queries the response was YES. [2022-12-06 07:25:26,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6932 conditions, 1535 events. 407/1535 cut-off events. For 11350/11599 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 14411 event pairs, 0 based on Foata normal form. 57/1503 useless extension candidates. Maximal degree in co-relation 6712. Up to 260 conditions per place. [2022-12-06 07:25:26,201 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 276 transitions, 4547 flow [2022-12-06 07:25:26,201 INFO L188 LiptonReduction]: Number of co-enabled transitions 1990 [2022-12-06 07:25:26,228 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] and [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] [2022-12-06 07:25:26,266 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] and [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] [2022-12-06 07:25:26,300 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] and [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] [2022-12-06 07:25:26,341 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:26,342 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 295 [2022-12-06 07:25:26,342 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 279 transitions, 4641 flow [2022-12-06 07:25:26,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:26,342 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:26,342 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:26,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 07:25:26,342 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:26,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:26,342 INFO L85 PathProgramCache]: Analyzing trace with hash 439942311, now seen corresponding path program 2 times [2022-12-06 07:25:26,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:26,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812710754] [2022-12-06 07:25:26,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:26,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:26,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:26,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:26,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812710754] [2022-12-06 07:25:26,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812710754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:26,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:26,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:26,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122957797] [2022-12-06 07:25:26,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:26,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:26,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:26,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:26,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:26,391 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2022-12-06 07:25:26,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 279 transitions, 4641 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:26,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:26,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2022-12-06 07:25:26,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:27,612 INFO L130 PetriNetUnfolder]: 5412/8741 cut-off events. [2022-12-06 07:25:27,613 INFO L131 PetriNetUnfolder]: For 67268/67268 co-relation queries the response was YES. [2022-12-06 07:25:27,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42938 conditions, 8741 events. 5412/8741 cut-off events. For 67268/67268 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 57413 event pairs, 1387 based on Foata normal form. 46/8493 useless extension candidates. Maximal degree in co-relation 41601. Up to 6534 conditions per place. [2022-12-06 07:25:27,667 INFO L137 encePairwiseOnDemand]: 45/50 looper letters, 260 selfloop transitions, 56 changer transitions 0/317 dead transitions. [2022-12-06 07:25:27,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 317 transitions, 5321 flow [2022-12-06 07:25:27,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:27,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:27,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-12-06 07:25:27,668 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47 [2022-12-06 07:25:27,668 INFO L175 Difference]: Start difference. First operand has 145 places, 279 transitions, 4641 flow. Second operand 4 states and 94 transitions. [2022-12-06 07:25:27,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 317 transitions, 5321 flow [2022-12-06 07:25:27,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 317 transitions, 5221 flow, removed 20 selfloop flow, removed 2 redundant places. [2022-12-06 07:25:27,924 INFO L231 Difference]: Finished difference. Result has 148 places, 277 transitions, 4494 flow [2022-12-06 07:25:27,924 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=4146, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4494, PETRI_PLACES=148, PETRI_TRANSITIONS=277} [2022-12-06 07:25:27,924 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 110 predicate places. [2022-12-06 07:25:27,924 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:27,924 INFO L89 Accepts]: Start accepts. Operand has 148 places, 277 transitions, 4494 flow [2022-12-06 07:25:27,925 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:27,925 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:27,925 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 277 transitions, 4494 flow [2022-12-06 07:25:27,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 277 transitions, 4494 flow [2022-12-06 07:25:28,043 INFO L130 PetriNetUnfolder]: 377/1514 cut-off events. [2022-12-06 07:25:28,043 INFO L131 PetriNetUnfolder]: For 11136/11618 co-relation queries the response was YES. [2022-12-06 07:25:28,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6570 conditions, 1514 events. 377/1514 cut-off events. For 11136/11618 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 14379 event pairs, 0 based on Foata normal form. 67/1492 useless extension candidates. Maximal degree in co-relation 6347. Up to 236 conditions per place. [2022-12-06 07:25:28,058 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 277 transitions, 4494 flow [2022-12-06 07:25:28,058 INFO L188 LiptonReduction]: Number of co-enabled transitions 1938 [2022-12-06 07:25:28,063 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:28,064 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-06 07:25:28,064 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 277 transitions, 4494 flow [2022-12-06 07:25:28,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:28,064 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:28,064 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:28,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 07:25:28,064 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:28,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:28,065 INFO L85 PathProgramCache]: Analyzing trace with hash -482826724, now seen corresponding path program 2 times [2022-12-06 07:25:28,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:28,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787553583] [2022-12-06 07:25:28,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:28,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:28,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:28,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:28,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787553583] [2022-12-06 07:25:28,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787553583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:28,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:28,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:25:28,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256145762] [2022-12-06 07:25:28,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:28,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:25:28,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:28,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:25:28,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:25:28,167 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 07:25:28,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 277 transitions, 4494 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:28,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:28,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 07:25:28,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:29,852 INFO L130 PetriNetUnfolder]: 7084/11339 cut-off events. [2022-12-06 07:25:29,853 INFO L131 PetriNetUnfolder]: For 88184/88184 co-relation queries the response was YES. [2022-12-06 07:25:29,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57001 conditions, 11339 events. 7084/11339 cut-off events. For 88184/88184 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 76369 event pairs, 2020 based on Foata normal form. 18/10996 useless extension candidates. Maximal degree in co-relation 55833. Up to 6451 conditions per place. [2022-12-06 07:25:29,962 INFO L137 encePairwiseOnDemand]: 27/47 looper letters, 403 selfloop transitions, 135 changer transitions 7/546 dead transitions. [2022-12-06 07:25:29,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 546 transitions, 9210 flow [2022-12-06 07:25:29,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:25:29,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:25:29,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2022-12-06 07:25:29,963 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5283687943262412 [2022-12-06 07:25:29,964 INFO L175 Difference]: Start difference. First operand has 148 places, 277 transitions, 4494 flow. Second operand 6 states and 149 transitions. [2022-12-06 07:25:29,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 546 transitions, 9210 flow [2022-12-06 07:25:30,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 546 transitions, 9071 flow, removed 23 selfloop flow, removed 2 redundant places. [2022-12-06 07:25:30,524 INFO L231 Difference]: Finished difference. Result has 155 places, 380 transitions, 6636 flow [2022-12-06 07:25:30,524 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=4418, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6636, PETRI_PLACES=155, PETRI_TRANSITIONS=380} [2022-12-06 07:25:30,525 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 117 predicate places. [2022-12-06 07:25:30,525 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:30,525 INFO L89 Accepts]: Start accepts. Operand has 155 places, 380 transitions, 6636 flow [2022-12-06 07:25:30,526 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:30,527 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:30,527 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 380 transitions, 6636 flow [2022-12-06 07:25:30,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 380 transitions, 6636 flow [2022-12-06 07:25:30,765 INFO L130 PetriNetUnfolder]: 511/1895 cut-off events. [2022-12-06 07:25:30,766 INFO L131 PetriNetUnfolder]: For 15687/15992 co-relation queries the response was YES. [2022-12-06 07:25:30,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9410 conditions, 1895 events. 511/1895 cut-off events. For 15687/15992 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 18459 event pairs, 0 based on Foata normal form. 83/1870 useless extension candidates. Maximal degree in co-relation 9097. Up to 319 conditions per place. [2022-12-06 07:25:30,799 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 380 transitions, 6636 flow [2022-12-06 07:25:30,799 INFO L188 LiptonReduction]: Number of co-enabled transitions 2818 [2022-12-06 07:25:36,477 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:25:36,479 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5954 [2022-12-06 07:25:36,479 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 379 transitions, 6651 flow [2022-12-06 07:25:36,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:36,479 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:36,479 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:36,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 07:25:36,479 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:36,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:36,480 INFO L85 PathProgramCache]: Analyzing trace with hash 591303418, now seen corresponding path program 1 times [2022-12-06 07:25:36,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:36,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249971663] [2022-12-06 07:25:36,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:36,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:36,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:36,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:36,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249971663] [2022-12-06 07:25:36,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249971663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:36,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:36,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:25:36,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532518476] [2022-12-06 07:25:36,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:36,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:25:36,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:36,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:25:36,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:25:36,731 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 48 [2022-12-06 07:25:36,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 379 transitions, 6651 flow. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:36,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:36,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 48 [2022-12-06 07:25:36,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:38,528 INFO L130 PetriNetUnfolder]: 7604/12650 cut-off events. [2022-12-06 07:25:38,528 INFO L131 PetriNetUnfolder]: For 106512/106512 co-relation queries the response was YES. [2022-12-06 07:25:38,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65953 conditions, 12650 events. 7604/12650 cut-off events. For 106512/106512 co-relation queries the response was YES. Maximal size of possible extension queue 727. Compared 90882 event pairs, 1784 based on Foata normal form. 18/12246 useless extension candidates. Maximal degree in co-relation 64446. Up to 3766 conditions per place. [2022-12-06 07:25:38,625 INFO L137 encePairwiseOnDemand]: 36/48 looper letters, 424 selfloop transitions, 101 changer transitions 57/583 dead transitions. [2022-12-06 07:25:38,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 583 transitions, 10186 flow [2022-12-06 07:25:38,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:25:38,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:25:38,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2022-12-06 07:25:38,626 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2022-12-06 07:25:38,626 INFO L175 Difference]: Start difference. First operand has 154 places, 379 transitions, 6651 flow. Second operand 7 states and 164 transitions. [2022-12-06 07:25:38,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 583 transitions, 10186 flow [2022-12-06 07:25:39,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 583 transitions, 10172 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-06 07:25:39,341 INFO L231 Difference]: Finished difference. Result has 161 places, 351 transitions, 6396 flow [2022-12-06 07:25:39,342 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=6637, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6396, PETRI_PLACES=161, PETRI_TRANSITIONS=351} [2022-12-06 07:25:39,342 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 123 predicate places. [2022-12-06 07:25:39,342 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:39,342 INFO L89 Accepts]: Start accepts. Operand has 161 places, 351 transitions, 6396 flow [2022-12-06 07:25:39,343 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:39,344 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:39,344 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 351 transitions, 6396 flow [2022-12-06 07:25:39,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 351 transitions, 6396 flow [2022-12-06 07:25:39,616 INFO L130 PetriNetUnfolder]: 432/1937 cut-off events. [2022-12-06 07:25:39,617 INFO L131 PetriNetUnfolder]: For 16712/17027 co-relation queries the response was YES. [2022-12-06 07:25:39,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9397 conditions, 1937 events. 432/1937 cut-off events. For 16712/17027 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 20010 event pairs, 0 based on Foata normal form. 85/1912 useless extension candidates. Maximal degree in co-relation 9077. Up to 294 conditions per place. [2022-12-06 07:25:39,637 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 351 transitions, 6396 flow [2022-12-06 07:25:39,638 INFO L188 LiptonReduction]: Number of co-enabled transitions 2584 [2022-12-06 07:25:39,646 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:39,646 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 304 [2022-12-06 07:25:39,646 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 351 transitions, 6396 flow [2022-12-06 07:25:39,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:39,647 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:39,647 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:39,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 07:25:39,647 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:39,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:39,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1519625511, now seen corresponding path program 4 times [2022-12-06 07:25:39,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:39,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776804444] [2022-12-06 07:25:39,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:39,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:39,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:39,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:39,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776804444] [2022-12-06 07:25:39,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776804444] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:39,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:39,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:39,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169974455] [2022-12-06 07:25:39,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:39,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:25:39,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:39,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:25:39,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:25:39,761 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 48 [2022-12-06 07:25:39,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 351 transitions, 6396 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:39,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:39,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 48 [2022-12-06 07:25:39,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:42,048 INFO L130 PetriNetUnfolder]: 8252/13283 cut-off events. [2022-12-06 07:25:42,048 INFO L131 PetriNetUnfolder]: For 115004/115004 co-relation queries the response was YES. [2022-12-06 07:25:42,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70280 conditions, 13283 events. 8252/13283 cut-off events. For 115004/115004 co-relation queries the response was YES. Maximal size of possible extension queue 754. Compared 92390 event pairs, 486 based on Foata normal form. 8/12811 useless extension candidates. Maximal degree in co-relation 68665. Up to 3262 conditions per place. [2022-12-06 07:25:42,183 INFO L137 encePairwiseOnDemand]: 29/48 looper letters, 321 selfloop transitions, 215 changer transitions 15/552 dead transitions. [2022-12-06 07:25:42,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 552 transitions, 9548 flow [2022-12-06 07:25:42,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:25:42,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:25:42,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 208 transitions. [2022-12-06 07:25:42,185 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2022-12-06 07:25:42,185 INFO L175 Difference]: Start difference. First operand has 161 places, 351 transitions, 6396 flow. Second operand 9 states and 208 transitions. [2022-12-06 07:25:42,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 552 transitions, 9548 flow [2022-12-06 07:25:42,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 552 transitions, 9308 flow, removed 17 selfloop flow, removed 4 redundant places. [2022-12-06 07:25:42,752 INFO L231 Difference]: Finished difference. Result has 169 places, 379 transitions, 7394 flow [2022-12-06 07:25:42,752 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=6243, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=181, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7394, PETRI_PLACES=169, PETRI_TRANSITIONS=379} [2022-12-06 07:25:42,752 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 131 predicate places. [2022-12-06 07:25:42,753 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:42,753 INFO L89 Accepts]: Start accepts. Operand has 169 places, 379 transitions, 7394 flow [2022-12-06 07:25:42,754 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:42,754 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:42,754 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 379 transitions, 7394 flow [2022-12-06 07:25:42,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 379 transitions, 7394 flow [2022-12-06 07:25:42,927 INFO L130 PetriNetUnfolder]: 486/2032 cut-off events. [2022-12-06 07:25:42,927 INFO L131 PetriNetUnfolder]: For 20836/21176 co-relation queries the response was YES. [2022-12-06 07:25:42,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10060 conditions, 2032 events. 486/2032 cut-off events. For 20836/21176 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 20763 event pairs, 0 based on Foata normal form. 101/2013 useless extension candidates. Maximal degree in co-relation 9751. Up to 298 conditions per place. [2022-12-06 07:25:42,948 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 379 transitions, 7394 flow [2022-12-06 07:25:42,949 INFO L188 LiptonReduction]: Number of co-enabled transitions 2820 [2022-12-06 07:25:42,957 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:42,958 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 205 [2022-12-06 07:25:42,958 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 379 transitions, 7394 flow [2022-12-06 07:25:42,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:42,958 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:42,958 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:42,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 07:25:42,958 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:42,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:42,959 INFO L85 PathProgramCache]: Analyzing trace with hash -903993484, now seen corresponding path program 1 times [2022-12-06 07:25:42,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:42,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787185629] [2022-12-06 07:25:42,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:42,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:43,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:43,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:43,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787185629] [2022-12-06 07:25:43,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787185629] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:43,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:43,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:43,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422572669] [2022-12-06 07:25:43,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:43,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:43,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:43,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:43,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:43,007 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 48 [2022-12-06 07:25:43,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 379 transitions, 7394 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:43,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:43,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 48 [2022-12-06 07:25:43,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:44,847 INFO L130 PetriNetUnfolder]: 7468/11886 cut-off events. [2022-12-06 07:25:44,848 INFO L131 PetriNetUnfolder]: For 134689/134689 co-relation queries the response was YES. [2022-12-06 07:25:44,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67542 conditions, 11886 events. 7468/11886 cut-off events. For 134689/134689 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 79590 event pairs, 1014 based on Foata normal form. 80/11512 useless extension candidates. Maximal degree in co-relation 66154. Up to 6806 conditions per place. [2022-12-06 07:25:44,961 INFO L137 encePairwiseOnDemand]: 40/48 looper letters, 351 selfloop transitions, 77 changer transitions 9/438 dead transitions. [2022-12-06 07:25:44,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 438 transitions, 8718 flow [2022-12-06 07:25:44,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:25:44,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:25:44,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2022-12-06 07:25:44,962 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44583333333333336 [2022-12-06 07:25:44,962 INFO L175 Difference]: Start difference. First operand has 169 places, 379 transitions, 7394 flow. Second operand 5 states and 107 transitions. [2022-12-06 07:25:44,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 438 transitions, 8718 flow [2022-12-06 07:25:46,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 438 transitions, 8444 flow, removed 70 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:46,149 INFO L231 Difference]: Finished difference. Result has 170 places, 367 transitions, 7037 flow [2022-12-06 07:25:46,150 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=6812, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7037, PETRI_PLACES=170, PETRI_TRANSITIONS=367} [2022-12-06 07:25:46,150 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 132 predicate places. [2022-12-06 07:25:46,150 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:46,150 INFO L89 Accepts]: Start accepts. Operand has 170 places, 367 transitions, 7037 flow [2022-12-06 07:25:46,151 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:46,152 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:46,152 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 367 transitions, 7037 flow [2022-12-06 07:25:46,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 367 transitions, 7037 flow [2022-12-06 07:25:46,362 INFO L130 PetriNetUnfolder]: 442/1866 cut-off events. [2022-12-06 07:25:46,362 INFO L131 PetriNetUnfolder]: For 19262/19682 co-relation queries the response was YES. [2022-12-06 07:25:46,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9157 conditions, 1866 events. 442/1866 cut-off events. For 19262/19682 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 18632 event pairs, 0 based on Foata normal form. 99/1863 useless extension candidates. Maximal degree in co-relation 8853. Up to 278 conditions per place. [2022-12-06 07:25:46,387 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 367 transitions, 7037 flow [2022-12-06 07:25:46,387 INFO L188 LiptonReduction]: Number of co-enabled transitions 2732 [2022-12-06 07:25:46,398 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:46,399 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 249 [2022-12-06 07:25:46,399 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 367 transitions, 7037 flow [2022-12-06 07:25:46,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:46,400 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:46,400 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:46,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 07:25:46,400 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:46,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:46,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1710776851, now seen corresponding path program 5 times [2022-12-06 07:25:46,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:46,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963276581] [2022-12-06 07:25:46,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:46,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:46,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:46,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:46,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963276581] [2022-12-06 07:25:46,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963276581] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:46,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:46,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:46,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092319658] [2022-12-06 07:25:46,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:46,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:25:46,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:46,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:25:46,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:25:46,540 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 07:25:46,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 367 transitions, 7037 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:46,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:46,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 07:25:46,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:48,498 INFO L130 PetriNetUnfolder]: 7428/11797 cut-off events. [2022-12-06 07:25:48,498 INFO L131 PetriNetUnfolder]: For 125056/125056 co-relation queries the response was YES. [2022-12-06 07:25:48,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66726 conditions, 11797 events. 7428/11797 cut-off events. For 125056/125056 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 78351 event pairs, 1280 based on Foata normal form. 4/11332 useless extension candidates. Maximal degree in co-relation 65093. Up to 4128 conditions per place. [2022-12-06 07:25:48,613 INFO L137 encePairwiseOnDemand]: 30/47 looper letters, 257 selfloop transitions, 152 changer transitions 17/427 dead transitions. [2022-12-06 07:25:48,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 427 transitions, 8199 flow [2022-12-06 07:25:48,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:25:48,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:25:48,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2022-12-06 07:25:48,614 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4326241134751773 [2022-12-06 07:25:48,614 INFO L175 Difference]: Start difference. First operand has 169 places, 367 transitions, 7037 flow. Second operand 6 states and 122 transitions. [2022-12-06 07:25:48,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 427 transitions, 8199 flow [2022-12-06 07:25:49,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 427 transitions, 7921 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-12-06 07:25:49,651 INFO L231 Difference]: Finished difference. Result has 170 places, 363 transitions, 7068 flow [2022-12-06 07:25:49,651 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=6762, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7068, PETRI_PLACES=170, PETRI_TRANSITIONS=363} [2022-12-06 07:25:49,652 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 132 predicate places. [2022-12-06 07:25:49,652 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:49,652 INFO L89 Accepts]: Start accepts. Operand has 170 places, 363 transitions, 7068 flow [2022-12-06 07:25:49,654 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:49,654 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:49,654 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 363 transitions, 7068 flow [2022-12-06 07:25:49,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 363 transitions, 7068 flow [2022-12-06 07:25:49,902 INFO L130 PetriNetUnfolder]: 442/1820 cut-off events. [2022-12-06 07:25:49,902 INFO L131 PetriNetUnfolder]: For 17537/17945 co-relation queries the response was YES. [2022-12-06 07:25:49,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9361 conditions, 1820 events. 442/1820 cut-off events. For 17537/17945 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 17941 event pairs, 0 based on Foata normal form. 99/1821 useless extension candidates. Maximal degree in co-relation 9092. Up to 277 conditions per place. [2022-12-06 07:25:49,929 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 363 transitions, 7068 flow [2022-12-06 07:25:49,929 INFO L188 LiptonReduction]: Number of co-enabled transitions 2692 [2022-12-06 07:25:49,937 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:49,938 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 286 [2022-12-06 07:25:49,938 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 363 transitions, 7068 flow [2022-12-06 07:25:49,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:49,938 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:49,938 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:49,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 07:25:49,938 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:49,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:49,938 INFO L85 PathProgramCache]: Analyzing trace with hash 616095279, now seen corresponding path program 1 times [2022-12-06 07:25:49,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:49,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889354334] [2022-12-06 07:25:49,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:49,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:50,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:50,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:50,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889354334] [2022-12-06 07:25:50,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889354334] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:50,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:50,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:50,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991581313] [2022-12-06 07:25:50,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:50,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:25:50,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:50,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:25:50,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:25:50,054 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 07:25:50,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 363 transitions, 7068 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:50,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:50,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 07:25:50,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:52,057 INFO L130 PetriNetUnfolder]: 7742/12368 cut-off events. [2022-12-06 07:25:52,057 INFO L131 PetriNetUnfolder]: For 128091/128091 co-relation queries the response was YES. [2022-12-06 07:25:52,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71294 conditions, 12368 events. 7742/12368 cut-off events. For 128091/128091 co-relation queries the response was YES. Maximal size of possible extension queue 679. Compared 83168 event pairs, 1298 based on Foata normal form. 8/11882 useless extension candidates. Maximal degree in co-relation 69532. Up to 4622 conditions per place. [2022-12-06 07:25:52,198 INFO L137 encePairwiseOnDemand]: 30/47 looper letters, 289 selfloop transitions, 197 changer transitions 7/494 dead transitions. [2022-12-06 07:25:52,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 494 transitions, 9452 flow [2022-12-06 07:25:52,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:25:52,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:25:52,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2022-12-06 07:25:52,200 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43465045592705165 [2022-12-06 07:25:52,200 INFO L175 Difference]: Start difference. First operand has 166 places, 363 transitions, 7068 flow. Second operand 7 states and 143 transitions. [2022-12-06 07:25:52,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 494 transitions, 9452 flow [2022-12-06 07:25:53,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 494 transitions, 9196 flow, removed 39 selfloop flow, removed 4 redundant places. [2022-12-06 07:25:53,051 INFO L231 Difference]: Finished difference. Result has 171 places, 408 transitions, 8180 flow [2022-12-06 07:25:53,051 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=6842, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8180, PETRI_PLACES=171, PETRI_TRANSITIONS=408} [2022-12-06 07:25:53,051 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 133 predicate places. [2022-12-06 07:25:53,052 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:53,052 INFO L89 Accepts]: Start accepts. Operand has 171 places, 408 transitions, 8180 flow [2022-12-06 07:25:53,054 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:53,054 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:53,054 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 408 transitions, 8180 flow [2022-12-06 07:25:53,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 408 transitions, 8180 flow [2022-12-06 07:25:53,426 INFO L130 PetriNetUnfolder]: 491/2065 cut-off events. [2022-12-06 07:25:53,427 INFO L131 PetriNetUnfolder]: For 19854/20288 co-relation queries the response was YES. [2022-12-06 07:25:53,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10548 conditions, 2065 events. 491/2065 cut-off events. For 19854/20288 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 21136 event pairs, 0 based on Foata normal form. 105/2064 useless extension candidates. Maximal degree in co-relation 10216. Up to 311 conditions per place. [2022-12-06 07:25:53,464 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 408 transitions, 8180 flow [2022-12-06 07:25:53,464 INFO L188 LiptonReduction]: Number of co-enabled transitions 2828 [2022-12-06 07:25:53,479 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:53,480 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 428 [2022-12-06 07:25:53,480 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 408 transitions, 8180 flow [2022-12-06 07:25:53,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:53,480 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:53,481 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:53,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 07:25:53,481 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:53,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:53,481 INFO L85 PathProgramCache]: Analyzing trace with hash 33751729, now seen corresponding path program 2 times [2022-12-06 07:25:53,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:53,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575139333] [2022-12-06 07:25:53,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:53,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:53,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:53,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:53,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575139333] [2022-12-06 07:25:53,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575139333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:53,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:53,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:53,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886726301] [2022-12-06 07:25:53,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:53,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:25:53,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:53,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:25:53,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:25:53,609 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 07:25:53,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 408 transitions, 8180 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:53,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:53,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 07:25:53,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:55,915 INFO L130 PetriNetUnfolder]: 8506/13631 cut-off events. [2022-12-06 07:25:55,915 INFO L131 PetriNetUnfolder]: For 140609/140609 co-relation queries the response was YES. [2022-12-06 07:25:55,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79030 conditions, 13631 events. 8506/13631 cut-off events. For 140609/140609 co-relation queries the response was YES. Maximal size of possible extension queue 738. Compared 94116 event pairs, 1058 based on Foata normal form. 8/13111 useless extension candidates. Maximal degree in co-relation 76841. Up to 5970 conditions per place. [2022-12-06 07:25:56,015 INFO L137 encePairwiseOnDemand]: 35/47 looper letters, 372 selfloop transitions, 150 changer transitions 18/541 dead transitions. [2022-12-06 07:25:56,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 541 transitions, 10953 flow [2022-12-06 07:25:56,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:25:56,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:25:56,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2022-12-06 07:25:56,016 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 07:25:56,016 INFO L175 Difference]: Start difference. First operand has 171 places, 408 transitions, 8180 flow. Second operand 6 states and 141 transitions. [2022-12-06 07:25:56,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 541 transitions, 10953 flow [2022-12-06 07:25:56,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 541 transitions, 10833 flow, removed 32 selfloop flow, removed 2 redundant places. [2022-12-06 07:25:56,681 INFO L231 Difference]: Finished difference. Result has 177 places, 423 transitions, 9009 flow [2022-12-06 07:25:56,682 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=8088, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=9009, PETRI_PLACES=177, PETRI_TRANSITIONS=423} [2022-12-06 07:25:56,682 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 139 predicate places. [2022-12-06 07:25:56,682 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:56,682 INFO L89 Accepts]: Start accepts. Operand has 177 places, 423 transitions, 9009 flow [2022-12-06 07:25:56,683 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:56,683 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:56,684 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 423 transitions, 9009 flow [2022-12-06 07:25:56,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 423 transitions, 9009 flow [2022-12-06 07:25:56,966 INFO L130 PetriNetUnfolder]: 524/2208 cut-off events. [2022-12-06 07:25:56,966 INFO L131 PetriNetUnfolder]: For 23925/24369 co-relation queries the response was YES. [2022-12-06 07:25:56,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11773 conditions, 2208 events. 524/2208 cut-off events. For 23925/24369 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 22875 event pairs, 0 based on Foata normal form. 117/2213 useless extension candidates. Maximal degree in co-relation 11181. Up to 356 conditions per place. [2022-12-06 07:25:56,996 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 423 transitions, 9009 flow [2022-12-06 07:25:56,996 INFO L188 LiptonReduction]: Number of co-enabled transitions 2946 [2022-12-06 07:25:57,008 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:57,009 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 327 [2022-12-06 07:25:57,010 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 423 transitions, 9009 flow [2022-12-06 07:25:57,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:57,010 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:57,010 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:57,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 07:25:57,010 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:57,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:57,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1773962696, now seen corresponding path program 1 times [2022-12-06 07:25:57,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:57,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420453087] [2022-12-06 07:25:57,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:57,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:57,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:57,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:57,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420453087] [2022-12-06 07:25:57,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420453087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:57,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:57,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:57,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952934733] [2022-12-06 07:25:57,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:57,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:57,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:57,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:57,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:57,134 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 07:25:57,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 423 transitions, 9009 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:57,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:57,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 07:25:57,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:59,227 INFO L130 PetriNetUnfolder]: 8120/13081 cut-off events. [2022-12-06 07:25:59,228 INFO L131 PetriNetUnfolder]: For 155037/155037 co-relation queries the response was YES. [2022-12-06 07:25:59,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76692 conditions, 13081 events. 8120/13081 cut-off events. For 155037/155037 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 90251 event pairs, 1410 based on Foata normal form. 96/12661 useless extension candidates. Maximal degree in co-relation 74857. Up to 9674 conditions per place. [2022-12-06 07:25:59,333 INFO L137 encePairwiseOnDemand]: 42/47 looper letters, 388 selfloop transitions, 60 changer transitions 0/449 dead transitions. [2022-12-06 07:25:59,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 449 transitions, 9923 flow [2022-12-06 07:25:59,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:59,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:59,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2022-12-06 07:25:59,334 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4787234042553192 [2022-12-06 07:25:59,334 INFO L175 Difference]: Start difference. First operand has 177 places, 423 transitions, 9009 flow. Second operand 4 states and 90 transitions. [2022-12-06 07:25:59,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 449 transitions, 9923 flow [2022-12-06 07:26:00,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 449 transitions, 9746 flow, removed 17 selfloop flow, removed 5 redundant places. [2022-12-06 07:26:00,263 INFO L231 Difference]: Finished difference. Result has 176 places, 414 transitions, 8721 flow [2022-12-06 07:26:00,263 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=8488, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=8721, PETRI_PLACES=176, PETRI_TRANSITIONS=414} [2022-12-06 07:26:00,264 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 138 predicate places. [2022-12-06 07:26:00,264 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:00,264 INFO L89 Accepts]: Start accepts. Operand has 176 places, 414 transitions, 8721 flow [2022-12-06 07:26:00,266 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:00,266 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:00,266 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 414 transitions, 8721 flow [2022-12-06 07:26:00,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 414 transitions, 8721 flow [2022-12-06 07:26:00,525 INFO L130 PetriNetUnfolder]: 503/2191 cut-off events. [2022-12-06 07:26:00,525 INFO L131 PetriNetUnfolder]: For 23380/23884 co-relation queries the response was YES. [2022-12-06 07:26:00,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11277 conditions, 2191 events. 503/2191 cut-off events. For 23380/23884 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 22890 event pairs, 0 based on Foata normal form. 129/2208 useless extension candidates. Maximal degree in co-relation 10707. Up to 331 conditions per place. [2022-12-06 07:26:00,554 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 414 transitions, 8721 flow [2022-12-06 07:26:00,554 INFO L188 LiptonReduction]: Number of co-enabled transitions 2848 [2022-12-06 07:26:00,566 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:26:00,567 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 303 [2022-12-06 07:26:00,567 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 414 transitions, 8721 flow [2022-12-06 07:26:00,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:00,567 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:00,567 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:00,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 07:26:00,567 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:00,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:00,568 INFO L85 PathProgramCache]: Analyzing trace with hash -37564633, now seen corresponding path program 3 times [2022-12-06 07:26:00,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:00,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657883935] [2022-12-06 07:26:00,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:00,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:00,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:00,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:00,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657883935] [2022-12-06 07:26:00,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657883935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:00,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:00,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:26:00,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892926500] [2022-12-06 07:26:00,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:00,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:26:00,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:00,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:26:00,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:26:00,671 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 07:26:00,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 414 transitions, 8721 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:00,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:00,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 07:26:00,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:02,802 INFO L130 PetriNetUnfolder]: 8120/13021 cut-off events. [2022-12-06 07:26:02,802 INFO L131 PetriNetUnfolder]: For 147555/147555 co-relation queries the response was YES. [2022-12-06 07:26:02,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76350 conditions, 13021 events. 8120/13021 cut-off events. For 147555/147555 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 89051 event pairs, 1632 based on Foata normal form. 4/12500 useless extension candidates. Maximal degree in co-relation 74069. Up to 7067 conditions per place. [2022-12-06 07:26:02,912 INFO L137 encePairwiseOnDemand]: 27/47 looper letters, 321 selfloop transitions, 141 changer transitions 9/472 dead transitions. [2022-12-06 07:26:02,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 472 transitions, 9935 flow [2022-12-06 07:26:02,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:26:02,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:26:02,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2022-12-06 07:26:02,913 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44680851063829785 [2022-12-06 07:26:02,913 INFO L175 Difference]: Start difference. First operand has 176 places, 414 transitions, 8721 flow. Second operand 6 states and 126 transitions. [2022-12-06 07:26:02,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 472 transitions, 9935 flow [2022-12-06 07:26:03,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 472 transitions, 9889 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 07:26:03,617 INFO L231 Difference]: Finished difference. Result has 181 places, 406 transitions, 8815 flow [2022-12-06 07:26:03,617 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=8675, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8815, PETRI_PLACES=181, PETRI_TRANSITIONS=406} [2022-12-06 07:26:03,618 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 143 predicate places. [2022-12-06 07:26:03,618 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:03,618 INFO L89 Accepts]: Start accepts. Operand has 181 places, 406 transitions, 8815 flow [2022-12-06 07:26:03,619 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:03,619 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:03,619 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 406 transitions, 8815 flow [2022-12-06 07:26:03,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 406 transitions, 8815 flow [2022-12-06 07:26:03,887 INFO L130 PetriNetUnfolder]: 498/2138 cut-off events. [2022-12-06 07:26:03,888 INFO L131 PetriNetUnfolder]: For 24197/24695 co-relation queries the response was YES. [2022-12-06 07:26:03,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11463 conditions, 2138 events. 498/2138 cut-off events. For 24197/24695 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 22106 event pairs, 0 based on Foata normal form. 125/2156 useless extension candidates. Maximal degree in co-relation 10887. Up to 331 conditions per place. [2022-12-06 07:26:03,919 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 181 places, 406 transitions, 8815 flow [2022-12-06 07:26:03,920 INFO L188 LiptonReduction]: Number of co-enabled transitions 2832 [2022-12-06 07:26:03,931 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:26:03,932 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 314 [2022-12-06 07:26:03,932 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 406 transitions, 8815 flow [2022-12-06 07:26:03,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:03,932 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:03,932 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:03,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 07:26:03,932 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:03,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:03,933 INFO L85 PathProgramCache]: Analyzing trace with hash -964678587, now seen corresponding path program 4 times [2022-12-06 07:26:03,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:03,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789930972] [2022-12-06 07:26:03,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:03,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:04,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:04,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:04,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789930972] [2022-12-06 07:26:04,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789930972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:04,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:04,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:04,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623473034] [2022-12-06 07:26:04,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:04,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:26:04,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:04,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:26:04,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:26:04,087 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 07:26:04,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 406 transitions, 8815 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:04,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:04,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 07:26:04,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:06,136 INFO L130 PetriNetUnfolder]: 8086/12908 cut-off events. [2022-12-06 07:26:06,136 INFO L131 PetriNetUnfolder]: For 160116/160116 co-relation queries the response was YES. [2022-12-06 07:26:06,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77628 conditions, 12908 events. 8086/12908 cut-off events. For 160116/160116 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 87713 event pairs, 3254 based on Foata normal form. 4/12396 useless extension candidates. Maximal degree in co-relation 75696. Up to 9588 conditions per place. [2022-12-06 07:26:06,240 INFO L137 encePairwiseOnDemand]: 40/47 looper letters, 396 selfloop transitions, 58 changer transitions 7/462 dead transitions. [2022-12-06 07:26:06,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 462 transitions, 10123 flow [2022-12-06 07:26:06,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:26:06,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:26:06,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-12-06 07:26:06,241 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4425531914893617 [2022-12-06 07:26:06,241 INFO L175 Difference]: Start difference. First operand has 181 places, 406 transitions, 8815 flow. Second operand 5 states and 104 transitions. [2022-12-06 07:26:06,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 462 transitions, 10123 flow [2022-12-06 07:26:06,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 462 transitions, 9844 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-06 07:26:07,006 INFO L231 Difference]: Finished difference. Result has 182 places, 404 transitions, 8613 flow [2022-12-06 07:26:07,007 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=8540, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=8613, PETRI_PLACES=182, PETRI_TRANSITIONS=404} [2022-12-06 07:26:07,008 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 144 predicate places. [2022-12-06 07:26:07,008 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:07,008 INFO L89 Accepts]: Start accepts. Operand has 182 places, 404 transitions, 8613 flow [2022-12-06 07:26:07,010 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:07,010 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:07,010 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 404 transitions, 8613 flow [2022-12-06 07:26:07,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 404 transitions, 8613 flow [2022-12-06 07:26:07,336 INFO L130 PetriNetUnfolder]: 493/2101 cut-off events. [2022-12-06 07:26:07,336 INFO L131 PetriNetUnfolder]: For 23172/23809 co-relation queries the response was YES. [2022-12-06 07:26:07,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11157 conditions, 2101 events. 493/2101 cut-off events. For 23172/23809 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 21597 event pairs, 0 based on Foata normal form. 113/2107 useless extension candidates. Maximal degree in co-relation 10578. Up to 322 conditions per place. [2022-12-06 07:26:07,369 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 404 transitions, 8613 flow [2022-12-06 07:26:07,369 INFO L188 LiptonReduction]: Number of co-enabled transitions 2812 [2022-12-06 07:26:07,382 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:26:07,383 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 375 [2022-12-06 07:26:07,383 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 404 transitions, 8613 flow [2022-12-06 07:26:07,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:07,383 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:07,383 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:07,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 07:26:07,383 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:07,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:07,383 INFO L85 PathProgramCache]: Analyzing trace with hash 985819455, now seen corresponding path program 1 times [2022-12-06 07:26:07,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:07,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945764261] [2022-12-06 07:26:07,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:07,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:07,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:07,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:07,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945764261] [2022-12-06 07:26:07,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945764261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:07,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:07,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:07,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276136795] [2022-12-06 07:26:07,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:07,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:07,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:07,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:07,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:07,446 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 07:26:07,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 404 transitions, 8613 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:07,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:07,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 07:26:07,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:09,222 INFO L130 PetriNetUnfolder]: 7698/12249 cut-off events. [2022-12-06 07:26:09,222 INFO L131 PetriNetUnfolder]: For 141289/141289 co-relation queries the response was YES. [2022-12-06 07:26:09,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71795 conditions, 12249 events. 7698/12249 cut-off events. For 141289/141289 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 82092 event pairs, 1456 based on Foata normal form. 96/11869 useless extension candidates. Maximal degree in co-relation 69857. Up to 9700 conditions per place. [2022-12-06 07:26:09,356 INFO L137 encePairwiseOnDemand]: 42/47 looper letters, 372 selfloop transitions, 50 changer transitions 0/423 dead transitions. [2022-12-06 07:26:09,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 423 transitions, 9314 flow [2022-12-06 07:26:09,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:09,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:09,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-12-06 07:26:09,357 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48936170212765956 [2022-12-06 07:26:09,357 INFO L175 Difference]: Start difference. First operand has 182 places, 404 transitions, 8613 flow. Second operand 4 states and 92 transitions. [2022-12-06 07:26:09,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 423 transitions, 9314 flow [2022-12-06 07:26:09,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 423 transitions, 9119 flow, removed 7 selfloop flow, removed 7 redundant places. [2022-12-06 07:26:09,925 INFO L231 Difference]: Finished difference. Result has 179 places, 393 transitions, 8191 flow [2022-12-06 07:26:09,926 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=8027, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=8191, PETRI_PLACES=179, PETRI_TRANSITIONS=393} [2022-12-06 07:26:09,926 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 141 predicate places. [2022-12-06 07:26:09,926 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:09,927 INFO L89 Accepts]: Start accepts. Operand has 179 places, 393 transitions, 8191 flow [2022-12-06 07:26:09,928 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:09,928 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:09,928 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 393 transitions, 8191 flow [2022-12-06 07:26:09,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 393 transitions, 8191 flow [2022-12-06 07:26:10,206 INFO L130 PetriNetUnfolder]: 486/1962 cut-off events. [2022-12-06 07:26:10,206 INFO L131 PetriNetUnfolder]: For 20574/21106 co-relation queries the response was YES. [2022-12-06 07:26:10,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10475 conditions, 1962 events. 486/1962 cut-off events. For 20574/21106 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 19498 event pairs, 0 based on Foata normal form. 91/1950 useless extension candidates. Maximal degree in co-relation 9922. Up to 297 conditions per place. [2022-12-06 07:26:10,229 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 393 transitions, 8191 flow [2022-12-06 07:26:10,229 INFO L188 LiptonReduction]: Number of co-enabled transitions 2706 [2022-12-06 07:26:10,238 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:26:10,239 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 313 [2022-12-06 07:26:10,239 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 393 transitions, 8191 flow [2022-12-06 07:26:10,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:10,239 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:10,239 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:10,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 07:26:10,239 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:10,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:10,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1236107118, now seen corresponding path program 2 times [2022-12-06 07:26:10,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:10,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128129603] [2022-12-06 07:26:10,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:10,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:10,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:10,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:10,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128129603] [2022-12-06 07:26:10,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128129603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:10,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:10,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:10,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125802011] [2022-12-06 07:26:10,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:10,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:10,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:10,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:10,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:10,293 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 07:26:10,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 393 transitions, 8191 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:10,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:10,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 07:26:10,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:11,858 INFO L130 PetriNetUnfolder]: 7138/11221 cut-off events. [2022-12-06 07:26:11,858 INFO L131 PetriNetUnfolder]: For 123918/123918 co-relation queries the response was YES. [2022-12-06 07:26:11,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67534 conditions, 11221 events. 7138/11221 cut-off events. For 123918/123918 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 72343 event pairs, 1156 based on Foata normal form. 56/10869 useless extension candidates. Maximal degree in co-relation 65839. Up to 6712 conditions per place. [2022-12-06 07:26:11,943 INFO L137 encePairwiseOnDemand]: 40/47 looper letters, 371 selfloop transitions, 42 changer transitions 14/428 dead transitions. [2022-12-06 07:26:11,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 428 transitions, 8934 flow [2022-12-06 07:26:11,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:26:11,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:26:11,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2022-12-06 07:26:11,944 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.451063829787234 [2022-12-06 07:26:11,944 INFO L175 Difference]: Start difference. First operand has 179 places, 393 transitions, 8191 flow. Second operand 5 states and 106 transitions. [2022-12-06 07:26:11,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 428 transitions, 8934 flow [2022-12-06 07:26:12,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 428 transitions, 8770 flow, removed 25 selfloop flow, removed 4 redundant places. [2022-12-06 07:26:12,513 INFO L231 Difference]: Finished difference. Result has 179 places, 361 transitions, 7366 flow [2022-12-06 07:26:12,514 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=7553, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7366, PETRI_PLACES=179, PETRI_TRANSITIONS=361} [2022-12-06 07:26:12,514 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 141 predicate places. [2022-12-06 07:26:12,514 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:12,514 INFO L89 Accepts]: Start accepts. Operand has 179 places, 361 transitions, 7366 flow [2022-12-06 07:26:12,515 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:12,515 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:12,515 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 361 transitions, 7366 flow [2022-12-06 07:26:12,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 361 transitions, 7366 flow [2022-12-06 07:26:12,673 INFO L130 PetriNetUnfolder]: 440/1678 cut-off events. [2022-12-06 07:26:12,674 INFO L131 PetriNetUnfolder]: For 17154/17424 co-relation queries the response was YES. [2022-12-06 07:26:12,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9226 conditions, 1678 events. 440/1678 cut-off events. For 17154/17424 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 15791 event pairs, 0 based on Foata normal form. 91/1684 useless extension candidates. Maximal degree in co-relation 8989. Up to 259 conditions per place. [2022-12-06 07:26:12,697 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 361 transitions, 7366 flow [2022-12-06 07:26:12,697 INFO L188 LiptonReduction]: Number of co-enabled transitions 2566 [2022-12-06 07:26:12,706 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:26:12,706 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 07:26:12,707 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 361 transitions, 7366 flow [2022-12-06 07:26:12,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:12,707 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:12,707 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:12,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 07:26:12,707 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:12,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:12,707 INFO L85 PathProgramCache]: Analyzing trace with hash 354104493, now seen corresponding path program 5 times [2022-12-06 07:26:12,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:12,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102523883] [2022-12-06 07:26:12,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:12,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:12,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:12,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:12,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102523883] [2022-12-06 07:26:12,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102523883] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:12,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:12,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:12,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142700816] [2022-12-06 07:26:12,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:12,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:26:12,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:12,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:26:12,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:26:12,820 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 46 [2022-12-06 07:26:12,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 361 transitions, 7366 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:12,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:12,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 46 [2022-12-06 07:26:12,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:14,519 INFO L130 PetriNetUnfolder]: 7066/11052 cut-off events. [2022-12-06 07:26:14,519 INFO L131 PetriNetUnfolder]: For 118464/118464 co-relation queries the response was YES. [2022-12-06 07:26:14,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66432 conditions, 11052 events. 7066/11052 cut-off events. For 118464/118464 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 70477 event pairs, 1224 based on Foata normal form. 4/10627 useless extension candidates. Maximal degree in co-relation 65902. Up to 3419 conditions per place. [2022-12-06 07:26:14,619 INFO L137 encePairwiseOnDemand]: 30/46 looper letters, 266 selfloop transitions, 138 changer transitions 13/418 dead transitions. [2022-12-06 07:26:14,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 418 transitions, 8392 flow [2022-12-06 07:26:14,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:26:14,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:26:14,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2022-12-06 07:26:14,620 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4673913043478261 [2022-12-06 07:26:14,620 INFO L175 Difference]: Start difference. First operand has 179 places, 361 transitions, 7366 flow. Second operand 6 states and 129 transitions. [2022-12-06 07:26:14,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 418 transitions, 8392 flow [2022-12-06 07:26:15,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 418 transitions, 8294 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:15,077 INFO L231 Difference]: Finished difference. Result has 183 places, 357 transitions, 7556 flow [2022-12-06 07:26:15,077 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7268, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7556, PETRI_PLACES=183, PETRI_TRANSITIONS=357} [2022-12-06 07:26:15,078 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 145 predicate places. [2022-12-06 07:26:15,078 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:15,078 INFO L89 Accepts]: Start accepts. Operand has 183 places, 357 transitions, 7556 flow [2022-12-06 07:26:15,079 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:15,079 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:15,079 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 357 transitions, 7556 flow [2022-12-06 07:26:15,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 357 transitions, 7556 flow [2022-12-06 07:26:15,235 INFO L130 PetriNetUnfolder]: 439/1625 cut-off events. [2022-12-06 07:26:15,235 INFO L131 PetriNetUnfolder]: For 17886/18163 co-relation queries the response was YES. [2022-12-06 07:26:15,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9691 conditions, 1625 events. 439/1625 cut-off events. For 17886/18163 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 14988 event pairs, 0 based on Foata normal form. 92/1636 useless extension candidates. Maximal degree in co-relation 9575. Up to 255 conditions per place. [2022-12-06 07:26:15,258 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 357 transitions, 7556 flow [2022-12-06 07:26:15,258 INFO L188 LiptonReduction]: Number of co-enabled transitions 2566 [2022-12-06 07:26:15,265 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:26:15,266 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 07:26:15,266 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 357 transitions, 7556 flow [2022-12-06 07:26:15,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:15,266 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:15,266 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:15,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-06 07:26:15,266 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:15,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:15,266 INFO L85 PathProgramCache]: Analyzing trace with hash 700599877, now seen corresponding path program 6 times [2022-12-06 07:26:15,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:15,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892729815] [2022-12-06 07:26:15,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:15,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:15,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:15,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:15,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892729815] [2022-12-06 07:26:15,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892729815] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:15,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:15,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:15,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881301595] [2022-12-06 07:26:15,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:15,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:26:15,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:15,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:26:15,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:26:15,352 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 46 [2022-12-06 07:26:15,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 357 transitions, 7556 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:15,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:15,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 46 [2022-12-06 07:26:15,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:16,870 INFO L130 PetriNetUnfolder]: 7032/10965 cut-off events. [2022-12-06 07:26:16,870 INFO L131 PetriNetUnfolder]: For 128425/128425 co-relation queries the response was YES. [2022-12-06 07:26:16,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70267 conditions, 10965 events. 7032/10965 cut-off events. For 128425/128425 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 70066 event pairs, 1134 based on Foata normal form. 8/10561 useless extension candidates. Maximal degree in co-relation 70077. Up to 3230 conditions per place. [2022-12-06 07:26:16,960 INFO L137 encePairwiseOnDemand]: 35/46 looper letters, 304 selfloop transitions, 116 changer transitions 20/441 dead transitions. [2022-12-06 07:26:16,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 441 transitions, 9024 flow [2022-12-06 07:26:16,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:26:16,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:26:16,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2022-12-06 07:26:16,962 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48188405797101447 [2022-12-06 07:26:16,962 INFO L175 Difference]: Start difference. First operand has 182 places, 357 transitions, 7556 flow. Second operand 6 states and 133 transitions. [2022-12-06 07:26:16,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 441 transitions, 9024 flow [2022-12-06 07:26:17,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 441 transitions, 8718 flow, removed 15 selfloop flow, removed 5 redundant places. [2022-12-06 07:26:17,396 INFO L231 Difference]: Finished difference. Result has 183 places, 347 transitions, 7294 flow [2022-12-06 07:26:17,397 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7261, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7294, PETRI_PLACES=183, PETRI_TRANSITIONS=347} [2022-12-06 07:26:17,397 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 145 predicate places. [2022-12-06 07:26:17,397 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:17,397 INFO L89 Accepts]: Start accepts. Operand has 183 places, 347 transitions, 7294 flow [2022-12-06 07:26:17,398 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:17,398 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:17,398 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 347 transitions, 7294 flow [2022-12-06 07:26:17,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 347 transitions, 7294 flow [2022-12-06 07:26:17,613 INFO L130 PetriNetUnfolder]: 441/1559 cut-off events. [2022-12-06 07:26:17,613 INFO L131 PetriNetUnfolder]: For 17054/17530 co-relation queries the response was YES. [2022-12-06 07:26:17,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9376 conditions, 1559 events. 441/1559 cut-off events. For 17054/17530 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13961 event pairs, 0 based on Foata normal form. 92/1569 useless extension candidates. Maximal degree in co-relation 9222. Up to 246 conditions per place. [2022-12-06 07:26:17,634 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 347 transitions, 7294 flow [2022-12-06 07:26:17,634 INFO L188 LiptonReduction]: Number of co-enabled transitions 2510 [2022-12-06 07:26:17,642 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:26:17,643 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 246 [2022-12-06 07:26:17,643 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 347 transitions, 7294 flow [2022-12-06 07:26:17,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:17,643 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:17,643 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:17,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-06 07:26:17,643 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:17,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:17,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1368851828, now seen corresponding path program 1 times [2022-12-06 07:26:17,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:17,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972530998] [2022-12-06 07:26:17,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:17,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:17,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:17,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:17,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972530998] [2022-12-06 07:26:17,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972530998] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:17,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:17,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:17,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90039298] [2022-12-06 07:26:17,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:17,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:17,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:17,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:17,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:17,688 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 46 [2022-12-06 07:26:17,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 347 transitions, 7294 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:17,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:17,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 46 [2022-12-06 07:26:17,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:19,063 INFO L130 PetriNetUnfolder]: 6606/10303 cut-off events. [2022-12-06 07:26:19,063 INFO L131 PetriNetUnfolder]: For 125612/125612 co-relation queries the response was YES. [2022-12-06 07:26:19,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65104 conditions, 10303 events. 6606/10303 cut-off events. For 125612/125612 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 64636 event pairs, 2374 based on Foata normal form. 104/10002 useless extension candidates. Maximal degree in co-relation 64905. Up to 6840 conditions per place. [2022-12-06 07:26:19,133 INFO L137 encePairwiseOnDemand]: 41/46 looper letters, 357 selfloop transitions, 31 changer transitions 14/403 dead transitions. [2022-12-06 07:26:19,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 403 transitions, 8265 flow [2022-12-06 07:26:19,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:26:19,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:26:19,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2022-12-06 07:26:19,134 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4956521739130435 [2022-12-06 07:26:19,135 INFO L175 Difference]: Start difference. First operand has 179 places, 347 transitions, 7294 flow. Second operand 5 states and 114 transitions. [2022-12-06 07:26:19,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 403 transitions, 8265 flow [2022-12-06 07:26:19,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 403 transitions, 8081 flow, removed 21 selfloop flow, removed 6 redundant places. [2022-12-06 07:26:19,581 INFO L231 Difference]: Finished difference. Result has 176 places, 329 transitions, 6793 flow [2022-12-06 07:26:19,582 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6891, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6793, PETRI_PLACES=176, PETRI_TRANSITIONS=329} [2022-12-06 07:26:19,582 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 138 predicate places. [2022-12-06 07:26:19,582 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:19,582 INFO L89 Accepts]: Start accepts. Operand has 176 places, 329 transitions, 6793 flow [2022-12-06 07:26:19,583 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:19,584 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:19,584 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 329 transitions, 6793 flow [2022-12-06 07:26:19,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 329 transitions, 6793 flow [2022-12-06 07:26:19,746 INFO L130 PetriNetUnfolder]: 399/1452 cut-off events. [2022-12-06 07:26:19,747 INFO L131 PetriNetUnfolder]: For 14440/14641 co-relation queries the response was YES. [2022-12-06 07:26:19,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8410 conditions, 1452 events. 399/1452 cut-off events. For 14440/14641 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 12890 event pairs, 0 based on Foata normal form. 81/1461 useless extension candidates. Maximal degree in co-relation 7893. Up to 240 conditions per place. [2022-12-06 07:26:19,765 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 329 transitions, 6793 flow [2022-12-06 07:26:19,766 INFO L188 LiptonReduction]: Number of co-enabled transitions 2394 [2022-12-06 07:26:19,773 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:26:19,773 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 07:26:19,773 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 329 transitions, 6793 flow [2022-12-06 07:26:19,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:19,773 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:19,773 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:19,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-06 07:26:19,774 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:19,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:19,774 INFO L85 PathProgramCache]: Analyzing trace with hash 403006098, now seen corresponding path program 2 times [2022-12-06 07:26:19,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:19,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475746852] [2022-12-06 07:26:19,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:19,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:19,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:19,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:19,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475746852] [2022-12-06 07:26:19,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475746852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:19,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:19,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:19,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718881982] [2022-12-06 07:26:19,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:19,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:19,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:19,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:19,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:19,821 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 46 [2022-12-06 07:26:19,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 329 transitions, 6793 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:19,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:19,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 46 [2022-12-06 07:26:19,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:20,998 INFO L130 PetriNetUnfolder]: 5924/9005 cut-off events. [2022-12-06 07:26:20,998 INFO L131 PetriNetUnfolder]: For 104945/104945 co-relation queries the response was YES. [2022-12-06 07:26:21,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58006 conditions, 9005 events. 5924/9005 cut-off events. For 104945/104945 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 52826 event pairs, 2208 based on Foata normal form. 48/8672 useless extension candidates. Maximal degree in co-relation 57763. Up to 6728 conditions per place. [2022-12-06 07:26:21,055 INFO L137 encePairwiseOnDemand]: 41/46 looper letters, 304 selfloop transitions, 22 changer transitions 10/337 dead transitions. [2022-12-06 07:26:21,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 337 transitions, 6936 flow [2022-12-06 07:26:21,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:26:21,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:26:21,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-12-06 07:26:21,056 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4434782608695652 [2022-12-06 07:26:21,056 INFO L175 Difference]: Start difference. First operand has 176 places, 329 transitions, 6793 flow. Second operand 5 states and 102 transitions. [2022-12-06 07:26:21,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 337 transitions, 6936 flow [2022-12-06 07:26:21,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 337 transitions, 6744 flow, removed 18 selfloop flow, removed 8 redundant places. [2022-12-06 07:26:21,237 INFO L231 Difference]: Finished difference. Result has 165 places, 291 transitions, 5827 flow [2022-12-06 07:26:21,237 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=5986, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5827, PETRI_PLACES=165, PETRI_TRANSITIONS=291} [2022-12-06 07:26:21,237 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 127 predicate places. [2022-12-06 07:26:21,237 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:21,237 INFO L89 Accepts]: Start accepts. Operand has 165 places, 291 transitions, 5827 flow [2022-12-06 07:26:21,238 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:21,241 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:21,241 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 291 transitions, 5827 flow [2022-12-06 07:26:21,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 291 transitions, 5827 flow [2022-12-06 07:26:21,341 INFO L130 PetriNetUnfolder]: 358/1183 cut-off events. [2022-12-06 07:26:21,342 INFO L131 PetriNetUnfolder]: For 12204/12354 co-relation queries the response was YES. [2022-12-06 07:26:21,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7115 conditions, 1183 events. 358/1183 cut-off events. For 12204/12354 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 9584 event pairs, 0 based on Foata normal form. 64/1195 useless extension candidates. Maximal degree in co-relation 6338. Up to 232 conditions per place. [2022-12-06 07:26:21,357 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 291 transitions, 5827 flow [2022-12-06 07:26:21,357 INFO L188 LiptonReduction]: Number of co-enabled transitions 2168 [2022-12-06 07:26:21,362 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1055] L71-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= v_thread2Thread1of1ForFork1_~stop~1_35 1) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0) (= v_~res2~0_60 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_42| (select (select |v_#memory_int_304| v_~get3~0.base_81) (+ v_~get3~0.offset_81 (* v_thread2Thread1of1ForFork1_~i~1_83 4)))) (- 1) 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_42|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_35, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81, ~res2~0=v_~res2~0_60, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-06 07:26:21,584 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1055] L71-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= v_thread2Thread1of1ForFork1_~stop~1_35 1) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0) (= v_~res2~0_60 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_42| (select (select |v_#memory_int_304| v_~get3~0.base_81) (+ v_~get3~0.offset_81 (* v_thread2Thread1of1ForFork1_~i~1_83 4)))) (- 1) 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_42|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_35, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81, ~res2~0=v_~res2~0_60, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-06 07:26:21,814 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1054] L69-6-->thread2EXIT: Formula: (and (or (not (< v_thread2Thread1of1ForFork1_~i~1_81 v_~n3~0_88)) (not (< v_thread2Thread1of1ForFork1_~i~1_81 v_~n2~0_84))) (let ((.cse2 (= (mod v_thread2Thread1of1ForFork1_~stop~1_33 256) 0)) (.cse0 (= |v_thread2Thread1of1ForFork1_#res.offset_13| 0)) (.cse1 (= |v_thread2Thread1of1ForFork1_#res.base_13| 0))) (or (and .cse0 (= (+ v_~n3~0_88 v_~res2~0_56) v_~n2~0_84) .cse1 .cse2) (and (not .cse2) (= v_~res2~0_57 v_~res2~0_56) .cse0 .cse1)))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_81, ~n2~0=v_~n2~0_84, ~n3~0=v_~n3~0_88, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_33, ~res2~0=v_~res2~0_57} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_13|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_81, ~n2~0=v_~n2~0_84, ~n3~0=v_~n3~0_88, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_33, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_13|, ~res2~0=v_~res2~0_56} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 07:26:22,131 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1055] L71-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= v_thread2Thread1of1ForFork1_~stop~1_35 1) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0) (= v_~res2~0_60 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_42| (select (select |v_#memory_int_304| v_~get3~0.base_81) (+ v_~get3~0.offset_81 (* v_thread2Thread1of1ForFork1_~i~1_83 4)))) (- 1) 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_42|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_35, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81, ~res2~0=v_~res2~0_60, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-06 07:26:22,405 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:22,406 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1169 [2022-12-06 07:26:22,406 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 290 transitions, 5882 flow [2022-12-06 07:26:22,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:22,406 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:22,407 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:22,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-06 07:26:22,407 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:22,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:22,407 INFO L85 PathProgramCache]: Analyzing trace with hash -277698036, now seen corresponding path program 3 times [2022-12-06 07:26:22,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:22,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525799704] [2022-12-06 07:26:22,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:22,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:22,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:22,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:22,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525799704] [2022-12-06 07:26:22,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525799704] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:22,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:22,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:22,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271739679] [2022-12-06 07:26:22,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:22,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:22,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:22,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:22,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:22,473 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2022-12-06 07:26:22,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 290 transitions, 5882 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:22,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:22,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2022-12-06 07:26:22,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:23,443 INFO L130 PetriNetUnfolder]: 5244/7929 cut-off events. [2022-12-06 07:26:23,443 INFO L131 PetriNetUnfolder]: For 93731/93731 co-relation queries the response was YES. [2022-12-06 07:26:23,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49278 conditions, 7929 events. 5244/7929 cut-off events. For 93731/93731 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 45371 event pairs, 1012 based on Foata normal form. 152/7721 useless extension candidates. Maximal degree in co-relation 45255. Up to 5612 conditions per place. [2022-12-06 07:26:23,503 INFO L137 encePairwiseOnDemand]: 44/50 looper letters, 250 selfloop transitions, 28 changer transitions 23/302 dead transitions. [2022-12-06 07:26:23,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 302 transitions, 6237 flow [2022-12-06 07:26:23,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:26:23,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:26:23,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-12-06 07:26:23,504 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34 [2022-12-06 07:26:23,505 INFO L175 Difference]: Start difference. First operand has 163 places, 290 transitions, 5882 flow. Second operand 5 states and 85 transitions. [2022-12-06 07:26:23,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 302 transitions, 6237 flow [2022-12-06 07:26:23,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 302 transitions, 6053 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-12-06 07:26:23,682 INFO L231 Difference]: Finished difference. Result has 159 places, 258 transitions, 4994 flow [2022-12-06 07:26:23,684 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=5325, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4994, PETRI_PLACES=159, PETRI_TRANSITIONS=258} [2022-12-06 07:26:23,685 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 121 predicate places. [2022-12-06 07:26:23,685 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:23,685 INFO L89 Accepts]: Start accepts. Operand has 159 places, 258 transitions, 4994 flow [2022-12-06 07:26:23,686 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:23,686 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:23,686 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 258 transitions, 4994 flow [2022-12-06 07:26:23,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 258 transitions, 4994 flow [2022-12-06 07:26:23,899 INFO L130 PetriNetUnfolder]: 317/966 cut-off events. [2022-12-06 07:26:23,900 INFO L131 PetriNetUnfolder]: For 10043/10170 co-relation queries the response was YES. [2022-12-06 07:26:23,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5807 conditions, 966 events. 317/966 cut-off events. For 10043/10170 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7056 event pairs, 0 based on Foata normal form. 50/966 useless extension candidates. Maximal degree in co-relation 5556. Up to 202 conditions per place. [2022-12-06 07:26:23,916 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 258 transitions, 4994 flow [2022-12-06 07:26:23,916 INFO L188 LiptonReduction]: Number of co-enabled transitions 1838 [2022-12-06 07:26:23,925 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1053] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_19| 0) (= v_~res1~0_62 (ite (< |v_thread1Thread1of1ForFork0_#t~mem4_40| (select (select |v_#memory_int_298| v_~get2~0.base_87) (+ v_~get2~0.offset_87 (* v_thread1Thread1of1ForFork0_~i~0_83 4)))) (- 1) 1)) (= v_thread1Thread1of1ForFork0_~stop~0_43 1) (= |v_thread1Thread1of1ForFork0_#res.base_19| 0)) InVars {thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_40|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, ~get2~0.base=v_~get2~0.base_87} OutVars{~res1~0=v_~res1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_19|, thread1Thread1of1ForFork0_#t~mem5=|v_thread1Thread1of1ForFork0_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_19|, ~get2~0.base=v_~get2~0.base_87, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_43} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~mem5, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] [2022-12-06 07:26:24,218 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1053] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_19| 0) (= v_~res1~0_62 (ite (< |v_thread1Thread1of1ForFork0_#t~mem4_40| (select (select |v_#memory_int_298| v_~get2~0.base_87) (+ v_~get2~0.offset_87 (* v_thread1Thread1of1ForFork0_~i~0_83 4)))) (- 1) 1)) (= v_thread1Thread1of1ForFork0_~stop~0_43 1) (= |v_thread1Thread1of1ForFork0_#res.base_19| 0)) InVars {thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_40|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, ~get2~0.base=v_~get2~0.base_87} OutVars{~res1~0=v_~res1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_19|, thread1Thread1of1ForFork0_#t~mem5=|v_thread1Thread1of1ForFork0_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_19|, ~get2~0.base=v_~get2~0.base_87, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_43} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~mem5, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] [2022-12-06 07:26:24,465 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1053] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_19| 0) (= v_~res1~0_62 (ite (< |v_thread1Thread1of1ForFork0_#t~mem4_40| (select (select |v_#memory_int_298| v_~get2~0.base_87) (+ v_~get2~0.offset_87 (* v_thread1Thread1of1ForFork0_~i~0_83 4)))) (- 1) 1)) (= v_thread1Thread1of1ForFork0_~stop~0_43 1) (= |v_thread1Thread1of1ForFork0_#res.base_19| 0)) InVars {thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_40|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, ~get2~0.base=v_~get2~0.base_87} OutVars{~res1~0=v_~res1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_19|, thread1Thread1of1ForFork0_#t~mem5=|v_thread1Thread1of1ForFork0_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_19|, ~get2~0.base=v_~get2~0.base_87, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_43} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~mem5, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] [2022-12-06 07:26:24,676 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1052] L49-6-->thread1EXIT: Formula: (and (let ((.cse1 (= |v_thread1Thread1of1ForFork0_#res.offset_17| 0)) (.cse2 (= |v_thread1Thread1of1ForFork0_#res.base_17| 0)) (.cse0 (= 0 (mod v_thread1Thread1of1ForFork0_~stop~0_41 256)))) (or (and (= (+ v_~n2~0_80 v_~res1~0_58) v_~n1~0_94) .cse0 .cse1 .cse2) (and .cse1 (= v_~res1~0_59 v_~res1~0_58) .cse2 (not .cse0)))) (or (not (< v_thread1Thread1of1ForFork0_~i~0_81 v_~n2~0_80)) (not (< v_thread1Thread1of1ForFork0_~i~0_81 v_~n1~0_94)))) InVars {~res1~0=v_~res1~0_59, ~n2~0=v_~n2~0_80, ~n1~0=v_~n1~0_94, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_81, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_41} OutVars{~res1~0=v_~res1~0_58, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_17|, ~n2~0=v_~n2~0_80, ~n1~0=v_~n1~0_94, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_81, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_17|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_41} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] [2022-12-06 07:26:24,964 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:24,965 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1280 [2022-12-06 07:26:24,965 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 257 transitions, 5055 flow [2022-12-06 07:26:24,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:24,965 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:24,965 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:24,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-06 07:26:24,966 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:24,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:24,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1595816312, now seen corresponding path program 1 times [2022-12-06 07:26:24,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:24,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261398552] [2022-12-06 07:26:24,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:24,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:25,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:25,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:25,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261398552] [2022-12-06 07:26:25,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261398552] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:25,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:25,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:25,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829138949] [2022-12-06 07:26:25,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:25,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:25,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:25,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:25,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:25,017 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 49 [2022-12-06 07:26:25,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 257 transitions, 5055 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:25,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:25,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 49 [2022-12-06 07:26:25,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:25,878 INFO L130 PetriNetUnfolder]: 4692/7113 cut-off events. [2022-12-06 07:26:25,878 INFO L131 PetriNetUnfolder]: For 77730/77730 co-relation queries the response was YES. [2022-12-06 07:26:25,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41670 conditions, 7113 events. 4692/7113 cut-off events. For 77730/77730 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 39879 event pairs, 460 based on Foata normal form. 200/6993 useless extension candidates. Maximal degree in co-relation 40497. Up to 4466 conditions per place. [2022-12-06 07:26:25,922 INFO L137 encePairwiseOnDemand]: 45/49 looper letters, 265 selfloop transitions, 34 changer transitions 0/300 dead transitions. [2022-12-06 07:26:25,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 300 transitions, 5937 flow [2022-12-06 07:26:25,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:25,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:25,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-12-06 07:26:25,923 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45408163265306123 [2022-12-06 07:26:25,923 INFO L175 Difference]: Start difference. First operand has 150 places, 257 transitions, 5055 flow. Second operand 4 states and 89 transitions. [2022-12-06 07:26:25,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 300 transitions, 5937 flow [2022-12-06 07:26:25,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 300 transitions, 5686 flow, removed 5 selfloop flow, removed 9 redundant places. [2022-12-06 07:26:25,987 INFO L231 Difference]: Finished difference. Result has 144 places, 252 transitions, 4768 flow [2022-12-06 07:26:25,987 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4700, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4768, PETRI_PLACES=144, PETRI_TRANSITIONS=252} [2022-12-06 07:26:25,987 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 106 predicate places. [2022-12-06 07:26:25,987 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:25,987 INFO L89 Accepts]: Start accepts. Operand has 144 places, 252 transitions, 4768 flow [2022-12-06 07:26:25,988 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:25,988 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:25,988 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 252 transitions, 4768 flow [2022-12-06 07:26:25,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 252 transitions, 4768 flow [2022-12-06 07:26:26,063 INFO L130 PetriNetUnfolder]: 299/954 cut-off events. [2022-12-06 07:26:26,063 INFO L131 PetriNetUnfolder]: For 8331/8411 co-relation queries the response was YES. [2022-12-06 07:26:26,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5463 conditions, 954 events. 299/954 cut-off events. For 8331/8411 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7129 event pairs, 0 based on Foata normal form. 46/950 useless extension candidates. Maximal degree in co-relation 4401. Up to 203 conditions per place. [2022-12-06 07:26:26,073 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 252 transitions, 4768 flow [2022-12-06 07:26:26,073 INFO L188 LiptonReduction]: Number of co-enabled transitions 1758 [2022-12-06 07:26:26,078 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:26:26,079 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-06 07:26:26,079 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 252 transitions, 4768 flow [2022-12-06 07:26:26,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:26,079 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:26,079 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:26,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-06 07:26:26,079 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:26,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:26,080 INFO L85 PathProgramCache]: Analyzing trace with hash 260300290, now seen corresponding path program 1 times [2022-12-06 07:26:26,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:26,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999685881] [2022-12-06 07:26:26,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:26,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:26,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:26,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:26,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999685881] [2022-12-06 07:26:26,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999685881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:26,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:26,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:26,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104071787] [2022-12-06 07:26:26,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:26,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:26,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:26,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:26,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:26,130 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 49 [2022-12-06 07:26:26,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 252 transitions, 4768 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:26,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:26,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 49 [2022-12-06 07:26:26,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:26,804 INFO L130 PetriNetUnfolder]: 4176/6269 cut-off events. [2022-12-06 07:26:26,804 INFO L131 PetriNetUnfolder]: For 60729/60729 co-relation queries the response was YES. [2022-12-06 07:26:26,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36676 conditions, 6269 events. 4176/6269 cut-off events. For 60729/60729 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 33561 event pairs, 1670 based on Foata normal form. 104/6058 useless extension candidates. Maximal degree in co-relation 29523. Up to 5166 conditions per place. [2022-12-06 07:26:26,844 INFO L137 encePairwiseOnDemand]: 44/49 looper letters, 226 selfloop transitions, 5 changer transitions 33/265 dead transitions. [2022-12-06 07:26:26,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 265 transitions, 5021 flow [2022-12-06 07:26:26,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:26:26,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:26:26,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-06 07:26:26,846 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3551020408163265 [2022-12-06 07:26:26,846 INFO L175 Difference]: Start difference. First operand has 144 places, 252 transitions, 4768 flow. Second operand 5 states and 87 transitions. [2022-12-06 07:26:26,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 265 transitions, 5021 flow [2022-12-06 07:26:26,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 265 transitions, 4888 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:26,895 INFO L231 Difference]: Finished difference. Result has 141 places, 218 transitions, 3950 flow [2022-12-06 07:26:26,895 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4297, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3950, PETRI_PLACES=141, PETRI_TRANSITIONS=218} [2022-12-06 07:26:26,896 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 103 predicate places. [2022-12-06 07:26:26,896 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:26,896 INFO L89 Accepts]: Start accepts. Operand has 141 places, 218 transitions, 3950 flow [2022-12-06 07:26:26,896 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:26,897 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:26,897 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 218 transitions, 3950 flow [2022-12-06 07:26:26,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 218 transitions, 3950 flow [2022-12-06 07:26:26,953 INFO L130 PetriNetUnfolder]: 258/731 cut-off events. [2022-12-06 07:26:26,953 INFO L131 PetriNetUnfolder]: For 6684/6741 co-relation queries the response was YES. [2022-12-06 07:26:26,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4351 conditions, 731 events. 258/731 cut-off events. For 6684/6741 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4723 event pairs, 0 based on Foata normal form. 29/722 useless extension candidates. Maximal degree in co-relation 3939. Up to 159 conditions per place. [2022-12-06 07:26:26,961 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 218 transitions, 3950 flow [2022-12-06 07:26:26,962 INFO L188 LiptonReduction]: Number of co-enabled transitions 1594 [2022-12-06 07:26:26,965 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:26:26,965 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-06 07:26:26,965 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 218 transitions, 3950 flow [2022-12-06 07:26:26,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:26,965 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:26,966 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:26,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-06 07:26:26,966 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:26,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:26,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1389266355, now seen corresponding path program 1 times [2022-12-06 07:26:26,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:26,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491021649] [2022-12-06 07:26:26,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:26,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:27,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:27,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:27,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491021649] [2022-12-06 07:26:27,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491021649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:27,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:27,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:26:27,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624485625] [2022-12-06 07:26:27,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:27,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:26:27,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:27,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:26:27,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:26:27,090 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 44 [2022-12-06 07:26:27,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 218 transitions, 3950 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:27,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:27,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 44 [2022-12-06 07:26:27,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:27,897 INFO L130 PetriNetUnfolder]: 5316/7865 cut-off events. [2022-12-06 07:26:27,898 INFO L131 PetriNetUnfolder]: For 67140/67140 co-relation queries the response was YES. [2022-12-06 07:26:27,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45982 conditions, 7865 events. 5316/7865 cut-off events. For 67140/67140 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 42637 event pairs, 1306 based on Foata normal form. 4/7530 useless extension candidates. Maximal degree in co-relation 39511. Up to 3035 conditions per place. [2022-12-06 07:26:27,948 INFO L137 encePairwiseOnDemand]: 31/44 looper letters, 284 selfloop transitions, 87 changer transitions 41/413 dead transitions. [2022-12-06 07:26:27,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 413 transitions, 7499 flow [2022-12-06 07:26:27,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:26:27,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:26:27,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2022-12-06 07:26:27,949 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2022-12-06 07:26:27,949 INFO L175 Difference]: Start difference. First operand has 133 places, 218 transitions, 3950 flow. Second operand 7 states and 140 transitions. [2022-12-06 07:26:27,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 413 transitions, 7499 flow [2022-12-06 07:26:28,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 413 transitions, 7114 flow, removed 20 selfloop flow, removed 7 redundant places. [2022-12-06 07:26:28,021 INFO L231 Difference]: Finished difference. Result has 135 places, 242 transitions, 4379 flow [2022-12-06 07:26:28,021 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3709, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4379, PETRI_PLACES=135, PETRI_TRANSITIONS=242} [2022-12-06 07:26:28,021 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 97 predicate places. [2022-12-06 07:26:28,022 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:28,022 INFO L89 Accepts]: Start accepts. Operand has 135 places, 242 transitions, 4379 flow [2022-12-06 07:26:28,022 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:28,022 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:28,022 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 242 transitions, 4379 flow [2022-12-06 07:26:28,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 242 transitions, 4379 flow [2022-12-06 07:26:28,095 INFO L130 PetriNetUnfolder]: 325/916 cut-off events. [2022-12-06 07:26:28,095 INFO L131 PetriNetUnfolder]: For 8436/8497 co-relation queries the response was YES. [2022-12-06 07:26:28,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5409 conditions, 916 events. 325/916 cut-off events. For 8436/8497 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6344 event pairs, 0 based on Foata normal form. 39/909 useless extension candidates. Maximal degree in co-relation 4420. Up to 184 conditions per place. [2022-12-06 07:26:28,105 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 242 transitions, 4379 flow [2022-12-06 07:26:28,105 INFO L188 LiptonReduction]: Number of co-enabled transitions 1770 [2022-12-06 07:26:28,856 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:28,856 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 834 [2022-12-06 07:26:28,856 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 241 transitions, 4376 flow [2022-12-06 07:26:28,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:28,856 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:28,856 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:28,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-06 07:26:28,857 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:28,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:28,857 INFO L85 PathProgramCache]: Analyzing trace with hash 904823545, now seen corresponding path program 1 times [2022-12-06 07:26:28,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:28,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020562687] [2022-12-06 07:26:28,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:28,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:28,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:28,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:28,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020562687] [2022-12-06 07:26:28,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020562687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:28,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:28,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:28,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983557311] [2022-12-06 07:26:28,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:28,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:26:28,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:28,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:26:28,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:26:28,924 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-06 07:26:28,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 241 transitions, 4376 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:28,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:28,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-06 07:26:28,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:29,855 INFO L130 PetriNetUnfolder]: 5994/8810 cut-off events. [2022-12-06 07:26:29,855 INFO L131 PetriNetUnfolder]: For 76872/76872 co-relation queries the response was YES. [2022-12-06 07:26:29,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50598 conditions, 8810 events. 5994/8810 cut-off events. For 76872/76872 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 48299 event pairs, 2539 based on Foata normal form. 72/8483 useless extension candidates. Maximal degree in co-relation 42691. Up to 4304 conditions per place. [2022-12-06 07:26:29,911 INFO L137 encePairwiseOnDemand]: 39/45 looper letters, 469 selfloop transitions, 13 changer transitions 0/483 dead transitions. [2022-12-06 07:26:29,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 483 transitions, 8833 flow [2022-12-06 07:26:29,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:26:29,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:26:29,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2022-12-06 07:26:29,912 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6577777777777778 [2022-12-06 07:26:29,912 INFO L175 Difference]: Start difference. First operand has 134 places, 241 transitions, 4376 flow. Second operand 5 states and 148 transitions. [2022-12-06 07:26:29,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 483 transitions, 8833 flow [2022-12-06 07:26:29,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 483 transitions, 8631 flow, removed 39 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:29,977 INFO L231 Difference]: Finished difference. Result has 137 places, 252 transitions, 4536 flow [2022-12-06 07:26:29,977 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=4260, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4536, PETRI_PLACES=137, PETRI_TRANSITIONS=252} [2022-12-06 07:26:29,979 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 99 predicate places. [2022-12-06 07:26:29,979 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:29,985 INFO L89 Accepts]: Start accepts. Operand has 137 places, 252 transitions, 4536 flow [2022-12-06 07:26:29,986 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:29,986 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:29,986 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 252 transitions, 4536 flow [2022-12-06 07:26:29,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 252 transitions, 4536 flow [2022-12-06 07:26:30,083 INFO L130 PetriNetUnfolder]: 350/1027 cut-off events. [2022-12-06 07:26:30,084 INFO L131 PetriNetUnfolder]: For 9379/9473 co-relation queries the response was YES. [2022-12-06 07:26:30,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5789 conditions, 1027 events. 350/1027 cut-off events. For 9379/9473 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7543 event pairs, 0 based on Foata normal form. 41/1037 useless extension candidates. Maximal degree in co-relation 4818. Up to 198 conditions per place. [2022-12-06 07:26:30,096 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 252 transitions, 4536 flow [2022-12-06 07:26:30,097 INFO L188 LiptonReduction]: Number of co-enabled transitions 1898 [2022-12-06 07:26:30,106 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:26:30,109 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-06 07:26:30,109 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 252 transitions, 4536 flow [2022-12-06 07:26:30,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:30,110 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:30,110 INFO L213 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] [2022-12-06 07:26:30,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-06 07:26:30,110 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:30,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:30,110 INFO L85 PathProgramCache]: Analyzing trace with hash -201703975, now seen corresponding path program 1 times [2022-12-06 07:26:30,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:30,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588521992] [2022-12-06 07:26:30,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:30,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:30,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:30,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:30,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588521992] [2022-12-06 07:26:30,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588521992] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:26:30,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911006436] [2022-12-06 07:26:30,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:30,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:26:30,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:26:30,327 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:26:30,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 07:26:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:30,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 07:26:30,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:26:30,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:26:30,679 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:26:30,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911006436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:30,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:26:30,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 9 [2022-12-06 07:26:30,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330310151] [2022-12-06 07:26:30,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:30,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:26:30,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:30,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:26:30,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:26:30,681 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-06 07:26:30,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 252 transitions, 4536 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:30,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:30,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-06 07:26:30,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:31,970 INFO L130 PetriNetUnfolder]: 8527/12416 cut-off events. [2022-12-06 07:26:31,970 INFO L131 PetriNetUnfolder]: For 107642/107642 co-relation queries the response was YES. [2022-12-06 07:26:32,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71358 conditions, 12416 events. 8527/12416 cut-off events. For 107642/107642 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 70490 event pairs, 3549 based on Foata normal form. 4/12386 useless extension candidates. Maximal degree in co-relation 58707. Up to 3795 conditions per place. [2022-12-06 07:26:32,071 INFO L137 encePairwiseOnDemand]: 30/45 looper letters, 316 selfloop transitions, 108 changer transitions 43/468 dead transitions. [2022-12-06 07:26:32,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 468 transitions, 8764 flow [2022-12-06 07:26:32,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:26:32,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:26:32,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2022-12-06 07:26:32,072 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2022-12-06 07:26:32,072 INFO L175 Difference]: Start difference. First operand has 137 places, 252 transitions, 4536 flow. Second operand 6 states and 132 transitions. [2022-12-06 07:26:32,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 468 transitions, 8764 flow [2022-12-06 07:26:32,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 468 transitions, 8760 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:26:32,199 INFO L231 Difference]: Finished difference. Result has 143 places, 292 transitions, 5499 flow [2022-12-06 07:26:32,199 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=4533, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5499, PETRI_PLACES=143, PETRI_TRANSITIONS=292} [2022-12-06 07:26:32,199 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 105 predicate places. [2022-12-06 07:26:32,199 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:32,199 INFO L89 Accepts]: Start accepts. Operand has 143 places, 292 transitions, 5499 flow [2022-12-06 07:26:32,200 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:32,200 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:32,200 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 292 transitions, 5499 flow [2022-12-06 07:26:32,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 292 transitions, 5499 flow [2022-12-06 07:26:32,313 INFO L130 PetriNetUnfolder]: 472/1287 cut-off events. [2022-12-06 07:26:32,313 INFO L131 PetriNetUnfolder]: For 13743/13866 co-relation queries the response was YES. [2022-12-06 07:26:32,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7798 conditions, 1287 events. 472/1287 cut-off events. For 13743/13866 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9406 event pairs, 0 based on Foata normal form. 53/1297 useless extension candidates. Maximal degree in co-relation 6198. Up to 276 conditions per place. [2022-12-06 07:26:32,331 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 292 transitions, 5499 flow [2022-12-06 07:26:32,331 INFO L188 LiptonReduction]: Number of co-enabled transitions 2124 [2022-12-06 07:26:32,343 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:26:32,343 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-06 07:26:32,343 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 292 transitions, 5499 flow [2022-12-06 07:26:32,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:32,343 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:32,344 INFO L213 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] [2022-12-06 07:26:32,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 07:26:32,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-06 07:26:32,548 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:32,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:32,549 INFO L85 PathProgramCache]: Analyzing trace with hash 2144975828, now seen corresponding path program 1 times [2022-12-06 07:26:32,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:32,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821386643] [2022-12-06 07:26:32,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:32,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:32,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:32,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:32,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821386643] [2022-12-06 07:26:32,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821386643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:32,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:32,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:32,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975558966] [2022-12-06 07:26:32,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:32,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:32,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:32,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:32,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:32,597 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 07:26:32,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 292 transitions, 5499 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:32,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:32,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 07:26:32,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:33,553 INFO L130 PetriNetUnfolder]: 6399/9198 cut-off events. [2022-12-06 07:26:33,554 INFO L131 PetriNetUnfolder]: For 87162/87162 co-relation queries the response was YES. [2022-12-06 07:26:33,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54895 conditions, 9198 events. 6399/9198 cut-off events. For 87162/87162 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 46461 event pairs, 2941 based on Foata normal form. 308/9153 useless extension candidates. Maximal degree in co-relation 50091. Up to 7619 conditions per place. [2022-12-06 07:26:33,626 INFO L137 encePairwiseOnDemand]: 40/45 looper letters, 168 selfloop transitions, 0 changer transitions 124/292 dead transitions. [2022-12-06 07:26:33,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 292 transitions, 5755 flow [2022-12-06 07:26:33,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:33,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:33,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-06 07:26:33,628 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2022-12-06 07:26:33,628 INFO L175 Difference]: Start difference. First operand has 143 places, 292 transitions, 5499 flow. Second operand 4 states and 87 transitions. [2022-12-06 07:26:33,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 292 transitions, 5755 flow [2022-12-06 07:26:33,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 292 transitions, 5586 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:33,759 INFO L231 Difference]: Finished difference. Result has 142 places, 168 transitions, 2798 flow [2022-12-06 07:26:33,759 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=4146, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2798, PETRI_PLACES=142, PETRI_TRANSITIONS=168} [2022-12-06 07:26:33,759 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 104 predicate places. [2022-12-06 07:26:33,759 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:33,760 INFO L89 Accepts]: Start accepts. Operand has 142 places, 168 transitions, 2798 flow [2022-12-06 07:26:33,760 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:33,760 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:33,760 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 168 transitions, 2798 flow [2022-12-06 07:26:33,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 168 transitions, 2798 flow [2022-12-06 07:26:33,822 INFO L130 PetriNetUnfolder]: 260/683 cut-off events. [2022-12-06 07:26:33,823 INFO L131 PetriNetUnfolder]: For 6570/6628 co-relation queries the response was YES. [2022-12-06 07:26:33,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3867 conditions, 683 events. 260/683 cut-off events. For 6570/6628 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4147 event pairs, 0 based on Foata normal form. 26/684 useless extension candidates. Maximal degree in co-relation 3277. Up to 154 conditions per place. [2022-12-06 07:26:33,833 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 168 transitions, 2798 flow [2022-12-06 07:26:33,833 INFO L188 LiptonReduction]: Number of co-enabled transitions 1230 [2022-12-06 07:26:37,668 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:37,669 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3910 [2022-12-06 07:26:37,669 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 168 transitions, 2840 flow [2022-12-06 07:26:37,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:37,669 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:37,670 INFO L213 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] [2022-12-06 07:26:37,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-06 07:26:37,670 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:37,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:37,670 INFO L85 PathProgramCache]: Analyzing trace with hash 733006512, now seen corresponding path program 1 times [2022-12-06 07:26:37,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:37,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932367136] [2022-12-06 07:26:37,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:37,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:37,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:37,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:37,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932367136] [2022-12-06 07:26:37,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932367136] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:37,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:37,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:26:37,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52070026] [2022-12-06 07:26:37,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:37,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:37,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:37,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:37,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:37,731 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 44 [2022-12-06 07:26:37,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 168 transitions, 2840 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:37,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:37,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 44 [2022-12-06 07:26:37,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:38,438 INFO L130 PetriNetUnfolder]: 3737/5321 cut-off events. [2022-12-06 07:26:38,439 INFO L131 PetriNetUnfolder]: For 47692/47692 co-relation queries the response was YES. [2022-12-06 07:26:38,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31887 conditions, 5321 events. 3737/5321 cut-off events. For 47692/47692 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 25585 event pairs, 1717 based on Foata normal form. 62/5360 useless extension candidates. Maximal degree in co-relation 28023. Up to 4942 conditions per place. [2022-12-06 07:26:38,673 INFO L137 encePairwiseOnDemand]: 41/44 looper letters, 141 selfloop transitions, 0 changer transitions 71/213 dead transitions. [2022-12-06 07:26:38,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 213 transitions, 3732 flow [2022-12-06 07:26:38,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:38,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:38,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-06 07:26:38,688 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4943181818181818 [2022-12-06 07:26:38,688 INFO L175 Difference]: Start difference. First operand has 128 places, 168 transitions, 2840 flow. Second operand 4 states and 87 transitions. [2022-12-06 07:26:38,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 213 transitions, 3732 flow [2022-12-06 07:26:38,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 213 transitions, 3483 flow, removed 38 selfloop flow, removed 6 redundant places. [2022-12-06 07:26:38,794 INFO L231 Difference]: Finished difference. Result has 125 places, 142 transitions, 2136 flow [2022-12-06 07:26:38,794 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2353, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2136, PETRI_PLACES=125, PETRI_TRANSITIONS=142} [2022-12-06 07:26:38,794 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 87 predicate places. [2022-12-06 07:26:38,794 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:38,794 INFO L89 Accepts]: Start accepts. Operand has 125 places, 142 transitions, 2136 flow [2022-12-06 07:26:38,795 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:38,795 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:38,795 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 142 transitions, 2136 flow [2022-12-06 07:26:38,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 142 transitions, 2136 flow [2022-12-06 07:26:38,833 INFO L130 PetriNetUnfolder]: 190/488 cut-off events. [2022-12-06 07:26:38,833 INFO L131 PetriNetUnfolder]: For 3986/4044 co-relation queries the response was YES. [2022-12-06 07:26:38,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2637 conditions, 488 events. 190/488 cut-off events. For 3986/4044 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2652 event pairs, 0 based on Foata normal form. 22/489 useless extension candidates. Maximal degree in co-relation 2119. Up to 117 conditions per place. [2022-12-06 07:26:38,839 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 142 transitions, 2136 flow [2022-12-06 07:26:38,839 INFO L188 LiptonReduction]: Number of co-enabled transitions 1062 [2022-12-06 07:26:44,045 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:44,046 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5252 [2022-12-06 07:26:44,046 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 142 transitions, 2176 flow [2022-12-06 07:26:44,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:44,046 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:44,046 INFO L213 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] [2022-12-06 07:26:44,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-06 07:26:44,046 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:44,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:44,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1871313740, now seen corresponding path program 1 times [2022-12-06 07:26:44,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:44,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936599548] [2022-12-06 07:26:44,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:44,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:44,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:44,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:44,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936599548] [2022-12-06 07:26:44,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936599548] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:26:44,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9344379] [2022-12-06 07:26:44,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:44,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:26:44,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:26:44,272 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:26:44,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 07:26:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:44,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 07:26:44,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:26:44,600 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:26:44,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 74 [2022-12-06 07:26:44,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:44,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:26:44,759 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:26:44,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 81 [2022-12-06 07:26:45,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:45,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9344379] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:26:45,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:26:45,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2022-12-06 07:26:45,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561251716] [2022-12-06 07:26:45,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:26:45,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 07:26:45,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:45,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 07:26:45,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2022-12-06 07:26:45,013 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 44 [2022-12-06 07:26:45,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 142 transitions, 2176 flow. Second operand has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:45,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:45,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 44 [2022-12-06 07:26:45,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:47,429 INFO L130 PetriNetUnfolder]: 8799/12747 cut-off events. [2022-12-06 07:26:47,429 INFO L131 PetriNetUnfolder]: For 86401/86401 co-relation queries the response was YES. [2022-12-06 07:26:47,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70887 conditions, 12747 events. 8799/12747 cut-off events. For 86401/86401 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 72545 event pairs, 2100 based on Foata normal form. 176/12889 useless extension candidates. Maximal degree in co-relation 56956. Up to 1997 conditions per place. [2022-12-06 07:26:47,515 INFO L137 encePairwiseOnDemand]: 24/44 looper letters, 355 selfloop transitions, 124 changer transitions 161/641 dead transitions. [2022-12-06 07:26:47,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 641 transitions, 9230 flow [2022-12-06 07:26:47,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 07:26:47,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 07:26:47,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 373 transitions. [2022-12-06 07:26:47,517 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35321969696969696 [2022-12-06 07:26:47,517 INFO L175 Difference]: Start difference. First operand has 119 places, 142 transitions, 2176 flow. Second operand 24 states and 373 transitions. [2022-12-06 07:26:47,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 641 transitions, 9230 flow [2022-12-06 07:26:47,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 641 transitions, 8800 flow, removed 68 selfloop flow, removed 5 redundant places. [2022-12-06 07:26:47,640 INFO L231 Difference]: Finished difference. Result has 153 places, 224 transitions, 4211 flow [2022-12-06 07:26:47,640 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2038, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=4211, PETRI_PLACES=153, PETRI_TRANSITIONS=224} [2022-12-06 07:26:47,640 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 115 predicate places. [2022-12-06 07:26:47,641 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:47,641 INFO L89 Accepts]: Start accepts. Operand has 153 places, 224 transitions, 4211 flow [2022-12-06 07:26:47,641 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:47,642 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:47,642 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 224 transitions, 4211 flow [2022-12-06 07:26:47,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 224 transitions, 4211 flow [2022-12-06 07:26:47,740 INFO L130 PetriNetUnfolder]: 361/1100 cut-off events. [2022-12-06 07:26:47,740 INFO L131 PetriNetUnfolder]: For 9589/9697 co-relation queries the response was YES. [2022-12-06 07:26:47,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5769 conditions, 1100 events. 361/1100 cut-off events. For 9589/9697 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8332 event pairs, 0 based on Foata normal form. 45/1110 useless extension candidates. Maximal degree in co-relation 5655. Up to 210 conditions per place. [2022-12-06 07:26:47,755 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 224 transitions, 4211 flow [2022-12-06 07:26:47,755 INFO L188 LiptonReduction]: Number of co-enabled transitions 1670 [2022-12-06 07:26:48,260 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:48,261 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 620 [2022-12-06 07:26:48,261 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 223 transitions, 4210 flow [2022-12-06 07:26:48,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:48,261 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:48,261 INFO L213 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] [2022-12-06 07:26:48,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 07:26:48,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-12-06 07:26:48,466 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:48,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:48,467 INFO L85 PathProgramCache]: Analyzing trace with hash -560612633, now seen corresponding path program 1 times [2022-12-06 07:26:48,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:48,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796275806] [2022-12-06 07:26:48,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:48,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:48,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:48,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:48,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796275806] [2022-12-06 07:26:48,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796275806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:48,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:48,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:48,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566151315] [2022-12-06 07:26:48,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:48,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:26:48,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:48,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:26:48,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:26:48,631 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-06 07:26:48,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 223 transitions, 4210 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:48,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:48,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-06 07:26:48,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:50,251 INFO L130 PetriNetUnfolder]: 8893/12972 cut-off events. [2022-12-06 07:26:50,252 INFO L131 PetriNetUnfolder]: For 119031/119031 co-relation queries the response was YES. [2022-12-06 07:26:50,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76324 conditions, 12972 events. 8893/12972 cut-off events. For 119031/119031 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 74623 event pairs, 4152 based on Foata normal form. 236/13145 useless extension candidates. Maximal degree in co-relation 76175. Up to 10097 conditions per place. [2022-12-06 07:26:50,363 INFO L137 encePairwiseOnDemand]: 35/45 looper letters, 262 selfloop transitions, 3 changer transitions 88/354 dead transitions. [2022-12-06 07:26:50,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 354 transitions, 6618 flow [2022-12-06 07:26:50,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:26:50,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:26:50,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2022-12-06 07:26:50,364 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44074074074074077 [2022-12-06 07:26:50,364 INFO L175 Difference]: Start difference. First operand has 143 places, 223 transitions, 4210 flow. Second operand 6 states and 119 transitions. [2022-12-06 07:26:50,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 354 transitions, 6618 flow [2022-12-06 07:26:50,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 354 transitions, 6466 flow, removed 55 selfloop flow, removed 11 redundant places. [2022-12-06 07:26:50,852 INFO L231 Difference]: Finished difference. Result has 141 places, 225 transitions, 4168 flow [2022-12-06 07:26:50,852 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=4082, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4168, PETRI_PLACES=141, PETRI_TRANSITIONS=225} [2022-12-06 07:26:50,852 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 103 predicate places. [2022-12-06 07:26:50,852 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:50,852 INFO L89 Accepts]: Start accepts. Operand has 141 places, 225 transitions, 4168 flow [2022-12-06 07:26:50,853 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:50,853 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:50,853 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 225 transitions, 4168 flow [2022-12-06 07:26:50,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 225 transitions, 4168 flow [2022-12-06 07:26:50,952 INFO L130 PetriNetUnfolder]: 381/1163 cut-off events. [2022-12-06 07:26:50,952 INFO L131 PetriNetUnfolder]: For 9356/9481 co-relation queries the response was YES. [2022-12-06 07:26:50,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5953 conditions, 1163 events. 381/1163 cut-off events. For 9356/9481 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8834 event pairs, 0 based on Foata normal form. 55/1180 useless extension candidates. Maximal degree in co-relation 5865. Up to 226 conditions per place. [2022-12-06 07:26:50,966 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 225 transitions, 4168 flow [2022-12-06 07:26:50,966 INFO L188 LiptonReduction]: Number of co-enabled transitions 1670 [2022-12-06 07:26:56,766 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:56,767 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5915 [2022-12-06 07:26:56,767 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 225 transitions, 4206 flow [2022-12-06 07:26:56,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:56,767 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:56,767 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:56,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-06 07:26:56,767 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:56,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:56,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1307663406, now seen corresponding path program 1 times [2022-12-06 07:26:56,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:56,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483156937] [2022-12-06 07:26:56,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:56,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:56,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:56,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:56,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483156937] [2022-12-06 07:26:56,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483156937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:56,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:56,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:56,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634111412] [2022-12-06 07:26:56,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:56,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:56,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:56,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:56,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:56,821 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 07:26:56,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 225 transitions, 4206 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:56,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:56,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 07:26:56,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:57,854 INFO L130 PetriNetUnfolder]: 6732/9886 cut-off events. [2022-12-06 07:26:57,855 INFO L131 PetriNetUnfolder]: For 92415/92415 co-relation queries the response was YES. [2022-12-06 07:26:57,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53688 conditions, 9886 events. 6732/9886 cut-off events. For 92415/92415 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 54594 event pairs, 692 based on Foata normal form. 500/10383 useless extension candidates. Maximal degree in co-relation 53601. Up to 7076 conditions per place. [2022-12-06 07:26:57,939 INFO L137 encePairwiseOnDemand]: 43/47 looper letters, 200 selfloop transitions, 20 changer transitions 11/232 dead transitions. [2022-12-06 07:26:57,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 232 transitions, 4439 flow [2022-12-06 07:26:57,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:57,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:57,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-12-06 07:26:57,940 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44680851063829785 [2022-12-06 07:26:57,940 INFO L175 Difference]: Start difference. First operand has 139 places, 225 transitions, 4206 flow. Second operand 4 states and 84 transitions. [2022-12-06 07:26:57,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 232 transitions, 4439 flow [2022-12-06 07:26:58,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 232 transitions, 3901 flow, removed 23 selfloop flow, removed 11 redundant places. [2022-12-06 07:26:58,198 INFO L231 Difference]: Finished difference. Result has 126 places, 192 transitions, 3181 flow [2022-12-06 07:26:58,199 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3348, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3181, PETRI_PLACES=126, PETRI_TRANSITIONS=192} [2022-12-06 07:26:58,199 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 88 predicate places. [2022-12-06 07:26:58,199 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:58,199 INFO L89 Accepts]: Start accepts. Operand has 126 places, 192 transitions, 3181 flow [2022-12-06 07:26:58,200 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:58,200 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:58,200 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 192 transitions, 3181 flow [2022-12-06 07:26:58,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 192 transitions, 3181 flow [2022-12-06 07:26:58,270 INFO L130 PetriNetUnfolder]: 299/866 cut-off events. [2022-12-06 07:26:58,270 INFO L131 PetriNetUnfolder]: For 6287/6376 co-relation queries the response was YES. [2022-12-06 07:26:58,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4009 conditions, 866 events. 299/866 cut-off events. For 6287/6376 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5974 event pairs, 0 based on Foata normal form. 31/861 useless extension candidates. Maximal degree in co-relation 3939. Up to 168 conditions per place. [2022-12-06 07:26:58,280 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 192 transitions, 3181 flow [2022-12-06 07:26:58,280 INFO L188 LiptonReduction]: Number of co-enabled transitions 1374 [2022-12-06 07:26:58,902 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:58,902 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 703 [2022-12-06 07:26:58,902 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 192 transitions, 3185 flow [2022-12-06 07:26:58,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:58,902 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:58,902 INFO L213 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] [2022-12-06 07:26:58,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-06 07:26:58,903 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:58,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:58,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1879050517, now seen corresponding path program 1 times [2022-12-06 07:26:58,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:58,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785036064] [2022-12-06 07:26:58,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:58,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:58,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:58,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:58,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785036064] [2022-12-06 07:26:58,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785036064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:58,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:58,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:58,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954645944] [2022-12-06 07:26:58,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:58,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:26:58,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:58,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:26:58,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:26:58,974 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 07:26:58,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 192 transitions, 3185 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:58,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:58,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 07:26:58,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:00,343 INFO L130 PetriNetUnfolder]: 10068/14493 cut-off events. [2022-12-06 07:27:00,343 INFO L131 PetriNetUnfolder]: For 97506/97506 co-relation queries the response was YES. [2022-12-06 07:27:00,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70332 conditions, 14493 events. 10068/14493 cut-off events. For 97506/97506 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 79462 event pairs, 4483 based on Foata normal form. 156/13952 useless extension candidates. Maximal degree in co-relation 68193. Up to 9270 conditions per place. [2022-12-06 07:27:00,470 INFO L137 encePairwiseOnDemand]: 40/45 looper letters, 335 selfloop transitions, 12 changer transitions 1/348 dead transitions. [2022-12-06 07:27:00,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 348 transitions, 5953 flow [2022-12-06 07:27:00,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:00,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:00,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2022-12-06 07:27:00,471 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-06 07:27:00,472 INFO L175 Difference]: Start difference. First operand has 121 places, 192 transitions, 3185 flow. Second operand 4 states and 105 transitions. [2022-12-06 07:27:00,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 348 transitions, 5953 flow [2022-12-06 07:27:00,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 348 transitions, 5751 flow, removed 84 selfloop flow, removed 8 redundant places. [2022-12-06 07:27:00,965 INFO L231 Difference]: Finished difference. Result has 118 places, 202 transitions, 3293 flow [2022-12-06 07:27:00,965 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3073, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3293, PETRI_PLACES=118, PETRI_TRANSITIONS=202} [2022-12-06 07:27:00,966 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 80 predicate places. [2022-12-06 07:27:00,966 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:00,966 INFO L89 Accepts]: Start accepts. Operand has 118 places, 202 transitions, 3293 flow [2022-12-06 07:27:00,966 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:00,967 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:00,967 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 202 transitions, 3293 flow [2022-12-06 07:27:00,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 202 transitions, 3293 flow [2022-12-06 07:27:01,064 INFO L130 PetriNetUnfolder]: 414/1300 cut-off events. [2022-12-06 07:27:01,064 INFO L131 PetriNetUnfolder]: For 7780/7894 co-relation queries the response was YES. [2022-12-06 07:27:01,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5675 conditions, 1300 events. 414/1300 cut-off events. For 7780/7894 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10255 event pairs, 0 based on Foata normal form. 40/1305 useless extension candidates. Maximal degree in co-relation 4663. Up to 231 conditions per place. [2022-12-06 07:27:01,078 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 202 transitions, 3293 flow [2022-12-06 07:27:01,078 INFO L188 LiptonReduction]: Number of co-enabled transitions 1514 [2022-12-06 07:27:01,087 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:27:01,088 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-06 07:27:01,088 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 202 transitions, 3293 flow [2022-12-06 07:27:01,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:01,088 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:01,088 INFO L213 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] [2022-12-06 07:27:01,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-06 07:27:01,088 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:01,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:01,089 INFO L85 PathProgramCache]: Analyzing trace with hash 367747665, now seen corresponding path program 1 times [2022-12-06 07:27:01,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:01,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785184102] [2022-12-06 07:27:01,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:01,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:01,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:01,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:01,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785184102] [2022-12-06 07:27:01,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785184102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:01,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:01,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:01,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517187926] [2022-12-06 07:27:01,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:01,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:27:01,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:01,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:27:01,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:27:01,222 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 44 [2022-12-06 07:27:01,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 202 transitions, 3293 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:01,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:01,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 44 [2022-12-06 07:27:01,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:02,507 INFO L130 PetriNetUnfolder]: 7926/11780 cut-off events. [2022-12-06 07:27:02,507 INFO L131 PetriNetUnfolder]: For 63899/63899 co-relation queries the response was YES. [2022-12-06 07:27:02,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57227 conditions, 11780 events. 7926/11780 cut-off events. For 63899/63899 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 68772 event pairs, 3795 based on Foata normal form. 236/11979 useless extension candidates. Maximal degree in co-relation 52921. Up to 9368 conditions per place. [2022-12-06 07:27:02,586 INFO L137 encePairwiseOnDemand]: 33/44 looper letters, 144 selfloop transitions, 3 changer transitions 110/258 dead transitions. [2022-12-06 07:27:02,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 258 transitions, 4014 flow [2022-12-06 07:27:02,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:27:02,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:27:02,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2022-12-06 07:27:02,588 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2022-12-06 07:27:02,588 INFO L175 Difference]: Start difference. First operand has 117 places, 202 transitions, 3293 flow. Second operand 6 states and 108 transitions. [2022-12-06 07:27:02,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 258 transitions, 4014 flow [2022-12-06 07:27:02,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 258 transitions, 3999 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 07:27:02,790 INFO L231 Difference]: Finished difference. Result has 122 places, 148 transitions, 2180 flow [2022-12-06 07:27:02,790 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3001, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2180, PETRI_PLACES=122, PETRI_TRANSITIONS=148} [2022-12-06 07:27:02,790 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 84 predicate places. [2022-12-06 07:27:02,790 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:02,790 INFO L89 Accepts]: Start accepts. Operand has 122 places, 148 transitions, 2180 flow [2022-12-06 07:27:02,791 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:02,791 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:02,791 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 148 transitions, 2180 flow [2022-12-06 07:27:02,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 148 transitions, 2180 flow [2022-12-06 07:27:02,865 INFO L130 PetriNetUnfolder]: 302/973 cut-off events. [2022-12-06 07:27:02,865 INFO L131 PetriNetUnfolder]: For 5506/5591 co-relation queries the response was YES. [2022-12-06 07:27:02,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4276 conditions, 973 events. 302/973 cut-off events. For 5506/5591 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7325 event pairs, 0 based on Foata normal form. 24/970 useless extension candidates. Maximal degree in co-relation 4206. Up to 166 conditions per place. [2022-12-06 07:27:02,876 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 148 transitions, 2180 flow [2022-12-06 07:27:02,876 INFO L188 LiptonReduction]: Number of co-enabled transitions 1112 [2022-12-06 07:27:02,880 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:27:02,890 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 07:27:02,890 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 148 transitions, 2180 flow [2022-12-06 07:27:02,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:02,890 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:02,890 INFO L213 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] [2022-12-06 07:27:02,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-06 07:27:02,890 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:02,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:02,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1732283600, now seen corresponding path program 1 times [2022-12-06 07:27:02,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:02,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952189585] [2022-12-06 07:27:02,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:02,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:02,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:02,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:02,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952189585] [2022-12-06 07:27:02,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952189585] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:02,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:02,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:27:02,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869015576] [2022-12-06 07:27:02,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:02,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:27:02,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:02,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:27:02,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:27:02,987 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 07:27:02,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 148 transitions, 2180 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:02,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:02,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 07:27:02,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:04,714 INFO L130 PetriNetUnfolder]: 10839/15816 cut-off events. [2022-12-06 07:27:04,714 INFO L131 PetriNetUnfolder]: For 91050/91050 co-relation queries the response was YES. [2022-12-06 07:27:04,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74478 conditions, 15816 events. 10839/15816 cut-off events. For 91050/91050 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 90177 event pairs, 3702 based on Foata normal form. 312/16124 useless extension candidates. Maximal degree in co-relation 74347. Up to 8851 conditions per place. [2022-12-06 07:27:04,806 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 203 selfloop transitions, 27 changer transitions 0/230 dead transitions. [2022-12-06 07:27:04,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 230 transitions, 3779 flow [2022-12-06 07:27:04,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:27:04,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:27:04,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-06 07:27:04,807 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33488372093023255 [2022-12-06 07:27:04,807 INFO L175 Difference]: Start difference. First operand has 115 places, 148 transitions, 2180 flow. Second operand 5 states and 72 transitions. [2022-12-06 07:27:04,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 230 transitions, 3779 flow [2022-12-06 07:27:05,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 230 transitions, 3712 flow, removed 32 selfloop flow, removed 5 redundant places. [2022-12-06 07:27:05,054 INFO L231 Difference]: Finished difference. Result has 115 places, 149 transitions, 2249 flow [2022-12-06 07:27:05,054 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2141, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2249, PETRI_PLACES=115, PETRI_TRANSITIONS=149} [2022-12-06 07:27:05,054 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 77 predicate places. [2022-12-06 07:27:05,054 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:05,054 INFO L89 Accepts]: Start accepts. Operand has 115 places, 149 transitions, 2249 flow [2022-12-06 07:27:05,055 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:05,055 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:05,055 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 149 transitions, 2249 flow [2022-12-06 07:27:05,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 149 transitions, 2249 flow [2022-12-06 07:27:05,142 INFO L130 PetriNetUnfolder]: 355/1216 cut-off events. [2022-12-06 07:27:05,143 INFO L131 PetriNetUnfolder]: For 7028/7164 co-relation queries the response was YES. [2022-12-06 07:27:05,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5142 conditions, 1216 events. 355/1216 cut-off events. For 7028/7164 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9977 event pairs, 0 based on Foata normal form. 23/1194 useless extension candidates. Maximal degree in co-relation 4293. Up to 205 conditions per place. [2022-12-06 07:27:05,155 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 149 transitions, 2249 flow [2022-12-06 07:27:05,155 INFO L188 LiptonReduction]: Number of co-enabled transitions 1176 [2022-12-06 07:27:05,161 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:27:05,162 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-06 07:27:05,162 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 149 transitions, 2249 flow [2022-12-06 07:27:05,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:05,162 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:05,162 INFO L213 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] [2022-12-06 07:27:05,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-06 07:27:05,162 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:05,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:05,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1365308623, now seen corresponding path program 1 times [2022-12-06 07:27:05,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:05,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673034788] [2022-12-06 07:27:05,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:05,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:05,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:05,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:05,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673034788] [2022-12-06 07:27:05,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673034788] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:05,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:05,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:05,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359179914] [2022-12-06 07:27:05,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:05,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:27:05,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:05,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:27:05,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:27:05,273 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:05,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 149 transitions, 2249 flow. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:05,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:05,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:05,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:06,525 INFO L130 PetriNetUnfolder]: 9250/13883 cut-off events. [2022-12-06 07:27:06,525 INFO L131 PetriNetUnfolder]: For 70312/70312 co-relation queries the response was YES. [2022-12-06 07:27:06,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65973 conditions, 13883 events. 9250/13883 cut-off events. For 70312/70312 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 83730 event pairs, 3155 based on Foata normal form. 6/13882 useless extension candidates. Maximal degree in co-relation 60129. Up to 6140 conditions per place. [2022-12-06 07:27:06,650 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 207 selfloop transitions, 49 changer transitions 31/288 dead transitions. [2022-12-06 07:27:06,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 288 transitions, 4328 flow [2022-12-06 07:27:06,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:27:06,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:27:06,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions. [2022-12-06 07:27:06,651 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49612403100775193 [2022-12-06 07:27:06,651 INFO L175 Difference]: Start difference. First operand has 115 places, 149 transitions, 2249 flow. Second operand 6 states and 128 transitions. [2022-12-06 07:27:06,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 288 transitions, 4328 flow [2022-12-06 07:27:06,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 288 transitions, 4252 flow, removed 22 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:06,781 INFO L231 Difference]: Finished difference. Result has 118 places, 159 transitions, 2455 flow [2022-12-06 07:27:06,781 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2195, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2455, PETRI_PLACES=118, PETRI_TRANSITIONS=159} [2022-12-06 07:27:06,782 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 80 predicate places. [2022-12-06 07:27:06,782 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:06,782 INFO L89 Accepts]: Start accepts. Operand has 118 places, 159 transitions, 2455 flow [2022-12-06 07:27:06,782 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:06,782 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:06,783 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 159 transitions, 2455 flow [2022-12-06 07:27:06,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 159 transitions, 2455 flow [2022-12-06 07:27:06,896 INFO L130 PetriNetUnfolder]: 335/1186 cut-off events. [2022-12-06 07:27:06,897 INFO L131 PetriNetUnfolder]: For 7198/7296 co-relation queries the response was YES. [2022-12-06 07:27:06,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5145 conditions, 1186 events. 335/1186 cut-off events. For 7198/7296 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 9844 event pairs, 0 based on Foata normal form. 22/1162 useless extension candidates. Maximal degree in co-relation 4282. Up to 196 conditions per place. [2022-12-06 07:27:06,909 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 159 transitions, 2455 flow [2022-12-06 07:27:06,909 INFO L188 LiptonReduction]: Number of co-enabled transitions 1256 [2022-12-06 07:27:06,914 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:27:06,915 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-06 07:27:06,915 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 159 transitions, 2455 flow [2022-12-06 07:27:06,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:06,915 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:06,915 INFO L213 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] [2022-12-06 07:27:06,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-06 07:27:06,915 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:06,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:06,916 INFO L85 PathProgramCache]: Analyzing trace with hash 612832168, now seen corresponding path program 1 times [2022-12-06 07:27:06,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:06,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888535456] [2022-12-06 07:27:06,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:06,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:07,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:07,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:07,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888535456] [2022-12-06 07:27:07,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888535456] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:07,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:07,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-06 07:27:07,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513863339] [2022-12-06 07:27:07,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:07,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 07:27:07,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:07,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 07:27:07,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-06 07:27:07,882 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 07:27:07,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 159 transitions, 2455 flow. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:07,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:07,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 07:27:07,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:10,000 INFO L130 PetriNetUnfolder]: 11030/16153 cut-off events. [2022-12-06 07:27:10,001 INFO L131 PetriNetUnfolder]: For 88758/88758 co-relation queries the response was YES. [2022-12-06 07:27:10,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76621 conditions, 16153 events. 11030/16153 cut-off events. For 88758/88758 co-relation queries the response was YES. Maximal size of possible extension queue 587. Compared 93025 event pairs, 5543 based on Foata normal form. 1/16150 useless extension candidates. Maximal degree in co-relation 70028. Up to 10593 conditions per place. [2022-12-06 07:27:10,115 INFO L137 encePairwiseOnDemand]: 27/43 looper letters, 302 selfloop transitions, 51 changer transitions 11/364 dead transitions. [2022-12-06 07:27:10,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 364 transitions, 5646 flow [2022-12-06 07:27:10,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:27:10,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:27:10,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 156 transitions. [2022-12-06 07:27:10,116 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3627906976744186 [2022-12-06 07:27:10,116 INFO L175 Difference]: Start difference. First operand has 118 places, 159 transitions, 2455 flow. Second operand 10 states and 156 transitions. [2022-12-06 07:27:10,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 364 transitions, 5646 flow [2022-12-06 07:27:10,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 364 transitions, 5539 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:10,255 INFO L231 Difference]: Finished difference. Result has 132 places, 211 transitions, 3517 flow [2022-12-06 07:27:10,255 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2392, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3517, PETRI_PLACES=132, PETRI_TRANSITIONS=211} [2022-12-06 07:27:10,255 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 94 predicate places. [2022-12-06 07:27:10,256 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:10,256 INFO L89 Accepts]: Start accepts. Operand has 132 places, 211 transitions, 3517 flow [2022-12-06 07:27:10,256 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:10,257 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:10,257 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 211 transitions, 3517 flow [2022-12-06 07:27:10,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 211 transitions, 3517 flow [2022-12-06 07:27:10,406 INFO L130 PetriNetUnfolder]: 619/1797 cut-off events. [2022-12-06 07:27:10,407 INFO L131 PetriNetUnfolder]: For 14452/14735 co-relation queries the response was YES. [2022-12-06 07:27:10,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8972 conditions, 1797 events. 619/1797 cut-off events. For 14452/14735 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 15438 event pairs, 103 based on Foata normal form. 49/1734 useless extension candidates. Maximal degree in co-relation 8873. Up to 362 conditions per place. [2022-12-06 07:27:10,428 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 211 transitions, 3517 flow [2022-12-06 07:27:10,428 INFO L188 LiptonReduction]: Number of co-enabled transitions 1566 [2022-12-06 07:27:10,472 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [1055] L71-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= v_thread2Thread1of1ForFork1_~stop~1_35 1) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0) (= v_~res2~0_60 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_42| (select (select |v_#memory_int_304| v_~get3~0.base_81) (+ v_~get3~0.offset_81 (* v_thread2Thread1of1ForFork1_~i~1_83 4)))) (- 1) 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_42|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_35, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81, ~res2~0=v_~res2~0_60, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-06 07:27:10,759 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [1053] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_19| 0) (= v_~res1~0_62 (ite (< |v_thread1Thread1of1ForFork0_#t~mem4_40| (select (select |v_#memory_int_298| v_~get2~0.base_87) (+ v_~get2~0.offset_87 (* v_thread1Thread1of1ForFork0_~i~0_83 4)))) (- 1) 1)) (= v_thread1Thread1of1ForFork0_~stop~0_43 1) (= |v_thread1Thread1of1ForFork0_#res.base_19| 0)) InVars {thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_40|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, ~get2~0.base=v_~get2~0.base_87} OutVars{~res1~0=v_~res1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_19|, thread1Thread1of1ForFork0_#t~mem5=|v_thread1Thread1of1ForFork0_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_19|, ~get2~0.base=v_~get2~0.base_87, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_43} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~mem5, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] [2022-12-06 07:27:10,801 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:10,802 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 546 [2022-12-06 07:27:10,802 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 210 transitions, 3544 flow [2022-12-06 07:27:10,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:10,802 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:10,802 INFO L213 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] [2022-12-06 07:27:10,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-06 07:27:10,802 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:10,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:10,802 INFO L85 PathProgramCache]: Analyzing trace with hash -734892427, now seen corresponding path program 1 times [2022-12-06 07:27:10,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:10,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043769399] [2022-12-06 07:27:10,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:10,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:11,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:27:11,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:11,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043769399] [2022-12-06 07:27:11,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043769399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:11,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:11,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:27:11,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112757631] [2022-12-06 07:27:11,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:11,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:27:11,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:11,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:27:11,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:27:11,066 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 07:27:11,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 210 transitions, 3544 flow. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:11,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:11,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 07:27:11,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:14,475 INFO L130 PetriNetUnfolder]: 18885/28493 cut-off events. [2022-12-06 07:27:14,475 INFO L131 PetriNetUnfolder]: For 190412/190412 co-relation queries the response was YES. [2022-12-06 07:27:14,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147874 conditions, 28493 events. 18885/28493 cut-off events. For 190412/190412 co-relation queries the response was YES. Maximal size of possible extension queue 1160. Compared 192993 event pairs, 4756 based on Foata normal form. 12/28490 useless extension candidates. Maximal degree in co-relation 147630. Up to 6359 conditions per place. [2022-12-06 07:27:14,739 INFO L137 encePairwiseOnDemand]: 32/47 looper letters, 447 selfloop transitions, 129 changer transitions 70/647 dead transitions. [2022-12-06 07:27:14,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 647 transitions, 10999 flow [2022-12-06 07:27:14,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:27:14,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:27:14,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 217 transitions. [2022-12-06 07:27:14,740 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46170212765957447 [2022-12-06 07:27:14,740 INFO L175 Difference]: Start difference. First operand has 129 places, 210 transitions, 3544 flow. Second operand 10 states and 217 transitions. [2022-12-06 07:27:14,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 647 transitions, 10999 flow [2022-12-06 07:27:15,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 647 transitions, 10937 flow, removed 31 selfloop flow, removed 2 redundant places. [2022-12-06 07:27:15,471 INFO L231 Difference]: Finished difference. Result has 140 places, 281 transitions, 5163 flow [2022-12-06 07:27:15,472 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3514, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5163, PETRI_PLACES=140, PETRI_TRANSITIONS=281} [2022-12-06 07:27:15,472 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 102 predicate places. [2022-12-06 07:27:15,472 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:15,472 INFO L89 Accepts]: Start accepts. Operand has 140 places, 281 transitions, 5163 flow [2022-12-06 07:27:15,473 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:15,473 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:15,473 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 281 transitions, 5163 flow [2022-12-06 07:27:15,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 281 transitions, 5163 flow [2022-12-06 07:27:15,890 INFO L130 PetriNetUnfolder]: 1182/3534 cut-off events. [2022-12-06 07:27:15,890 INFO L131 PetriNetUnfolder]: For 30773/31359 co-relation queries the response was YES. [2022-12-06 07:27:15,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18147 conditions, 3534 events. 1182/3534 cut-off events. For 30773/31359 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 35081 event pairs, 156 based on Foata normal form. 117/3459 useless extension candidates. Maximal degree in co-relation 16359. Up to 696 conditions per place. [2022-12-06 07:27:15,958 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 281 transitions, 5163 flow [2022-12-06 07:27:15,958 INFO L188 LiptonReduction]: Number of co-enabled transitions 2108 [2022-12-06 07:27:16,875 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:16,876 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1404 [2022-12-06 07:27:16,876 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 281 transitions, 5165 flow [2022-12-06 07:27:16,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:16,876 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:16,876 INFO L213 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] [2022-12-06 07:27:16,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-06 07:27:16,876 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:16,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:16,877 INFO L85 PathProgramCache]: Analyzing trace with hash -339816289, now seen corresponding path program 1 times [2022-12-06 07:27:16,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:16,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12958231] [2022-12-06 07:27:16,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:16,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:17,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:17,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:17,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12958231] [2022-12-06 07:27:17,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12958231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:17,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:17,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 07:27:17,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312863391] [2022-12-06 07:27:17,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:17,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:27:17,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:17,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:27:17,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:27:17,826 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 07:27:17,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 281 transitions, 5165 flow. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:17,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:17,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 07:27:17,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:22,810 INFO L130 PetriNetUnfolder]: 22049/32349 cut-off events. [2022-12-06 07:27:22,810 INFO L131 PetriNetUnfolder]: For 239355/239355 co-relation queries the response was YES. [2022-12-06 07:27:23,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171139 conditions, 32349 events. 22049/32349 cut-off events. For 239355/239355 co-relation queries the response was YES. Maximal size of possible extension queue 1149. Compared 207176 event pairs, 11032 based on Foata normal form. 2/32350 useless extension candidates. Maximal degree in co-relation 154860. Up to 21005 conditions per place. [2022-12-06 07:27:23,190 INFO L137 encePairwiseOnDemand]: 33/49 looper letters, 383 selfloop transitions, 85 changer transitions 11/479 dead transitions. [2022-12-06 07:27:23,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 479 transitions, 8929 flow [2022-12-06 07:27:23,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:27:23,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:27:23,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2022-12-06 07:27:23,192 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3492063492063492 [2022-12-06 07:27:23,192 INFO L175 Difference]: Start difference. First operand has 140 places, 281 transitions, 5165 flow. Second operand 9 states and 154 transitions. [2022-12-06 07:27:23,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 479 transitions, 8929 flow [2022-12-06 07:27:23,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 479 transitions, 8716 flow, removed 19 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:23,726 INFO L231 Difference]: Finished difference. Result has 149 places, 312 transitions, 5999 flow [2022-12-06 07:27:23,726 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5010, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5999, PETRI_PLACES=149, PETRI_TRANSITIONS=312} [2022-12-06 07:27:23,727 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 111 predicate places. [2022-12-06 07:27:23,727 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:23,727 INFO L89 Accepts]: Start accepts. Operand has 149 places, 312 transitions, 5999 flow [2022-12-06 07:27:23,728 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:23,728 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:23,728 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 312 transitions, 5999 flow [2022-12-06 07:27:23,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 312 transitions, 5999 flow [2022-12-06 07:27:24,279 INFO L130 PetriNetUnfolder]: 1235/3564 cut-off events. [2022-12-06 07:27:24,279 INFO L131 PetriNetUnfolder]: For 36284/36962 co-relation queries the response was YES. [2022-12-06 07:27:24,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19442 conditions, 3564 events. 1235/3564 cut-off events. For 36284/36962 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 34947 event pairs, 152 based on Foata normal form. 134/3499 useless extension candidates. Maximal degree in co-relation 19266. Up to 732 conditions per place. [2022-12-06 07:27:24,346 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 312 transitions, 5999 flow [2022-12-06 07:27:24,346 INFO L188 LiptonReduction]: Number of co-enabled transitions 2270 [2022-12-06 07:27:24,355 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:27:24,355 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 628 [2022-12-06 07:27:24,356 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 312 transitions, 5999 flow [2022-12-06 07:27:24,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:24,356 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:24,356 INFO L213 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] [2022-12-06 07:27:24,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-06 07:27:24,356 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:24,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:24,356 INFO L85 PathProgramCache]: Analyzing trace with hash 870752006, now seen corresponding path program 2 times [2022-12-06 07:27:24,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:24,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031962091] [2022-12-06 07:27:24,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:24,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:25,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:25,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:25,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031962091] [2022-12-06 07:27:25,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031962091] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:25,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:25,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-06 07:27:25,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268498420] [2022-12-06 07:27:25,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:25,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 07:27:25,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:25,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 07:27:25,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-12-06 07:27:25,489 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 07:27:25,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 312 transitions, 5999 flow. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:25,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:25,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 07:27:25,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:31,115 INFO L130 PetriNetUnfolder]: 23333/34184 cut-off events. [2022-12-06 07:27:31,115 INFO L131 PetriNetUnfolder]: For 275988/275988 co-relation queries the response was YES. [2022-12-06 07:27:31,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187471 conditions, 34184 events. 23333/34184 cut-off events. For 275988/275988 co-relation queries the response was YES. Maximal size of possible extension queue 1235. Compared 219788 event pairs, 6964 based on Foata normal form. 2/34185 useless extension candidates. Maximal degree in co-relation 187204. Up to 10583 conditions per place. [2022-12-06 07:27:31,436 INFO L137 encePairwiseOnDemand]: 25/47 looper letters, 398 selfloop transitions, 237 changer transitions 13/648 dead transitions. [2022-12-06 07:27:31,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 648 transitions, 11290 flow [2022-12-06 07:27:31,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 07:27:31,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 07:27:31,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 272 transitions. [2022-12-06 07:27:31,440 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3617021276595745 [2022-12-06 07:27:31,440 INFO L175 Difference]: Start difference. First operand has 146 places, 312 transitions, 5999 flow. Second operand 16 states and 272 transitions. [2022-12-06 07:27:31,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 648 transitions, 11290 flow [2022-12-06 07:27:32,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 648 transitions, 11258 flow, removed 16 selfloop flow, removed 2 redundant places. [2022-12-06 07:27:32,131 INFO L231 Difference]: Finished difference. Result has 170 places, 409 transitions, 9002 flow [2022-12-06 07:27:32,131 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5981, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=9002, PETRI_PLACES=170, PETRI_TRANSITIONS=409} [2022-12-06 07:27:32,132 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 132 predicate places. [2022-12-06 07:27:32,132 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:32,132 INFO L89 Accepts]: Start accepts. Operand has 170 places, 409 transitions, 9002 flow [2022-12-06 07:27:32,134 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:32,134 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:32,134 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 409 transitions, 9002 flow [2022-12-06 07:27:32,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 409 transitions, 9002 flow [2022-12-06 07:27:32,719 INFO L130 PetriNetUnfolder]: 1556/4213 cut-off events. [2022-12-06 07:27:32,719 INFO L131 PetriNetUnfolder]: For 60134/60780 co-relation queries the response was YES. [2022-12-06 07:27:32,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26431 conditions, 4213 events. 1556/4213 cut-off events. For 60134/60780 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 41123 event pairs, 168 based on Foata normal form. 170/4156 useless extension candidates. Maximal degree in co-relation 26233. Up to 926 conditions per place. [2022-12-06 07:27:32,786 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 409 transitions, 9002 flow [2022-12-06 07:27:32,786 INFO L188 LiptonReduction]: Number of co-enabled transitions 2878 [2022-12-06 07:27:32,789 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [1055] L71-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= v_thread2Thread1of1ForFork1_~stop~1_35 1) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0) (= v_~res2~0_60 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_42| (select (select |v_#memory_int_304| v_~get3~0.base_81) (+ v_~get3~0.offset_81 (* v_thread2Thread1of1ForFork1_~i~1_83 4)))) (- 1) 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_42|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_35, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81, ~res2~0=v_~res2~0_60, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-06 07:27:32,820 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [1055] L71-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= v_thread2Thread1of1ForFork1_~stop~1_35 1) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0) (= v_~res2~0_60 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_42| (select (select |v_#memory_int_304| v_~get3~0.base_81) (+ v_~get3~0.offset_81 (* v_thread2Thread1of1ForFork1_~i~1_83 4)))) (- 1) 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_42|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_35, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81, ~res2~0=v_~res2~0_60, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-06 07:27:32,876 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [905] L50-1-->L49-6: Formula: (and (= (select (select |v_#memory_int_122| v_~get2~0.base_31) (+ (* v_thread1Thread1of1ForFork0_~i~0_50 4) v_~get2~0.offset_31)) |v_thread1Thread1of1ForFork0_#t~mem2_26|) (= v_thread1Thread1of1ForFork0_~i~0_49 (+ v_thread1Thread1of1ForFork0_~i~0_50 1))) InVars {thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_26|, ~get2~0.offset=v_~get2~0.offset_31, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_50, #memory_int=|v_#memory_int_122|, ~get2~0.base=v_~get2~0.base_31} OutVars{thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_29|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, ~get2~0.offset=v_~get2~0.offset_31, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_49, #memory_int=|v_#memory_int_122|, ~get2~0.base=v_~get2~0.base_31} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-06 07:27:32,895 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [1028] L70-1-->L69-6: Formula: (and (= (select (select |v_#memory_int_250| v_~get3~0.base_67) (+ v_~get3~0.offset_67 (* v_thread2Thread1of1ForFork1_~i~1_64 4))) |v_thread2Thread1of1ForFork1_#t~mem7_44|) (= v_thread2Thread1of1ForFork1_~i~1_63 (+ v_thread2Thread1of1ForFork1_~i~1_64 1))) InVars {thread2Thread1of1ForFork1_#t~mem7=|v_thread2Thread1of1ForFork1_#t~mem7_44|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_64, ~get3~0.base=v_~get3~0.base_67, #memory_int=|v_#memory_int_250|, ~get3~0.offset=v_~get3~0.offset_67} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_63, thread2Thread1of1ForFork1_#t~mem8=|v_thread2Thread1of1ForFork1_#t~mem8_43|, ~get3~0.base=v_~get3~0.base_67, thread2Thread1of1ForFork1_#t~post6=|v_thread2Thread1of1ForFork1_#t~post6_15|, #memory_int=|v_#memory_int_250|, ~get3~0.offset=v_~get3~0.offset_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~mem8, thread2Thread1of1ForFork1_#t~post6] [2022-12-06 07:27:32,913 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [1028] L70-1-->L69-6: Formula: (and (= (select (select |v_#memory_int_250| v_~get3~0.base_67) (+ v_~get3~0.offset_67 (* v_thread2Thread1of1ForFork1_~i~1_64 4))) |v_thread2Thread1of1ForFork1_#t~mem7_44|) (= v_thread2Thread1of1ForFork1_~i~1_63 (+ v_thread2Thread1of1ForFork1_~i~1_64 1))) InVars {thread2Thread1of1ForFork1_#t~mem7=|v_thread2Thread1of1ForFork1_#t~mem7_44|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_64, ~get3~0.base=v_~get3~0.base_67, #memory_int=|v_#memory_int_250|, ~get3~0.offset=v_~get3~0.offset_67} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_63, thread2Thread1of1ForFork1_#t~mem8=|v_thread2Thread1of1ForFork1_#t~mem8_43|, ~get3~0.base=v_~get3~0.base_67, thread2Thread1of1ForFork1_#t~post6=|v_thread2Thread1of1ForFork1_#t~post6_15|, #memory_int=|v_#memory_int_250|, ~get3~0.offset=v_~get3~0.offset_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~mem8, thread2Thread1of1ForFork1_#t~post6] [2022-12-06 07:27:33,148 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [917] L50-3-->L51-1: Formula: (= (select (select |v_#memory_int_124| v_~get1~0.base_23) (+ v_~get1~0.offset_23 (* v_thread1Thread1of1ForFork0_~i~0_53 4))) |v_thread1Thread1of1ForFork0_#t~mem4_11|) InVars {#memory_int=|v_#memory_int_124|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_53, ~get1~0.offset=v_~get1~0.offset_23, ~get1~0.base=v_~get1~0.base_23} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_29|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_33|, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_11|, #memory_int=|v_#memory_int_124|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_53, ~get1~0.offset=v_~get1~0.offset_23, ~get1~0.base=v_~get1~0.base_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~mem4] [2022-12-06 07:27:33,164 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [1053] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_19| 0) (= v_~res1~0_62 (ite (< |v_thread1Thread1of1ForFork0_#t~mem4_40| (select (select |v_#memory_int_298| v_~get2~0.base_87) (+ v_~get2~0.offset_87 (* v_thread1Thread1of1ForFork0_~i~0_83 4)))) (- 1) 1)) (= v_thread1Thread1of1ForFork0_~stop~0_43 1) (= |v_thread1Thread1of1ForFork0_#res.base_19| 0)) InVars {thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_40|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, ~get2~0.base=v_~get2~0.base_87} OutVars{~res1~0=v_~res1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_19|, thread1Thread1of1ForFork0_#t~mem5=|v_thread1Thread1of1ForFork0_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_19|, ~get2~0.base=v_~get2~0.base_87, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_43} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~mem5, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] [2022-12-06 07:27:33,629 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [1053] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_19| 0) (= v_~res1~0_62 (ite (< |v_thread1Thread1of1ForFork0_#t~mem4_40| (select (select |v_#memory_int_298| v_~get2~0.base_87) (+ v_~get2~0.offset_87 (* v_thread1Thread1of1ForFork0_~i~0_83 4)))) (- 1) 1)) (= v_thread1Thread1of1ForFork0_~stop~0_43 1) (= |v_thread1Thread1of1ForFork0_#res.base_19| 0)) InVars {thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_40|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, ~get2~0.base=v_~get2~0.base_87} OutVars{~res1~0=v_~res1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_19|, thread1Thread1of1ForFork0_#t~mem5=|v_thread1Thread1of1ForFork0_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_19|, ~get2~0.base=v_~get2~0.base_87, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_43} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~mem5, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] [2022-12-06 07:27:33,665 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [1053] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_19| 0) (= v_~res1~0_62 (ite (< |v_thread1Thread1of1ForFork0_#t~mem4_40| (select (select |v_#memory_int_298| v_~get2~0.base_87) (+ v_~get2~0.offset_87 (* v_thread1Thread1of1ForFork0_~i~0_83 4)))) (- 1) 1)) (= v_thread1Thread1of1ForFork0_~stop~0_43 1) (= |v_thread1Thread1of1ForFork0_#res.base_19| 0)) InVars {thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_40|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, ~get2~0.base=v_~get2~0.base_87} OutVars{~res1~0=v_~res1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_19|, thread1Thread1of1ForFork0_#t~mem5=|v_thread1Thread1of1ForFork0_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_19|, ~get2~0.base=v_~get2~0.base_87, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_43} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~mem5, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] [2022-12-06 07:27:33,935 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [1055] L71-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= v_thread2Thread1of1ForFork1_~stop~1_35 1) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0) (= v_~res2~0_60 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_42| (select (select |v_#memory_int_304| v_~get3~0.base_81) (+ v_~get3~0.offset_81 (* v_thread2Thread1of1ForFork1_~i~1_83 4)))) (- 1) 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_42|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_35, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81, ~res2~0=v_~res2~0_60, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-06 07:27:33,970 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [1028] L70-1-->L69-6: Formula: (and (= (select (select |v_#memory_int_250| v_~get3~0.base_67) (+ v_~get3~0.offset_67 (* v_thread2Thread1of1ForFork1_~i~1_64 4))) |v_thread2Thread1of1ForFork1_#t~mem7_44|) (= v_thread2Thread1of1ForFork1_~i~1_63 (+ v_thread2Thread1of1ForFork1_~i~1_64 1))) InVars {thread2Thread1of1ForFork1_#t~mem7=|v_thread2Thread1of1ForFork1_#t~mem7_44|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_64, ~get3~0.base=v_~get3~0.base_67, #memory_int=|v_#memory_int_250|, ~get3~0.offset=v_~get3~0.offset_67} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_63, thread2Thread1of1ForFork1_#t~mem8=|v_thread2Thread1of1ForFork1_#t~mem8_43|, ~get3~0.base=v_~get3~0.base_67, thread2Thread1of1ForFork1_#t~post6=|v_thread2Thread1of1ForFork1_#t~post6_15|, #memory_int=|v_#memory_int_250|, ~get3~0.offset=v_~get3~0.offset_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~mem8, thread2Thread1of1ForFork1_#t~post6] [2022-12-06 07:27:33,993 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [1053] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_19| 0) (= v_~res1~0_62 (ite (< |v_thread1Thread1of1ForFork0_#t~mem4_40| (select (select |v_#memory_int_298| v_~get2~0.base_87) (+ v_~get2~0.offset_87 (* v_thread1Thread1of1ForFork0_~i~0_83 4)))) (- 1) 1)) (= v_thread1Thread1of1ForFork0_~stop~0_43 1) (= |v_thread1Thread1of1ForFork0_#res.base_19| 0)) InVars {thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_40|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, ~get2~0.base=v_~get2~0.base_87} OutVars{~res1~0=v_~res1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_19|, thread1Thread1of1ForFork0_#t~mem5=|v_thread1Thread1of1ForFork0_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_19|, ~get2~0.base=v_~get2~0.base_87, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_43} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~mem5, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] [2022-12-06 07:27:34,262 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [1053] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_19| 0) (= v_~res1~0_62 (ite (< |v_thread1Thread1of1ForFork0_#t~mem4_40| (select (select |v_#memory_int_298| v_~get2~0.base_87) (+ v_~get2~0.offset_87 (* v_thread1Thread1of1ForFork0_~i~0_83 4)))) (- 1) 1)) (= v_thread1Thread1of1ForFork0_~stop~0_43 1) (= |v_thread1Thread1of1ForFork0_#res.base_19| 0)) InVars {thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_40|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, ~get2~0.base=v_~get2~0.base_87} OutVars{~res1~0=v_~res1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_19|, thread1Thread1of1ForFork0_#t~mem5=|v_thread1Thread1of1ForFork0_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_19|, ~get2~0.base=v_~get2~0.base_87, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_43} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~mem5, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] [2022-12-06 07:27:34,983 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [1055] L71-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= v_thread2Thread1of1ForFork1_~stop~1_35 1) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0) (= v_~res2~0_60 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_42| (select (select |v_#memory_int_304| v_~get3~0.base_81) (+ v_~get3~0.offset_81 (* v_thread2Thread1of1ForFork1_~i~1_83 4)))) (- 1) 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_42|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_35, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81, ~res2~0=v_~res2~0_60, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-06 07:27:35,273 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1132] $Ultimate##0-->L51-1: Formula: (and (= 0 v_thread3Thread1of1ForFork2_~stop~2_155) (= v_~count1~0_173 v_~count3~0_179) (= (select (select |v_#memory_int_569| v_~get1~0.base_180) (+ v_~get1~0.offset_180 (* v_thread1Thread1of1ForFork0_~i~0_141 4))) |v_thread1Thread1of1ForFork0_#t~mem4_86|) (= v_thread3Thread1of1ForFork2_~i~2_129 0)) InVars {~count3~0=v_~count3~0_179, ~count1~0=v_~count1~0_173, #memory_int=|v_#memory_int_569|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_141, ~get1~0.offset=v_~get1~0.offset_180, ~get1~0.base=v_~get1~0.base_180} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_73|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_64|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_155, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_86|, ~count3~0=v_~count3~0_179, ~count1~0=v_~count1~0_173, #memory_int=|v_#memory_int_569|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_141, ~get1~0.offset=v_~get1~0.offset_180, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_129, ~get1~0.base=v_~get1~0.base_180} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread3Thread1of1ForFork2_~stop~2, thread1Thread1of1ForFork0_#t~mem4, thread3Thread1of1ForFork2_~i~2] and [1028] L70-1-->L69-6: Formula: (and (= (select (select |v_#memory_int_250| v_~get3~0.base_67) (+ v_~get3~0.offset_67 (* v_thread2Thread1of1ForFork1_~i~1_64 4))) |v_thread2Thread1of1ForFork1_#t~mem7_44|) (= v_thread2Thread1of1ForFork1_~i~1_63 (+ v_thread2Thread1of1ForFork1_~i~1_64 1))) InVars {thread2Thread1of1ForFork1_#t~mem7=|v_thread2Thread1of1ForFork1_#t~mem7_44|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_64, ~get3~0.base=v_~get3~0.base_67, #memory_int=|v_#memory_int_250|, ~get3~0.offset=v_~get3~0.offset_67} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_63, thread2Thread1of1ForFork1_#t~mem8=|v_thread2Thread1of1ForFork1_#t~mem8_43|, ~get3~0.base=v_~get3~0.base_67, thread2Thread1of1ForFork1_#t~post6=|v_thread2Thread1of1ForFork1_#t~post6_15|, #memory_int=|v_#memory_int_250|, ~get3~0.offset=v_~get3~0.offset_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~mem8, thread2Thread1of1ForFork1_#t~post6] [2022-12-06 07:27:35,304 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1132] $Ultimate##0-->L51-1: Formula: (and (= 0 v_thread3Thread1of1ForFork2_~stop~2_155) (= v_~count1~0_173 v_~count3~0_179) (= (select (select |v_#memory_int_569| v_~get1~0.base_180) (+ v_~get1~0.offset_180 (* v_thread1Thread1of1ForFork0_~i~0_141 4))) |v_thread1Thread1of1ForFork0_#t~mem4_86|) (= v_thread3Thread1of1ForFork2_~i~2_129 0)) InVars {~count3~0=v_~count3~0_179, ~count1~0=v_~count1~0_173, #memory_int=|v_#memory_int_569|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_141, ~get1~0.offset=v_~get1~0.offset_180, ~get1~0.base=v_~get1~0.base_180} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_73|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_64|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_155, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_86|, ~count3~0=v_~count3~0_179, ~count1~0=v_~count1~0_173, #memory_int=|v_#memory_int_569|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_141, ~get1~0.offset=v_~get1~0.offset_180, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_129, ~get1~0.base=v_~get1~0.base_180} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread3Thread1of1ForFork2_~stop~2, thread1Thread1of1ForFork0_#t~mem4, thread3Thread1of1ForFork2_~i~2] and [1060] L89-6-->thread1EXIT: Formula: (and (= v_thread1Thread1of1ForFork0_~stop~0_49 1) (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.offset_23| 0)) (.cse1 (= (mod v_thread3Thread1of1ForFork2_~stop~2_57 256) 0)) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.base_23| 0))) (or (and .cse0 .cse1 (= (+ v_~res3~0_70 v_~n3~0_100) v_~n1~0_106) .cse2) (and .cse0 (not .cse1) (= v_~res3~0_72 v_~res3~0_70) .cse2))) (= |v_thread1Thread1of1ForFork0_#res.base_25| 0) (= (ite (< |v_thread1Thread1of1ForFork0_#t~mem4_50| (select (select |v_#memory_int_330| v_~get2~0.base_93) (+ v_~get2~0.offset_93 (* v_thread1Thread1of1ForFork0_~i~0_93 4)))) (- 1) 1) v_~res1~0_72) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_63 v_~n3~0_100)) (.cse3 (< v_thread3Thread1of1ForFork2_~i~2_63 v_~n1~0_106))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_58 v_thread3Thread1of1ForFork2_~stop~2_57) (= |v_thread3Thread1of1ForFork2_#t~mem14_49| |v_thread3Thread1of1ForFork2_#t~mem14_50|) (= |v_thread3Thread1of1ForFork2_#t~mem15_45| |v_thread3Thread1of1ForFork2_#t~mem15_46|) (= |v_thread3Thread1of1ForFork2_#t~mem13_65| |v_thread3Thread1of1ForFork2_#t~mem13_66|) (= v_~res3~0_72 v_~res3~0_71) (= |v_thread3Thread1of1ForFork2_#t~mem12_64| |v_thread3Thread1of1ForFork2_#t~mem12_63|) (or (not .cse3) (not .cse4))) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_63 4))) (let ((.cse6 (select (select |v_#memory_int_330| v_~get3~0.base_93) (+ v_~get3~0.offset_93 .cse7))) (.cse5 (select (select |v_#memory_int_330| v_~get1~0.base_89) (+ v_~get1~0.offset_89 .cse7)))) (and (= (ite (< .cse5 .cse6) (- 1) 1) v_~res3~0_72) .cse4 .cse3 (= v_thread3Thread1of1ForFork2_~stop~2_57 1) (not (= .cse6 .cse5))))))) (= |v_thread1Thread1of1ForFork0_#res.offset_25| 0)) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_66|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_64|, ~get3~0.base=v_~get3~0.base_93, ~n3~0=v_~n3~0_100, ~n1~0=v_~n1~0_106, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_93, ~get2~0.base=v_~get2~0.base_93, ~get3~0.offset=v_~get3~0.offset_93, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_46|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_63, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_50|, ~get1~0.base=v_~get1~0.base_89, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_58, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_50|, ~get2~0.offset=v_~get2~0.offset_93, #memory_int=|v_#memory_int_330|, ~get1~0.offset=v_~get1~0.offset_89, ~res3~0=v_~res3~0_71} OutVars{~res1~0=v_~res1~0_72, ~get3~0.base=v_~get3~0.base_93, ~n3~0=v_~n3~0_100, ~n1~0=v_~n1~0_106, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_93, ~get2~0.base=v_~get2~0.base_93, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_23|, ~get3~0.offset=v_~get3~0.offset_93, ~get1~0.base=v_~get1~0.base_89, thread1Thread1of1ForFork0_#t~mem5=|v_thread1Thread1of1ForFork0_#t~mem5_33|, ~get2~0.offset=v_~get2~0.offset_93, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_49, thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_65|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_63|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_25|, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_23|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_25|, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_45|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_63, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_49|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_57, #memory_int=|v_#memory_int_330|, ~get1~0.offset=v_~get1~0.offset_89, ~res3~0=v_~res3~0_70} AuxVars[v_~res3~0_72] AssignedVars[~res1~0, thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread1Thread1of1ForFork0_#res.base, thread3Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, thread3Thread1of1ForFork2_~stop~2, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~mem5, thread1Thread1of1ForFork0_~stop~0, ~res3~0] [2022-12-06 07:27:35,534 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1132] $Ultimate##0-->L51-1: Formula: (and (= 0 v_thread3Thread1of1ForFork2_~stop~2_155) (= v_~count1~0_173 v_~count3~0_179) (= (select (select |v_#memory_int_569| v_~get1~0.base_180) (+ v_~get1~0.offset_180 (* v_thread1Thread1of1ForFork0_~i~0_141 4))) |v_thread1Thread1of1ForFork0_#t~mem4_86|) (= v_thread3Thread1of1ForFork2_~i~2_129 0)) InVars {~count3~0=v_~count3~0_179, ~count1~0=v_~count1~0_173, #memory_int=|v_#memory_int_569|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_141, ~get1~0.offset=v_~get1~0.offset_180, ~get1~0.base=v_~get1~0.base_180} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_73|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_64|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_155, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_86|, ~count3~0=v_~count3~0_179, ~count1~0=v_~count1~0_173, #memory_int=|v_#memory_int_569|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_141, ~get1~0.offset=v_~get1~0.offset_180, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_129, ~get1~0.base=v_~get1~0.base_180} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread3Thread1of1ForFork2_~stop~2, thread1Thread1of1ForFork0_#t~mem4, thread3Thread1of1ForFork2_~i~2] and [1055] L71-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= v_thread2Thread1of1ForFork1_~stop~1_35 1) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0) (= v_~res2~0_60 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_42| (select (select |v_#memory_int_304| v_~get3~0.base_81) (+ v_~get3~0.offset_81 (* v_thread2Thread1of1ForFork1_~i~1_83 4)))) (- 1) 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_42|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_35, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81, ~res2~0=v_~res2~0_60, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-06 07:27:35,617 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1132] $Ultimate##0-->L51-1: Formula: (and (= 0 v_thread3Thread1of1ForFork2_~stop~2_155) (= v_~count1~0_173 v_~count3~0_179) (= (select (select |v_#memory_int_569| v_~get1~0.base_180) (+ v_~get1~0.offset_180 (* v_thread1Thread1of1ForFork0_~i~0_141 4))) |v_thread1Thread1of1ForFork0_#t~mem4_86|) (= v_thread3Thread1of1ForFork2_~i~2_129 0)) InVars {~count3~0=v_~count3~0_179, ~count1~0=v_~count1~0_173, #memory_int=|v_#memory_int_569|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_141, ~get1~0.offset=v_~get1~0.offset_180, ~get1~0.base=v_~get1~0.base_180} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_73|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_64|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_155, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_86|, ~count3~0=v_~count3~0_179, ~count1~0=v_~count1~0_173, #memory_int=|v_#memory_int_569|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_141, ~get1~0.offset=v_~get1~0.offset_180, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_129, ~get1~0.base=v_~get1~0.base_180} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread3Thread1of1ForFork2_~stop~2, thread1Thread1of1ForFork0_#t~mem4, thread3Thread1of1ForFork2_~i~2] and [1058] L89-6-->thread2EXIT: Formula: (let ((.cse3 (select |v_#memory_int_326| v_~get3~0.base_89))) (and (= v_thread2Thread1of1ForFork1_~stop~1_39 1) (= |v_thread2Thread1of1ForFork1_#res.base_19| 0) (let ((.cse2 (= (mod v_thread3Thread1of1ForFork2_~stop~2_49 256) 0)) (.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_19| 0)) (.cse1 (= |v_thread3Thread1of1ForFork2_#res.offset_19| 0))) (or (and .cse0 (= v_~res3~0_58 v_~res3~0_60) .cse1 (not .cse2)) (and (= v_~n1~0_102 (+ v_~n3~0_96 v_~res3~0_58)) .cse2 .cse0 .cse1))) (= (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_50| (select .cse3 (+ v_~get3~0.offset_89 (* v_thread2Thread1of1ForFork1_~i~1_87 4)))) (- 1) 1) v_~res2~0_66) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n1~0_102)) (.cse5 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n3~0_96))) (or (let ((.cse8 (* v_thread3Thread1of1ForFork2_~i~2_59 4))) (let ((.cse7 (select .cse3 (+ v_~get3~0.offset_89 .cse8))) (.cse6 (select (select |v_#memory_int_326| v_~get1~0.base_85) (+ v_~get1~0.offset_85 .cse8)))) (and .cse4 .cse5 (= v_~res3~0_60 (ite (< .cse6 .cse7) (- 1) 1)) (not (= .cse7 .cse6)) (= v_thread3Thread1of1ForFork2_~stop~2_49 1)))) (and (= |v_thread3Thread1of1ForFork2_#t~mem12_56| |v_thread3Thread1of1ForFork2_#t~mem12_55|) (= v_~res3~0_59 v_~res3~0_60) (or (not .cse4) (not .cse5)) (= v_thread3Thread1of1ForFork2_~stop~2_49 v_thread3Thread1of1ForFork2_~stop~2_50) (= |v_thread3Thread1of1ForFork2_#t~mem14_42| |v_thread3Thread1of1ForFork2_#t~mem14_41|) (= |v_thread3Thread1of1ForFork2_#t~mem15_38| |v_thread3Thread1of1ForFork2_#t~mem15_37|) (= |v_thread3Thread1of1ForFork2_#t~mem13_58| |v_thread3Thread1of1ForFork2_#t~mem13_57|)))) (= |v_thread2Thread1of1ForFork1_#res.offset_19| 0))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_58|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_56|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_38|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_42|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_50, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_50|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res3~0=v_~res3~0_59} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_57|, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_19|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_55|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_19|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_19|, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_37|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_41|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_49, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_39, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_19|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res2~0=v_~res2~0_66, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_33|, ~res3~0=v_~res3~0_58} AuxVars[v_~res3~0_60] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread2Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, thread3Thread1of1ForFork2_~stop~2, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10, ~res3~0] [2022-12-06 07:27:35,858 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1132] $Ultimate##0-->L51-1: Formula: (and (= 0 v_thread3Thread1of1ForFork2_~stop~2_155) (= v_~count1~0_173 v_~count3~0_179) (= (select (select |v_#memory_int_569| v_~get1~0.base_180) (+ v_~get1~0.offset_180 (* v_thread1Thread1of1ForFork0_~i~0_141 4))) |v_thread1Thread1of1ForFork0_#t~mem4_86|) (= v_thread3Thread1of1ForFork2_~i~2_129 0)) InVars {~count3~0=v_~count3~0_179, ~count1~0=v_~count1~0_173, #memory_int=|v_#memory_int_569|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_141, ~get1~0.offset=v_~get1~0.offset_180, ~get1~0.base=v_~get1~0.base_180} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_73|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_64|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_155, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_86|, ~count3~0=v_~count3~0_179, ~count1~0=v_~count1~0_173, #memory_int=|v_#memory_int_569|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_141, ~get1~0.offset=v_~get1~0.offset_180, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_129, ~get1~0.base=v_~get1~0.base_180} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread3Thread1of1ForFork2_~stop~2, thread1Thread1of1ForFork0_#t~mem4, thread3Thread1of1ForFork2_~i~2] and [1012] L89-6-->L89-6: Formula: (and (< v_thread3Thread1of1ForFork2_~i~2_44 v_~n1~0_76) (let ((.cse0 (* v_thread3Thread1of1ForFork2_~i~2_44 4))) (= (select (select |v_#memory_int_220| v_~get3~0.base_51) (+ .cse0 v_~get3~0.offset_51)) (select (select |v_#memory_int_220| v_~get1~0.base_57) (+ .cse0 v_~get1~0.offset_57)))) (= v_thread3Thread1of1ForFork2_~i~2_43 (+ v_thread3Thread1of1ForFork2_~i~2_44 1)) (< v_thread3Thread1of1ForFork2_~i~2_44 v_~n3~0_66)) InVars {~get3~0.base=v_~get3~0.base_51, ~n3~0=v_~n3~0_66, ~n1~0=v_~n1~0_76, #memory_int=|v_#memory_int_220|, ~get3~0.offset=v_~get3~0.offset_51, ~get1~0.offset=v_~get1~0.offset_57, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_44, ~get1~0.base=v_~get1~0.base_57} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_37|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_35|, ~get3~0.base=v_~get3~0.base_51, ~n3~0=v_~n3~0_66, ~n1~0=v_~n1~0_76, #memory_int=|v_#memory_int_220|, thread3Thread1of1ForFork2_#t~post11=|v_thread3Thread1of1ForFork2_#t~post11_19|, ~get3~0.offset=v_~get3~0.offset_51, ~get1~0.offset=v_~get1~0.offset_57, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_43, ~get1~0.base=v_~get1~0.base_57} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_#t~post11, thread3Thread1of1ForFork2_~i~2] [2022-12-06 07:27:35,894 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1132] $Ultimate##0-->L51-1: Formula: (and (= 0 v_thread3Thread1of1ForFork2_~stop~2_155) (= v_~count1~0_173 v_~count3~0_179) (= (select (select |v_#memory_int_569| v_~get1~0.base_180) (+ v_~get1~0.offset_180 (* v_thread1Thread1of1ForFork0_~i~0_141 4))) |v_thread1Thread1of1ForFork0_#t~mem4_86|) (= v_thread3Thread1of1ForFork2_~i~2_129 0)) InVars {~count3~0=v_~count3~0_179, ~count1~0=v_~count1~0_173, #memory_int=|v_#memory_int_569|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_141, ~get1~0.offset=v_~get1~0.offset_180, ~get1~0.base=v_~get1~0.base_180} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_73|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_64|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_155, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_86|, ~count3~0=v_~count3~0_179, ~count1~0=v_~count1~0_173, #memory_int=|v_#memory_int_569|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_141, ~get1~0.offset=v_~get1~0.offset_180, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_129, ~get1~0.base=v_~get1~0.base_180} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread3Thread1of1ForFork2_~stop~2, thread1Thread1of1ForFork0_#t~mem4, thread3Thread1of1ForFork2_~i~2] and [1058] L89-6-->thread2EXIT: Formula: (let ((.cse3 (select |v_#memory_int_326| v_~get3~0.base_89))) (and (= v_thread2Thread1of1ForFork1_~stop~1_39 1) (= |v_thread2Thread1of1ForFork1_#res.base_19| 0) (let ((.cse2 (= (mod v_thread3Thread1of1ForFork2_~stop~2_49 256) 0)) (.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_19| 0)) (.cse1 (= |v_thread3Thread1of1ForFork2_#res.offset_19| 0))) (or (and .cse0 (= v_~res3~0_58 v_~res3~0_60) .cse1 (not .cse2)) (and (= v_~n1~0_102 (+ v_~n3~0_96 v_~res3~0_58)) .cse2 .cse0 .cse1))) (= (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_50| (select .cse3 (+ v_~get3~0.offset_89 (* v_thread2Thread1of1ForFork1_~i~1_87 4)))) (- 1) 1) v_~res2~0_66) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n1~0_102)) (.cse5 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n3~0_96))) (or (let ((.cse8 (* v_thread3Thread1of1ForFork2_~i~2_59 4))) (let ((.cse7 (select .cse3 (+ v_~get3~0.offset_89 .cse8))) (.cse6 (select (select |v_#memory_int_326| v_~get1~0.base_85) (+ v_~get1~0.offset_85 .cse8)))) (and .cse4 .cse5 (= v_~res3~0_60 (ite (< .cse6 .cse7) (- 1) 1)) (not (= .cse7 .cse6)) (= v_thread3Thread1of1ForFork2_~stop~2_49 1)))) (and (= |v_thread3Thread1of1ForFork2_#t~mem12_56| |v_thread3Thread1of1ForFork2_#t~mem12_55|) (= v_~res3~0_59 v_~res3~0_60) (or (not .cse4) (not .cse5)) (= v_thread3Thread1of1ForFork2_~stop~2_49 v_thread3Thread1of1ForFork2_~stop~2_50) (= |v_thread3Thread1of1ForFork2_#t~mem14_42| |v_thread3Thread1of1ForFork2_#t~mem14_41|) (= |v_thread3Thread1of1ForFork2_#t~mem15_38| |v_thread3Thread1of1ForFork2_#t~mem15_37|) (= |v_thread3Thread1of1ForFork2_#t~mem13_58| |v_thread3Thread1of1ForFork2_#t~mem13_57|)))) (= |v_thread2Thread1of1ForFork1_#res.offset_19| 0))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_58|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_56|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_38|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_42|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_50, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_50|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res3~0=v_~res3~0_59} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_57|, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_19|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_55|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_19|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_19|, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_37|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_41|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_49, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_39, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_19|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res2~0=v_~res2~0_66, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_33|, ~res3~0=v_~res3~0_58} AuxVars[v_~res3~0_60] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread2Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, thread3Thread1of1ForFork2_~stop~2, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10, ~res3~0] [2022-12-06 07:27:36,148 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1132] $Ultimate##0-->L51-1: Formula: (and (= 0 v_thread3Thread1of1ForFork2_~stop~2_155) (= v_~count1~0_173 v_~count3~0_179) (= (select (select |v_#memory_int_569| v_~get1~0.base_180) (+ v_~get1~0.offset_180 (* v_thread1Thread1of1ForFork0_~i~0_141 4))) |v_thread1Thread1of1ForFork0_#t~mem4_86|) (= v_thread3Thread1of1ForFork2_~i~2_129 0)) InVars {~count3~0=v_~count3~0_179, ~count1~0=v_~count1~0_173, #memory_int=|v_#memory_int_569|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_141, ~get1~0.offset=v_~get1~0.offset_180, ~get1~0.base=v_~get1~0.base_180} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_73|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_64|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_155, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_86|, ~count3~0=v_~count3~0_179, ~count1~0=v_~count1~0_173, #memory_int=|v_#memory_int_569|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_141, ~get1~0.offset=v_~get1~0.offset_180, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_129, ~get1~0.base=v_~get1~0.base_180} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread3Thread1of1ForFork2_~stop~2, thread1Thread1of1ForFork0_#t~mem4, thread3Thread1of1ForFork2_~i~2] and [1055] L71-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= v_thread2Thread1of1ForFork1_~stop~1_35 1) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0) (= v_~res2~0_60 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_42| (select (select |v_#memory_int_304| v_~get3~0.base_81) (+ v_~get3~0.offset_81 (* v_thread2Thread1of1ForFork1_~i~1_83 4)))) (- 1) 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_42|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_35, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81, ~res2~0=v_~res2~0_60, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-06 07:27:36,206 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:27:36,207 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4075 [2022-12-06 07:27:36,207 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 408 transitions, 9444 flow [2022-12-06 07:27:36,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:36,207 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:36,207 INFO L213 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] [2022-12-06 07:27:36,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-06 07:27:36,207 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:36,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:36,207 INFO L85 PathProgramCache]: Analyzing trace with hash 423201592, now seen corresponding path program 1 times [2022-12-06 07:27:36,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:36,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029408544] [2022-12-06 07:27:36,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:36,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:36,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:36,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:36,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029408544] [2022-12-06 07:27:36,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029408544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:36,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:36,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-06 07:27:36,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68588159] [2022-12-06 07:27:36,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:36,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:27:36,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:36,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:27:36,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-12-06 07:27:36,977 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 78 [2022-12-06 07:27:36,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 408 transitions, 9444 flow. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:27:36,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:36,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 78 [2022-12-06 07:27:36,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:46,313 INFO L130 PetriNetUnfolder]: 35723/52093 cut-off events. [2022-12-06 07:27:46,314 INFO L131 PetriNetUnfolder]: For 590773/590773 co-relation queries the response was YES. [2022-12-06 07:27:46,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311143 conditions, 52093 events. 35723/52093 cut-off events. For 590773/590773 co-relation queries the response was YES. Maximal size of possible extension queue 1910. Compared 356617 event pairs, 14728 based on Foata normal form. 4/52095 useless extension candidates. Maximal degree in co-relation 310764. Up to 34112 conditions per place. [2022-12-06 07:27:47,202 INFO L137 encePairwiseOnDemand]: 56/78 looper letters, 763 selfloop transitions, 80 changer transitions 44/887 dead transitions. [2022-12-06 07:27:47,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 887 transitions, 17478 flow [2022-12-06 07:27:47,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 07:27:47,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 07:27:47,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 311 transitions. [2022-12-06 07:27:47,220 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23453996983408748 [2022-12-06 07:27:47,220 INFO L175 Difference]: Start difference. First operand has 167 places, 408 transitions, 9444 flow. Second operand 17 states and 311 transitions. [2022-12-06 07:27:47,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 887 transitions, 17478 flow [2022-12-06 07:27:53,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 887 transitions, 17011 flow, removed 127 selfloop flow, removed 8 redundant places. [2022-12-06 07:27:53,325 INFO L231 Difference]: Finished difference. Result has 190 places, 487 transitions, 10767 flow [2022-12-06 07:27:53,325 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=9119, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=10767, PETRI_PLACES=190, PETRI_TRANSITIONS=487} [2022-12-06 07:27:53,326 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 152 predicate places. [2022-12-06 07:27:53,326 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:53,326 INFO L89 Accepts]: Start accepts. Operand has 190 places, 487 transitions, 10767 flow [2022-12-06 07:27:53,329 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:53,329 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:53,329 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 190 places, 487 transitions, 10767 flow [2022-12-06 07:27:53,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 487 transitions, 10767 flow [2022-12-06 07:27:54,399 INFO L130 PetriNetUnfolder]: 2624/6900 cut-off events. [2022-12-06 07:27:54,399 INFO L131 PetriNetUnfolder]: For 107278/109077 co-relation queries the response was YES. [2022-12-06 07:27:54,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44592 conditions, 6900 events. 2624/6900 cut-off events. For 107278/109077 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 71828 event pairs, 309 based on Foata normal form. 248/6849 useless extension candidates. Maximal degree in co-relation 44204. Up to 1520 conditions per place. [2022-12-06 07:27:54,546 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 487 transitions, 10767 flow [2022-12-06 07:27:54,546 INFO L188 LiptonReduction]: Number of co-enabled transitions 3766 [2022-12-06 07:28:02,986 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:28:02,987 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9661 [2022-12-06 07:28:02,987 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 487 transitions, 10812 flow [2022-12-06 07:28:02,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:02,987 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:02,987 INFO L213 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] [2022-12-06 07:28:02,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-06 07:28:02,988 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:02,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:02,988 INFO L85 PathProgramCache]: Analyzing trace with hash 744151707, now seen corresponding path program 1 times [2022-12-06 07:28:02,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:02,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863494063] [2022-12-06 07:28:02,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:02,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:03,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:03,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:03,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863494063] [2022-12-06 07:28:03,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863494063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:03,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:03,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 07:28:03,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038901904] [2022-12-06 07:28:03,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:03,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:28:03,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:03,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:28:03,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:28:03,809 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 82 [2022-12-06 07:28:03,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 487 transitions, 10812 flow. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:03,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:03,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 82 [2022-12-06 07:28:03,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:13,922 INFO L130 PetriNetUnfolder]: 36615/53317 cut-off events. [2022-12-06 07:28:13,922 INFO L131 PetriNetUnfolder]: For 730202/730202 co-relation queries the response was YES. [2022-12-06 07:28:14,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345903 conditions, 53317 events. 36615/53317 cut-off events. For 730202/730202 co-relation queries the response was YES. Maximal size of possible extension queue 1999. Compared 362981 event pairs, 15716 based on Foata normal form. 2/53184 useless extension candidates. Maximal degree in co-relation 345394. Up to 21006 conditions per place. [2022-12-06 07:28:14,808 INFO L137 encePairwiseOnDemand]: 51/82 looper letters, 659 selfloop transitions, 150 changer transitions 14/823 dead transitions. [2022-12-06 07:28:14,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 823 transitions, 17995 flow [2022-12-06 07:28:14,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:28:14,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:28:14,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 212 transitions. [2022-12-06 07:28:14,817 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3231707317073171 [2022-12-06 07:28:14,817 INFO L175 Difference]: Start difference. First operand has 186 places, 487 transitions, 10812 flow. Second operand 8 states and 212 transitions. [2022-12-06 07:28:14,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 823 transitions, 17995 flow [2022-12-06 07:28:22,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 823 transitions, 17799 flow, removed 98 selfloop flow, removed 4 redundant places. [2022-12-06 07:28:22,123 INFO L231 Difference]: Finished difference. Result has 194 places, 544 transitions, 12600 flow [2022-12-06 07:28:22,124 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=10664, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12600, PETRI_PLACES=194, PETRI_TRANSITIONS=544} [2022-12-06 07:28:22,124 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 156 predicate places. [2022-12-06 07:28:22,124 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:22,124 INFO L89 Accepts]: Start accepts. Operand has 194 places, 544 transitions, 12600 flow [2022-12-06 07:28:22,127 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:22,128 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:22,128 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 194 places, 544 transitions, 12600 flow [2022-12-06 07:28:22,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 544 transitions, 12600 flow [2022-12-06 07:28:23,268 INFO L130 PetriNetUnfolder]: 2881/7466 cut-off events. [2022-12-06 07:28:23,268 INFO L131 PetriNetUnfolder]: For 127924/129538 co-relation queries the response was YES. [2022-12-06 07:28:23,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50572 conditions, 7466 events. 2881/7466 cut-off events. For 127924/129538 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 77971 event pairs, 304 based on Foata normal form. 296/7490 useless extension candidates. Maximal degree in co-relation 50290. Up to 1673 conditions per place. [2022-12-06 07:28:23,436 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 544 transitions, 12600 flow [2022-12-06 07:28:23,436 INFO L188 LiptonReduction]: Number of co-enabled transitions 4254 [2022-12-06 07:28:23,476 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:28:23,477 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1353 [2022-12-06 07:28:23,477 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 544 transitions, 12600 flow [2022-12-06 07:28:23,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:23,477 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:23,477 INFO L213 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] [2022-12-06 07:28:23,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-06 07:28:23,477 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:23,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:23,477 INFO L85 PathProgramCache]: Analyzing trace with hash 2025523196, now seen corresponding path program 1 times [2022-12-06 07:28:23,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:23,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879501598] [2022-12-06 07:28:23,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:23,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:24,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:24,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:24,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879501598] [2022-12-06 07:28:24,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879501598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:24,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:24,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 07:28:24,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327254715] [2022-12-06 07:28:24,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:24,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:28:24,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:24,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:28:24,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:28:24,210 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 81 [2022-12-06 07:28:24,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 544 transitions, 12600 flow. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:24,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:24,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 81 [2022-12-06 07:28:24,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:35,603 INFO L130 PetriNetUnfolder]: 36607/53304 cut-off events. [2022-12-06 07:28:35,604 INFO L131 PetriNetUnfolder]: For 783207/783207 co-relation queries the response was YES. [2022-12-06 07:28:36,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354794 conditions, 53304 events. 36607/53304 cut-off events. For 783207/783207 co-relation queries the response was YES. Maximal size of possible extension queue 1994. Compared 361133 event pairs, 10031 based on Foata normal form. 2/53172 useless extension candidates. Maximal degree in co-relation 354397. Up to 10583 conditions per place. [2022-12-06 07:28:36,564 INFO L137 encePairwiseOnDemand]: 29/81 looper letters, 499 selfloop transitions, 389 changer transitions 10/898 dead transitions. [2022-12-06 07:28:36,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 898 transitions, 19292 flow [2022-12-06 07:28:36,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:28:36,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:28:36,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 289 transitions. [2022-12-06 07:28:36,566 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29732510288065844 [2022-12-06 07:28:36,566 INFO L175 Difference]: Start difference. First operand has 191 places, 544 transitions, 12600 flow. Second operand 12 states and 289 transitions. [2022-12-06 07:28:36,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 898 transitions, 19292 flow [2022-12-06 07:28:44,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 898 transitions, 19204 flow, removed 23 selfloop flow, removed 5 redundant places. [2022-12-06 07:28:44,324 INFO L231 Difference]: Finished difference. Result has 199 places, 616 transitions, 15103 flow [2022-12-06 07:28:44,325 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=12544, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=315, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=15103, PETRI_PLACES=199, PETRI_TRANSITIONS=616} [2022-12-06 07:28:44,326 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 161 predicate places. [2022-12-06 07:28:44,326 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:44,326 INFO L89 Accepts]: Start accepts. Operand has 199 places, 616 transitions, 15103 flow [2022-12-06 07:28:44,329 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:44,329 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:44,330 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 616 transitions, 15103 flow [2022-12-06 07:28:44,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 616 transitions, 15103 flow [2022-12-06 07:28:45,397 INFO L130 PetriNetUnfolder]: 2955/7558 cut-off events. [2022-12-06 07:28:45,397 INFO L131 PetriNetUnfolder]: For 142475/144138 co-relation queries the response was YES. [2022-12-06 07:28:45,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53239 conditions, 7558 events. 2955/7558 cut-off events. For 142475/144138 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 78126 event pairs, 340 based on Foata normal form. 343/7634 useless extension candidates. Maximal degree in co-relation 53154. Up to 1706 conditions per place. [2022-12-06 07:28:45,706 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 616 transitions, 15103 flow [2022-12-06 07:28:45,706 INFO L188 LiptonReduction]: Number of co-enabled transitions 4690 [2022-12-06 07:28:45,745 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:28:45,745 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1419 [2022-12-06 07:28:45,745 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 616 transitions, 15103 flow [2022-12-06 07:28:45,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:45,746 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:45,746 INFO L213 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] [2022-12-06 07:28:45,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-06 07:28:45,746 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:45,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:45,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1798877282, now seen corresponding path program 1 times [2022-12-06 07:28:45,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:45,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687617824] [2022-12-06 07:28:45,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:45,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:46,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:46,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:46,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687617824] [2022-12-06 07:28:46,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687617824] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:46,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:46,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 07:28:46,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681298010] [2022-12-06 07:28:46,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:46,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:28:46,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:46,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:28:46,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:28:46,829 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 81 [2022-12-06 07:28:46,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 616 transitions, 15103 flow. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:46,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:46,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 81 [2022-12-06 07:28:46,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:59,086 INFO L130 PetriNetUnfolder]: 38720/56325 cut-off events. [2022-12-06 07:28:59,086 INFO L131 PetriNetUnfolder]: For 879187/879187 co-relation queries the response was YES. [2022-12-06 07:28:59,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381121 conditions, 56325 events. 38720/56325 cut-off events. For 879187/879187 co-relation queries the response was YES. Maximal size of possible extension queue 2140. Compared 385435 event pairs, 18401 based on Foata normal form. 2/56193 useless extension candidates. Maximal degree in co-relation 380997. Up to 43914 conditions per place. [2022-12-06 07:29:00,156 INFO L137 encePairwiseOnDemand]: 64/81 looper letters, 881 selfloop transitions, 60 changer transitions 22/963 dead transitions. [2022-12-06 07:29:00,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 963 transitions, 21930 flow [2022-12-06 07:29:00,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:29:00,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:29:00,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 252 transitions. [2022-12-06 07:29:00,157 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2828282828282828 [2022-12-06 07:29:00,157 INFO L175 Difference]: Start difference. First operand has 198 places, 616 transitions, 15103 flow. Second operand 11 states and 252 transitions. [2022-12-06 07:29:00,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 963 transitions, 21930 flow [2022-12-06 07:29:09,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 963 transitions, 21429 flow, removed 22 selfloop flow, removed 6 redundant places. [2022-12-06 07:29:09,026 INFO L231 Difference]: Finished difference. Result has 211 places, 667 transitions, 15888 flow [2022-12-06 07:29:09,027 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=14664, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15888, PETRI_PLACES=211, PETRI_TRANSITIONS=667} [2022-12-06 07:29:09,027 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 173 predicate places. [2022-12-06 07:29:09,027 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:09,027 INFO L89 Accepts]: Start accepts. Operand has 211 places, 667 transitions, 15888 flow [2022-12-06 07:29:09,030 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:09,030 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:09,030 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 667 transitions, 15888 flow [2022-12-06 07:29:09,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 667 transitions, 15888 flow [2022-12-06 07:29:10,357 INFO L130 PetriNetUnfolder]: 3278/8092 cut-off events. [2022-12-06 07:29:10,357 INFO L131 PetriNetUnfolder]: For 168374/170137 co-relation queries the response was YES. [2022-12-06 07:29:10,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58811 conditions, 8092 events. 3278/8092 cut-off events. For 168374/170137 co-relation queries the response was YES. Maximal size of possible extension queue 772. Compared 82910 event pairs, 352 based on Foata normal form. 366/8189 useless extension candidates. Maximal degree in co-relation 58509. Up to 1860 conditions per place. [2022-12-06 07:29:10,564 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 667 transitions, 15888 flow [2022-12-06 07:29:10,565 INFO L188 LiptonReduction]: Number of co-enabled transitions 5274 [2022-12-06 07:29:17,281 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:17,281 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8254 [2022-12-06 07:29:17,282 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 667 transitions, 15926 flow [2022-12-06 07:29:17,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:17,282 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:17,282 INFO L213 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] [2022-12-06 07:29:17,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-12-06 07:29:17,282 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:17,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:17,282 INFO L85 PathProgramCache]: Analyzing trace with hash -193927269, now seen corresponding path program 2 times [2022-12-06 07:29:17,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:17,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879587413] [2022-12-06 07:29:17,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:17,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:17,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:17,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:17,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879587413] [2022-12-06 07:29:17,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879587413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:17,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:17,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 07:29:17,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092839149] [2022-12-06 07:29:17,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:17,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:29:17,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:17,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:29:17,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:29:17,763 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 83 [2022-12-06 07:29:17,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 667 transitions, 15926 flow. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:17,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:17,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 83 [2022-12-06 07:29:17,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:29,954 INFO L130 PetriNetUnfolder]: 38668/56233 cut-off events. [2022-12-06 07:29:29,954 INFO L131 PetriNetUnfolder]: For 990549/990549 co-relation queries the response was YES. [2022-12-06 07:29:30,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393312 conditions, 56233 events. 38668/56233 cut-off events. For 990549/990549 co-relation queries the response was YES. Maximal size of possible extension queue 2056. Compared 381753 event pairs, 10646 based on Foata normal form. 2/56100 useless extension candidates. Maximal degree in co-relation 392894. Up to 10583 conditions per place. [2022-12-06 07:29:31,067 INFO L137 encePairwiseOnDemand]: 30/83 looper letters, 529 selfloop transitions, 444 changer transitions 13/986 dead transitions. [2022-12-06 07:29:31,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 986 transitions, 22082 flow [2022-12-06 07:29:31,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:29:31,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:29:31,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 285 transitions. [2022-12-06 07:29:31,068 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.286144578313253 [2022-12-06 07:29:31,068 INFO L175 Difference]: Start difference. First operand has 209 places, 667 transitions, 15926 flow. Second operand 12 states and 285 transitions. [2022-12-06 07:29:31,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 986 transitions, 22082 flow [2022-12-06 07:29:42,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 986 transitions, 21928 flow, removed 77 selfloop flow, removed 2 redundant places. [2022-12-06 07:29:42,521 INFO L231 Difference]: Finished difference. Result has 221 places, 703 transitions, 17813 flow [2022-12-06 07:29:42,522 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=15820, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=407, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=17813, PETRI_PLACES=221, PETRI_TRANSITIONS=703} [2022-12-06 07:29:42,522 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 183 predicate places. [2022-12-06 07:29:42,522 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:42,522 INFO L89 Accepts]: Start accepts. Operand has 221 places, 703 transitions, 17813 flow [2022-12-06 07:29:42,525 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:42,525 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:42,525 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 703 transitions, 17813 flow [2022-12-06 07:29:42,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 219 places, 703 transitions, 17813 flow [2022-12-06 07:29:43,754 INFO L130 PetriNetUnfolder]: 3201/8040 cut-off events. [2022-12-06 07:29:43,754 INFO L131 PetriNetUnfolder]: For 178310/179998 co-relation queries the response was YES. [2022-12-06 07:29:43,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59050 conditions, 8040 events. 3201/8040 cut-off events. For 178310/179998 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 82763 event pairs, 344 based on Foata normal form. 366/8132 useless extension candidates. Maximal degree in co-relation 58798. Up to 1748 conditions per place. [2022-12-06 07:29:43,943 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 219 places, 703 transitions, 17813 flow [2022-12-06 07:29:43,944 INFO L188 LiptonReduction]: Number of co-enabled transitions 5452 [2022-12-06 07:29:44,003 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:29:44,004 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1482 [2022-12-06 07:29:44,004 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 703 transitions, 17813 flow [2022-12-06 07:29:44,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:44,004 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:44,005 INFO L213 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] [2022-12-06 07:29:44,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-06 07:29:44,005 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:44,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:44,005 INFO L85 PathProgramCache]: Analyzing trace with hash 248456657, now seen corresponding path program 1 times [2022-12-06 07:29:44,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:44,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022758608] [2022-12-06 07:29:44,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:44,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:45,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:45,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:45,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022758608] [2022-12-06 07:29:45,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022758608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:45,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:45,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 07:29:45,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489205718] [2022-12-06 07:29:45,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:45,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:29:45,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:45,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:29:45,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:29:45,268 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 82 [2022-12-06 07:29:45,268 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 703 transitions, 17813 flow. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:45,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:45,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 82 [2022-12-06 07:29:45,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:58,749 INFO L130 PetriNetUnfolder]: 38659/56208 cut-off events. [2022-12-06 07:29:58,749 INFO L131 PetriNetUnfolder]: For 1054785/1054785 co-relation queries the response was YES. [2022-12-06 07:29:59,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402265 conditions, 56208 events. 38659/56208 cut-off events. For 1054785/1054785 co-relation queries the response was YES. Maximal size of possible extension queue 2093. Compared 381497 event pairs, 14161 based on Foata normal form. 1/56075 useless extension candidates. Maximal degree in co-relation 401488. Up to 29807 conditions per place. [2022-12-06 07:29:59,948 INFO L137 encePairwiseOnDemand]: 38/82 looper letters, 741 selfloop transitions, 347 changer transitions 12/1100 dead transitions. [2022-12-06 07:29:59,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 1100 transitions, 24799 flow [2022-12-06 07:29:59,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 07:29:59,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 07:29:59,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 360 transitions. [2022-12-06 07:29:59,950 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27439024390243905 [2022-12-06 07:29:59,950 INFO L175 Difference]: Start difference. First operand has 219 places, 703 transitions, 17813 flow. Second operand 16 states and 360 transitions. [2022-12-06 07:29:59,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 1100 transitions, 24799 flow [2022-12-06 07:30:09,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 1100 transitions, 24178 flow, removed 16 selfloop flow, removed 7 redundant places. [2022-12-06 07:30:09,091 INFO L231 Difference]: Finished difference. Result has 235 places, 758 transitions, 19357 flow [2022-12-06 07:30:09,092 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=17308, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=291, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=19357, PETRI_PLACES=235, PETRI_TRANSITIONS=758} [2022-12-06 07:30:09,092 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 197 predicate places. [2022-12-06 07:30:09,092 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:09,092 INFO L89 Accepts]: Start accepts. Operand has 235 places, 758 transitions, 19357 flow [2022-12-06 07:30:09,097 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:09,097 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:09,097 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 235 places, 758 transitions, 19357 flow [2022-12-06 07:30:09,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 758 transitions, 19357 flow [2022-12-06 07:30:10,415 INFO L130 PetriNetUnfolder]: 3264/8122 cut-off events. [2022-12-06 07:30:10,415 INFO L131 PetriNetUnfolder]: For 193875/195488 co-relation queries the response was YES. [2022-12-06 07:30:10,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60916 conditions, 8122 events. 3264/8122 cut-off events. For 193875/195488 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 83306 event pairs, 351 based on Foata normal form. 369/8226 useless extension candidates. Maximal degree in co-relation 60688. Up to 1840 conditions per place. [2022-12-06 07:30:10,614 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 233 places, 758 transitions, 19357 flow [2022-12-06 07:30:10,614 INFO L188 LiptonReduction]: Number of co-enabled transitions 5956 [2022-12-06 07:30:10,639 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1028] L70-1-->L69-6: Formula: (and (= (select (select |v_#memory_int_250| v_~get3~0.base_67) (+ v_~get3~0.offset_67 (* v_thread2Thread1of1ForFork1_~i~1_64 4))) |v_thread2Thread1of1ForFork1_#t~mem7_44|) (= v_thread2Thread1of1ForFork1_~i~1_63 (+ v_thread2Thread1of1ForFork1_~i~1_64 1))) InVars {thread2Thread1of1ForFork1_#t~mem7=|v_thread2Thread1of1ForFork1_#t~mem7_44|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_64, ~get3~0.base=v_~get3~0.base_67, #memory_int=|v_#memory_int_250|, ~get3~0.offset=v_~get3~0.offset_67} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_63, thread2Thread1of1ForFork1_#t~mem8=|v_thread2Thread1of1ForFork1_#t~mem8_43|, ~get3~0.base=v_~get3~0.base_67, thread2Thread1of1ForFork1_#t~post6=|v_thread2Thread1of1ForFork1_#t~post6_15|, #memory_int=|v_#memory_int_250|, ~get3~0.offset=v_~get3~0.offset_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~mem8, thread2Thread1of1ForFork1_#t~post6] [2022-12-06 07:30:10,829 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1028] L70-1-->L69-6: Formula: (and (= (select (select |v_#memory_int_250| v_~get3~0.base_67) (+ v_~get3~0.offset_67 (* v_thread2Thread1of1ForFork1_~i~1_64 4))) |v_thread2Thread1of1ForFork1_#t~mem7_44|) (= v_thread2Thread1of1ForFork1_~i~1_63 (+ v_thread2Thread1of1ForFork1_~i~1_64 1))) InVars {thread2Thread1of1ForFork1_#t~mem7=|v_thread2Thread1of1ForFork1_#t~mem7_44|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_64, ~get3~0.base=v_~get3~0.base_67, #memory_int=|v_#memory_int_250|, ~get3~0.offset=v_~get3~0.offset_67} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_63, thread2Thread1of1ForFork1_#t~mem8=|v_thread2Thread1of1ForFork1_#t~mem8_43|, ~get3~0.base=v_~get3~0.base_67, thread2Thread1of1ForFork1_#t~post6=|v_thread2Thread1of1ForFork1_#t~post6_15|, #memory_int=|v_#memory_int_250|, ~get3~0.offset=v_~get3~0.offset_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~mem8, thread2Thread1of1ForFork1_#t~post6] [2022-12-06 07:30:11,112 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:11,112 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2020 [2022-12-06 07:30:11,112 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 759 transitions, 19400 flow [2022-12-06 07:30:11,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:11,112 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:11,113 INFO L213 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] [2022-12-06 07:30:11,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-06 07:30:11,113 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:11,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:11,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1827961189, now seen corresponding path program 2 times [2022-12-06 07:30:11,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:11,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065206134] [2022-12-06 07:30:11,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:11,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:11,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:11,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:11,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065206134] [2022-12-06 07:30:11,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065206134] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:11,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:11,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 07:30:11,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064792849] [2022-12-06 07:30:11,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:11,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:30:11,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:11,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:30:11,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:30:11,688 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 84 [2022-12-06 07:30:11,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 759 transitions, 19400 flow. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:11,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:11,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 84 [2022-12-06 07:30:11,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand